Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Liming Ye

dblp:339/2803 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0006-3593-9036ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet architecture and protocols · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 50% Distributed systems · 50%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › traffic shaping
token bucket
1.012026
Distributed Rate Limiting Under Decentralized Cloud Networks · IEEE Trans. Mob. Comput. 2026
Internet architecture and protocols
traffic management
1.012026
Distributed Rate Limiting Under Decentralized Cloud Networks · IEEE Trans. Mob. Comput. 2026
Cloud and datacenter computing › cloud deployment model
distributed cloud
1.012026
Distributed Rate Limiting Under Decentralized Cloud Networks · IEEE Trans. Mob. Comput. 2026
Distributed systems › distributed coordination
distributed rate limiting
1.012026
Distributed Rate Limiting Under Decentralized Cloud Networks · IEEE Trans. Mob. Comput. 2026
Internet architecture and protocols
overlay networks
0.312026
Distributed Rate Limiting Under Decentralized Cloud Networks · IEEE Trans. Mob. Comput. 2026

Methods — techniques the papers use, named apart from their topics

dynamic adjustment · 2.0constant probability control · 2.0
YearPublicationVenuePosition
2026 Distributed Rate Limiting Under Decentralized Cloud Networks
abstract
The rapid expansion of cloud applications has led to unprecedented increases in network traffic volume, diversity, and complexity. As Cloud Service Providers (CSPs) adopt decentralized, geographically distributed data centers, effective traffic management across these environments has become critical. Distributed Rate Limiting (DRL) has emerged as an essential tool to manage the complex traffic dynamics of decentralized networks, yet traditional centralized rate limiting methods fall short, facing limitations in scalability, adaptability to bursty traffic, and efficiency. This paper presents C3PDAR (Cloud Control with Constant Probabilities and Dynamic Adjustment Range), a novel DRL algorithm tailored for decentralized cloud infrastructures. C3PDAR introduces three key innovations: (1) CPS-BPS DualPoint Rate Limiting and Parent-Child Token Bucket mechanisms, which effectively mitigate burst traffic and short-lived connections while improving bandwidth fairness and inter-tenant isolation; (2) A vSwitch-CGW Cascade Rate Limiting architecture, which reduces CPU overhead in CGW clusters and accelerates convergence by 42%–78%; (3) Virtual Extensible Local Area Network (VXLAN) Padding scheme, which embeds rate-limiting information in existing traffic instead of transmitting new data packets, reducing the communication overhead of the C3PDAR algorithm by over 40%. By integrating these advancements, C3PDAR delivers a scalable, robust solution that outperforms traditional DRL approaches in performance, fault tolerance, and resource efficiency. C3PDAR uniquely empowers CSPs to manage complex, high-volume traffic dynamics in decentralized cloud environments, offering both theoretical insights and practical optimizations for next-generation network control.
Tianyu Xu 0007, Lilong Chen, Xiaochong Jiang, Liming Ye, Yilong Lv, Chenhao Jia, Yongwang Wu, Zhigang Zong, Xing Li 0007, Bingqian Lu, Shunmin Zhu, Chengkun Wei, Wenzhi Chen
IEEE Trans. Mob. Comput.6