Gradient mechanism in a communication network
- 24 March 2008
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 77 (3) , 036121
Abstract
We study the efficiency of the gradient mechanism of message transfer in a two-dimensional communication network of regular nodes and randomly distributed hubs. Each hub on the network is assigned some randomly chosen capacity and hubs with lower capacities are connected to the hubs with maximum capacity. The average travel times of single messages traveling on the lattice decrease rapidly as the number of hubs increase. The functional dependence of the average travel times on the hub density shows -exponential behavior with a power-law tail. We also study the relaxation behavior of the network when a large number of messages are created simultaneously at random locations and travel on the network toward their designated destinations. For this situation, in the absence of the gradient mechanism, the network can show congestion effects due to the formation of transport traps. We show that if hubs of high betweenness centrality are connected by the gradient mechanism, efficient decongestion can be achieved. The gradient mechanism is less prone to the formation of traps than other decongestion schemes. We also study the spatial configurations of transport traps and propose minimal strategies for their elimination.
Keywords
All Related Versions
This publication has 53 references indexed in Scilit:
- Traffic dynamics based on local routing protocol on a scale-free networkPhysical Review E, 2006
- Navigating networks with limited informationPhysical Review E, 2005
- Jamming is limited in scale-free systemsNature, 2004
- Packet transport along the shortest pathways in scale-free networksThe European Physical Journal B, 2004
- Information super-diffusion on structured networksPhysica A: Statistical Mechanics and its Applications, 2004
- Modeling Dynamics of Information NetworksPhysical Review Letters, 2003
- The Structure and Function of Complex NetworksSIAM Review, 2003
- PACKET TRANSPORT ON SCALE-FREE NETWORKSAdvances in Complex Systems, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Communication in Networks with Hierarchical BranchingPhysical Review Letters, 2001