An Efficient Probe-based Routing for Content-Centric Networking
Pei-Hsuan Tsai, Junbin Zhang, Meng-Hsun Tsai

TL;DR
This paper introduces a probe-based routing algorithm for Content-Centric Networking that improves routing accuracy, reduces response time, and enhances network reliability by leveraging real-time in-network caching information.
Contribution
The paper proposes a novel probe-based routing method that utilizes real-time in-network caching to optimize path selection in CCN, addressing nondeterminism and caching challenges.
Findings
Reduces timeout interests by 6%
Lowers average response time by 0.6 seconds
Improves FIB accuracy and network reliability
Abstract
With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and Content-Centric Networking (CCN) are therefore proposed as an alternative for future networks. However, unlike IP-based networks, CCN routing is nondeterministic and difficult to optimize due to frequent in-network caching replacement. This paper presents a novel probe-based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up-to-date. Effective probe-selections, Pending Interest Table (PIT) probe, and Forwarding Information Base (FIB) probe are discussed and analyzed by simulation with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
