Approaches to Congestion Control in packet networks

We discuss congestion control algorithms, using network awareness as a criterion to categorize different approaches. The first category ("the box is black") consists of a group of algorithms that consider the network as a black box, assuming no knowledge of its state, other than the binary feedback upon congestion. The second category ("the box is grey") groups approaches that use measurements to estimate available bandwidth, level of contention or even the temporary characteristics of congestion. Due to the possibility of wrong estimations and measurements, the network is considered a grey box. The third category ("the box is green") contains the bimodal congestion control, which calculates explicitly the fair-share, as well as the network-assisted control, where the network communicates its state to the transport layer; the box now is becoming green. We go beyond a description of the different approaches to discuss the tradeoffs of network parameters, the accuracy of congestion control models and the impact of network and application heterogeneity on congestion itself.

[1]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[2]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[3]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[4]  Srinivasan Seshan,et al.  Selfish behavior and stability of the internet: a game-theoretic analysis of TCP , 2002, SIGCOMM.

[5]  Vassilis Tsaoussidis,et al.  Experimental Evaluation of Red in Heterogeneous Environments , 2002, International Conference on Internet Computing.

[6]  Kostas Pentikousis,et al.  Energy/throughput tradeoffs of TCP error control strategies , 2000, Proceedings ISCC 2000. Fifth IEEE Symposium on Computers and Communications.

[7]  Song Chong,et al.  A distributed utility max-min flow control algorithm , 2006, Comput. Networks.

[8]  Vassilis Tsaoussidis,et al.  Beyond AIMD: explicit fair-share calculation , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[9]  Cheng Jin,et al.  FAST TCP: Motivation, Architecture, Algorithms, Performance , 2006, IEEE/ACM Transactions on Networking.

[10]  Leandros Tassiulas,et al.  Fair allocation of utilities in multirate multicast networks: a framework for unifying diverse fairness objectives , 2002, IEEE Trans. Autom. Control..

[11]  S. Low,et al.  Understanding Vegas: a duality model , 2002 .

[12]  Hayder Radha,et al.  End-to-end rate-based congestion control: convergence properties and scalability analysis , 2003, TNET.

[13]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[14]  Vaduvur Bharghavan,et al.  WTCP: A Reliable Transport Protocol for Wireless Wide-Area Networks , 1999, Wirel. Networks.

[15]  Anand Rangarajan Early Regulation of Unresponsive Flows , 1999 .

[16]  V. Tsaoussidis,et al.  ADDITIVE INCREASE MULTIPLICATIVE DECREASE - FAST CONVERGENCE (AIMD-FC) , 2002 .

[17]  Tobias Harks,et al.  Priority pricing in utility fair networks , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[18]  Richard M. Karp,et al.  Optimization problems in congestion control , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[19]  Paul G. Spirakis,et al.  Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost , 2005, WAOA.

[20]  Srinivasan Seshan,et al.  Improving TCP/IP performance over wireless networks , 1995, MobiCom '95.

[21]  Andrew T. Campbell,et al.  A Utility-Based Approach for Quantitative Adaptation in Wireless Packet Networks , 2001, Wirel. Networks.

[22]  Deborah Estrin,et al.  RAP: An end-to-end rate-based congestion control mechanism for realtime streams in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[23]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[24]  Sally Floyd,et al.  HighSpeed TCP for Large Congestion Windows , 2003, RFC.

[25]  Vassilis Tsaoussidis,et al.  TCP-real: improving real-time capabilities of TCP over heterogeneous networks , 2001, NOSSDAV '01.

[26]  Ren Wang,et al.  TCP westwood: Bandwidth estimation for enhanced transport over wireless links , 2001, MobiCom '01.

[27]  Shengyu Zhang,et al.  Distributed rate allocation for inelastic flows: optimization frameworks, optimality conditions, and optimal algorithms , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[28]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM '02.

[29]  Vassilis Tsaoussidis,et al.  /spl tau/-AIMD for asynchronous receiver feedback , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[30]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[31]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[32]  Ellen W. Zegura,et al.  Utility max-min: an application-oriented bandwidth allocation scheme , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[33]  Thomas R. Gross,et al.  TCP Vegas revisited , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[34]  Mark Handley,et al.  A Comparison of Equation-Based and AIMD Congestion Control , 2000 .

[35]  Ioannis Psaras,et al.  Why TCP timers (still) don't work well , 2007, Comput. Networks.

[36]  Mark Handley,et al.  Equation-based congestion control for unicast applications , 2000, SIGCOMM 2000.

[37]  Scott Shenker,et al.  Approximate fairness through differential dropping , 2003, CCRV.

[38]  Vassilis Tsaoussidis,et al.  Exploiting the adaptive properties of a probing device for TCP in heterogenous networks , 2003, Comput. Commun..

[39]  Kai Xu,et al.  TCP-Jersey for wireless IP communications , 2004, IEEE Journal on Selected Areas in Communications.

[40]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[41]  T. V. Lakshman,et al.  SRED: stabilized RED , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[42]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[43]  Kouji Yata,et al.  Improving the convergence time highspeed TCP , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

[44]  Ness B. Shroff,et al.  Non-convex optimization and rate control for multi-class services in the Internet , 2005, IEEE/ACM Transactions on Networking.

[45]  Eddie Kohler,et al.  TCP Friendly Rate Control (TFRC): The Small-Packet (SP) Variant , 2007, RFC.

[46]  Yang Richard Yang,et al.  Two Problems of TCP AIMD Congestion Control , 2000 .

[47]  Saverio Mascolo,et al.  Performance evaluation of Westwood+ TCP congestion control , 2004, Perform. Evaluation.

[48]  Ratul Mahajan,et al.  Controlling high-bandwidth flows at the congested router , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[49]  K. K. Ramakrishnan,et al.  A Proposal to add Explicit Congestion Notification (ECN) to IP , 1999, RFC.

[50]  Ian F. Akyildiz,et al.  TCP-Peach: a new congestion control scheme for satellite IP networks , 2001, TNET.

[51]  Deepak Bansal,et al.  Binomial congestion control algorithms , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[52]  Sergey Gorinsky,et al.  Extended Analysis of Binary Adjustment Algorithms , 2002 .

[53]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[54]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[55]  Paul G. Spirakis,et al.  Selfish unsplittable flows , 2005, Theor. Comput. Sci..

[56]  Vassilis Tsaoussidis,et al.  The Wave & Probe Communication Mechanisms , 2004, The Journal of Supercomputing.

[57]  Vipul Gupta,et al.  Freeze-TCP: a true end-to-end TCP enhancement mechanism for mobile environments , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[58]  George Karakostas,et al.  Edge pricing of multicommodity networks for heterogeneous selfish users , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[59]  Paul G. Spirakis,et al.  The price of selfish routing , 2001, STOC '01.

[60]  Steven H. Low,et al.  REM: active queue management , 2001, IEEE Netw..

[61]  Vassilis Tsaoussidis,et al.  TCP-Real: receiver-oriented congestion control , 2002, Comput. Networks.

[62]  Fernando Paganini,et al.  Congestion control for high performance, stability, and fairness in general networks , 2005, IEEE/ACM Transactions on Networking.

[63]  Jörg Widmer,et al.  TCP Friendly Rate Control (TFRC): Protocol Specification , 2003, RFC.

[64]  Sergey Gorinsky,et al.  Multimodal Congestion Control for Low Stable-State Queuing , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[65]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[66]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[67]  Vassilis Tsaoussidis,et al.  The interrelation of TCP responsiveness and smoothness in heterogeneous networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[68]  Paul G. Spirakis,et al.  Atomic Selfish Routing in Networks: A Survey , 2005, WINE.

[69]  H. Vin,et al.  Additive Increase Appears Inferior , 2000 .

[70]  Martin May,et al.  Analytic evaluation of RED performance , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[71]  Vassilis Tsaoussidis,et al.  Exploiting the efficiency and fairness potential of AIMD-based congestion avoidance and control , 2003, Comput. Networks.

[72]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[73]  Mohammad Mahdian,et al.  Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[74]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[75]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[76]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[77]  Scott Shenker,et al.  Fundamental Design Issues for the Future Internet (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..

[78]  Sally Floyd,et al.  TCP Selective Acknowledgement Options , 1996 .

[79]  Paul G. Spirakis,et al.  The structure and complexity of Nash equilibria for a selfish routing game , 2002, Theor. Comput. Sci..

[80]  Dmitri Loguinov,et al.  JetMax: Scalable Max-Min Congestion Control for High-Speed Heterogeneous Networks , 2006, INFOCOM.

[81]  Fernando Paganini,et al.  Internet congestion control , 2002 .

[82]  Liang Guo,et al.  TCP-friendly SIMD congestion control and its convergence behavior , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[83]  Injong Rhee,et al.  Binary increase congestion control (BIC) for fast long-distance networks , 2004, IEEE INFOCOM 2004.

[84]  Wu-chang Fengy,et al.  BLUE: A New Class of Active Queue Management Algorithms , 1999 .

[85]  Leandros Tassiulas,et al.  Fair bandwidth sharing among adaptive and non-adaptive flows in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[86]  Richard Cole,et al.  Pricing network edges for heterogeneous selfish users , 2003, STOC '03.

[87]  Sergey Gorinsky,et al.  Feedback Modeling in Internet Congestion Control , 2003 .

[88]  Yang Richard Yang,et al.  General AIMD congestion control , 2000, Proceedings 2000 International Conference on Network Protocols.

[89]  Manish Jain,et al.  Ten fallacies and pitfalls on end-to-end available bandwidth estimation , 2004, IMC '04.