Tong Yang

Orcid: 0000-0003-2402-5854

Affiliations:
  • Peking University, Department of Computer and Science, Beijing, China


According to our database1, Tong Yang authored at least 154 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Enabling space-time efficient range queries with REncoder.
VLDB J., November, 2024

A Unified Framework for Mining Batch and Periodic Batch in Data Streams.
IEEE Trans. Knowl. Data Eng., November, 2024

WavingSketch: an unbiased and generic sketch for finding top-k items in data streams.
VLDB J., September, 2024

BurstBalancer: Do Less, Better Balance for Large-Scale Data Center Traffic.
IEEE Trans. Parallel Distributed Syst., June, 2024

CAFE: Towards Compact, Adaptive, and Fast Embedding for Large-scale Recommendation Models.
Proc. ACM Manag. Data, February, 2024

Unbiased Real-Time Traffic Sketching.
IEEE Trans. Netw. Sci. Eng., 2024

BATON: Enhancing Batch-wise Inference Efficiency for Large Language Models via Dynamic Re-batching.
CoRR, 2024

INT-FlashAttention: Enabling Flash Attention for INT8 Quantization.
CoRR, 2024

An Efficient Inference Framework for Early-exit Large Language Models.
CoRR, 2024

Approaching 100% Confidence in Stream Summary through ReliableSketch.
CoRR, 2024

SimiSketch: Efficiently Estimating Similarity of streaming Multisets.
CoRR, 2024

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs.
CoRR, 2024

Prediction Is All MoE Needs: Expert Load Distribution Goes from Fluctuating to Stabilizing.
CoRR, 2024

Need for Speed: Taming Backdoor Attacks with Speed and Precision.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

Scalable Overspeed Item Detection in Streams.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

BitMatcher: Bit-level Counter Adjustment for Sketches.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

M4: A Framework for Per-Flow Quantile Estimation.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Newton Sketches: Estimating Node Intimacy in Dynamic Graphs Using Newton's Law of Cooling.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

CodingSketch: A Hierarchical Sketch with Efficient Encoding and Recursive Decoding.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Online Detection of Outstanding Quantiles with QuantileFilter.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

VisionEmbedder: Bit-Level-Compact Key-Value Storage with Constant Lookup, Rapid Updates, and Rare Failure.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Bubble Sketch: A High-performance and Memory-efficient Sketch for Finding Top-<i>k</i> Items in Data Streams.
Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, 2024

2023
CocoSketch: High-Performance Sketch-Based Measurement Over Arbitrary Partial Key Query.
IEEE/ACM Trans. Netw., December, 2023

PISketch: Finding Persistent and Infrequent Flows.
IEEE/ACM Trans. Netw., December, 2023

Seesaw Counting Filter: A Dynamic Filtering Framework for Vulnerable Negative Keys.
IEEE Trans. Knowl. Data Eng., December, 2023

OneSketch: A Generic and Accurate Sketch for Data Streams.
IEEE Trans. Knowl. Data Eng., December, 2023

Experimental Analysis of Large-scale Learnable Vector Storage Compression.
Proc. VLDB Endow., December, 2023

ChainedFilter: Combining Membership Filters by Chain Rule.
Proc. ACM Manag. Data, December, 2023

SketchINT: Empowering INT With TowerSketch for Per-Flow Per-Switch Measurement.
IEEE Trans. Parallel Distributed Syst., November, 2023

BurstSketch: Finding Bursts in Data Streams.
IEEE Trans. Knowl. Data Eng., November, 2023

HoppingSketch: More Accurate Temporal Membership Query and Frequency Query.
IEEE Trans. Knowl. Data Eng., September, 2023

Cuckoo Counter: Adaptive Structure of Counters for Accurate Frequency and Top-k Estimation.
IEEE/ACM Trans. Netw., August, 2023

On the Evolutionary of Bloom Filter False Positives - An Information Theoretical Approach to Optimizing Bloom Filter Parameters.
IEEE Trans. Knowl. Data Eng., July, 2023

Graph Stream Sketch: Summarizing Graph Streams With High Speed and Accuracy.
IEEE Trans. Knowl. Data Eng., June, 2023

A Sketch Framework for Approximate Data Stream Processing in Sliding Windows.
IEEE Trans. Knowl. Data Eng., May, 2023

Enhanced Machine Learning Sketches for Network Measurements.
IEEE Trans. Computers, April, 2023

SSA: Microsecond-Level Clock Synchronization Based on Machine Learning for IoT Devices.
IEEE Trans. Instrum. Meas., 2023

Sniffer: A Novel Model Type Detection System against Machine-Learning-as-a-Service Platforms.
Proc. VLDB Endow., 2023

Double-Anonymous Sketch: Achieving Top-K-fairness for Finding Global Top-K Frequent Items.
Proc. ACM Manag. Data, 2023

JoinSketch: A Sketch Algorithm for Accurate and Unbiased Inner-Product Estimation.
Proc. ACM Manag. Data, 2023

TreeSensing: Linearly Compressing Sketches with Flexibility.
Proc. ACM Manag. Data, 2023

LadderFilter: Filtering Infrequent Items with Small Memory and Time Overhead.
Proc. ACM Manag. Data, 2023

DIT and Beyond: Interdomain Routing With Intradomain Awareness for IIoT.
IEEE Internet Things J., 2023

AAsclepius: Monitoring, Diagnosing, and Detouring at the Internet Peering Edge.
Proceedings of the 2023 USENIX Annual Technical Conference, 2023

P4LRU: Towards An LRU Cache Entirely in Programmable Data Plane.
Proceedings of the ACM SIGCOMM 2023 Conference, 2023

ChameleMon: Shifting Measurement Attention as Network State Changes.
Proceedings of the ACM SIGCOMM 2023 Conference, 2023

MimoSketch: A Framework to Mine Item Frequency on Multiple Nodes with Sketches.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Hyper-USS: Answering Subset Query Over Multi-Attribute Data Stream.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

SketchPolymer: Estimate Per-item Tail Quantile Using One Sketch.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

MicroscopeSketch: Accurate Sliding Estimation Using Adaptive Zooming.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

SteadySketch: Finding Steady Flows in Data Streams.
Proceedings of the 31st IEEE/ACM International Symposium on Quality of Service, 2023

REncoder: A Space-Time Efficient Range Filter with Local Encoder.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Wind-Bell Index: Towards Ultra-Fast Edge Query for Graph Databases.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

SketchConf: A Framework for Automatic Sketch Configuration.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

HyperCalm Sketch: One-Pass Mining Periodic Batches in Data Streams.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Finding Simplex Items in Data Streams.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

KVSAgg: Secure Aggregation of Distributed Key-Value Sets.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022
FPGA-Based Updatable Packet Classification Using TSS-Combined Bit-Selecting Tree.
IEEE/ACM Trans. Netw., 2022

SEAD Counter: Self-Adaptive Counters With Different Counting Ranges.
IEEE/ACM Trans. Netw., 2022

Pyramid Family: Generic Frameworks for Accurate and Fast Flow Size Measurement.
IEEE/ACM Trans. Netw., 2022

Coloring Embedder: Towards Multi-Set Membership Queries in Web Cache Sharing.
IEEE Trans. Knowl. Data Eng., 2022

LTC: A Fast Algorithm to Accurately Find Significant Items in Data Streams.
IEEE Trans. Knowl. Data Eng., 2022

Elastic Bloom Filter: Deletable and Expandable Filter Using Elastic Fingerprints.
IEEE Trans. Computers, 2022

Stingy Sketch: A Sketch Framework for Accurate and Fast Frequency Estimation.
Proc. VLDB Endow., 2022

QCluster: Clustering Packets for Flow Scheduling.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Seesaw Counting Filter: An Efficient Guardian for Vulnerable Negative Keys During Dynamic Filtering.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Beyond Video Surveillance: Exploiting Sleep-Talk of Apps to See Smartphone's ID.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2022

MinMax Sampling: A Near-optimal Global Summary for Aggregation in the Wide Area.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

FlyMon: enabling on-the-fly task reconfiguration for network measurement.
Proceedings of the SIGCOMM '22: ACM SIGCOMM 2022 Conference, Amsterdam, The Netherlands, August 22, 2022

PISketch: finding persistent and infrequent flows.
Proceedings of the FFSPIN '22: Proceedings of the ACM SIGCOMM Workshop on Formal Foundations and Security of Programmable Network Infrastructures, 2022

Work-in-Progress: A Novel Clock Synchronization System for Large-Scale Clusters.
Proceedings of the IEEE Real-Time Systems Symposium, 2022

Break the Blackbox! Desensitize Intra-domain Information for Inter-domain Routing.
Proceedings of the 30th IEEE/ACM International Symposium on Quality of Service, 2022

SHE: A Generic Framework for Data Stream Mining over Sliding Windows.
Proceedings of the 51st International Conference on Parallel Processing, 2022

BurstBalancer: Do Less, Better Balance for Large-scale Data Center Traffic.
Proceedings of the 30th IEEE International Conference on Network Protocols, 2022

The Stair Sketch: Bringing more Clarity to Memorize Recent Events.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

PeriodicSketch: Finding Periodic Items in Data Streams.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
BurstSketch: Finding Bursts in Data Streams.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Out of Many We are One: Measuring Item Batch with Clock-Sketch.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

CocoSketch: high-performance sketch-based measurement over arbitrary partial key query.
Proceedings of the ACM SIGCOMM 2021 Conference, Virtual Event, USA, August 23-27, 2021., 2021

LightGuardian: A Full-Visibility, Lightweight, In-band Telemetry System Using Sketchlets.
Proceedings of the 18th USENIX Symposium on Networked Systems Design and Implementation, 2021

Cluster-Reduce: Compressing Sketches for Distributed Data Streams.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

MapEmbed: Perfect Hashing with High Load Factor and Fast Update.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Precise error estimation for sketch-based flow measurement.
Proceedings of the IMC '21: ACM Internet Measurement Conference, 2021

SketchINT: Empowering INT with TowerSketch for Per-flow Per-switch Measurement.
Proceedings of the 29th IEEE International Conference on Network Protocols, 2021

Tagged Cuckoo Filters.
Proceedings of the 30th International Conference on Computer Communications and Networks, 2021

2020
SKCompress: compressing sparse and nonuniform gradient in distributed machine learning.
VLDB J., 2020

Eiffel: Evolutionary Flow Map for Influence Graph Visualization.
IEEE Trans. Vis. Comput. Graph., 2020

SF-Sketch: A Two-Stage Sketch for Data Streams.
IEEE Trans. Parallel Distributed Syst., 2020

On-Off Sketch: A Fast and Accurate Sketch on Persistence.
Proc. VLDB Endow., 2020

Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS).
Proc. VLDB Endow., 2020

HyperSight: Towards Scalable, High-Coverage, and Dynamic Network Monitoring Queries.
IEEE J. Sel. Areas Commun., 2020

Tuple Space Assisted Packet Classification With High Performance on Both Search and Update.
IEEE J. Sel. Areas Commun., 2020

Spectral Clustering with Smooth Tiny Clusters.
CoRR, 2020

QCluster: Clustering Packets for FlowScheduling.
CoRR, 2020

Priority-Aware Per-flow Measurement using Cuckoo Sketch.
Proceedings of the 2020 IFIP Networking Conference, 2020

WavingSketch: An Unbiased and Generic Sketch for Finding Top-k Items in Data Streams.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Sliding Sketches: A Framework using Time Zones for Data Stream Processing in Sliding Windows.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Additive and Subtractive Cuckoo Filters.
Proceedings of the 28th IEEE/ACM International Symposium on Quality of Service, 2020

Martini: Bridging the Gap between Network Measurement and Control Using Switching ASICs.
Proceedings of the 28th IEEE International Conference on Network Protocols, 2020

SmartChain: Enabling High-Performance Service Chain Partition between SmartNIC and CPU.
Proceedings of the 2020 IEEE International Conference on Communications, 2020

2019
FID-sketch: an accurate sketch to store frequencies in data streams.
World Wide Web, 2019

Fine-grained probability counting for cardinality estimation of data streams.
World Wide Web, 2019

Fast and accurate stream processing by filtering the cold.
VLDB J., 2019

Diamond Sketch: Accurate Per-flow Measurement for Big Streaming Data.
IEEE Trans. Parallel Distributed Syst., 2019

Adaptive Measurements Using One Elastic Sketch.
IEEE/ACM Trans. Netw., 2019

HeavyKeeper: An Accurate Algorithm for Finding Top-k Elephant Flows.
IEEE/ACM Trans. Netw., 2019

Elastic_HH: Tailored Elastic for Finding Heavy Hitters.
CoRR, 2019

Mathematical analysis on forwarding information base compression.
CCF Trans. Netw., 2019

A fast flow table engine for Open vSwitch with high performance on both lookups and updates.
Proceedings of the ACM SIGCOMM 2019 Conference Posters and Demos, 2019

A Generic Technique for Sketches to Adapt to Different Counting Ranges.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Coloring Embedder: A Memory Efficient Data Structure for Answering Multi-set Query.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Multi-copy Cuckoo Hashing.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Fast and Accurate Graph Stream Summarization.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Finding Significant Items in Data Streams.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Longest Prefix Matching with Pruning.
Proceedings of the 20th IEEE International Conference on High Performance Switching and Routing, 2019

Shifting Hash Table: An Efficient Hash Table with Delicate Summary.
Proceedings of the 2019 IEEE Globecom Workshops, Waikoloa, HI, USA, December 9-13, 2019, 2019

Magic Cube Bloom Filter: Answering Membership Queries for Multiple Sets.
Proceedings of the IEEE International Conference on Big Data and Smart Computing, 2019

Cuckoo Counter: A Novel Framework for Accurate Per-Flow Frequency Estimation in Network Measurement.
Proceedings of the 2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems, 2019

TabTree: A TSS-assisted Bit-selecting Tree Scheme for Packet Classification with Balanced Rule Mapping.
Proceedings of the 2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems, 2019

2018
Constant IP Lookup With FIB Explosion.
IEEE/ACM Trans. Netw., 2018

Low Computational Cost Bloom Filters.
IEEE/ACM Trans. Netw., 2018

Enabling NFV Elasticity Control With Optimized Flow Migration.
IEEE J. Sel. Areas Commun., 2018

Accelerating network measurement in software.
Comput. Commun. Rev., 2018

HeavyKeeper: An Accurate Algorithm for Finding Top-k Elephant Flows.
Proceedings of the 2018 USENIX Annual Technical Conference, 2018

A Comparison of Performance and Accuracy of Measurement Algorithms in Software.
Proceedings of the Symposium on SDN Research, 2018

Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing.
Proceedings of the 2018 International Conference on Management of Data, 2018

SketchML: Accelerating Distributed Machine Learning with Data Sketches.
Proceedings of the 2018 International Conference on Management of Data, 2018

Empowering Sketches with Machine Learning for Network Measurements.
Proceedings of the 2018 Workshop on Network Meets AI & ML, 2018

Elastic sketch: adaptive and fast network-wide measurements.
Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, 2018

HeavyGuardian: Separate and Guard Hot Items in Data Streams.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Accurate per-flow measurement with bloom sketch.
Proceedings of the IEEE INFOCOM 2018, 2018

Fast OpenFlow Table Lookup with Fast Update.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

Diamond sketch: Accurate per-flow measurement for real IP streams.
Proceedings of the IEEE INFOCOM 2018, 2018

KeySight: Troubleshooting Programmable Switches via Scalable High-Coverage Behavior Tracking.
Proceedings of the 2018 IEEE 26th International Conference on Network Protocols, 2018

DDP: Distributed Network Updates in SDN.
Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

ID Bloom Filter: Achieving Faster Multi-Set Membership Query in Network Applications.
Proceedings of the 2018 IEEE International Conference on Communications, 2018

Fine-Grained Probability Counting: Refined LogLog Algorithm.
Proceedings of the 2018 IEEE International Conference on Big Data and Smart Computing, 2018

Single Hash: Use One Hash Function to Build Faster Hash Based Data Structures.
Proceedings of the 2018 IEEE International Conference on Big Data and Smart Computing, 2018

SSS: An Accurate and Fast Algorithm for Finding Top-k Hot Items in Data Streams.
Proceedings of the 2018 IEEE International Conference on Big Data and Smart Computing, 2018

2017
A Shifting Framework for Set Queries.
IEEE/ACM Trans. Netw., 2017

Pyramid Sketch: a Sketch Framework for Frequency Estimation of Data Streams.
Proc. VLDB Endow., 2017

SF-sketch: slim-fat-sketch with GPU assistance.
CoRR, 2017

FISF: Better User Experience using Smaller Bandwidth for Panoramic Virtual Reality Video.
CoRR, 2017

SF-sketch: A Fast, Accurate, and Memory Efficient Data Structure to Store Frequencies of Data Items.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Difference Bloom Filter: A probabilistic structure for multi-set membership query.
Proceedings of the IEEE International Conference on Communications, 2017

One Memory Access Sketch: A More Accurate and Faster Sketch for Per-Flow Measurement.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

Rectangular hash table: Bloom filter and bitmap assisted hash table with high speed.
Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

ABC: A practicable sketch framework for non-uniform multisets.
Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

2016
A Shifting Bloom Filter Framework for Set Queries.
Proc. VLDB Endow., 2016

Self-Adaptive End-Point Mutation Technique Based on Adversary Strategy Awareness.
Proceedings of the 41st IEEE Conference on Local Computer Networks, 2016

Fit the elephant in a box - towards IP lookup at on-chip memory access speed.
Proceedings of the 24th IEEE International Conference on Network Protocols, 2016

2014
Guarantee IP lookup performance with FIB explosion.
Proceedings of the ACM SIGCOMM 2014 Conference, 2014

Towards practical use of Bloom Filter based IP lookup in operational network.
Proceedings of the 2014 IEEE Network Operations and Management Symposium, 2014

A fresh look at Forwarding Information Base compression via mathematical analysis.
Proceedings of the 2014 IEEE Network Operations and Management Symposium, 2014


  Loading...