Exploiting Path Diversity for Thwarting Pollution Attacks in Named Data Networking
Authors:
- 30 May 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 11 (9) , 2077-2090
Abstract
With information becoming a first-class citizen on the Internet, information-centric networking (ICN) is considered as a promising direction for the future Internet. Named data networking (NDN) is a prominent example of emerging ICN architectures. Unfortunately, NDN is vulnerable to various attacks targeting its in-network caching mechanism. In this paper, we focus on the false-locality pollution attack, in which an adversary repeatedly requests a number of unpopular data objects to waste the precious cache space on the NDN router and to reduce normal users' hit ratios. With simulation experiments, we show that such an attack can cause considerable damage to the NDN network. To detect and mitigate such an attack, we introduce an algorithm that exploits the diversity of the Interest traversing paths within an Internet service provider's point-of-presence network. We also propose inexpensive methodologies based on the probabilistic counting and Bloom filter techniques to implement the algorithm on an NDN router. The experimental results indicate that our proposed algorithm is effective in thwarting false-locality pollution. We also experiment with strategies that the adversary may utilize against our antipollution algorithm and demonstrate that such strategies are either ineffective or impractical in the real world.Keywords
Funding Information
- Strategic Priority Research Program of the Chinese Academy of Sciences (XDA06011201)
- National Natural Science Foundation of China (61202405)
- Anhui Provincial Natural Science Foundation (1608085MF126)
This publication has 32 references indexed in Scilit:
- An Architecture of Content-Centric Networking over Protocol-Oblivious Forwarding2015
- Fast name lookup for Named Data Networking2014
- Scalable Pending Interest Table design: From principles to practice2014
- A lightweight mechanism for detection of cache pollution attacks in Named Data NetworkingComputer Networks, 2013
- Protocol-oblivious forwarding2013
- A reality check for content centric networking2011
- Theory and Practice of Bloom Filters for Distributed SystemsIEEE Communications Surveys & Tutorials, 2011
- Cardinality estimation and dynamic length adaptation for Bloom filtersDistributed and Parallel Databases, 2010
- Loglog Counting of Large Cardinalities2003
- Probabilistic counting algorithms for data base applicationsJournal of Computer and System Sciences, 1985