Skip to main content
SpringerLink
Log in

Mathematical Modelling of the Internet

  • Chapter
Mathematics Unlimited — 2001 and Beyond

Abstract

Modern communication networks are able to respond to randomly fluctuating demands and failures by adapting rates, by rerouting traffic and by reallocating resources. They are able to do this so well that, in many respects, large-scale networks appear as coherent, self-regulating systems. The design and control of such networks present challenges of a mathematical, engineering and economic nature. This paper outlines how mathematical models are being used to address one current set of issues concerning the stability and fairness of rate control algorithms for the Internet.

This is an extended version of a paper from the Proceedings of the Fourth International Congress on Industrial and Applied Mathematics (July 1999, Edinburgh, Scotland, editors J. M. Ball and J. C. R. Hunt), by kind permisson of Oxford University Press.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Beckmann, C. B. McGuire and C. B. Winsten (1956) Studies in the Economics of Transportation. Cowles Commission Monograph, Yale University Press

    Google Scholar 

  2. D. Bertsekas and R. Gallager (1987) Data Networks. Prentice-Hall

    MATH  Google Scholar 

  3. : D. Braess (1968) Über ein Paradoxon aus der Verkehrsplanung. Unternehmenforschung 12, 258–268

    MATH  Google Scholar 

  4. J. Crowcroft and P. Oechslin (1998) Differentiated end-to-end Internet services using a weighted proportionally fair sharing TCP. ACM Computer Communications Review 28, 53–67

    Article  Google Scholar 

  5. O. Diekmann, S. A. van Gils, S. M. Verduyn Lunel and H.-O. Walther (1995) Delay Equations: Functional-, Complex-, and Nonlinear Analysis. Springer, New York

    Book  MATH  Google Scholar 

  6. A. Ephremides and B. Hajek (1998) Information theory and communication networks: an unconsummated union. IEEE Transactions on Information Theory 44, 2384–2415

    Article  MATH  MathSciNet  Google Scholar 

  7. A. K. Erlang (1925) A proof of Maxwell’s law, the principal proposition in the kinetic theory of gases. In: E. Brockmeyer, H. L Haistrom, H. L. and A. Jensen (eds.) The Life and Works of A. K. Erlang. Academy of Technical Sciences, Copenhagen 1948, pp. 222–226

    Google Scholar 

  8. K. W. Fendick and M. A. Rodrigues (1994) Asymptotic analysis of adaptive rate control for diverse sources with delayed feedback. IEEE Transactions on Information Theory 40, 2008–2025

    Article  MATH  Google Scholar 

  9. S. Floyd (1994) TCP and Explicit Congestion Notification. ACM Computer Communication Review 24, 10–23, http://www.aciri.org/floyd/ecn.html

    Article  Google Scholar 

  10. S. Floyd and V. Jacobson (1992) On traffic phase effects in packet-switched gateways. Internetworking: Research and Experience 3, 115–156, http://www.aciri.org/floyd/papers.html/

    Google Scholar 

  11. S. Floyd and V. Jacobson (1993) Random Early Detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking 1, 397–413, ftp://ftp.ee.lbl.gov/papers/early.pdf

    Article  Google Scholar 

  12. S.J. Golestani and S. Bhattacharyya (1998) A class of end-to-end congestion control algorithms for the Internet. In: Proc. Sixth International Conference on Network Protocols, http://www.bell-labs.com/user/golestani/

    Book  Google Scholar 

  13. R. J. Gibbens and F. P. Kelly (1999) Resource pricing and congestion control. Automatica 35, 1969–1985www.statslab.cam.ac.uk/~frank/evol.html

    Article  MATH  MathSciNet  Google Scholar 

  14. P. Hurley, J. Y. Le Boudec and P. Thiran (1999) A note on the fairness of additive increase and multiplicative decrease. In: Proc. 16th International TeletrafficCongress Edinburgh, P. Key and D. Smith (eds). Elsevier, Amsterdam, pp. 467–478

    Google Scholar 

  15. V. Jacobson (1988) Congestion avoidance and control. In: Proc. ACM SIGCOMM ’88 pp. 314–329. A revised version, joint with M.J. Karels, is available via ftp://ftp.ee.lbl.g0v/papers/c0ngav0id.ps.Z

    Google Scholar 

  16. R. Johari and D. K. H. Tan (2000) End-to-end congestion control for the Internet: delays and stability

    Google Scholar 

  17. F.P. Kelly (1991) Network routing. Phil. Trans. R. Soc. Lond. A 337, 343–367, www.statslab.cam.ac.uk/~frank/

    Article  MATH  MathSciNet  Google Scholar 

  18. F. P. Kelly (2000) Models for a self-managed Internet. Phil. Trans. R. Soc. Lond. A 358

    Google Scholar 

  19. F. P. Kelly, A. K. Maulloo, and D. K. H. Tan (1998) Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49, 237–252, www.statslab.cam.ac.uk/~frank/rate.html

    Article  MATH  Google Scholar 

  20. P. Key and D. McAuley (1999) Differential QoS and pricing in networks: where flow control meets game theory. IEE Proc Software 146, 39–43

    Article  Google Scholar 

  21. P. Key, D. McAuley, P. Barham, and K. Laevens: Congestion pricing for congestion avoidance. Microsoft Research report MSR-TR-99–15http://research.microsoft.com/pubs/

  22. P. Key and L. Massoulié (1999) User policies in a network implementing congestion pricing. Workshop on Internet Service Quality Economics, MIT 1999, http://research.microsoft.com/research/network/disgame.htm

    Google Scholar 

  23. S. Kunniyar and R. Srikant (2000) End-to-end congestion control schemes: utility functions, random losses and ECN marks. Infocom

    Google Scholar 

  24. J. F. Kurose and K. W. Ross (2000) Computer Networking: a Top-Down Approach Featuring the Internet. Addison-Wesley

    Google Scholar 

  25. S. H. Low and D. E. Lapsley (1999) Optimization flow control, I: basic algorithm and convergence. IEEE/ACM Transactions on Networking 7, 861–874, http://www.ee.mu.oz.au/staff/slow/

    Article  Google Scholar 

  26. M. Mathis, J. Semke, J. Mahdavi, and T. Ott (1997) The macroscopic behaviour of the TCP congestion avoidance algorithm. Computer Communication Review 27, 67–82

    Article  Google Scholar 

  27. J. C. Maxwell (1860) Illustrations of the dynamical theory of gases. Philosophical Magazine 20, 21–37

    Google Scholar 

  28. D. Mitra (ed.) (1995) Advances in the fundamentals of networking. IEEE J. Selected Areas in Commun. 13, 933–1362

    Google Scholar 

  29. J. Rawls (1971) A Theory of Justice. Harvard University Press

    Google Scholar 

  30. S. Shenker (1995) Fundamental design issues for the future Internet. IEEE J. Selected Areas in Commun. 13, 1176–1188

    Article  Google Scholar 

  31. D.J. Songhurst (ed.) (1999) Charging Communication Networks: from Theory to Practice. Elsevier, Amsterdam

    Google Scholar 

  32. W. Thomson and P. G. Tait (1879) Treatise on Natural Philosophy. Cambridge

    MATH  Google Scholar 

  33. H. R. Varian (1992) Microeconomic Analysis, 3rd edn. Norton, New York

    Google Scholar 

  34. J. G. Wardrop (1952) Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers 1, 325–378

    Article  Google Scholar 

  35. W. Willinger and V. Paxson (1998) Where Mathematics meets the Internet. Notices of the American Mathematical Society 45, 961–970, www.ams.org/notices/

    MATH  MathSciNet  Google Scholar 

  36. D. Wischik (1999) How to mark fairly. Workshop on Internet Service Quality Economics, MIT 1999

    Google Scholar 

Download references

Authors
  1. Frank Kelly
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Parallel Computers, Royal Institute of Technology (KTH), Lindstedtsvägen 25, 10044, Stockholm, Sweden

    Björn Engquist

  2. Department of Mathematics, University of California at Los Angeles, 3148 Murphy Hall, 7619A MSB, 90095-1555, Los Angeles, CA, USA

    Björn Engquist

  3. Department of Mathematics, Harvard University, 02138-2901, Cambridge, MA, USA

    Wilfried Schmid

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kelly, F. (2001). Mathematical Modelling of the Internet. In: Engquist, B., Schmid, W. (eds) Mathematics Unlimited — 2001 and Beyond. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56478-9_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-56478-9_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63114-6

  • Online ISBN: 978-3-642-56478-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation