Routing approaches in named data network: a survey and emerging research challenges

Abstract

Named Data Networking (NDN) has emerged as a promising information-centric networking paradigm that addresses the limitations of the traditional IP-based Internet architecture. The core principle of NDN relies on content naming instead of host addressing, to provide efficient, secure, and scalable content delivery. Routing is a critical component of NDN and is responsible for discovering and maintaining optimal paths to named content. This paper presents a comprehensive review of routing techniques in NDN, focusing on the design principles, algorithms, and performance metrics, especially in wired network architecture. We first summarize the NDN architecture and discuss its key components. We then delve into the fundamental routing concepts in NDN and categorize and examine various routing techniques, including link state, distance vector, and centralized approaches based on Software Defined Network. We also summarize the relevant research efforts proposed to address NDN routing challenges by focusing more on wired network architecture. Finally, we identify open research issues and future directions in NDN routing, emphasizing the need for scalable, efficient, and secure routing techniques that can fulfill the growing demands of the modern Internet. In conclusion, this review serves as a valuable reference for researchers and practitioners in NDN, offering a comprehensive understanding of the current state-of-the-art routing techniques, limitations, and potential future advancements.

KEYWORDS:

• Software defined network
• routing
• named data network
• scalabilitty
• overhead
• wired network

Acknowledgements

My profound gratitude goes out to our mentors, Pr. Jamali Abdellah and Naja Najib, for their essential advice and assistance during the study process. I would especially like to thank my parents for their insightful advice. I appreciate the unwavering support and love of my family and friends. Finally, I would like to express my gratitude for the assistance and cooperation of the entire Department of Mathematics, Informatique, and Networks team.

Disclosure statement

No potential conflict of interest was reported by the author(s).