The Gradient Mechanism in a Communication Network

Physics – Physics and Society

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

24 pages, 25 figures

Scientific paper

10.1103/PhysRevE.77.036121

We study the efficiency of the gradient mechanism of message transfer in a $2-d$ 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The Gradient Mechanism in a Communication Network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Gradient Mechanism in a Communication Network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Gradient Mechanism in a Communication Network will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-481627

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.