Models for a self–managed Internet

This paper uses a variety of mathematical models to explore some of the consequences of rapidly growing communications capacity for the evolution of the Internet. It argues that queueing delays may become small in comparison with propagation delays, and that differentiation between traffic classes within the network may become redundant. Instead, a simple packet network may be able to support an arbitrarily differentiated and constantly evolving set of services, by conveying information on incipient congestion to intelligent end–nodes, which themselves determine what should be their demands on the packet network.

[1]  P. Key,et al.  User Policies in a Network Implementing Congestion Pricing , 1999 .

[2]  Stan Zachary.  Dynamics of large uncontrolled loss networks , 2000, Journal of Applied Probability.

[3]  Damon Wischik,et al.  How to Mark Fairly , 1999 .

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

[5]  F. Kelly.  Charging and Rate Control for Elastic Traac , 1997 .

[6]  J. Harrison,et al.  Brownian motion and stochastic flow systems , 1986 .

[7]  S. Jamaloddin Golestani,et al.  A class of end-to-end congestion control algorithms for the Internet , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).

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

[9]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[10]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

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

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

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

[14]  D. J. Songhurst.  Charging communication networks: from theory to practice , 1999 .

[15]  George D. Stamoulis,et al.  Application of the many sources asymptotic and effective bandwidths to traffic engineering , 1999, Telecommun. Syst..

[16]  Alan Weiss,et al.  Analysis of a Rate-Based Feedback Control Strategy for Long Haul Data Transport , 1992, Perform. Evaluation.

[17]  A. Udaya Shankar,et al.  Dynamical behavior of rate-based flow control mechanisms , 1990, CCRV.

[18]  Frank Kelly,et al.  Mathematical Modelling of the Internet , 2001 .

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

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

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

[22]  Damon Wischik.  The Output of a Switch, Or, Eeective Bandwidths for Networks , 1999 .

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

[24]  Walter Willinger,et al.  A Bibliographical Guide to Self-Similar Traffic and Performance Modeling for Modern High-Speed Netwo , 1996 .

[25]  Ilkka Norros,et al.  A storage model with self-similar input , 1994, Queueing Syst. Theory Appl..

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

[27]  Jeffrey K. MacKie-Mason,et al.  Pricing the Internet , 1995 .

[28]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[29]  Steven Low,et al.  Random early marking: an optimisation approach to Internet congestion control , 1999, IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243).

[30]  B. Briscoe,et al.  Lightweight policing and charging for packet networks , 2000, 2000 IEEE Third Conference on Open Architectures and Network Programming. Proceedings (Cat. No.00EX401).

[31]  Nemo Semret,et al.  Spot and Derivative Markets in Admission Control , 1999 .

[32]  K. K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer , 1988, SIGCOMM '88.

[33]  Peter Key,et al.  Congestion Pricing for Congestion Avoidance , 1999 .

[34]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[35]  Richard J. Gibbens,et al.  Distributed connection acceptance control for a connectionless network , 1999 .

[36]  Damon Wischik.  The output of a switch, or, effective bandwidths for networks , 1999, Queueing Syst. Theory Appl..

[37]  Peter Key,et al.  Service Differentiation: Congestion Pricing, Brokers and Bandwidth Futures , 1999 .

[38]  Derek McAuley,et al.  Differential QoS and pricing in networks: Where flow control meets game theory , 1999, IEE Proc. Softw..