Methodological frameworks for large-scale network analysis and design

This paper emphasizes the need for methodological frameworks for analysis and design of large scale networks which are independent of specific design innovations and their advocacy, with the aim of making networking a more systematic engineering discipline. Networking problems have largely confounded existing theory, and innovation based on intuition has dominated design. This paper will illustrate potential pitfalls of this practice. The general aim is to illustrate universal aspects of theoretical and methodological research that can be applied to network design and verification. The issues focused on will include the choice of models, including the relationship between flow and packet level descriptions, the need to account for uncertainty generated by modelling abstractions, and the challenges of dealing with network scale. The rigorous comparison of proposed schemes will be illustrated using various abstractions. While standard tools from robust control theory have been applied in this area, we will also illustrate how network-specific challenges can drive the development of new mathematics that expand their range of applicability, and how many enormous challenges remain.

[1]  Raj Jain,et al.  Congestion Control in Computer Networks: Trends and Issues , 1990, IEEE Netw..

[2]  R. Jain Congestion control in computer networks: issues and trends , 1990, IEEE Network.

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

[4]  Steven H. Low,et al.  Convergence of Asynchronous Optimization Flow Control , 1999, Broadband Communications.

[5]  Scott Shenker,et al.  A theoretical analysis of feedback flow control , 1990, SIGCOMM '90.

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

[7]  G. Dullerud,et al.  A Course in Robust Control Theory: A Convex Approach , 2005 .

[8]  A. Papachristodoulou,et al.  On the construction of Lyapunov functions using the sum of squares decomposition , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

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

[10]  Glenn Vinnicombe,et al.  Robust congestion control for the Internet , 2002 .

[11]  Glenn Vinnicombe,et al.  ON THE STABILITY OF NETWORKS OPERATING TCP-LIKE CONGESTION CONTROL , 2002 .

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

[13]  Fernando Paganini,et al.  Linear stability of TCP/RED and a scalable control , 2003, Comput. Networks.

[14]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[15]  A. Papachristodoulou Analysis of nonlinear time-delay systems using the sum of squares decomposition , 2004, Proceedings of the 2004 American Control Conference.

[16]  Jack K. Hale,et al.  Introduction to Functional Differential Equations , 1993, Applied Mathematical Sciences.

[17]  Vishal Misra,et al.  Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED , 2000, SIGCOMM.

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

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

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

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

[22]  Srinivasan Keshav A control-theoretic approach to flow control , 1991, SIGCOMM 1991.

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

[24]  Mischa Schwartz,et al.  ACM SIGCOMM computer communication review , 2001, CCRV.

[25]  Donald F. Towsley,et al.  A control theoretic analysis of RED , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[26]  Wenhua Dou,et al.  Design of a robust active queue management algorithm based on feedback compensation , 2003, SIGCOMM '03.

[27]  Steven H. Low,et al.  Stabilized Vegas , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[28]  Pablo A. Parrilo,et al.  Introducing SOSTOOLS: a general purpose sum of squares programming solver , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[29]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

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

[31]  A. Rantzer,et al.  System analysis via integral quadratic constraints , 1997, IEEE Trans. Autom. Control..

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

[33]  John T. Wen,et al.  Robustness of network flow control against disturbances and time-delay , 2004, Syst. Control. Lett..