Let sources know: Enabling access tracking in a content centric context

As a promising future network architecture, Named Data Networking (NDN) enables efficient content distribution and significantly reduces the overall network traffic through its routing and caching mechanisms. On the other hand, the routing and caching features of NDN could cause a side-effect in which Content Providers (CPs) are unable to acquire the accurate number of access to their contents, since consumers can get contents directly from intermediate network devices such as routers. However, the accurate statistical information of content access is of great importance for CPs when making pricing and cache placement strategies based on content popularity, but now CPs can only assume the content's access information rather than the real data to make strategies. In this paper, we propose a new scheme to help CPs regain the access information of contents timely and efficiently. In our solution, network devices keep track of the requested content information and collect the statistics of the content access information in a self-adaptive manner. The statistical information is sent to CPs by routers when certain events are triggered, so that CPs could obtain the popularity of their contents. With the proposed scheme, CPs, in the context of NDN, based on the real popularity information of contents, can make appropriate caching and pricing strategies for the sake of better serving their business interest. Our simulation further indicates that the proposed scheme is not only lightweight but also exhibits good accuracy and low latency.

[1]  Donald F. Towsley,et al.  Cashing in on caching: on-demand contract design with linear pricing , 2015, CoNEXT.

[2]  Donald F. Towsley,et al.  On Allocating Cache Resources to Content Providers , 2016, ICN.

[3]  Gang Peng,et al.  CDN: Content Distribution Network , 2004, ArXiv.

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

[5]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[6]  Satyajayant Misra,et al.  Application-Specific Secure Gathering of Consumer Preferences and Feedback in ICNs , 2016, ICN.

[7]  Damien Magoni,et al.  Evaluation of Internet topology generators by power law and distance indicators , 2002, Proceedings 10th IEEE International Conference on Networks (ICON 2002). Towards Network Superiority (Cat. No.02EX588).

[8]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, SIGCOMM 2002.

[9]  Muhammad Rizwan,et al.  Application of 80/20 rule in software engineering Waterfall Model , 2009, 2009 International Conference on Information and Communication Technologies.

[10]  Mohamed Hefeeda,et al.  Traffic modeling and proportional partial caching for peer-to-peer systems , 2008, TNET.

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

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

[13]  David M. W. Powers,et al.  Applications and Explanations of Zipf’s Law , 1998, CoNLL.

[14]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[15]  Bin Tang,et al.  An Optimal Cache Placement Strategy Based on Content Popularity in Content Centric Network , 2014 .

[16]  Narayan B. Mandayam,et al.  Joint Caching and Pricing Strategies for Popular Content in Information Centric Networks , 2016, IEEE Journal on Selected Areas in Communications.

[17]  Narayan B. Mandayam,et al.  Joint Caching and Pricing Strategies for Information Centric Networks , 2014, GLOBECOM 2014.