Details

A LIGHT ON XCP TO AVOID CONGESTION FOR HIGH BANDWIDTH NETWORK

Syed Nusrat

Research Scholar, Shri Jjt University

Farman Ali

Research Scholar, Shri Jjt University

Agha Salman Haider

Research Scholar, Manav Bharti University

45-56

Vol: 4, Issue: 1, 2014

Receiving Date: Acceptance Date:

Publication Date:

Download PDF

Abstract

Technology trends indicate that the future Internet will have a large number of very high-bandwidth links. Less ubiquitous but still commonplace will be satellite and wireless links with high latency. These trends are problematic because TCP reacts adversely to increases in the per-flow bandwidth-delay product. This extended abstract proposes a novel congestion control protocol, called XCP, that outperforms TCP in both traditional and high bandwidth-delay product environments. The problem facing TCP as the per-flow bandwidth-delay increases is multi-fold. First, mathematical analysis of TCP congestion control reveals that, regardless of the queuing scheme, as the delay-bandwidth product increases, TCP becomes oscillatory and prone to instability. By casting the problem into a control theory framework, Low et al. [10] show that as capacity or delay increases, Random Early Discard (RED) [4], Random Early Marking (REM) [2], Proportional Integral Controller [6], and Virtual Queue [5] all eventually become oscillatory and prone to instability. They further argue that it is unlikely that any Active Queue Management scheme (AQM) can maintain stability over very high-capacity or large-delay links. Furthermore, Katabi and Blake [7] show that Adaptive Virtual Queue (AVQ) [9] also becomes prone to instability when the link capacity is large enough (e.g., gigabit links). Inefficiency is another problem facing TCP in the future Internet. As the delay bandwidth product increases, performance degrades. TCP’s additive increase policy limits its ability to acquire spare bandwidth to one packet per RTT. Since the bandwidth-delay product of a single flow over very-high-bandwidth links may be many thousands of packets, TCP might waste thousands of RTTs ramping up to full utilization following a burst of congestion. To address the above problem, we compared a novel protocol for congestion control that outperforms TCP in conventional environments, and further remains efficient, fair, and stable as the link bandwidth or the round-trip delay increases [8].This protocol is eXplicit Control Protocol, XCP, generalizesthe Explicit Congestion Notification proposal (ECN) [12]. Instead of the one bit congestion indication used by ECN, our routers inform the senders about the degree of congestion at the bottleneck. Another new concept is the decoupling of utilization control from fairness control. Methodology In this paper we gives a light to the novel protocol (XCP) for congestion control that outperforms TCP inconventional environments. Conclusion To control utilization, this novel protocol adjusts its aggressiveness according to the spare bandwidth in the network and the feedback delay. This prevents oscillations, provides stability in face of high bandwidth or large delay, and ensures efficient utilization of network resources. To control fairness, the protocol reclaims bandwidth from flows whose rate is above their fair share and reallocates it to other flows. By putting the control state in the packets, XCP needs no per-flow state in routers and can scale to any number of flows. Further, implementation of XCP, requires only a few CPU cycles per packet, making it practical even for high-speed routers

Keywords: Networks; TCP, XCP; Congestion control

References

  1. The network simulator ns-2. http://www.isi.edu/nsnam/ns.
  2. Red parameters. http://www.icir.org/floyd/red.html#parameters.
  3. Y. Afek, Y. Mansour, and Z. Ostfeld. Phantom: A simple and effective flow control scheme. In Proc. of ACM SIGCOMM, 1996.
  4. M. Allman, D. Glover, and L. Sanchez. Enhancing tcp over satellite channels using standard mechanisms, Jan. 1999.
  5. S. Athuraliya, V. H. Li, S. H. Low, and Q. Yin. Rem: Active queue management. IEEE Network, 2001.
  6. D. Bansal and H. Balakrishnan. Binomial congestion control algorithms. In Proc. of IEEE INFOCOM ’01, Apr. 2001.
  7. D. Bansal, H. Balakrishnan, and S. S. S. Floyd. Dynamic behavior of slowly-responsivecongestion control algorithms. In Proc. of ACM SIGCOMM, 2001.
  8. J. Border, M. Kojo, J. Griner, and G. Montenegro. Performance enhancing proxies, Nov. 2000.
  9. A. Charny. An algorithm for rate allocation in a packet-switching network with feedback, 1994.
  10. D. Chiu and R. Jain. Analysis of the increase and decrease algorithms for congestion avoidancein computer networks.In Computer Networks and ISDN Systems 17, page 1-14, 1989.
  11. 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.
  12. S. Floyd, M. Handley, J. Padhye, and J. Widmer. Equation-based congestion control for unicast applications. In Proc. of ACM SIGCOMM, Aug. 2000.
  13. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. In IEEE/ACM Transactions on Networking, 1(4):397–413, Aug. 1993.
  14. R. Gibbens and F. Kelly. Distributed connection acceptance control for a connectionlessnetwork. In Proc. of the 16th Intl. Telegraffic Congress, June 1999.
  15. 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.
  16. V. Jacobson. Congestion avoidance and control. ACM Computer Communication Review; Proceedings of the Sigcomm ’88 Symposium, 18, 4:314–329, Aug. 1988.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.
  17. 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.
  18. D. Katabi and C. Blake. A note on the stability requirements of adaptive virtual queue. MIT Technichal Memo, 2002.
  19. D. Katabi and M. Handley. Precise feedback for congestion control in the internet. MITTechnical Report, 2001.
  20. F. Kelly, A. Maulloo, and D. Tan. Rate control for communication networks: shadow prices, proportional fairness and stability.
  21. S. Kunniyur and R. Srikant. Analysis and design of an adaptive virtual queue. In Proc. of ACM SIGCOMM, 2001.
  22. 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.
  23. 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.
  24. G. Montenegro, S. Dawkins, M. Kojo, V. Magret, and N. Vaidya. Long thin networks, Jan. 2000.
  25. F. Paganini, J. C. Doyle, and S. H. Low. Scalable laws for stable network congestion control. In IEEE CDC, 2001.
  26. K. K. Ramakrishnan and S. Floyd. Proposal to add explicit congestion notification (ecn) to ip. RFC 2481, Jan. 1999.
  27. 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.
Back

Disclaimer: Indexing of published papers is subject to the evaluation and acceptance criteria of the respective indexing agencies. While we strive to maintain high academic and editorial standards, International Journal of Research in Science and Technology does not guarantee the indexing of any published paper. Acceptance and inclusion in indexing databases are determined by the quality, originality, and relevance of the paper, and are at the sole discretion of the indexing bodies.