Randomized algorithms for stability and robustness analysis of high-speed communication networks

This paper initiates a study toward developing and applying randomized algorithms for stability of high-speed communication networks. The focus is on congestion and delay-based flow controllers for sources, which are "utility maximizers" for individual users. First, we introduce a nonlinear algorithm for such source flow controllers, which uses as feedback aggregate congestion and delay information from bottleneck nodes of the network, and depends on a number of parameters, among which are link capacities, user preference for utility, and pricing. We then linearize this nonlinear model around its unique equilibrium point and perform a robustness analysis for a special symmetric case with a single bottleneck node. The "symmetry" here captures the scenario when certain utility and pricing parameters are the same across all active users, for which we derive closed-form necessary and sufficient conditions for stability and robustness under parameter variations. In addition, the ranges of values for the utility and pricing parameters for which stability is guaranteed are computed exactly. These results also admit counterparts for the case when the pricing parameters vary across users, but the utility parameter values are still the same. In the general nonsymmetric case, when closed-form derivation is not possible, we construct specific randomized algorithms which provide a probabilistic estimate of the local stability of the network. In particular, we use Monte Carlo as well as quasi-Monte Carlo techniques for the linearized model. The results obtained provide a complete analysis of congestion control algorithms for internet style networks with a single bottleneck node as well as for networks with general random topologies.

[1]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[2]  Tansu Alpcan,et al.  A utility-based congestion control scheme for Internet-style networks with delay , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  L. Devroye Non-Uniform Random Variate Generation , 1986 .

[4]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[5]  Joseph F. Traub,et al.  Complexity and information , 1999, Lezioni Lincee.

[6]  T. Basar,et al.  Global stability analysis of an end-to-end congestion control scheme for general topology networks with delay , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[7]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[8]  H. Chernoff A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[9]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[10]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[11]  Weibo Gong,et al.  Guest editorial: special issue of the IEEE transactions on automatic control on systems and control methods for communication networks , 2002, IEEE Transactions on Automatic Control.

[12]  Mathukumalli Vidyasagar,et al.  A Theory of Learning and Generalization: With Applications to Neural Networks and Control Systems , 1997 .

[13]  Jean C. Walrand,et al.  Analysis and comparison of TCP Reno and Vegas , 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).

[14]  Rayadurgam Srikant,et al.  Controlling the Internet: a survey and some new results , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[15]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

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

[17]  R. Srikant,et al.  Global stability of congestion controllers for the Internet , 2003, IEEE Trans. Autom. Control..

[18]  R. Srikant,et al.  Revenue-maximizing pricing and capacity expansion in a many-users regime , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[20]  Richard J. La,et al.  Charge-sensitive TCP and rate control in the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[21]  John T. Wen,et al.  A unifying passivity framework for network flow control , 2004, IEEE Transactions on Automatic Control.

[22]  Giuseppe Carlo Calafiore,et al.  Randomized algorithms for probabilistic robustness with real and complex structured uncertainty , 2000, IEEE Trans. Autom. Control..

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

[24]  Tansu Alpcan,et al.  Variable rate model with QoS guarantees for real-time Internet traffic , 2001, SPIE Optics East.

[25]  R. Tempo,et al.  Randomized Algorithms for Analysis and Control of Uncertain Systems , 2004 .

[26]  Linda Bushnell,et al.  Networks and control [Guest Editorial] , 2001 .

[27]  Mathukumalli Vidyasagar,et al.  Statistical learning theory and randomized algorithms for control , 1998 .

[28]  Donald E. Knuth The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .

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

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

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

[32]  P. Hellekalek Good random number generators are (not so) easy to find , 1998 .

[33]  Roberto Tempo,et al.  Randomized algorithms for analysis and control of uncertain systems: An overview , 2001 .

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

[35]  Eitan Altman,et al.  Multiuser rate-based flow control , 1998, IEEE Trans. Commun..

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

[37]  Bruce W. Schmeiser,et al.  Random variate generation , 1981, WSC '81.