Skip to main content
SpringerLink
Log in
Book cover

Communications and Information Processing pp 359–367Cite as

General Local Routing on Complex Networks

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 288))

Abstract

Motivated by the problem of traffic congestion in large communication networks, three kinds of general local routing strategies are proposed respectively based on local topological, dynamic information and the estimated waiting time for enhancing the efficiency of traffic delivery on scale-free networks. The three strategies are governed separately by a single parameter. Simulations show that the maximal network capacity corresponds to an optimal controlled parameter. Moreover, a simulation is performed in a model of scale-free network with different clustering coefficient, and the results revealed that the more clustered network, the less efficient the packet delivery process.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barabási, A.L., Albert, R.: Emergence of scaling in random neteorks. Science 286, 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  2. de Menezes, M.A., Barabási, A.L.: Separating Internal and external dynamics of complex systems. Physical Review Letter 93, 068701 (2004)

    Article  Google Scholar 

  3. Ling, X., Hu, M.B., Jiang, R., Wang, R.L., Cao, X.B., Wu, Q.S.: Pheromone routing protocol on a scale-free network. Physical Review E 80, 066110 (2009)

    Article  Google Scholar 

  4. Sanders, D.P.: Exact encounter times for many random walkers on regular and complex networks. Physical Review E 80, 036119 (2009)

    Article  Google Scholar 

  5. Wu, J.J., Sun, H.J., Gao, Z.Y.: Dynamic urban traffic flow behavior on scale-free networks. Physica A-Statistical Mechanics and Its Applications 387, 653–660 (2008)

    Article  Google Scholar 

  6. Naganuma, Y., Igarashi, A.: A packet routing strategy using neural networks on scale-free networks. Physica A-Statistical Mechanics and Its Applications 389, 623–628 (2010)

    Article  Google Scholar 

  7. Cohen, R., Erez, K., Ben-Avraham, D., Havlin, S.: Resilience of the Internet to random breakdowns. Physical Review Letter 85, 4626–4628 (2000)

    Article  Google Scholar 

  8. Callaway, D.S., Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Network robustness and fragility: percolation on random graphs. Physical Review Letter 85, 5468–5471 (2000)

    Article  Google Scholar 

  9. Moreno, Y., Pastor-Satorras, R., Vespignani, A.: Epidemic outbreaks in complex heterogeneous networks. European Physical Journal B 26, 521–529 (2002)

    Google Scholar 

  10. Vázquez, A., Moreno, Y.: Resilience to damage of graphs with degree correlations. Physical Review E 67, 015101(R) (2003)

    Google Scholar 

  11. Newman, M.E.J.: Spread of epidemic disease on networks. Physical Review E 66, 016128 (2002)

    Article  Google Scholar 

  12. Tadić, B., Thurner, S., Rodgers, G.J.: Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations. Physical Review E 69, 036102 (2004)

    Article  Google Scholar 

  13. Echenique, P., Gómez-Gardeñes, J., Moreno, Y.: Improved routing strategies for Internet traffic delivery. Physical Review E 70, 056105 (2004)

    Article  Google Scholar 

  14. Chen, Z.Y., Wang, X.F.: Effects of network structure and routing strategy on network capacity. Physical Review E 73, 036107 (2006)

    Article  Google Scholar 

  15. Wang, D., Jing, Y.W., Zhang, S.Y.: Traffic dynamics based on a traffic awareness routing strategy on scale-free networks. Physica A-Statistical Mechanics and Its Applications 387, 3001–3007 (2008)

    Article  Google Scholar 

  16. Wang, W.X., Wang, B.H., Yin, C.Y., Xie, Y.B., Zhou, T.: Traffic dynamics based on local routing protocol on a scale-free network. Physical Review E 73, 026111 (2006)

    Article  Google Scholar 

  17. Yan, G., Zhou, T., Hu, B., Fu, Z.-Q., Wang, B.-H.: Efficient routing on complex networks. Physical Review E 73, 046108 (2006)

    Article  Google Scholar 

  18. Singh, B.K., Gupte, N.: Congestion and decongestion in a communication network. Physical Review E 71, 055103(R) (2005)

    Google Scholar 

  19. Noh, J.D., Rieger, H.: Random walks on complex networks. Physical Review Letter 92, 118701 (2004)

    Article  Google Scholar 

  20. Park, K., Lai, Y.C., Zhao, L.: Jamming in complex gradient networks. Physical Review E 71, 065105(R) (2005)

    Google Scholar 

  21. Holme, P., Kim, B.J.: Growing scale-free networks with tunable clustering. Physical Review E 65, 026107 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Laboratory of Manufacturing Industrial Integrated Automation, Shenyang University, 110044, Shenyang, China

    Dan Wang & Zhen Li

Authors
  1. Dan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhen Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Taiyuan University, Xueyuan Road 3, 030051, Taiyuan, Shanxi, China

    Maotai Zhao

  2. Xi’an University, Jinhua Road 4, 710032, Xi’an, Shanxi, China

    Junpin Sha

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, D., Li, Z. (2012). General Local Routing on Complex Networks. In: Zhao, M., Sha, J. (eds) Communications and Information Processing. Communications in Computer and Information Science, vol 288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31965-5_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31965-5_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31964-8

  • Online ISBN: 978-3-642-31965-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation