Xiang Hu

Xiang Hu

Auto-generated profile, based on publicly available information

Xiang Hu

School of Software Technology, Zhejiang University, Ningbo, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 August 2024
Verified
Conference Paper
Open access
LCLilong Chen
Lilong Chen
XJXiaochong Jiang
Xiaochong Jiang
XHXiang Hu
Xiang Hu
TXTianyu Xu
Tianyu Xu
YYYe Yang
Ye Yang
WCWenzhi Chen
Wenzhi Chen
As cloud networks continue to evolve, network traffic has experienced an exponential increase. The network architecture is progressively adopting a distributed structure to address this challenge. This architecture extensively utilizes technologies like gateway clusters and Equal-Cost Multi-Path (ECMP) routing, enabling traffic from individual tenants to be routed through multiple pathways. As a result, distributed rate limiting (DRL) has emerged as an essential aspect. Nonetheless, the shift from centralized to DRL has encountered obstacles, with the associated algorithms grappling with simplicity, precision, and applicability issues. Consequently, our research seeks to reconceptualize the issue of DRL from a theoretical standpoint to discover a more holistic and efficacious solution. In this paper, we introduce CMDRL, a novel Markovian DRL algorithm that conceptualizes the problem as a random walk on a graph and frames it within a Markov model premised on two widely accepted assumptions. We establish that the converging model exhibits a bounded mixing time, serving as a more comprehensive metric for assessing convergence velocity. The algorithm’s benefits include simplified input requisites, greater versatility across diverse contexts, and improved accuracy. Our evaluation results show that the algorithm attains a favorable convergence, evidenced by an L1-norm error of 0.063 after 50 iterations, demonstrates a rapid adaptive response with a 72.9% decrease in error within 20 iterations, and achieves a swift mixing time, requiring only 33 iterations to reach an error threshold of 0.05. Additionally, We evaluate the effectiveness of various optimization strategies for Markov chains in addressing the DRL problem.

16 September 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
XHXiang Hu
Xiang Hu
TXTianyu Xu
Tianyu Xu
LCLilong Chen
Lilong Chen
XJXiaochong Jiang
Xiaochong Jiang
YYYe Yang
Ye Yang
WCWenzhi Chen
Wenzhi Chen
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 Dual-Point 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.