PopNetCod: A Popularity-based Caching Policy for Network Coding enabled Named Data Networking

In this paper, we propose PopNetCod, a popularity-based caching policy for network coding enabled Named Data Networking. PopNetCod is a distributed caching policy, in which each router measures the local popularity of the content objects by analyzing the requests that it receives. It then uses this information to decide which Data packets to cache or evict from its content store. Since network coding is used, partial caching of content objects is supported, which facilitates the management of the content store. The routers decide the Data packets that they cache or evict in an online manner when they receive requests for Data packets. This allows the most popular Data packets to be cached closer to the network edges. The evaluation of PopNetCod shows an improved cache-hit rate compared to the widely used Leave Copy Everywhere placement policy and the Least Recently Used eviction policy. The improved cache-hit rate helps the clients to achieve higher goodput, while it also reduces the load on the source servers.

[1]  Mihaela van der Schaar,et al.  Popularity-driven content caching , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[2]  Lixia Zhang,et al.  ndnSIM 2 : An updated NDN simulator for NS-3 , 2016 .

[3]  J. J. Garcia-Luna-Aceves,et al.  Understanding optimal caching and opportunistic caching at "the edge" of information-centric networks , 2014, ICN '14.

[4]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[5]  Christian Timmerer,et al.  Which Adaptation Logic? An Objective and Subjective Performance Evaluation of HTTP-based Adaptive Media Streaming Systems , 2016, ArXiv.

[6]  Mario Gerla,et al.  Popularity-based partial caching for Information Centric Networks , 2016, 2016 Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net).

[7]  Dirk Trossen,et al.  Network coding meets information-centric networking: an architectural case for information dispersion through native network coding , 2012, NoM '12.

[8]  Ying Cui,et al.  VIP: a framework for joint dynamic forwarding and caching in named data networks , 2013, ICN '14.

[9]  Steve Uhlig,et al.  Open Connect Everywhere: A Glimpse at the Internet Ecosystem through the Lens of the Netflix CDN , 2016, CCRV.

[10]  Yanghee Choi,et al.  WAVE: Popularity-based and collaborative in-network caching for content-oriented networks , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[11]  Torsten Braun,et al.  NetCodCCN: A network coding approach for content-centric networks , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[12]  Gaogang Xie,et al.  CodingCache: multipath-aware CCN cache with network coding , 2013, ICN '13.

[13]  Bruce M. Maggs,et al.  Less pain, most of the gain: incrementally deployable ICN , 2013, SIGCOMM.

[14]  Jing Ren,et al.  An optimal Cache management framework for information-centric networks with network coding , 2014, 2014 IFIP Networking Conference.

[15]  Torsten Braun,et al.  Adaptive Video Streaming With Network Coding Enabled Named Data Networking , 2017, IEEE Transactions on Multimedia.

[16]  Yunnan Wu,et al.  Network Coding for the Internet and Wireless Networks , 2007, IEEE Signal Processing Magazine.

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

[18]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[19]  Cédric Westphal,et al.  Adaptive Video Streaming over CCN with Network Coding for Seamless Mobility , 2016, 2016 IEEE International Symposium on Multimedia (ISM).

[20]  Yi Sun,et al.  Trace-Driven Analysis of ICN Caching Algorithms on Video-on-Demand Workloads , 2014, CoNEXT.

[21]  D. Woolley.  The White Paper. , 1972, British medical journal.

[22]  Jaime Llorca,et al.  Network-coded caching-aided multicast for efficient content delivery , 2013, 2013 IEEE International Conference on Communications (ICC).