Models for a self-managed Internet

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 358, Issue 1773, 2000, Pages 2335-2348

  Kelly, Frank P ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Explicit congestion notification; Fairness; Queues; Shadow price; Short transfers; Stability

Indexed keywords

EID: 0347308103     PISSN: 1364503X     EISSN: None     Source Type: Journal    
DOI: 10.1098/rsta.2000.0651     Document Type: Article

References (39)

1. Bolot, J.-C. & Shankar, A. U. 1990 Dynamic behavior of rate-based flow control mechanisms. ACM Comp. Commun. Rev. 20, 35-49.
2. Bonomi, F., Mitra, D. & Seery, J. B. 1995 Adaptive algorithms for feedback-based flow control in high-speed wide-area networks. IEEE J. Selected Areas Commun. 13, 1267-1283.
3. Briscoe, B., Rizzo, M., Tassel, J. & Damianakis, K. 2000 Lightweight policing and charging for packet networks. In 3rd IEEE Conf. on Open Architectures and Network Programming. (See http://www.labs.bt.com/people/briscorj/.)
4. Courcoubetis, C., Siris, V. A. & Stamoulis, G. D. 1999 Application of the many sources asymptotic and effective bandwidths to traffic engineering. Telecom. Systems 12, 167-191.
5. Crowcroft, J. & Oechslin, P. 1998 Differentiated end-to-end Internet services using a weighted proportionally fair sharing TCP. ACM Comp. Commun. Rev. 28, 53-67.
6. Fendick, K. W., Rodrigues, M. A. & Weiss, A. 1992 Analysis of a rate-based feedback control strategy for long-haul data transport. Performance Eval. 16, 67-84.
7. Floyd, S. 1994 TCP and explicit congestion notification. ACM Comp. Commun. Rev. 24, 10-23. (See http://www.aciri.org/floyd/ecn.html.)
8. Floyd, S. & Jacobson, V. 1993 Random Early Detection gateways for congestion avoidance. IEEE/ACM Trans. Networking 1, 397-413. (See ftp://ftp.ee.lbl.gov/papers/early.pdf.)
9. Gibbens, R. J. & Kelly, F. P. 1999a Resource pricing and the evolution of congestion control. Automatica 35 1969-1985. (See http://www.statslab.cam.ac.uk/-frank/evol.html.)
10. Gibbens, R. J. & Kelly, F. P. 1999b Distributed connection acceptance control for a connection-less network. In Proc. 16th Int. Teletraffic Congr. (ed. P. B. Key & D. G. Smith), pp. 941-952. Elsevier. (See http://www.statslab.cam.ac.uk/∼frank/dcac.html.)
11. Gibbens, R. J. & Teh, Y. C. 1999 Critical time and space scales for statistical multiplexing in multiservice networks. In Proc. 16th Int. Teletraffic Congr. (ed. P. B. Key & D. G. Smith), pp. 87-96. Elsevier.
12. Golestani, S. J. & Bhattacharyya, S. 1998 A class of end-to-end congestion control algorithms for the Internet. In Proc. 6th Int. Conf. on Network Protocols. (See http://www.bell-labs.com/user/golestani/.)
13. Hale, J. 1977 Theory of functional differential equations. Springer.
14. Harrison, J. M. 1985 Brownian motion and stochastic flow systems. New York: Krieger.
15. International Telecommunications Union 1996 Recommendation 1371: traffic control and congestion control in B-ISDN. Geneva.
16. Jacobson, V. 1988 Congestion avoidance and control. In Proc. ACM SIGCOMM '88, pp. 314-329. (See ftp://ftp.ee.lbl.gov/papers/congavoid.ps.Z.)
17. Johari, R. & Tan, D. K. H. 2000 End-to-end congestion control for the Internet: delays and stability. Statistical Laboratory Research Report 2000-2, University of Cambridge.
18. Kelly, F. P. 1997 Charging and rate control for elastic traffic. Eur. Trans. Telecom. 8, 33-37. (See http://www.statslab.cam.ac.uk/∼frank.)
19. Kelly, F. P. 2000 Mathematical modelling of the Internet. In Proc. 4th Int. Congr. on Industrial and Applied Mathematics.
20. Kelly, F. P., Maulloo, A. K. & Tan, D. K. H. 1998 Rate control in communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49, 237-252.
21. Kelly, F. P., Key, P. B. & Zachary, S. 2000 Distributed admission control. IEEE J. Selected Areas Commun. 18.
22. Key, P. 1999 Service differentiation: congestion pricing, brokers and bandwidth futures. In Proc. 9th Int. Workshop on Network and Operating Systems Support for Digital Audio and Video. (See http://www.nossdav.org.)
23. Key, P. & McAuley, D. 1999 Differential QoS and pricing in networks: where flow control meets game theory. IEE Proc. Software 146, 39-43.
24. Key, P. & Massoulié, L. 1999 User policies in a network implementing congestion pricing. In Workshop on Internet Service Quality Economics, MIT 1999. (See http://research. microsoft.com/research/network/disgame.htm.)
25. Key, P., McAuley, D., Barham, P. & Laevens, K. 1999 Congestion pricing for congestion avoidance. Microsoft Research report MSR-TR-99-15. (See http://research.microsoft.com/pubs/.)
26. Kleinrock, L. 1964 Communication nets: stochastic message flow and delay. New York: McGraw-Hill.
27. Lapsley, D. E. & Low, S. H. 1999 Random Early Marking: an optimisation approach to Internet congestion control. In Proc. IEEE ICON '99, Brisbane, Australia.
28. Low, S. H. & Lapsley, D. E. 1999 Optimization flow control. I. Basic algorithm and convergence. IEEE/ACM Trans. Networking. (See http://www.ee.mu.oz.au/staff/slow/.)
29. MacKie-Mason, J. K. & Varian, H. R. 1994 Pricing the Internet. In Public access to the Internet (ed. B. Kahin & J. Keller). Englewood Cliffs, NJ: Prentice-Hall.
30. Norros, I. 1994 A storage model with self-similar input. Queueing Systems 16, 387-396.
31. Ramakrishnan, K. K. & Jain, R. 1990 A binary feedback scheme for congestion avoidance in computer networks. ACM Trans. Comp. Systems 8, 158-181.
32. Semret, N. & Lazar, A. A. 1999 Spot and derivative markets in admission control. In Proc. 16th Int. Teletraffic Congr. (ed. P. B. Key & D. G. Smith), pp. 757-766. Elsevier.
33. Songhurst, D. J. (ed) 1999 Charging communication networks: from theory to practice. Elsevier.
34. Tan, D. K. H. 1999 Mathematical models of rate control for communication networks. PhD thesis, University of Cambridge. (See http://www.statslab.cam.ac.uk/∼dkht2/phd.html.)
35. Turányi, Z. R. & Westberg, L. 1999 Load control: lightweight provisioning of Internet resources. (See http://www.ericsson.co.hu/ethzrt/.)
36. Willinger, W., Taqqu, M. S. & Erramilli, A. 1996 A bibliographical guide to self-similar traffic and performance modeling for modern high-speed networks. In Stochastic networks: theory and applications (ed. F. P. Kelly, S. Zachary & I. Ziedins), pp. 339-366. Royal Statistical Society Lecture Notes Series, vol. 4. Oxford University Press.
37. Wischik, D. 1999a The output of a switch, or, effective bandwidths for networks. Queueing Systems 32, 383-396. (See http://www.statslab.cam.ac.uk/∼djw1005.)
38. Wischik, D. 1999b How to mark fairly. In Workshop on Internet Service Quality Economics, MIT 1999.
39. Zachary, S. 2000 Dynamics of large uncontrolled loss networks. J. Appl. Prob. 37. (See http://www.ma.hw.ac.uk/∼stan/papers.) (In the press.)