Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, JRen_US
dc.contributor.authorChen, YCen_US
dc.date.accessioned2014-12-08T15:46:13Z-
dc.date.available2014-12-08T15:46:13Z-
dc.date.issued1999-09-25en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0140-3664(99)00103-6en_US
dc.identifier.urihttp://hdl.handle.net/11536/31082-
dc.description.abstractAs 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.isoen_USen_US
dc.subjectpseudo-rate TCPen_US
dc.subjectfairnessen_US
dc.subjectTCP Vegasen_US
dc.titlePseudo-rate TCP: a congestion avoidance scheme with nearly optimized fairness and throughputen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0140-3664(99)00103-6en_US
dc.identifier.journalCOMPUTER COMMUNICATIONSen_US
dc.citation.volume22en_US
dc.citation.issue15-16en_US
dc.citation.spage1493en_US
dc.citation.epage1501en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000082916900012-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. 000082916900012.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.