Optimal routing on complex networks

Details Optimal routing on complex networks Optimal routing on complex networks

2006-07-01

arxiv.org/abs/cond-mat/0607017v2

Phys Rev E 74, 046106 (2006)

Physics

Condensed Matter

Statistical Mechanics

4 pages, 5 figures

Scientific paper

10.1103/PhysRevE.74.046106

We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to queuing overload. By using the resulting routing table, a network can sustain significantly higher traffic without jamming than in the case of traditional shortest path routing.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-451290