Show simple item record

dc.contributor.authorJin, Shudongen_US
dc.contributor.authorGuo, Liangen_US
dc.contributor.authorMatta, Ibrahimen_US
dc.contributor.authorBestavros, Azeren_US
dc.date.accessioned2011-10-20T04:42:37Z
dc.date.available2011-10-20T04:42:37Z
dc.date.issued2001-02-02
dc.identifier.urihttps://hdl.handle.net/2144/1636
dc.description.abstractThe increased diversity of Internet application requirements has spurred recent interests in transport protocols with flexible transmission controls. In window-based congestion control schemes, increase rules determine how to probe available bandwidth, whereas decrease rules determine how to back off when losses due to congestion are detected. The parameterization of these control rules is done so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship between throughput and loss rate. In this paper, we define a new spectrum of window-based congestion control algorithms that are TCP-friendly as well as TCP-compatible under RED. Contrary to previous memory-less controls, our algorithms utilize history information in their control rules. Our proposed algorithms have two salient features: (1) They enable a wider region of TCP-friendliness, and thus more flexibility in trading off among smoothness, aggressiveness, and responsiveness; and (2) they ensure a faster convergence to fairness under a wide range of system conditions. We demonstrate analytically and through extensive ns simulations the steady-state and transient behaviors of several instances of this new spectrum of algorithms. In particular, SIMD is one instance in which the congestion window is increased super-linearly with time since the detection of the last loss. Compared to recently proposed TCP-friendly AIMD and binomial algorithms, we demonstrate the superiority of SIMD in: (1) adapting to sudden increases in available bandwidth, while maintaining competitive smoothness and responsiveness; and (2) rapidly converging to fairness and efficiency.en_US
dc.description.sponsorshipNational Science Foundation (CAREER ANI-0096045, ANI-9986397); IBM PhD Fellowshipen_US
dc.language.isoen_US
dc.publisherBoston University Computer Science Departmenten_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-2001-015
dc.relation.hasversionBUCS-TR-2002-027
dc.subjectCongestion controlen_US
dc.subjectTCP-friendlyen_US
dc.subjectFairnessen_US
dc.subjectConvergenceen_US
dc.titleA Spectrum of TCP-Friendly Window-Based Congestion Control Algorithmsen_US
dc.typeTechnical Reporten_US


This item appears in the following Collection(s)

Show simple item record