By Topic

Delay-Independent Stability and Performance of Distributed Congestion Control

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yueping Zhang ; Texas A&M Univ., College Station ; Seong-Ryong Kang ; Dmitri Loguinov

Recent research efforts to design better Internet transport protocols combined with scalable active queue management (AQM) have led to significant advances in congestion control. One of the hottest topics in this area is the design of discrete congestion control algorithms that are asymptotically stable under heterogeneous feedback delay and whose control equations do not explicitly depend on the RTTs of end-flows. In this paper, we first prove that single-link congestion control methods with a stable radial Jacobian remain stable under arbitrary feedback delay (including heterogeneous directional delays) and that the stability condition of such methods does not involve any of the delays. We then extend this result to generic networks with fixed consistent bottleneck assignments and max-min network feedback. To demonstrate the practicality of the obtained result, we change the original controller in Kelly's work [ldquoRate Control for communication networks: Shadow prices, proportional fairness and stability,rdquo Journal of the Operational Research Society, vol. 49, no. 3, pp. 237-252, March 1998] to become robust under random feedback delay and fixed constants of the control equation. We call the resulting framework max-min Kelly control (MKC) and show that it offers smooth sending rate, exponential convergence to efficiency, and fast convergence to fairness, all of which make it appealing for future high-speed networks.

Published in:

IEEE/ACM Transactions on Networking  (Volume:15 ,  Issue: 4 )