A Query-based Routing Table Update Mechanism for Content-Centric Network

Abstract

Due to the popularity of network applications, such as multimedia, online shopping, Internet of Things (IoT), and 5G, the contents cached in the routers are frequently replaced in Content-Centric Networking (CCN). Generally, cache miss causes numerous propagated packets to get the required content that deteriorates network congestion and delay the response time of consumers. Many caching strategies and routing policies were proposed to solve the problem. This paper presents an alternative solution by designing a query-based routing table update mechanism to increase the accuracy of routing tables. By adding an additional query content in interest packets, our approach real-time explores the cached content in routers and updated the routing table accordingly. This paper uses a general network simulator, ndnSIM, to compare basic CCN and our approach. The results show that our approach improves the response time of consumers and network congestion and is compatible with general forwarding strategies.

An Efficient Probe-Based Routing for Content-Centric Networking

“…One solution to fully exploit in-network cache is to explore the distribution of cached content [ 3 , 4 , 5 , 7 , 24 , 25 , 33 ]. They can be categorized into content share and content query .…”

“…Bastos et al [ 3 ] proposed a Diversity-based Search-and-Routing (DIVER) approach, which uses a probe packet with ε probability to search for copies of cached content on surrounding routers. To make full use of multipath forwarding and in-network caching, Xiaoyan et al [ 7 , 33 ] proposed an on-demand off-path Cache Exploration-based Multipath Forwarding strategy (O2CEMF).…”

“…In addition, a more complicated network topology, PoP-level Rocketfuel SPRINT topology [ 7 , 33 ], as shown in Figure 5 b is also adopted for simulation. The network topology has 52 nodes, including 8 producers (red stars), 11 consumers (green squares), and 33 routers (blue circle).…”

“…Figure 8 illustrates the impact of router failures on the performance of our approach, RECIF+PIF [ 41 ] and EEGPR [ 31 ]. This simulation adopts PoP-level SPRINT topology [ 7 , 33 ]. To simulate the failures of routers, several routers are randomly selected to crash after running half of the simulations.…”

“… Topology. ( a ) Abilene topology [ 40 ]; ( b ) PoP-level SPRINT topology [ 7 , 33 ], where including producer (red star), consumer (green square), and router (blue circle). …”