Skip to main content

A Multipath Routing Algorithm Avoiding Congested Links According to the Link Usage Ratios on NDN

  • Conference paper
  • First Online:
Advances in Networked-based Information Systems (NBiS 2023)

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 183))

Included in the following conference series:

  • 232 Accesses

Abstract

Recent Internet traffic amount rapidly grows with a development of multimedia communications. Those traffic data, typically, will be used multiple times by multiple users, without any modifications. Then, for reducing network load, NDN (Named Data Networking) has attracted wide attention from network researchers as a new network architecture replacing current TCP/IP based Internet architecture. On NDN, routers named CR cache a content to be delivered users to reuse for the future content request. For the request same with those cached content, CR return it to user instead of original content server. The NDN, however, a overconcentration of content delivery path will occur due to only always the path will be used for forwarding according to the best forwarding (shortest path) strategy of NDN even if there are un-congested forwarding paths as a secondary best. Hence, the content acquisition ratio degrades rapidly when the congestion is occurred on a best forwarding path. In this paper, for mitigating effects of overconcentration problem on NDN, a new multipath algorithm for avoiding congested links on NDN will be proposed. By the performance evaluations, we clarify the advantages of our proposed algorithm in terms of content acquisition ratio without no large affecting on content acquisition hops.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.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

Institutional subscriptions

Similar content being viewed by others

References

  1. Soniya, M., Kumar, K.: A survey on named data networking. In: Proceedings of 2nd International Conference on Electronics and Communication Systems 2015 (ICECS 2015), Coimbatore, pp. 1515–1519 (2015)

    Google Scholar 

  2. Chen, Q., Xie, R., Yu, F., Huang, T., Liu, Y.: Transport control strategies in named data networking: a survey. IEEE Commun. Surv. Tutorials 18(3), 2052–2083 (2016)

    Article  Google Scholar 

  3. Molinaro, M., Campolo, C., Sifalakis, M.: Transport layer design for named data wireless networking. In: Proceedings of IEEE INFOCOM Workshop on Name-Oriented Mobility, pp. 464–469 (2014)

    Google Scholar 

  4. Cheng, Y., Afanasyev, A., Moiseenko, I., Zhang, B., Wang, L., Zhang, L.: A case for stateful forwarding plane computer communications. ACM Digial Librapy 36(7), 779–791 (2013)

    Google Scholar 

  5. Zhou, J., Wu, Q., Li, Z., Kaafar, M.A., Xie, G.: A proactive transport mechanism with explicit congestion notification for NDN. In: Proceedings of the IEEE ICC 2015, pp. 5242–5247 (2015)

    Google Scholar 

  6. Rozhhnova, N., Fdida, S.: An effective hop-by-hop Interest shaping mechanism for CCN communications. In: Proceedings of IEEE Infocom, vol. 2012, pp. 322–327 (2012)

    Google Scholar 

  7. Carofiglio, G., Gallo, M., Muscariello, L.: ICP: design and evalution of an interest control protocol for content-centric networking. In: Proceedings of IEEE INFOCOM, vol. 2012, pp. 304–309 (2012)

    Google Scholar 

  8. Salsano, S., Detti, A., Cancellieri, M., Pomposini, M., Blefari-Melazzi, N.: Transport-layer issue in information centric networks. In: Proceedings of the ACM ICN2012, pp. 19–24 (2012)

    Google Scholar 

  9. Saino, L., Cocora, C., Pavlou, G.: CCTCP: a scalable receiverdriven congestion control protocol for content centric networking. In: Proceedings of the IEEE ICC, vol. 2013, pp. 3775–3780 (2013)

    Google Scholar 

  10. Zhang, F., Zhang, Y., Reznik, A., Liu, H., Qian, C., Xu, C.: A transport protocol for content-centric networking with explicit congestion control. In: Proceedings of IEEE ICCCN, pp. 1–8 (2014)

    Google Scholar 

  11. Kato, T., Bandai, M., Yamamoto, M.: A congestion control method for named data networking with hopby-hop window-based approach. IEICE Trans. Commun. E102.B(1) (2019), 97–110 (2019)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tetsuya Shigeyasu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Omitsu, N., Shigeyasu, T. (2023). A Multipath Routing Algorithm Avoiding Congested Links According to the Link Usage Ratios on NDN. In: Barolli, L. (eds) Advances in Networked-based Information Systems. NBiS 2023. Lecture Notes on Data Engineering and Communications Technologies, vol 183. Springer, Cham. https://doi.org/10.1007/978-3-031-40978-3_1

Download citation

Publish with us

Policies and ethics