Communication Bottlenecks in Scale-Free Networks

Details Communication Bottlenecks in Scale-Free Networks Communication Bottlenecks in Scale-Free Networks

2006-04-06

arxiv.org/abs/cs/0604023v1

Phys. Rev. E 75, 036105 (2007)

Computer Science

Networking and Internet Architecture

5 pages, 3 figures

Scientific paper

10.1103/PhysRevE.75.036105

We consider the effects of network topology on the optimality of packet routing quantified by $\gamma_c$, the rate of packet insertion beyond which congestion and queue growth occurs. The key result of this paper is to show that for any network, there exists an absolute upper bound, expressed in terms of vertex separators, for the scaling of $\gamma_c$ with network size $N$, irrespective of the routing algorithm used. We then derive an estimate to this upper bound for scale-free networks, and introduce a novel static routing protocol which is superior to shortest path routing under intense packet insertion rates.

Affiliated with

Also associated with

No associations

Rating

Communication Bottlenecks in Scale-Free 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 Communication Bottlenecks in Scale-Free Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communication Bottlenecks in Scale-Free Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-721133