Efficient routing on complex networks
Top Cited Papers
- 7 April 2006
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 73 (4), 046108
- https://doi.org/10.1103/physreve.73.046108
Abstract
We propose a routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called efficient path, which considers the possible congestion in the nodes along actual paths. Since the nodes with the largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our strategy, can be redistributing traffic load in central nodes to other noncentral nodes. Simulation results indicate that the network capability in processing traffic is improved more than 10 times by optimizing the efficient path, which is in good agreement with the analysis.Keywords
All Related Versions
This publication has 37 references indexed in Scilit:
- Complex networks: Structure and dynamicsPhysics Reports, 2006
- Evolution and Structure of the InternetPublished by Cambridge University Press (CUP) ,2004
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Communication in Networks with Hierarchical BranchingPhysical Review Letters, 2001
- Emergence of Scaling in Random NetworksScience, 1999
- Collective dynamics of ‘small-world’ networksNature, 1998
- Self-similarity in World Wide Web traffic: evidence and possible causesIEEE/ACM Transactions on Networking, 1997
- Proof of a fundamental result in self-similar traffic modelingACM SIGCOMM Computer Communication Review, 1997
- On the self-similar nature of Ethernet trafficACM SIGCOMM Computer Communication Review, 1993
- Polymorphic-torus networkIEEE Transactions on Computers, 1989