Homogeneous and Heterogeneous Traffic of Data Packets on Complex Networks: The Traffic Congestion Phenomenon

We study the congestion phenomenon in a mathematical model of the data packets traffic in transmission networks as a function of the topology and of the load of the network. Two types of traffic are considered: homogeneous and heterogeneous traffic. The congestion phenomenon is studied in stationary conditions through the behaviour of two quantities: the mean travel time of a packet and the mean number of packets that have not reached their destination and are traveling in the network. We define a transformation that maps a network having the small world property (Inet 3037 in our numerical experiments) into a (modified) lattice network that has the same number of nodes. This map changes the capacity of the branches of the graphs representing the networks and can be regarded as an “interpolation” between the two classes of networks. Using this transformation we compare the behaviour of Inet 3037 to the behaviour of a modified rectangular lattice and we study the behaviour of the interpolating networks. This study suggests how to change the network topology and the branch capacities in order to alleviate the congestion phenomenon. In the website: http://www.ceri.uniroma1.it/ceri/zirilli/w6 some auxiliary material including animations and stereo?graphic scenes that helps the understanding of this paper is shown.

[1]  Christos H. Papadimitriou,et al.  Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet , 2002, ICALP.

[2]  Reginald D. Smith,et al.  Data Traffic Dynamics and Saturation on a Single Link , 2008, 0802.3554.

[3]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[4]  Haruko Okamura,et al.  Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.

[5]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[6]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[7]  C. J. Adkins.  Equilibrium thermodynamics: Introduction , 1983 .

[8]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[9]  Arnold O. Allen,et al.  Probability, statistics and queueing theory - with computer science applications (2. ed.) , 1981, Int. CMG Conference.

[10]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Ljupco Kocarev,et al.  Complex Dynamics in Communication Networks , 2005 .

[12]  Alfonso Farina,et al.  Probabilistic Analysis of Failures in Power Transmission Networks and Phase Transitions: Study Case of a High-Voltage Power Transmission Network , 2008 .

[13]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[14]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[15]  C. J. Adkins.  Equilibrium thermodynamics: Frontmatter , 1983 .

[16]  Linyuan Lu,et al.  Random evolution in massive graphs , 2001 .

[17]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[18]  Ziyou Gao,et al.  Dynamical properties of transportation on complex networks , 2008 .

[19]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[20]  Sugih Jamin,et al.  Inet-3.0: Internet Topology Generator , 2002 .

[21]  Stefano Leonardi,et al.  On-line Network Routing , 1996, Online Algorithms.