完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChen, JRen_US
dc.contributor.authorChen, YCen_US
dc.contributor.authorLee, CLen_US
dc.date.accessioned2014-12-08T15:44:49Z-
dc.date.available2014-12-08T15:44:49Z-
dc.date.issued2000-09-30en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0140-3664(00)00216-4en_US
dc.identifier.urihttp://hdl.handle.net/11536/30248-
dc.description.abstractTraditional TCP Row control schemes, such as Tahoe and Reno, continuously increase the window size until possible packet loss is detected. These schemes generate congestion unnecessarily by themselves and utilize the buffer space inefficiently. Therefore, Vegas was proposed to accommodate the drawbacks. It uses the measured round-trip time (RTT) to obtain the information required for the flow control. in this work, we propose a Row control scheme, RTT-based TCP, which uses the RTT directly to control the window size adjustment. RTT-based TCP comprises four mechanisms: the modified exponential window increment, the RTT measurement, the queue occupancy estimation, and the quick queue-occupancy reduction. Simulation results show that RTT-based TCP outperforms Vegas in the aspects of throughput, fairness and efficiency of buffer usage. (C) 2000 Elsevier Science B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectTCPen_US
dc.subjectcongestion avoidanceen_US
dc.subjectfairnessen_US
dc.titleAn end-to-end flow control approach based on round trip timeen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0140-3664(00)00216-4en_US
dc.identifier.journalCOMPUTER COMMUNICATIONSen_US
dc.citation.volume23en_US
dc.citation.issue16en_US
dc.citation.spage1537en_US
dc.citation.epage1547en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000089564600004-
dc.citation.woscount3-
顯示於類別:期刊論文


文件中的檔案:

  1. 000089564600004.pdf

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