完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chen, JR | en_US |
dc.contributor.author | Chen, YC | en_US |
dc.date.accessioned | 2014-12-08T15:46:13Z | - |
dc.date.available | 2014-12-08T15:46:13Z | - |
dc.date.issued | 1999-09-25 | en_US |
dc.identifier.issn | 0140-3664 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1016/S0140-3664(99)00103-6 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/31082 | - |
dc.description.abstract | As the bandwidth requirement on the Internet grows, the efficiency of networking protocol becomes an important concern. This paper proposes a so-called pseudo-rate TCP, which features both better fairness and higher throughput than TCP Vegas by exponentially increasing the window size to a derived bound. The pseudo-rate TCP avoids the typical problem that sources with shorter round-trip times always get better chance in allocating the bandwidth. We discuss two key mechanisms designed for pseudo-rate TCP, and compare its performance with TCP Vegas through system simulation. (C) 1999 Elsevier Science B.V. All rights reserved. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | pseudo-rate TCP | en_US |
dc.subject | fairness | en_US |
dc.subject | TCP Vegas | en_US |
dc.title | Pseudo-rate TCP: a congestion avoidance scheme with nearly optimized fairness and throughput | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/S0140-3664(99)00103-6 | en_US |
dc.identifier.journal | COMPUTER COMMUNICATIONS | en_US |
dc.citation.volume | 22 | en_US |
dc.citation.issue | 15-16 | en_US |
dc.citation.spage | 1493 | en_US |
dc.citation.epage | 1501 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000082916900012 | - |
dc.citation.woscount | 0 | - |
顯示於類別: | 期刊論文 |