Optimal Routing Strategy Based on Specifying Shortest Path
Keywords:complex networks, weighted networks, routing strategy, betweenness
How to enhance the transfer capacity of weighted networks is of great
importance. The network transfer capacity, which is often evaluated by the critical
packet generation rate, is proved to be inversely proportional to the highest
node betweenness. By specifying the shortest path according to the different node
characteristics, two different routing strategies are proposed to reduce the high node
betweenness for the different node delivery capability schemes. Simulations on both
computer-generated networks and real world networks show that our routing strategies
can improve the network transfer capacity greatly. Especially, the greater the
new added edge number is, the more efficient our routing strategies are.
Arenas A. et al (2001); Communication in networks with hierarchical branching, Physical Review Letters, ISSN 0031-9007. 86(14): 3196-3199.
Guimera R. et al (2002); Optimal network topologies for local search with congestion, Physical Review Letters, ISSN 0031-9007. http://dx.doi.org/10.1103/PhysRevLett.89.248701
Zhang, G.Q. (2010); On cost-effective communication network designing. Europhysics Letters, ISSN 0295-5075. 89(3): 38003.
Dijkstra E.W. (1959); A note on two problems in connexion with graphs. Numerische Mathematik, ISSN 0029-599X, 1(1): 269-271.
Yan G. et al (2006); Efficient routing on complex networks. Physical Review E, ISSN 1539-3755. 73(4): 046108.
Wang W.X. et al. (2006); Traffic dynamics based on local routing protocol on a scale-free network. Physical Review E, ISSN 1539-3755, 73(2): 026111.
Yin C.Y. et al (2006); Traffic dynamics based on an efficient routing strategy on scale free networks, The European Physical Journal B, ISSN 1434-6028. 49(2): 205-211.
Toroczkai Z.; Bassler K.E. (2004); Network dynamics: Jamming is limited in scale-free systems. Nature, 428, 716 (15 April 2004) http://dx.doi.org/10.1038/428716a
Wu Y.H. et al (2013); Performance Analysis of Epidemic Routing in Delay Tolerant Networks with Overlapping Communities and Selfish Nodes, International Journal of Computers Communications & Control, ISSN 1841-9844, 8(5): 744-753.
Newman M.E.J. (2001); Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Physical Review E, ISSN 1063-651X. 64(1): 016132.
Almaas E. et al (2004); Global organization of metabolic fluxes in the bacterium Escherichia coli, Nature, ISSN 0028-0836. 427(6977): 839-843.
Barrat A. et al (2004); The architecture of complex weighted networks. PNAS, ISSN 0027-8424. 101(11): 3747-3752.
Pastor-Satorras R.; Vespignani A. (2007); Evolution and structure of the Internet: A statistical physics approach, Cambridge University Press, ISBN 9780521714778.
Brandes U. (2001); A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, ISSN 0022-250X, 25(2): 163-177.
Shao, F. (2013); Optimal Transport on Weighted Networks for Different Node Delivery Capability Schemes, The Scientific World Journal http://dx.doi.org/10.1155/2013/378083
Barrat A. et al (2004); Modeling the evolution of weighted networks. Physical Review E, ISSN 1539-3755. 70(6): 066149.
Barrat, A. et al (2004); Weighted evolving networks: coupling topology and weight dynamics. Physical Review Letters, ISSN 1079-7114. 92(22): 228701.
Barthelemy M. et al (2005); Characterization and modeling of weighted networks. Physica A: Statistical Mechanics and its Applications, ISSN 0378-4371. 346(1-2): 34-43.
Freeman L.C. (1977); A set of measures of centrality based on betweenness. Sociometry, ISSN 0038-0431, 40(1): 35-41.
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.