Stability and performance analysis of networks supporting services with rate control-could the Internet be unstable?

We consider the stability and performance of a model for networks supporting services that adapt their transmission to the available bandwidth. Not unlike real networks, in our model connection arrivals are stochastic and have a random amount of data to send, so the number of connections in the system changes over time. In turn the bandwidth allocated to, or throughput achieved by, a given connection, may change during its lifetime due to feedback control mechanisms that react to congestion and thus implicitly to the number of ongoing connections. Ideally, for a fixed number of connections, such mechanisms reach an equilibrium typically characterized in terms of its 'fairness' in allocating bandwidth to users, e.g., max-min fair. We prove the stability of such networks when the offered load on each link does not exceed its capacity. We use simulation to investigate the performance, in terms of average connection delays, for various network topologies and fairness criteria. Finally we pose an architectural problem in TCP/IP's decoupling of the transport and network layer from the point of view of guaranteeing connection level stability, which we claim may explain congestion phenomena on the Internet.

[1]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[2]  Jon Crowcroft,et al.  Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP , 1998, CCRV.

[3]  Eli Gafni,et al.  Dynamic Control of Session Input Rates in Communication Networks , 1982, MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications.

[4]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[5]  Debasis Mitra,et al.  Adaptive Algorithms for Feedback-Based Flow Control in High Speed, Wide-Area ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[6]  F. Bonomi,et al.  The rate-based flow control framework for the available bit rate ATM service , 1995, IEEE Netw..

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

[8]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[9]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[10]  Anurag Kumar,et al.  A stochastic approximation approach for max-min fair adaptive rate control of ABR sessions with MCRs , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

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

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

[13]  Jean C. Walrand,et al.  Explicit rate flow control for ABR services in ATM networks , 2000, TNET.

[14]  Sean P. Meyn,et al.  Piecewise linear test functions for stability and instability of queueing networks , 1997, Queueing Syst. Theory Appl..

[15]  Eitan Altman,et al.  Discrete-Time Analysis of Adaptive Rate Control Mechanisms , 1993, Data Communication Networks and their Performance.

[16]  Tae-Jin Lee,et al.  A decentralized framework to achieve max-min fair bandwidth allocation for ATM networks , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).