Congestion-gradient driven transport on complex networks

Details Congestion-gradient driven transport on complex networks Congestion-gradient driven transport on complex networks

2006-03-31

arxiv.org/abs/cond-mat/0603861v1

Phys Rev E 74, 046114 (2006)

Physics

Condensed Matter

Statistical Mechanics

11 pages, 8 figures

Scientific paper

10.1103/PhysRevE.74.046114

We present a study of transport on complex networks with routing based on local information. Particles hop from one node of the network to another according to a set of routing rules with different degrees of congestion awareness, ranging from random diffusion to rigid congestion-gradient driven flow. Each node can be either source or destination for particles and all nodes have the same routing capacity, which are features of ad-hoc wireless networks. It is shown that the transport capacity increases when a small amount of congestion awareness is present in the routing rules, and that it then decreases as the routing rules become too rigid when the flow becomes strictly congestion-gradient driven. Therefore, an optimum value of the congestion awareness exists in the routing rules. It is also shown that, in the limit of a large number of nodes, networks using routing based on local information jam at any nonzero load. Finally, we study the correlation between congestion at node level and a betweenness centrality measure.

Affiliated with

Also associated with

No associations

Rating

Congestion-gradient driven transport on complex networks 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 Congestion-gradient driven transport on complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Congestion-gradient driven transport on complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-332304