A popularity-driven controller-based routing and cooperative caching for named data networks

In this work, we investigate cache admission policies and forwarding decisions that account for content popularity in order to optimize the named-based routing performances in Named Data Networks (NDN). To achieve this goal, we propose a new controller-based, neighborhood content-aware, popularity-driven routing tightly coupled with a cooperative caching strategy, named Controller-Based Caching and Forwarding Scheme (CCFS). The rationale behind our proposal is to divide the network into domains mastered by cooperative Controllers forming a Connected Dominating Set (CDS). Controllers are responsible for making judicious request forwarding decisions while holding the most popular content requested in their domains. To gauge the effectiveness of our proposal, we conducted extensive simulations. Results show that CCFS reduces the mean hit distance by up to 30% and minimizes the communication cost by up to 47 times in comparison with a prominent existing approach - COntent-driven Bloom filter based Routing Algorithm (COBRA) as well as the default NDN routing. In addition, we observe that the performances of our proposal are very close to those achieved by the Best-route forwarding scheme using location-based Dijkstra's algorithm.

[1]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[2]  Sasu Tarkoma,et al.  Theory and Practice of Bloom Filters for Distributed Systems , 2012, IEEE Communications Surveys & Tutorials.

[3]  Yang Li,et al.  Self assembly caching with dynamic request routing for Information-Centric Networking , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[4]  Patrick Crowley,et al.  Named data networking , 2014, CCRV.

[5]  Aditya Akella,et al.  Redundancy in network traffic: findings and implications , 2009, SIGMETRICS '09.

[6]  Ding-Zhu Du,et al.  Connected Dominating Set: Theory and Applications , 2012 .

[7]  James F. Kurose,et al.  Breadcrumbs: Efficient, Best-Effort Content Location in Cache Networks , 2009, IEEE INFOCOM 2009.

[8]  Fan Deng,et al.  Approximately detecting duplicates for streaming data using stable bloom filters , 2006, SIGMOD Conference.

[9]  Yang Li,et al.  A chunk caching location and searching scheme in Content Centric Networking , 2012, 2012 IEEE International Conference on Communications (ICC).

[11]  Massimo Gallo,et al.  Modeling data transfer in content-centric networking , 2011, 2011 23rd International Teletraffic Congress (ITC).

[12]  Nikos Fotiou,et al.  A Survey of Information-Centric Networking Research , 2014, IEEE Communications Surveys & Tutorials.

[13]  Gennaro Boggia,et al.  COBRA: Lean intra-domain routing in NDN , 2014, 2014 IEEE 11th Consumer Communications and Networking Conference (CCNC).