Detecting and mitigating interest flooding attacks in content‐centric network. Issue 4 (10th April 2013)

• Record Type: Journal Article
• Authors: Wang, Kai; Zhou, Huachun; Luo, Hongbin; Guan, Jianfeng; Qin, Yajuan; Zhang, Hongke
• Is Part Of: Security and communication networks. Volume 7:Issue 4(2014:Apr.)
• Page Start: 685
• Page End: 699
• Publication Date: 2013-04-10
• Subjects: Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.770
• Languages: English
• ISSNs: 1939-0114

Abstract

<abstract abstract-type="main"> <title>ABSTRACT</title> <p>The original architecture of content‐centric network (CCN) may suffer from interest flooding attacks. In this paper, we focus on one type of interest flooding attacks called denial of service against content source (DACS attack). To damage CCN, it floods a large number of malicious interests requesting content that does not exist, which guarantees that no cache hit can occur at routers until these malicious interests reach the target content source. Thus, it can directly exhaust the resource of the victim. To counter it, we propose a threshold‐based detecting and mitigating (TDM) scheme. The basic idea is to detect DACS attack on the basis of the frequency that pending interest table items in CCN routers expire (recording this frequency by introducing two counters with their corresponding thresholds and one indicator for counter mode) and to mitigate it by implementing the rate limiter in each router. From the viewpoint of a CCN router, we analyze the performance of TDM in terms of detection ability and effect on mitigating malicious traffic. In addition, we briefly analyze the overhead of TDM. The results show that TDM achieves high detection ability and good effect on mitigating malicious traffic while bringing in small overhead on countering DACS attack. To the best of our knowledge, this is the first attempt to design a detailed scheme embedded with corresponding algorithms on countering this attack. Copyright © 2013 John Wiley & Sons, Ltd.</p> </abstract>