Structural bottlenecks for communication in networks

Sameet Sreenivasan, Reuven Cohen, Eduardo López, Zoltán Toroczkai, H. Eugene Stanley

Research output: Contribution to journalArticlepeer-review

126 Scopus citations

Abstract

We consider the effect of network topology on the optimality of packet routing which is quantified by γc, the rate of packet insertion beyond which congestion and queue growth occurs. We show that for any network, there exists an absolute upper bound, expressed in terms of vertex separators, for the scaling of γc with network size N, irrespective of the static routing protocol used. We then derive an estimate to this upper bound for scale-free networks and introduce a static routing protocol, the "hub avoidance protocol," which, for large packet insertion rates, is superior to the shortest path routing protocol.

Original languageEnglish
Article number036105
JournalPhysical Review E
Volume75
Issue number3
DOIs
StatePublished - 5 Mar 2007
Externally publishedYes

Fingerprint

Dive into the research topics of 'Structural bottlenecks for communication in networks'. Together they form a unique fingerprint.

Cite this