完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, Ying-Daren_US
dc.contributor.authorTsao, Shih-Chiangen_US
dc.contributor.authorLeong, Un-Pioen_US
dc.date.accessioned2014-12-08T15:14:53Z-
dc.date.available2014-12-08T15:14:53Z-
dc.date.issued2007-01-15en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.comcom.2006.09.001en_US
dc.identifier.urihttp://hdl.handle.net/11536/11226-
dc.description.abstractMany 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.en_US
dc.language.isoen_USen_US
dc.subjectpath selectionen_US
dc.subjectRTTen_US
dc.subjectTCP three-way handshakingen_US
dc.titleOn-the-fly TCP path selection algorithm in access link load balancingen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.comcom.2006.09.001en_US
dc.identifier.journalCOMPUTER COMMUNICATIONSen_US
dc.citation.volume30en_US
dc.citation.issue2en_US
dc.citation.spage351en_US
dc.citation.epage357en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000243629700013-
dc.citation.woscount1-
顯示於類別:期刊論文


文件中的檔案:

  1. 000243629700013.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。