EST

Call for paper
April Edition 2017

International Journal of Applied Information Systems solicits high quality original research papers for the
March 15, 2017
April 2017 Edition of the journal.
The last date of research paper submission is
March 15, 2017
SUBMIT YOUR PAPER

Number 10

Optimal Routing Strategy on Weighted Networks

journal image
  • International Journal of Applied Information Systems
  • Foundation of Computer Science (FCS), NY, USA
  • Volume 7 - Number 10
  • Year of Publication:
  • Authors: Yu Su, Tao Zhou, Shoubao Su
  • 10.5120/ijais14-451246
 Download
972

Export

  • Yu Su and Tao Zhou and Shoubao Su 2014. Optimal Routing Strategy on Weighted Networks. International Journal of Applied Information Systems. 7, 10 (October 2014), 41-45. DOI=http://dx.doi.org/10.5120/ijais451246 
  • @article{10.5120/ijais2017451568,
author = {Yu Su and Tao Zhou and Shoubao Su},
title = {Optimal Routing Strategy on Weighted Networks},
journal = {International Journal of Applied Information Systems},
issue_date = {October 2014},
volume = {7},
number = {},
month = {October},
year = {2014},
issn = {},
pages = {41-45},
numpages = {},
url = {/archives/volume7/number10/690-1246},
doi = { 10.5120/ijais14-451246},
publisher = { xA9 2013 by IJAIS Journal},
address = {}
}

  • %1 451246
%A Yu Su
%A Tao Zhou
%A Shoubao Su
%T Optimal Routing Strategy on Weighted Networks
%J International Journal of Applied Information Systems
%@ 
%V 7
%N 
%P 41-45
%D 2014
%I  xA9 2013 by IJAIS Journal

Abstract

How to improve the transfer capability of the weighted networks is one of the most important problems in complex networks. In this paper, a novel and effective routing strategy is proposed by deleting edges in proper order according to their different definitions of edge weight. Kicking out few specified edges can enhance the transfer capability of weighted networks greatly. Simulations on both compute generated and real world networks show that the routing strategy kicking out edges according to the product of the strengths of two nodes of the edge is more effective. Moreover, we analyse the curve of critical packet generation rate of kicking out all deletable edges and find that there is a sharp transition after kicking out some edges. Due to the strongly improved network capacity, easy realization on networks, and low cost, the strategy may be useful for real communication networks.

References

  1. Zhou, T., Zhang, Z.K., Chen, G.R., et al, (2014). Opportunities and challenges of complex networks research. Journal of University of Electronic Science and Technology of China, Vol.43, No.1, pp.1-5.
  2. Steve, H. (2011). Weighted Network Analysis. Springer-Verlag, New York, pp.205-221.
  3. Watts, D.J., Strogatz, S.H., (1998). Collective dynamics of 'small-world' networks. Nature, Vol.393, No.6684, pp.440-442.
  4. BarabxE1si, A.L., Albert, R. (1999). Emergence of scaling in random networks. Science, Vol.286, No.5439, pp.509-512.
  5. Chen, S.Y., Huang, W., Cattani, C., et al, (2012). Traffic Dynamics on Complex Networks: A Survey. Mathematical Problems in Engineering, Vol.2012, Article ID 732698, 23 pages,.
  6. Barrat, A., BarthxE9lemy, M., Pastor-Satorras, R., et al. (2004). The architecture of complex weighted networks. PNAS, Vol.101, No.11, pp.3747-3752.
  7. Pastor-Satorras, R., Vespignani, A., (2007). Evolution and structure of the Internet: A statistical physics approach. Cambridge: Cambridge University Press, UK, pp.123-135.
  8. Zhang, D.G., Dai, W.B., Niu, Q.X., (2012). Local-world weighted topology evolving model for wireless sensor networks. Acta Electronica Sinica, vol.40, No.5, pp.1000-1004.
  9. Marcellus-Lopes, F. (2014). Epidemics on a weighted network with tunable degree-degree correlation. Mathematical Biosciences, Vol.253, No.1, pp.40-49.
  10. Zhou, T., (2008). Mixing navigation on networks. Physica A, Vol.387, No.12, pp.3025-3032.
  11. Yan, G., Zhou, T., Hu, B., et al, (2006). Efficient Routing on Complex Networks. Phys. Rev. E., Vol.73, No.4, p.046108.
  12. Wang, W.X., Wang, B. H., Yin, C.Y., et al, (2006). Traffic dynamics based on local routing protocol on a scale-free network. Physical Review E, Vol.73, No.2, p.026111.
  13. He, Z.W., Liu, S., Zhan, M., (2013). Dynamical robustness analysis of weighted complex networks, Physica A, Vol.392, No.18, pp.4181-4191.
  14. GuimerxE0, R., DxEDaz-Guilera, A., Vega-Redondo, F., et al, (2002). Optimal network topologies for local search with congestion. Physical Review Letters, vol.89, No.24, p.248701.
  15. Barthelemy, M., Barrat, A., Pastor-Satorras, R., et al. (2005). Characterization and modelling of weighted networks. Physica A, Vol.346, No.1, pp.34-43.
  16. Huang, W., ChowT.W.S., (2010). Effective strategy of adding nodes and links for maximizing the traffic capacity of scale-free network. Chaos, vol.20, no.3, p.033123.
  17. Zhang, G.Q., (2010). On cost-effective communication network designing. Europhysics Letters, vol.89, no.3, p.38003.
  18. Barrat, A.BarthxE9lemy, M.Vespignani, A., (2004). Weighted evolving networks: coupling topology and weight dynamics. Physical Review Letters, vol.92, no.22, p.228701.
  19. Arenas, A., DxEDaz-GuilerxE0, A., GuimerxE0, R. (2001). Communication in Networks with Hierarchical Branching, Physical Review Letters, Vol.86, No.14, pp.3196-3199.
  20. Wang, K., Zhou, S.Y., Zhang, Y.F., et al, (2011). A modified optimal routing strategy based on random walk on complex networks. Acta Phys. Sin., Vol.60, No.11, p.118903.

Keywords

Weighted network, Barrat-Barthelemy-Vespignani (BBV) network, Routing strategy, Transfer capability

Index Terms

Computer Science
Information Sciences