Mean FDE models for Internet congestion control under a many-flows regime

Congestion control algorithms used in the Internet are difficult to analyze or simulate on a large scale, i.e., when there are large numbers of nodes, links, and sources in a network. The reasons for this include the complexity of the actual implementation of the algorithm and the randomness introduced in the packet arrival and service processes due to many factors such as arrivals and departures of sources and uncontrollable short flows in the network. To make the analysis or simulation tractable, often deterministic fluid approximations of these algorithms are used. These approximations are in the form of either deterministic delay differential equations, or more generally, deterministic functional-differential equations (FDEs). In this paper, we ignore the complexity introduced by the window-based implementation of such algorithms and focus on the randomness in the network. We justify the use of deterministic models for proportionally-fair congestion controllers under a limiting regime where the number of flows in a network is large.

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

[2]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

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

[4]  T. Kurtz.  Solutions of ordinary differential equations as limits of pure jump markov processes , 1970, Journal of Applied Probability.

[5]  R. Srikant,et al.  An adaptive virtual queue (AVQ) algorithm for active queue management , 2004, IEEE/ACM Transactions on Networking.

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

[7]  J. Hale.  Theory of Functional Differential Equations , 1977 .

[8]  D. Lapsley,et al.  Random early marking for Internet congestion control , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[9]  Rayadurgam Srikant,et al.  Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management , 2001, SIGCOMM.

[10]  Harold J. Kushner,et al.  Stochastic Approximation Algorithms and Applications , 1997, Applications of Mathematics.

[11]  V. Lakshmikantham,et al.  Differential and integral inequalities : theory and applications , 1969 .

[12]  Sean P. Meyn,et al.  Bounds on the throughput of congestion controllers in the presence of feedback delay , 2003, TNET.

[13]  R. Srikant,et al.  A time-scale decomposition approach to adaptive explicit congestion notification (ECN) marking , 2002, IEEE Trans. Autom. Control..

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

[15]  Fernando Paganini,et al.  Scalable laws for stable network congestion control , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[16]  James A. Bucklew,et al.  Large Deviation Techniques in Decision, Simulation, and Estimation , 1990 .

[17]  R. Srikant,et al.  A time scale decomposition approach to adaptive ECN marking , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[19]  Ramesh Johari,et al.  End-to-end congestion control for the internet: delays and stability , 2001, TNET.

[20]  Richard Bellman,et al.  Asymptotic behavior of solutions of differential-difference equations , 1959 .

[21]  R. Srikant,et al.  Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management , 2001, SIGCOMM '01.

[22]  Glenn Vinnicombe,et al.  On the stability of end-to-end congestion control for the internet , 2001 .

[23]  Laurent Massoulié,et al.  Stability of distributed congestion control with heterogeneous feedback delays , 2002, IEEE Trans. Autom. Control..

[24]  Donald F. Towsley,et al.  On designing improved controllers for AQM routers supporting TCP flows , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[25]  Frank Kelly,et al.  Mathematical modeling of the Internet , 1999 .

[26]  Jean-Yves Le Boudec,et al.  Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[27]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[28]  G. Parmigiani.  Large Deviation Techniques in Decision, Simulation and Estimation , 1992 .