Skip to main content

Improving XCP to achieve max-min fair bandwidth allocation

Publication ,  Journal Article
Lei, Z; Xiaowei, Y
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
December 24, 2007

TCP is shown to be inefficient and instable in high speed and long latency networks. The eXplicit Control Protocol (XCP) is a new and promising protocol that outperforms TCP in terms of efficiency, stability, queue size, and convergence speed. However, Low et al. recently discovered a weakness of XCP. In a multi-bottleneck environment, XCP may achieve as low as 80% utilization at a bottleneck link and consequently some flows may only receive a small fraction of their max-min fair rates. This paper proposes iXCP, an improved version of XCP. Extensive simulations show that iXCP overcomes the weakness of XCP, and achieves efficient and fair bandwidth utilization in both single- and multi-bottleneck environments. In addition, we prove that iXCP is max-min fair in steady state. This result implies that iXCP is able to fully utilize bottleneck bandwidth. Simulations also show that iXCP preserves the good properties of XCP, including negligible queue lengths, near-zero packet loss rates, scalability, and fast convergence. © IFIP International Federation for Information Processing 2007.

Duke Scholars

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

EISSN

1611-3349

ISSN

0302-9743

Publication Date

December 24, 2007

Volume

4479 LNCS

Start / End Page

992 / 1004

Related Subject Headings

  • Artificial Intelligence & Image Processing
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Lei, Z., & Xiaowei, Y. (2007). Improving XCP to achieve max-min fair bandwidth allocation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4479 LNCS, 992–1004.
Lei, Z., and Y. Xiaowei. “Improving XCP to achieve max-min fair bandwidth allocation.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4479 LNCS (December 24, 2007): 992–1004.
Lei Z, Xiaowei Y. Improving XCP to achieve max-min fair bandwidth allocation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2007 Dec 24;4479 LNCS:992–1004.
Lei, Z., and Y. Xiaowei. “Improving XCP to achieve max-min fair bandwidth allocation.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4479 LNCS, Dec. 2007, pp. 992–1004.
Lei Z, Xiaowei Y. Improving XCP to achieve max-min fair bandwidth allocation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2007 Dec 24;4479 LNCS:992–1004.

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

EISSN

1611-3349

ISSN

0302-9743

Publication Date

December 24, 2007

Volume

4479 LNCS

Start / End Page

992 / 1004

Related Subject Headings

  • Artificial Intelligence & Image Processing