Skip to main content
SpringerLink
Log in

Congestion avoidance by dynamically cache placement method in named data networking

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In recent years, a new paradigm of Content-Centric Networks has emerged, which employs the prefix content name for addressing in the context of Named Data Networking (NDN). In conventional networks, subscribers send interest packets, and publishers generate related content and publish it to the requesters. In NDN, Caching Routers (CRs), as well as publishers, can also propagate data packets toward the requesters. The NDN network flow has two opposite sides: (1) the interest packet flow, known as interest forwarding on the upstream side, (2) the content flow, known as data publishing, on the downstream side. High traffic volume can be created by the increasing number of requested packets and associated data that are leading to bottlenecks in some parts of the networks. Therefore, congestion control and avoidance are significant issues in NDN. A considerable number of congestion control methods employ forwarding interest rate adjustment coming through the forwarding side. Nevertheless, the congestion can be prevented on the data publishing side using an efficient cache placement method. Congestion avoidance is a process for controlling congestion and balancing traffic loads to make the network effective. In this paper, a Dynamic Cache Placement (DCP) method is proposed to provide congestion avoidance by dynamically relocating the content of the CRs according to the traffic volume pattern and the link capacity. The DCP method distributes the popular data to the network regions with less traffic load and more accessible routers to balance the congested routers’ traffic load. The DCP is implemented in the ndnSIM network simulator, and its performance is compared to the conventional method. Simulation results show that DCP is a fair and robust cache placement design, which successfully avoids congestion inflows with highly varying traffic demand. The proposed techniques employed in the DCP method improve the network performance in dynamic circumstances of the network.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  1. Ahlgren B, Dannewitz C, Imbrenda C, Kutscher D, Ohlman B (2012) A survey of information-centric networking. IEEE Commun Mag 50(7):26–36

    Article  Google Scholar 

  2. Asmaa EB, Bouayad A, Bekkali ME (2019) A hop-by-hop congestion control mechanisms in NDN networks—a survey. In: 2019 7th mediterranean congress of telecommunications (CMT). IEEE, pp 1–4

  3. Chai WK, He D, Psaras I, Pavlou G (2012) Cache less for more in information-centric networks. In: International Conference on Research in Networking. Springer, pp 27–40

  4. Cui Y, Lai F, Yeh E, Liu R (2016) Enhanced VIP algorithms for forwarding, caching, and congestion control in named data networks. In: 2016 IEEE global communications conference (GLOBECOM). IEEE, pp 1–7

  5. Dukkipati N (2008) Rate control protocol (RCP): congestion control to make flows complete quickly. Citeseer

  6. Hashemi SNS, Bohlooli A (2018) Analytical modeling of multi-source content delivery in information-centric networks. Comput Netw 140:152–162

    Article  Google Scholar 

  7. Ioannou A, Weber S (2016) A survey of caching policies and forwarding mechanisms in information-centric networking. IEEE Commun Surv Tutor 18(4):2847–2886

    Article  Google Scholar 

  8. Jaffri A, Ahmad Z, Tahir M (2013) Named data networking (NDN), new approach to future internet architecture design: a survey. Int J Inform Commun Technol 2(3):155–164

    Google Scholar 

  9. Kalghoum A, Gammar SM, Saidane LA (2018) Towards a novel cache replacement strategy for named data networking based on software defined networking. Comput Electric Eng 66:98–113

    Article  Google Scholar 

  10. Kato T, Bandai M (2018) A hop-by-hop window-based congestion control method for named data networking. In: 2018 15th IEEE Annual Consumer Communications and Networking Conference (CCNC). IEEE, pp 1–7

  11. Lei K, Hou C, Li L, Xu K (2015) A RCP-based congestion control protocol in named data networking. In: 2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery. IEEE, pp 538–541

  12. Li C, Okamura K (2014) Cluster-based in-networking caching for content-centric networking. Int J Comput Sci Netw Secur (IJCSNS) 14(11):1

    Google Scholar 

  13. Li Z, Xu Y, Zhang B, Yan L, Liu K (2018) Packet forwarding in named data networking requirements and survey of solutions. IEEE Commun Surv Tutor 21(2):1950–1987

    Article  Google Scholar 

  14. Mahdian M, Arianfar S, Gibson J, Oran D (2016) MIRCC: Multipath-aware ICN rate-based congestion control. In: Proceedings of the 3rd ACM Conference on Information-Centric Networking, pp 1–10

  15. Mastorakis S, Afanasyev A, Zhang L (2017) On the evolution of NDNSIM: An open-source simulator for NDN experimentation. ACM SIGCOMM Comput Commun Rev 47(3):19–33

    Article  Google Scholar 

  16. Mejri S, Touati H, Malouch N, Kamoun F (2017) Hop-by-hop congestion control for named data networks. In: 2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA). IEEE, pp 114–119

  17. Ndikumana A, Ullah S, Kamal R, Thar K, Kang HS, Moon SI, Hong CS (2015) Network-assisted congestion control for information centric networking. In: 2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS). IEEE, pp 464–467

  18. Nichols K, Jacobson V (2012) Controlling queue delay. Commun ACM 55(7):42–50

    Article  Google Scholar 

  19. Nichols K, Jacobson V, McGregor A, Iyengar J (2018) Controlled delay active queue management. RFC 8289(1):1–25

    Google Scholar 

  20. Nikzad M, Jamshidi K, Bohlooli A (2020) A responsibility-based transport control for named data networking. Future Gener Comput Syst 106:518–533

    Article  Google Scholar 

  21. Park H, Jang H, Kwon T (2014) Popularity-based congestion control in named data networking. In: 2014 Sixth International Conference on Ubiquitous and Future Networks (ICUFN). IEEE, pp 166–171

  22. Ren Y, Li J, Shi S, Li L, Wang G, Zhang B (2016) Congestion control in named data networking-a survey. Comput Commun 86:1–11

    Article  Google Scholar 

  23. Rezaeifar Z, Wang J, Oh H, Lee SB, Hur J (2019) A reliable adaptive forwarding approach in named data networking. Future Gener Comput Syst 96:538–551

    Article  Google Scholar 

  24. Rozhnova N, Fdida S (2012) An effective hop-by-hop interest shaping mechanism for ccn communications. In: 2012 Proceedings IEEE INFOCOM Workshops. IEEE, pp 322–327

  25. Rozhnova N, Fdida S (2014) An extended hop-by-hop interest shaping mechanism for content-centric networking. In: 2014 IEEE Global Communications Conference. IEEE, pp 1–7

  26. Schneider K, Yi C, Zhang B, Zhang L (2016) A practical congestion control scheme for named data networking. In: Proceedings of the 3rd ACM Conference on Information-Centric Networking, pp 21–30

  27. Sung J, Kim M, Lim K, Rhee JKK (2016) Efficient cache placement strategy in two-tier wireless content delivery network. IEEE Trans Multimed 18(6):1163–1174

    Article  Google Scholar 

  28. Wang Y, Rozhnova N, Narayanan A, Oran D, Rhee I (2013) An improved hop-by-hop interest shaper for congestion control in named data networking. ACM SIGCOMM Comput Commun Rev 43(4):55–60

    Article  Google Scholar 

  29. Yang W, Qin Y, Yang Y (2018) An interest shaping mechanism in NDN: joint congestion control and traffic management. In: 2018 IEEE International Conference on Communications (ICC). IEEE, pp 1–6

  30. Yeh E, Ho T, Cui Y, Liu R, Burd M, Leong D (2013) Forwarding, caching and congestion control in named data networks. arXiv:13105569

  31. Zhang G, Li Y, Lin T (2013) Caching in information centric networking: a survey. Comput Netw 57(16):3128–3141

    Article  Google Scholar 

  32. Zhang G, Li H, Zhang T, Li D, Xu L (2015) A multi-path forwarding strategy for content-centric networking. In: 2015 IEEE/CIC International Conference on Communications in China (ICCC). IEEE, pp 1–6

  33. Zhang L, Estrin D, Burke J, Jacobson V, Thornton JD, Smetters DK, Zhang B, Tsudik G, Massey D, Papadopoulos C, et al. (2010) Named data networking (NDN) project. Relatório Técnico NDN-0001, Xerox Palo Alto Research Center-PARC 157:158

  34. Zhang L, Afanasyev A, Burke J, Jacobson V, Claffy K, Crowley P, Papadopoulos C, Wang L, Zhang B (2014) Named data networking. ACM SIGCOMM Comput Commun Rev 44(3):66–73

    Article  Google Scholar 

  35. Zhong S, Liu Y, Li J, Lei K (2017) A rate-based multipath-aware congestion control mechanism in named data networking. In: 2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC). IEEE, pp 174–181

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Engineering, NajafAbad Branch, Islamic Azad University, Najafabad, Iran

    Babak Nikmard, Naser Movahhedinia & Mohammad Reza Khayyambashi

  2. Department of Computer Architecture, Faculty of Computer Engineering, University of Isfahan, Isfahan, Iran

    Naser Movahhedinia & Mohammad Reza Khayyambashi

Authors
  1. Babak Nikmard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Naser Movahhedinia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohammad Reza Khayyambashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Naser Movahhedinia.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nikmard, B., Movahhedinia, N. & Khayyambashi, M.R. Congestion avoidance by dynamically cache placement method in named data networking. J Supercomput 78, 5779–5805 (2022). https://doi.org/10.1007/s11227-021-04080-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-021-04080-0

Keywords

Search

Navigation