Scaling of Fluctuations in Traffic on Complex Networks
- 2 June 2006
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 96 (21) , 218702
- https://doi.org/10.1103/physrevlett.96.218702
Abstract
We study the scaling of fluctuations with the mean of traffic in complex networks using a model where the arrival and departure of “packets” follow exponential distributions, and the processing capability of nodes is either unlimited or finite. The model presents a wide variety of exponents between and 1 for this scaling, revealing their dependence on the few parameters considered, and questioning the existence of universality classes. We also report the experimental scaling of the fluctuations in the Internet for the Abilene backbone network. We found scaling exponents between 0.71 and 0.86 that do not fit with the exponent reported in the literature.
Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Optimization of random searches on regular latticesPhysical Review E, 2005
- Entangled Networks, Synchronization, and Optimal Network TopologyPhysical Review Letters, 2005
- Load distribution in weighted complex networksPhysical Review E, 2005
- Congestion and decongestion in a communication networkPhysical Review E, 2005
- Onset of traffic congestion in complex networksPhysical Review E, 2005
- Effect of Congestion Costs on Shortest Paths Through Complex NetworksPhysical Review Letters, 2005
- Improved routing strategies for Internet traffic deliveryPhysical Review E, 2004
- Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuationsPhysical Review E, 2004
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Optimal Network Topologies for Local Search with CongestionPhysical Review Letters, 2002