Combining Popularity and Locality to Enhance In-Network Caching Performance and Mitigate Pollution Attacks in Content-Centric Networking

Content-centric networking (CCN) aims to improve network reliability, scalability, and security by changing the way that information is organized and retrieved in the current Internet. One critical issue in CCN is in-network cache allocation. It is known that in-network caching mechanisms are vulnerable to distributed denial of service attacks, especially to pollution attacks. That is, a caching mechanism under pollution attacks cannot work well. The past years witnessed kinds of proposals of cache allocation mechanisms. However, none of them could effectively allocate in-network cache while defending against attacks. In this paper, we propose a lightweight non-collaborative cache allocation approach (IFDD), which could not only enhance in-network caching performance in terms of the cache hit ratio and the request processing delay, but also defend against pollution attacks. By lightweight, we mean that IFDD generates low communication overhead (due to non-collaboration) and computational overhead at routers. The key idea behind IFDD is to combine the content popularity with the content locality in making caching decision. Extensive simulation results on ndnSIM platform demonstrate the capability of the proposed approach in improving cache allocation performance while reducing the impact of pollution attacks.

[1]  Stefan Weber,et al.  A Survey of Caching Policies and Forwarding Mechanisms in Information-Centric Networking , 2016, IEEE Communications Surveys & Tutorials.

[2]  Catherine Rosenberg,et al.  Analysis of a CDN–P2P hybrid architecture for cost-effective streaming media distribution , 2006, Multimedia Systems.

[3]  Steve Uhlig,et al.  Design and Evaluation of the Optimal Cache Allocation for Content-Centric Networking , 2016, IEEE Transactions on Computers.

[4]  Haiying Shen,et al.  Selective Data replication for Online Social Networks with Distributed Datacenters , 2013, 2013 21st IEEE International Conference on Network Protocols (ICNP).

[5]  Olivier Festor,et al.  MPC: Popularity-based caching strategy for content centric networks , 2013, 2013 IEEE International Conference on Communications (ICC).

[6]  Ling Chen,et al.  A Load Balancing Method under Zipf-Like Requests Distribution in DHT-Based P2P Network Systems , 2009, 2009 International Conference on Web Information Systems and Mining.

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

[8]  Prithula Dhungel,et al.  The pollution attack in P2P live video streaming: measurement results and defenses , 2007, P2P-TV '07.

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

[10]  Xin Wang,et al.  Popularity-driven coordinated caching in Named Data Networking , 2012, 2012 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[11]  Mirjam Wattenhofer,et al.  YouTube around the world: geographic popularity of videos , 2012, WWW.

[12]  Ibrahim Abdullahi,et al.  Survey on caching approaches in Information Centric Networking , 2015, J. Netw. Comput. Appl..

[13]  Alexander Afanasyev,et al.  ndnSIM 2 . 0 : A new version of the NDN simulator for NS-3 , 2015 .

[14]  Robbert van Renesse,et al.  An analysis of Facebook photo caching , 2013, SOSP.

[15]  Balachander Krishnamurthy,et al.  On the use and performance of content distribution networks , 2001, IMW '01.

[16]  Célio Vinicius N. de Albuquerque,et al.  On the possibility of mitigating content pollution in Content-Centric Networking , 2014, 39th Annual IEEE Conference on Local Computer Networks.

[17]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

[18]  Xiaodong Wang,et al.  Exploiting Path Diversity for Thwarting Pollution Attacks in Named Data Networking , 2016, IEEE Transactions on Information Forensics and Security.

[19]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[20]  Guoqiang Zhang,et al.  Caching in information centric networking: A survey , 2013, Comput. Networks.

[21]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[22]  George Pavlou,et al.  In-Network Cache Management and Resource Allocation for Information-Centric Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

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

[24]  Paolo Giaccone,et al.  Unravelling the Impact of Temporal and Geographical Locality in Content Caching Systems , 2015, IEEE Transactions on Multimedia.

[25]  Jaime Llorca,et al.  A Methodology for the Design of Self-Optimizing, Decentralized Content-Caching Strategies , 2016, IEEE/ACM Transactions on Networking.

[26]  Mauro Conti,et al.  Poseidon: Mitigating interest flooding DDoS attacks in Named Data Networking , 2013, 38th Annual IEEE Conference on Local Computer Networks.

[27]  Cecilia Mascolo,et al.  Track globally, deliver locally: improving content delivery networks by tracking geographic social cascades , 2011, WWW.

[28]  Xiaojun Cao,et al.  Disseminating Authorized Content in Interest-Centric Opportunistic Social Networks , 2015, 2015 24th International Conference on Computer Communication and Networks (ICCCN).

[29]  Mengjun Xie,et al.  Enhancing cache robustness for content-centric networking , 2012, 2012 Proceedings IEEE INFOCOM.

[30]  Stelios H. Zanakis,et al.  Multi-attribute decision making: A simulation comparison of select methods , 1998, Eur. J. Oper. Res..

[31]  Hongke Zhang,et al.  Decoupling malicious Interests from Pending Interest Table to mitigate Interest Flooding Attacks , 2013, 2013 IEEE Globecom Workshops (GC Wkshps).

[32]  Nikolaos Laoutaris,et al.  Meta algorithms for hierarchical Web caches , 2004, IEEE International Conference on Performance, Computing, and Communications, 2004.

[33]  Muhammad Aamir,et al.  Denial-of-service in content centric (named data) networking: a tutorial and state-of-the-art survey , 2015, Secur. Commun. Networks.

[34]  Yang Li,et al.  A popularity-driven caching scheme with dynamic multipath routing in CCN , 2016, 2016 IEEE Symposium on Computers and Communication (ISCC).

[35]  Thomas R. Henderson,et al.  Network Simulations with the ns-3 Simulator , 2008 .

[36]  Mauro Conti,et al.  A lightweight mechanism for detection of cache pollution attacks in Named Data Networking , 2013, Comput. Networks.