Fast convergence of congestion control algorithm

Authors:
Lihong Peng;Xinwen Jiang;Heying Zhang;Wenhua Dou
Affiliations:
School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China
Venue:
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Year:
2009

Citing 4
Cited 0

Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
Congestion control for high bandwidth-delay product networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Delay-independent stability and performance of distributed congestion control

IEEE/ACM Transactions on Networking (TON)
Processor sharing flows in the internet

IWQoS'05 Proceedings of the 13th international conference on Quality of Service

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional congestion control algorithms exhibit low convergence speed to equilibrium in high BDP (Bandwidth Delay Product) networks. The Fast Max-Min Kelly Control (FMKC) is a new and promising protocol that performs well especially in fairness convergence speed. FMKC utilizes packet loss to switch temporarily into a fairing mode and thereby improve the fairness convergence speed. In this paper, we investigate FMKC, prove its stability with homogeneous delay and also study the convergence behavior of FMKC. Extensive simulations show that FMKC offers faster convergence rate than EMKC. Simulations also show that FMKC preserves the good properties of EMKC, such as delay-independent stability and max-min fairness in steady state.