Fluid models of integrated traffic and multipath routing

In this paper we consider a stochastic model describing the varying number of flows in a network. This model features flows of two types, namely file transfers (with fixed volume) and streaming traffic (with fixed duration), and extends the model of Key, Massoulié, Bain and Kelly [27] by allowing more general bandwidth allocation criteria. We analyse the dynamics of the system under a fluid scaling, and show Lyapunov stability of the fluid limits under a natural stability condition. We provide natural interpretations of the fixed points of these fluid limits.We then compare the fluid dynamics of file transfers under (i) balanced multipath routing and (ii) parallel, uncoordinated routing. We show that for identical traffic demands, parallel uncoordinated routing can be unstable while balanced multipath routing is stable.Finally, we identify multi-dimensional Ornstein-Uhlenbeck processes as second-order approximations to the first-order fluid limit dynamics.

[1]  Donald F. Towsley,et al.  Fixed point approximations for TCP behavior in an AQM network , 2001, SIGMETRICS '01.

[2]  R. Srikant,et al.  Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet , 2006, IEEE/ACM Transactions on Networking.

[3]  Laurent Massoulié,et al.  Fair internet traffic integration: network flow models and analysis , 2004, Ann. des Télécommunications.

[4]  宮沢 政清,et al.  P. Bremaud 著, Markov Chains, (Gibbs fields, Monte Carlo simulation and Queues), Springer-Verlag, 1999年 , 2000 .

[5]  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).

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

[7]  T. Kurtz.  Strong approximation theorems for density dependent Markov chains , 1978 .

[8]  Alexandre Proutière,et al.  Modeling integration of streaming and data traffic , 2004, Perform. Evaluation.

[9]  Dai Zhi-gan.  Stream Control Transmission Protocol , 2001 .

[10]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

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

[12]  Matthew Roughan,et al.  Network performance for TCP networks Part I: Persistent sources , 2001 .

[13]  Antonis Dimakis,et al.  Providing bandwidth guarantees over a best-effort network: call-admission and pricing , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Thomas Bonald,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[15]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[16]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[17]  Pirkko Kuusela,et al.  Modeling RED with Idealized TCP Sources , 2001 .

[18]  D. Vere-Jones.  Markov Chains , 1972, Nature.

[19]  SemkeJeffrey,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997 .

[20]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2003, TNET.

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

[22]  Philippe Robert,et al.  Integration of streaming services and TCP data transmission in the Internet , 2005, Perform. Evaluation.

[23]  G. Raina,et al.  Buffer sizes for large multiplexers: TCP queueing theory and instability analysis , 2005, Next Generation Internet Networks, 2005.

[24]  Gustavo de Veciana,et al.  Stability and performance analysis of networks supporting elastic services , 2001, TNET.

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

[26]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[27]  Scott Shenker,et al.  Endpoint admission control: architectural issues and performance , 2000, SIGCOMM.

[28]  R. J. Williams,et al.  Fluid model for a network operating under a fair bandwidth-sharing policy , 2004, math/0407057.

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

[30]  Eitan Altman,et al.  TCP network calculus: the case of large delay-bandwidth product , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[31]  Richard J. Gibbens,et al.  Fixed-Point Models for the End-to-End Performance Analysis of IP Networks , 2000 .

[32]  Stan Zachary,et al.  Distributed admission control , 2000, IEEE Journal on Selected Areas in Communications.

[33]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[34]  Alexandre Proutière,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[35]  Thomas Voice,et al.  Stability of end-to-end algorithms for joint routing and rate control , 2005, CCRV.

[36]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications) , 2004 .

[37]  Donald F. Towsley,et al.  Modeling TCP Reno performance: a simple model and its empirical validation , 2000, TNET.

[38]  Michel Mandjes,et al.  Performance evaluation of strategies for integration of elastic and stream traffic , 1999 .

[39]  Peter B. Key,et al.  Modelling the performance of distributed admission control for adaptive applications , 2001, PERV.

[40]  Derong Liu.  The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.

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

[42]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

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

[44]  Alexandre Proutière,et al.  On performance bounds for the integration of elastic and adaptive streaming flows , 2004, SIGMETRICS '04/Performance '04.