Back to Search Start Over

Adaptive congestion protocol: A congestion control protocol with learning capability

Authors :
Lestas, Marios
Pitsillides, Andreas
Ioannou, Petros
Hadjipollas, George
Source :
Computer Networks The International Journal of Computer and Telecommunications Networking. Sept 12, 2007, Vol. 51 Issue 13, p3773, 26 p.
Publication Year :
2007

Abstract

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.comnet.2007.04.002 Byline: Marios Lestas (a), Andreas Pitsillides (a), Petros Ioannou (b), George Hadjipollas (a) Keywords: High-speed; Congestion control; Adaptive Abstract: There is strong evidence that the current implementation of TCP will perform poorly in future high-speed networks. To address this problem many congestion control protocols have been proposed in literature which, however, fail to satisfy key design requirements of congestion control protocols, as these are outlined in the paper. In this work we develop an adaptive congestion protocol (ACP) which is shown to satisfy all the design requirements and thus outperform previous proposals. Extensive simulations indicate that the protocol is able to guide the network to a stable equilibrium which is characterized by max-min fairness, high-utilization, small queue sizes and no observable packet drops. In addition, it is found to be scalable with respect to changing bandwidths, delays and number of users utilizing the network. The protocol also exhibits nice transient properties such as smooth responses with no oscillations and fast convergence. In realistic traffic scenarios comprising of a small number of long flows and a large number of short flows, ACP outperforms both TCP and XCP, even in the presence of random packet losses. ACP does not require maintenance of per flow states within the network and utilizes an explicit multi-bit feedback signalling scheme. To maintain stability it implements at each link a novel estimation algorithm which estimates the number of flows utilizing the link. Using a simple network model, we show analytically the effectiveness of the estimation algorithm. We use the same model to generate phase portraits which demonstrate that the ACP protocol is stable for all delays. Author Affiliation: (a) Computer Science Department, University of Cyprus, Nicosia, Cyprus (b) Electrical Engineering Department, University of Southern California, Los Angeles, CA, United States Article History: Received 27 June 2006; Revised 15 March 2007; Accepted 5 April 2007 Article Note: (footnote) [star] This work was funded in part by the NSF Award No. CMS-0510921, in part by the Research Promotion Foundation (RPF) VIDEO project and in part by the University of Cyprus (UCY) ADVIDEO project.

Subjects

Subjects :
Algorithm
Algorithms -- Analysis

Details

Language :
English
ISSN :
13891286
Volume :
51
Issue :
13
Database :
Gale General OneFile
Journal :
Computer Networks The International Journal of Computer and Telecommunications Networking
Publication Type :
Academic Journal
Accession number :
edsgcl.166449023