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

Ying-Dar Lin*, Shih Chiang Tsao, Un Pio Leong

*此作品的通信作者

研究成果: Paper同行評審

摘要

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 new approach to maximize the per-connection end-to-end throughput by the on-the-fly round trip time (RTT) probing mechanism. The RTTs through all possible links are probed by duplicating the SYN packet during the three way handshaking stage of a TCP connection. Combined with the statistical packet loss ratio and the passively collected link metrics, our algorithm can real-time select a link which provides the maximum throughput for the TCP connection. The experiment results show that the accuracy to choose the best outgoing access link is over 71%. If the second best link is chosen, it is usually very close to the best, thus achieving over 89% of the maximum possible throughput The average per-connection throughput for our algorithm and the traditional round-robin algorithm is 94% vs. 69%

原文English
頁面856-860
頁數5
出版狀態Published - 2004
事件GLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States
持續時間: 29 11月 20043 12月 2004

Conference

ConferenceGLOBECOM'04 - IEEE Global Telecommunications Conference
國家/地區United States
城市Dallas, TX
期間29/11/043/12/04

指紋

深入研究「On-the-fly TCP path selection algorithm in access link load balancing」主題。共同形成了獨特的指紋。

引用此