Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the 5th International Conference on Applications in Nonlinear Dynamics pp 164–173Cite as

Congestion Avoidance on Networks Using Independent Memory Information

  • Conference paper
  • First Online:

Part of the book series: Understanding Complex Systems ((UCS))

Abstract

We propose in this paper a new routing method that utilizes hop distance information and transmitting history. Most of conventional routing methods use global and real-time information such as the number of waiting packets at nodes. In addition, they assumed that these real-time information can be accessed instantaneously at every node. These unrealistic network circumstances, however, limit applicability of routing methods. On the other hand, our proposed method in this paper uses transmitting histories held by each node to diversify routes of packets. In addition, any packets to exchange global information is not necessary. Numerical simulations indicate that our proposed method shows higher arrival rate of packets for various scale-free type communication network models.

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   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. D.J. Watts, D.J. Watts, S.H. Strogatz, S.H. Strogatz, Nature 393, 440 (1998)

    Article  Google Scholar 

  2. A.L. Barabási, R. Albert, Science 286, 509 (1999)

    Article  MathSciNet  Google Scholar 

  3. R. Guimerà, A. Díaz-Guilera, F. Vega-Redondo, A. Cabrales, A. Arenas, Phys. Rev. Lett. 89(24), 248701 (2002)

    Article  Google Scholar 

  4. S. Chen, W. Huang, C. Cattani, G. Altieri, Math. Probl. Eng. 2012(25), 1 (2012)

    Google Scholar 

  5. E.W. Dijkstra, Numer. Math. 1(1), 269 (1959)

    Article  MathSciNet  Google Scholar 

  6. G. Yan, T. Zhou, B. Hu, Z.Q. Fu, B.H. Wang, Phys. Rev. E 73(4), 046108 (2006)

    Article  Google Scholar 

  7. P. Echenique, J. Gómez-Gardeñes, Y. Moreno, Europhys. Lett. 71(2), 325 (2005)

    Article  Google Scholar 

  8. M. Tang, Z. Liu, X. Liang, P.M. Hui, Phys. Rev. E 80(2), 026114 (2009)

    Article  Google Scholar 

  9. W. Huang, T.W.S. Chow, Chaos 19(4), 043124 (2009)

    Article  Google Scholar 

  10. W.X. Wang, C.Y. Yin, G. Yan, B.H. Wang, Phys. Rev. E 74(1), 016101 (2006)

    Article  Google Scholar 

  11. W.X. Wang, B.H. Wang, C.Y. Yin, Y.B. Xie, T. Zhou, Phys. Rev. E 73(2), 026111 (2006)

    Article  Google Scholar 

  12. C. Hong, Phys. A 424, 242 (2015)

    Article  Google Scholar 

  13. T. Kimura, H. Nakajima, T. Ikeguchi, Phys. A 376, 658 (2007)

    Article  Google Scholar 

  14. T. Kimura, T. Takamizawa, K. Kimura, K. Jin’no, Nonlinear Theory Appl. IEICE 6(2), 263 (2015)

    Article  Google Scholar 

  15. T. Kimura, T. Takamizawa, T. Matsuura, Am. J. Oper. Res. 06(04), 343 (2016)

    Article  Google Scholar 

  16. T. Kimura, T. Ikeguchi, Neural Comput. Appl. 16(6), 519 (2007)

    Article  Google Scholar 

  17. T. Kimura, T. Ikeguchi, Integr. Comput.-Aided Eng. 14, 307 (2007)

    Article  Google Scholar 

  18. T. Kimura, T. Hiraguri, T. Ikeguchi, Am. J. Oper. Res. 02(03), 348 (2012)

    Article  Google Scholar 

  19. Y. Morita, T. Kimura, Nonlinear Theory Appl. IEICE 9(1), 95 (2018)

    Article  Google Scholar 

  20. T. Kimura, T. Ikeguchi, C.K. Tse, Am. J. Oper. Res. 02(01), 73 (2012)

    Article  Google Scholar 

  21. X. Ling, M.B. Hu, R. Jiang, Q.S. Wu, Phys. Rev. E 81(1), 016113 (2010)

    Article  Google Scholar 

  22. M.B. Hu, W.X. Wang, R. Jiang, Q.S. Wu, Y.H. Wu, Phys. Rev. E 75(3), 036102 (2007)

    Article  Google Scholar 

  23. M. Faloutsos, P. Faloutsos, C. Faloutsos, in SIGCOMM (1999), pp. 251–262

    Google Scholar 

  24. A. Arenas, A. Díaz-Guilera, R. Guimerà, Phys. Rev. Lett. 86(14), 3196 (2001)

    Article  Google Scholar 

  25. K.I. Goh, B. Kahng, D. Kim, Phys. Rev. Lett. 87(27), 278701 (2001)

    Article  Google Scholar 

Download references

Acknowledgments

The research of T.K. was partially supported by a Grant-in-Aid for Young Scientists (B) from JSPS (No.16K21327).

Author information

Authors and Affiliations

  1. Department of Electrical, Electronics, and Communication Engineering, Faculty of Fundamental Engineering, Nippon Institute of Technology, 4-1-1 Gakuendai, Miyashiro, Saitama, 345-8501, Japan

    Takayuki Kimura

Authors
  1. Takayuki Kimura
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Takayuki Kimura .

Editor information

Editors and Affiliations

  1. Space and Naval Warfare Systems Center, San Diego, CA, USA

    Visarath In

  2. Space and Naval Warfare Systems Center, San Diego, CA, USA

    Patrick Longhini

  3. Department of Mathematics and Statistics, San Diego State University, San Diego, CA, USA

    Antonio Palacios

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kimura, T. (2019). Congestion Avoidance on Networks Using Independent Memory Information. In: In, V., Longhini, P., Palacios, A. (eds) Proceedings of the 5th International Conference on Applications in Nonlinear Dynamics. Understanding Complex Systems. Springer, Cham. https://doi.org/10.1007/978-3-030-10892-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-10892-2_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-10891-5

  • Online ISBN: 978-3-030-10892-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation