Dina Katabi
Mark Handley
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.
- The network simulator ns-2. http://www.isi.edu/nsnam/ns.Google Scholar
- Red parameters. http://www.icir.org/floyd/red.html#parameters.Google Scholar
- Y. Afek, Y. Mansour, and Z. Ostfeld. Phantom: A simple and effective flow control scheme. In Proc. of ACM SIGCOMM, 1996. Google ScholarDigital Library
- M. Allman, D. Glover, and L. Sanchez. Enhancing tcp over satellite channels using standard mechanisms, Jan. 1999.Google Scholar
- S. Athuraliya, V. H. Li, S. H. Low, and Q. Yin. Rem: Active queue management. IEEE Network, 2001. Google ScholarDigital Library
- D. Bansal and H. Balakrishnan. Binomial congestion control algorithms. In Proc. of IEEE INFOCOM '01, Apr. 2001.Google ScholarCross Ref
- D. Bansal, H. Balakrishnan, and S. S. S. Floyd. Dynamic behavior of slowly-responsive congestion control algorithms. In Proc. of ACM SIGCOMM, 2001. Google ScholarDigital Library
- J. Border, M. Kojo, J. Griner, and G. Montenegro. Performance enhancing proxies, Nov. 2000.Google Scholar
- A. Charny. An algorithm for rate allocation in a packet-switching network with feedback, 1994.Google Scholar
- D. Chiu and R. Jain. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. In Computer Networks and ISDN Systems 17, page 1--14, 1989. Google ScholarDigital Library
- M. E. Crovella and A. Bestavros. Self-similarity in world wide web traffic: Evidence and possible causes. In IEEE/ACM Transactions on Networking, 5(6):835--846, Dec. 1997. Google ScholarDigital Library
- S. Floyd, M. Handley, J. Padhye, and J. Widmer. Equation-based congestion control for unicast applications. In Proc. of ACM SIGCOMM, Aug. 2000. Google ScholarDigital Library
- S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. In IEEE/ACM Transactions on Networking, 1(4):397--413, Aug. 1993. Google ScholarDigital Library
- R. Gibbens and F. Kelly. Distributed connection acceptance control for a connectionless network. In Proc. of the 16th Intl. Telegraffic Congress, June 1999.Google Scholar
- C. Hollot, V. Misra, D. Towsley, , and W. Gong. On designing improved controllers for aqm routers supporting tcp flows. In Proc. of IEEE INFOCOM, Apr. 2001.Google ScholarCross Ref
- V. Jacobson. Congestion avoidance and control. ACM Computer Communication Review; Proceedings of the Sigcomm '88 Symposium, 18, 4:314--329, Aug. 1988. Google ScholarDigital Library
- R. Jain, S. Fahmy, S. Kalyanaraman, and R. Goyal. The erica switch algorithm for abr traffic management in atm networks: Part ii: Requirements and performance evaluation. In The Ohio State University, Department of CIS, Jan. 1997.Google Scholar
- R. Jain, S. Kalyanaraman, and R. Viswanathan. The osu scheme for congestion avoidance in atm networks: Lessons learnt and extensions. In Performance Evaluation Journal, Vol. 31/1--2, Dec. 1997. Google ScholarDigital Library
- D. Katabi and C. Blake. A note on the stability requirements of adaptive virtual queue. MIT Technichal Memo, 2002.Google Scholar
- D. Katabi and M. Handley. Precise feedback for congestion control in the internet. MIT Technical Report, 2001.Google Scholar
- F. Kelly, A. Maulloo, and D. Tan. Rate control for communication networks: shadow prices, proportional fairness and stability.Google Scholar
- S. Kunniyur and R. Srikant. Analysis and design of an adaptive virtual queue. In Proc. of ACM SIGCOMM, 2001. Google ScholarDigital Library
- S. H. Low, F. Paganini, J. Wang, S. Adlakha, and J. C. Doyle. Dynamics of tcp/aqm and a scalable control. In Proc. of IEEE INFOCOM, June 2002.Google Scholar
- V. Misra, W. Gong, and D. Towsley. A fluid-based analysis of a network of aqm routers supporting tcp flows with an application to red. Aug. 2000.Google Scholar
- G. Montenegro, S. Dawkins, M. Kojo, V. Magret, and N. Vaidya. Long thin networks, Jan. 2000.Google Scholar
- F. Paganini, J. C. Doyle, and S. H. Low. Scalable laws for stable network congestion control. In IEEE CDC, 2001.Google ScholarCross Ref
- K. K. Ramakrishnan and S. Floyd. Proposal to add explicit congestion notification (ecn) to ip. RFC 2481, Jan. 1999. Google ScholarDigital Library
- I. Stoica, S. Shenker, and H. Zhang. Core-stateless fair queuing: A scalable architecture to approximate fair bandwidth allocations in high speed networks. In Proc. of ACM SIGCOMM, Aug. 1998. Google ScholarDigital Library
Index Terms
- Congestion control for high bandwidth-delay product networks
Recommendations
Congestion control for high bandwidth-delay product networks
SIGCOMM '02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communicationsTheory 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 ...
Unreliable transport protocol using congestion control for high-speed networks
Currently there is no control for the real-time traffic of multimedia applications using UDP (User Datagram Protocol) in high-speed networks. Therefore, although a number of high-speed TCP (Transmission Control Protocol) protocols have been developed ...
An efficient and fair explicit congestion control protocol for high bandwidth-delay product networks
XCP and VCP can achieve excellent performance under high bandwidth-delay product networks, but they all have some defects. In XCP, router needs to calculate a feedback for each departing packet, the cost will be un-negligible in high-speed networks. In ...
Comments