Tong Meng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tong Meng has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Changqing Yan
Bytedance, Beijing, China
2 shared publications - Bingcong Lu
SHANGHAI JIAOTONG UNIVERSITY, Shanghai, China
1 shared publication Brighten Godfrey
UIUC
1 shared publication- Brighten Godfrey
UIUC and Broadcom
1 shared publication - Chao Li
ByteDance Inc., Shanghai, China
1 shared publication - Chenguang Li
ByteDance Inc., Shanghai, China
1 shared publication
Latest Publications
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 730-742
Adaptive Bitrate Live Streaming over HTTP-FLV: A Practical System Perspective
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 730-742
Open AccessAdaptive Bitrate Live Streaming over HTTP-FLV: A Practical System Perspective
- Open Access
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1199-1212
Harnessing WebRTC for Large-Scale Live Streaming
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1199-1212
Open AccessHarnessing WebRTC for Large-Scale Live Streaming
- Open Access
- 30 June 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 1 (CoNEXT1) , 1-22
Flock: Accurate Network Fault Localization at Scale
Inferring the root cause of failures among thousands of components in a data center network is challenging, especially for "gray" failures that are not reported directly by switches. Faults can be localized through end-to-end measurements, but past localization schemes are either too slow for large-scale networks or sacrifice accuracy. We describe Flock, a network fault localization algorithm and system that achieves both high accuracy and speed at datacenter scale. Flock uses a probabilistic graphical model (PGM) to achieve high accuracy, coupled with new techniques to dramatically accelerate inference in discrete-valued Bayesian PGMs. Large-scale simulations and experiments in a hardware testbed show Flock speeds up inference by >10000x compared to past PGM methods, and improves accuracy over the best previous datacenter fault localization approaches, reducing inference error by 1.19-11x on the same input telemetry, and by 1.2-55x after incorporating passive telemetry. We also prove Flock's inference is optimal in restricted settings.
- 30 June 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 1 (CoNEXT1) , 1-22
Open AccessFlock: Accurate Network Fault Localization at Scale
Inferring the root cause of failures among thousands of components in a data center network is challenging, especially for "gray" failures that are not reported directly by switches. Faults can be localized through end-to-end measurements, but past localization schemes are either too slow for large-scale networks or sacrifice accuracy. We describe Flock, a network fault localization algorithm and system that achieves both high accuracy and speed at datacenter scale. Flock uses a probabilistic graphical model (PGM) to achieve high accuracy, coupled with new techniques to dramatically accelerate inference in discrete-valued Bayesian PGMs. Large-scale simulations and experiments in a hardware testbed show Flock speeds up inference by >10000x compared to past PGM methods, and improves accuracy over the best previous datacenter fault localization approaches, reducing inference error by 1.19-11x on the same input telemetry, and by 1.2-55x after incorporating passive telemetry. We also prove Flock's inference is optimal in restricted settings.
- Open Access
- 24 July 2021
- Published by Association for Computing Machinery (ACM)
- Vol. 14, 59-61
Toward greater scavenger congestion control deployment
Heterogeneous applications and restricted bandwidth on the Internet have motivated recent works on scavenger congestion control, which yields bandwidth to competing primary traffic for increased network-wide utility. Although potential use cases are quite common, deployments are as yet limited, in part due to protocol design immaturity, lack of open source code, and limited experimental evaluation. In this work, we extend recent scavenger advances by providing (1) open-source implementations of two recent scavenger proposals, PCC Proteus (QUIC-based) and LEDBAT++; (2) early benchmarks of the two in a realistic network setup; and (3) a discussion of APIs needed for applications to take advantage of scavenger congestion control. Ultimately, we hope this line of work will lead to further community discussion, open development, and deployment of scavengers yielding better quality of experience for users.
- 24 July 2021
- Published by Association for Computing Machinery (ACM)
- Vol. 14, 59-61
Open AccessToward greater scavenger congestion control deployment
Heterogeneous applications and restricted bandwidth on the Internet have motivated recent works on scavenger congestion control, which yields bandwidth to competing primary traffic for increased network-wide utility. Although potential use cases are quite common, deployments are as yet limited, in part due to protocol design immaturity, lack of open source code, and limited experimental evaluation. In this work, we extend recent scavenger advances by providing (1) open-source implementations of two recent scavenger proposals, PCC Proteus (QUIC-based) and LEDBAT++; (2) early benchmarks of the two in a realistic network setup; and (3) a discussion of APIs needed for applications to take advantage of scavenger congestion control. Ultimately, we hope this line of work will lead to further community discussion, open development, and deployment of scavengers yielding better quality of experience for users.