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    
Computer Communications
Volume 30, Issue 2, 15 January 2007, Pages 351-357
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (981 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.comcom.2006.09.001    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2006 Elsevier B.V. All rights reserved.

On-the-fly TCP path selection algorithm in access link load balancing

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.

Ying-Dar Lina, E-mail The Corresponding Author, Shih-Chiang TsaoCorresponding Author Contact Information, a, E-mail The Corresponding Author and Un-Pio Leonga

aDepartment of Computer and Information Science, National Chiao Tung University, HsinChu, Taiwan


Received 17 April 2006; 
revised 31 August 2006; 
accepted 2 September 2006. 
Available online 2 October 2006.

Abstract

Many enterprises install multiple access links for fault tolerance or bandwidth enlargement. Dispatching connections through good links is the ultimate goal in utilizing multiple access links. The traditional dispatching method is only based on the condition of the access links to ISPs. It may achieve fair utilization on the access links but poor performance on connection throughput. In this work, we propose a novel approach to maximize the per-connection end-to-end throughput by the on-the-fly round trip time (RTT) probing mechanism. The end-to-end RTTs through all possible links are probed by duplicating the SYN packet during the three-way handshaking stage of a TCP connection. The experiment results show that the ratio to choose the best outgoing access link is 79% on the average. If the second best link is chosen, it is usually very close to the best, thus averagely achieving 94% of the maximum possible throughput. The ratio of the traditional round-robin (RR) algorithm is only 35%, and the link selected by RR algorithm could provide 69% of throughput.

Keywords: Path selection; RTT; TCP three-way handshaking

Article Outline

1. Introduction
2. Problems in traditional link selection
2.1. Used protocol
2.2. Collection distance
2.3. Measured moment
3. On-the-fly RTT probing mechanism
3.1. RTT is short-time stable
3.2. On-the-fly probing on RTT
3.3. Packet loss ratio
3.4. Implementation issues
4. Evaluation
4.1. Testbed configuration
4.2. The link selected by OFRP-LB
4.3. The accuracy of OFRP-LB
4.4. The comparison between selected and maximum links
5. Conclusion and future work
References
Vitae







Corresponding Author Contact InformationCorresponding author. Tel: +886 3 5731899; fax: +886 3 5721490.

Computer Communications
Volume 30, Issue 2, 15 January 2007, Pages 351-357
 
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.