ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Performance Evaluation
Volume 64, Issues 9-12, October 2007, Pages 948-964
Performance 2007, 26th International Symposium on Computer Performance, Modeling, Measurements, and Evaluation
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (1106 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.peva.2007.07.001    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2007 Elsevier Ltd All rights reserved.

Target bandwidth sharing using endhost measures

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

George KolaCorresponding Author Contact Information, a, E-mail The Corresponding Author and Mary K. Vernona, E-mail The Corresponding Author

aComputer Sciences Department, University of Wisconsin-Madison, United States


Available online 10 July 2007.

Abstract

Recent congestion control protocols such as XCP and RCP achieve fair bandwidth sharing, high utilization, small queue sizes and nearly zero packet loss by implementing an explicit bandwidth share mechanism in the network routers. This paper develops new quantitative techniques for achieving the same results using only end-host measures. We develop new methods of computing bottleneck link characteristics, a new technique for sharing bandwidth fairly with Reno flows, and a new approach for rapidly converging to bandwidth share. A new transport protocol, TCP-Madison, that employs the new bandwidth sharing techniques is also defined in the paper. Experiments comparing TCP-Madison with FAST TCP, BIC-TCP and TCP-Reno over hundreds of PlanetLab and other live Internet paths show that the new protocol achieves the stated bandwidth sharing properties, is easily configured for near-optimal performance over all paths, and significantly outperforms the previous protocols.

Keywords: Performance; Internet transport protocol; Network queuing

Article Outline

1. Introduction
2. Related work
3. New quantitative techniques
3.1. Computing View the MathML source
3.2. Key assumptions
3.3. Computing bottleneck measures
3.4. Target sending rate
4. The TCP-Madison protocol
4.1. Protocol parameters and measures
4.2. Flow start-up
4.3. Congestion avoidance
5. Protocol performance comparisons
5.1. Experimental setup
5.2. Protocol bandwidth sharing performance
5.3. Protocol throughput comparisons
6. Conclusions
Acknowledgements
References
Vitae










Corresponding Author Contact InformationCorresponding author.

Performance Evaluation
Volume 64, Issues 9-12, October 2007, Pages 948-964
Performance 2007, 26th International Symposium on Computer Performance, Modeling, Measurements, and Evaluation
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.