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

檔案

日期

2007-01-15

期刊名稱

COMPUTER COMMUNICATIONS

摘要

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. (c) 2006 Elsevier B.V. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Lin, Y.-D., Tsao, S.-C., & Leong, U.-P. (2007). On-the-fly TCP path selection algorithm in access link load balancing. COMPUTER COMMUNICATIONS, 30(2), 351–357. https://doi.org/10.1016/j.comcom.2006.09.001

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/11226