Chuanqing Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chuanqing Lin has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Gerui Lv
Institute of Computing Technology, University of Chinese Academy of Sciences, Beijing, China
4 shared publications - Gaogang Xie
Chinese Academy of Sciences
3 shared publications - Qinghua Wu
University of Chinese Academy of Sciences
3 shared publications - Yu Tian
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
3 shared publications - Zhenyu Li
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China and University of Chinese Academy of Sciences, Beijing, China
3 shared publications - Ao Li
Communication and Network Laboratory, Dalian University, Dalian 116622, China
1 shared publication
Latest Publications
- Open Access
- 6 May 2026
- Published by Elsevier in Computer Networks
- Vol. 284
ADePT: Latency prediction for edge CDN traffic scheduling via causal inference
- 6 May 2026
- Published by Elsevier in Computer Networks
- Vol. 284
Open AccessADePT: Latency prediction for edge CDN traffic scheduling via causal inference
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1604-1620
RLive: Robust Delivery System for Scaling Live Streaming Services
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1604-1620
Open AccessRLive: Robust Delivery System for Scaling Live Streaming Services
- Open Access
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3 (CoNEXT4) , 1-26
Cost-efficient Request Mapping for Large-scale Live Streaming Services
The live streaming landscape has shifted to a crowd-sourced paradigm, resulting in highly volatile and geographically diverse viewer demand. To handle growing traffic, Content Delivery Networks (CDNs) increasingly rely on a mix of dedicated infrastructure and lower-cost, heterogeneous edge resources. Our analysis of production data reveals two emerging characteristics in modern live delivery: dynamic regional supply-demand imbalance and per-stream heterogeneity in popularity and geography. However, existing request mapping solutions fall short in this new landscape, as they assume stable regional capacity and overlook stream-level heterogeneity. This paper proposes LiveMap , a cost-efficient and latency-aware request mapping system for live CDNs. LiveMap performs online bandwidth provisioning via dual-level coordination to resolve regional supply-demand imbalances and reduce bandwidth costs. Further, LiveMap introduces an adaptive stream mapping strategy that dynamically forms per-stream delivery groups based on real-time popularity and system load. Deployed in Bilibili CDN serving crowdsourced live streaming over a year, LiveMap reduces bandwidth costs by 42.18% and access latency by 20.26%, outperforming the state-of-the-art solutions.
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3 (CoNEXT4) , 1-26
Open AccessCost-efficient Request Mapping for Large-scale Live Streaming Services
The live streaming landscape has shifted to a crowd-sourced paradigm, resulting in highly volatile and geographically diverse viewer demand. To handle growing traffic, Content Delivery Networks (CDNs) increasingly rely on a mix of dedicated infrastructure and lower-cost, heterogeneous edge resources. Our analysis of production data reveals two emerging characteristics in modern live delivery: dynamic regional supply-demand imbalance and per-stream heterogeneity in popularity and geography. However, existing request mapping solutions fall short in this new landscape, as they assume stable regional capacity and overlook stream-level heterogeneity. This paper proposes LiveMap , a cost-efficient and latency-aware request mapping system for live CDNs. LiveMap performs online bandwidth provisioning via dual-level coordination to resolve regional supply-demand imbalances and reduce bandwidth costs. Further, LiveMap introduces an adaptive stream mapping strategy that dynamically forms per-stream delivery groups based on real-time popularity and system load. Deployed in Bilibili CDN serving crowdsourced live streaming over a year, LiveMap reduces bandwidth costs by 42.18% and access latency by 20.26%, outperforming the state-of-the-art solutions.
- Open Access
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3 (CoNEXT4) , 1-25
Oceanus: Scheduling Traffic Flows to Achieve Cost-Efficiency under Uncertainties in Large-Scale Edge CDNs
Large-scale edge Content Delivery Networks (CDNs) provide low-latency content access services and suffer from high bandwidth costs. While previous studies have sought to optimize bandwidth costs under percentile billing, the efficacy is compromised due to the pervasive uncertainty inherent in practical systems, including traffic demand dynamics, performance-constrained scheduling bias, and systemic scheduling deviations. Such uncertainties can result in large gaps among optimal, expected, and actual utilization of massive vulnerable and heterogeneous edge nodes. To address these uncertainties, we propose Oceanus, a cost-effective traffic scheduling system for large-scale edge CDN systems. Oceanus decouples the bandwidth planning problem and performs on multiple timescales. In addition, Oceanus coordinates bandwidth planning with flow scheduling through the bidirectional feedback scheme. Oceanus further utilizes nodes with minimal marginal cost to reduce additional bandwidth cost. Extensive experiments in a trace-driven testbed and real-world deployment confirm the effectiveness of Oceanus. Compared to the state-of-the-art scheduling method, Oceanus achieves 79.4% (vs. 51.5%) of optimum cost reduction and reduces 21.4% (vs. 8.1%) bandwidth costs.
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3 (CoNEXT4) , 1-25
Open AccessOceanus: Scheduling Traffic Flows to Achieve Cost-Efficiency under Uncertainties in Large-Scale Edge CDNs
Large-scale edge Content Delivery Networks (CDNs) provide low-latency content access services and suffer from high bandwidth costs. While previous studies have sought to optimize bandwidth costs under percentile billing, the efficacy is compromised due to the pervasive uncertainty inherent in practical systems, including traffic demand dynamics, performance-constrained scheduling bias, and systemic scheduling deviations. Such uncertainties can result in large gaps among optimal, expected, and actual utilization of massive vulnerable and heterogeneous edge nodes. To address these uncertainties, we propose Oceanus, a cost-effective traffic scheduling system for large-scale edge CDN systems. Oceanus decouples the bandwidth planning problem and performs on multiple timescales. In addition, Oceanus coordinates bandwidth planning with flow scheduling through the bidirectional feedback scheme. Oceanus further utilizes nodes with minimal marginal cost to reduce additional bandwidth cost. Extensive experiments in a trace-driven testbed and real-world deployment confirm the effectiveness of Oceanus. Compared to the state-of-the-art scheduling method, Oceanus achieves 79.4% (vs. 51.5%) of optimum cost reduction and reduces 21.4% (vs. 8.1%) bandwidth costs.