Skip to main content

Internet Traffic Congestion Modelling and Parallel Distributed Analysis

  • Conference paper
  • First Online:
Parallel and Distributed Processing and Applications (ISPA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2745))

  • 355 Accesses

Abstract

The level of complexity for modelling Internet traffic is equivalent to that of modelling highly non-linear natural systems. A network is essentially made up of a large number of queues. The effects of traffic volumes on service time and waiting time are discussed using a simplified form of the queuing theory. The key attributes that influence network traffic are identified. A numerical optimisation based approach is suggested to analyse the existing Internet architecture for future developments. The increase in the routing table sizes with the increase in the number of networked devices is discussed. A parallel-distributed routing approach is identified for devising a scalable routing architecture.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Tanenbaum A S, Computer Networks, 3rd edition, Prentice-Hall Inc, Upper Saddle River, New Jersey, 1996.

    Google Scholar 

  2. Kershenbaum A, Telecommunications Network Design Algorithms, McGraw-Hill computer science series, 1993.

    Google Scholar 

  3. Parente V R, Switch Back to Routers, http://www.bcr.com/bcrmag/08/98p33.html, Business Communications Review, Volume 28, Number 8, pp. 33–36, August 1998.

    Google Scholar 

  4. Kung H T, Traffic Management for High Speed Networks, Naval Studies Board, 1997

    Google Scholar 

  5. Yang Q, Reddy, Alpati V S, A Taxonomy for Congestion Control Algorithms in Packet Switching Networks, IEEE Network Magazine, Volume 9, Number 5, July/August 1995.

    Google Scholar 

  6. Verma D, Supporting Service Level Agreements on IP Networks, MacMillan Technical Publishing, 1999.

    Google Scholar 

  7. Lougheed K, Rekhter Y, RFC 1267: A Border Gateway Protocol 3 (BGP-3), IETF, Networking Group, 1991

    Google Scholar 

  8. Rekhter Y, Li T, RFC 1771: A Border Gateway Protocol 4 (BGP-4), IETF, Networking Group, March 1995

    Google Scholar 

  9. Foster I, Designing and Building Parallel Programs, Addison-Wesley, 1995, http://wwwunix.mcs.anl.gov/dbpp/, retrieved on April 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Isreb, M., Khan, A.I. (2003). Internet Traffic Congestion Modelling and Parallel Distributed Analysis. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-37619-4_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40523-8

  • Online ISBN: 978-3-540-37619-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics