The Gradient Mechanism in a Communication Network
arXiv:0709.4371 · doi:10.1103/PhysRevE.77.036121
Abstract
We study the efficiency of the gradient mechanism of message transfer in a 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 time of single messages traveling on this lattice, plotted as a function of hub density, shows q-exponential behavior. At high hub densities, this distribution can be fitted well by a power law. 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 towards 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.
24 pages, 25 figures
References in corpus (33)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Lethality and centrality in protein networks
- The large-scale organization of metabolic networks
- Mean-field theory for scale-free random networks
- Efficient routing on complex networks
- Optimal network topologies for local search with congestion
- Random Geometric Graphs
- Communication in networks with hierarchical branching
- Improved routing strategies for Internet traffic delivery
- Single-vehicle data of highway traffic - a statistical analysis
- Critical load and congestion instabilities in scale-free networks
- Dynamical properties of model communication networks
- Scale-free Networks on Lattices
- Communication Bottlenecks in Scale-Free Networks
- Geography in a Scale-Free Network Model
- Transport optimization on complex networks
- Information Super-Diffusion on Structured Networks
- Performance of data networks with random links
- Congestion and decongestion in a communication network
- An efficient approach of controlling traffic congestion in scale-free networks
- Phase transition in a directed traffic flow network
- Random walk and trapping processes on scale-free networks
- A generative model for feedback networks
- Congestion-gradient driven transport on complex networks
- Itineration of the Internet over Nonequilibrium Stationary States in Tsallis Statistics
- Modeling Dynamics of Information Networks
- Navigating Networks with Limited Information
- Nonextensive statistical mechanics and complex scale-free networks
- Search and Congestion in Complex Networks
- Packet delay in models of data networks
- Cross-over behaviour in a communication network
- Message Transfer in a Communication Network