Exploiting Path Diversity for Thwarting Pollution Attacks in Named Data Networking

被引:38
作者
Guo, Haoran [1 ]
Wang, Xiaodong [1 ]
Chang, Kun [1 ]
Tian, Ye [1 ]
机构
[1] Univ Sci & Technol China, Anhui Key Lab High Performance Comp & Applicat, Sch Comp Sci & Technol, Hefei 230026, Peoples R China
基金
中国国家自然科学基金;
关键词
Future Internet architecture; cache pollution attack; network security;
D O I
10.1109/TIFS.2016.2574307
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:2077 / 2090
页数:14
相关论文
共 37 条
[1]  
Ali K., 2007, Proceedings of the 16th international conference on World Wide Web, WWW '07, P511, DOI [10.1145/1242572.1242642, DOI 10.1145/1242572.1242642]
[2]  
[Anonymous], 2009, P 5 INT C EM NETW EX, DOI [DOI 10.1145/1658939.1658941, 10.1145/1658939.1658941]
[3]  
[Anonymous], 2013, P 2 ACM SIGCOMM WORK
[4]   A lightweight mechanism for detection of cache pollution attacks in Named Data Networking [J].
Conti, Mauro ;
Gasti, Paolo ;
Teoli, Marco .
COMPUTER NETWORKS, 2013, 57 (16) :3178-3191
[5]   Pollution attacks and defenses for Internet caching systems [J].
Deng, Leiwen ;
Gao, Yan ;
Chen, Yan ;
Kumanovic, Aleksandar .
COMPUTER NETWORKS, 2008, 52 (05) :935-956
[6]  
Durand M, 2003, LECT NOTES COMPUT SC, V2832, P605
[7]  
Fayazbakhsh, 2013, ACM SIGCOMM, DOI DOI 10.1145/2534169.2486023
[8]   PROBABILISTIC COUNTING ALGORITHMS FOR DATABASE APPLICATIONS [J].
FLAJOLET, P ;
MARTIN, GN .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 31 (02) :182-209
[9]  
Gasti P., 2013, Computer Communications and Networks (ICCCN), 2013 22nd International Conference on, P1
[10]   Network-Layer Trust in Named-Data Networking [J].
Ghali, Cesar ;
Tsudik, Gene ;
Uzun, Ersin .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2014, 44 (05) :13-19