Citation

Zhao L, Cupertino TH, Park K, Lai YC, Jin X. Chaos 2007; 17(4): 043103.

Affiliation

Institute of Mathematics and Computer Science, University of São Paulo, São Carlos, SP, 13560-970, Brazil.

Copyright

(Copyright © 2007, American Institute of Physics)

DOI

10.1063/1.2790367

PMID

18163767

Abstract

To design complex networks to minimize traffic congestion, it is necessary to understand how traffic flow depends on network structure. We study data packet flow on complex networks, where the packet delivery capacity of each node is not fixed. The optimal configuration of capacities to minimize traffic congestion is derived and the critical packet generating rate is determined, below which the network is at a free flow state but above which congestion occurs. Our analysis reveals a direct relation between network topology and traffic flow. Optimal network structure, free of traffic congestion, should have two features: uniform distribution of load over all nodes and small network diameter. This finding is confirmed by numerical simulations. Our analysis also makes it possible to theoretically compare the congestion conditions for different types of complex networks. In particular, we find that network with low critical generating rate is more susceptible to congestion. The comparison has been made on the following complex-network topologies: random, scale-free, and regular.

Language: en