• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Congestion control for high bandwidth-delay product networks (2002)

Cached

  • Download as a PDF

Download Links

  • [www.sigcomm.org]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [cs.ucsb.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.acm.org]
  • [www.cs.toronto.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.toronto.edu]
  • [www.cs.umd.edu]
  • [www.news.cs.nyu.edu]
  • [cs.baylor.edu]
  • [www.cs.berkeley.edu]
  • [www.cs.cuhk.hk]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Dina Katabi , Mark Handley , Charlie Rohrs
Venue:SIGCOMM '02
Citations:290 - 4 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Katabi02congestioncontrol,
    author = {Dina Katabi and Mark Handley and Charlie Rohrs},
    title = {Congestion control for high bandwidth-delay product networks},
    booktitle = {SIGCOMM '02},
    year = {2002},
    pages = {89--102},
    publisher = {}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Theory and experiments show that as the per-flow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes increasingly important as the Internet evolves to incorporate very high-bandwidth optical links and more large-delay satellite links. To address this problem, we develop a novel approach to Internet congestion control that outperforms TCP in conventional environments, and remains efficient, fair, scalable, and stable as the bandwidth-delay product increases. This new eXplicit Control Protocol, XCP, generalizes the Explicit Congestion Notification proposal (ECN). In addition, XCP introduces the new concept of decoupling utilization control from fairness control. This allows a more flexible and analytically tractable protocol design and opens new avenues for service differentiation. Using a control theory framework, we model XCP and demonstrate it is stable and efficient regardless of the link capacity, the round trip delay, and the number of sources. Extensive packet-level simulations show that XCP outperforms TCP in both conventional and high bandwidth-delay environments. Further, XCP achieves fair bandwidth allocation, high utilization, small standing queue size, and near-zero packet drops, with both steady and highly varying traffic. Additionally, the new protocol does not maintain any per-flow state in routers and requires few CPU cycles per packet, which makes it implementable in high-speed routers.

Citations

2033 Congestion avoidance and control - Jacobson - 1988
1933 Random early detection gateways for congestion avoidance - Floyd, Jacobson - 1993
1093 Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability - Kelly, Maulloo, et al. - 1998
1023 A.: Self-similarity in world wide web traffic: Evidence and possible causes - Crovella, Bestavros - 1997
631 Equation-based congestion control for unicast applications - Floyd, Handley, et al. - 2000
453 Analysis of the increase and decrease algorithm for congestion avoidance in computer networks - Chiu, Jain - 1989
368 A proposal to add Explicit Congestion Notification (ECN - Ramakrishnan, Floyd - 1999
281 Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED - Misra, Gong, et al. - 2000
189 On designing improved controllers for AQM routers supporting TCP flows - Hollot, Misra, et al. - 2001
180 Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management - Kunniyur, Srikant - 2001
176 REM: Active queue management - Athuraliya, Li, et al. - 2001
158 L.Sanchez, “Enhancing TCP over satellite channels using standard mechanisms - Allman - 1999
154 Binomial congestion control algorithm - Bansal, Balakrishnan - 2001
96 Distributed Connection Acceptance Control for a Connectionless Network - Gibbens, Kelly - 1999
89 Scalable laws for stable network congestion control - Paganini, Doyle, et al. - 2001
82 The ERICA switch algorithm for ABR traffic management - Jain, Kalyanaraman, et al. - 1997
74 An Algorithm for Rate Allocation in a Packet-Switching Network with Feedback - Charny - 1994
72 S.: Dynamic behavior of slowly-responsive congestion control algorithms - Bansal, Balakrishnan, et al. - 2001
29 Phantom: A Simple and Effective Flow Control Scheme - Afek, Mansour, et al. - 1996
21 The OSU Scheme for Congestion Avoidance in ATM Networks: Lessons Learnt and Extensions - Jain, Kalyanaraman, et al. - 1997
18 Core-stateless Fair Queuing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High-Speed Networks - Stoica, Shenker, et al. - 1998
15 Long thin networks - Montenegro, Dawkins, et al. - 2000
13 Dynamics of tcp/aqm and a scalable control - Low, Paganini, et al. - 2002
12 Performance Enhancing Proxies - Border, Kojo, et al. - 2000
5 A note on the stability requirements of adaptive virtual queue - Katabi, Blake - 2002
2 Precise feedback for congestion control in the internet - Katabi, Handley - 2001
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University