Internet traffic congestion modelling and parallel distributed analysis

  • Authors:
  • M. Isreb;A. I. Khan

  • Affiliations:
  • School of Engineering, Monash University, Churchill, Victoria, Australia;School of Network Computing, Monash University, Frankston, Australia

  • Venue:
  • ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.