RBFNN: a radial basis function neural network model for detecting and mitigating the cache pollution attacks in named data networking. Issue 5 (22nd September 2020)

• Record Type: Journal Article
• Authors: Buvanesvari, Ramachandira Moorthy; Suresh Joseph, Kanagaraj
• Is Part Of: IET networks. Volume 9:Issue 5(2020)
• Page Start: 255
• Page End: 261
• Publication Date: 2020-09-22
• Subjects: radial basis function networks -- cache storage -- computer network security -- Internet -- neural nets -- protocols; RBFNN -- radial basis function neural network model -- named data networking -- content‐centric networking -- content‐based networking -- data‐oriented networking -- pervasive caching -- cache pollution attack detection -- cache pollution attack mitigation -- NDN -- Internet architecture -- Internet protocol‐based Internet; Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/iet-net.2019.0156
• Languages: English
• ISSNs: 2047-4954

Abstract

Abstract : Named data networking (NDN) corresponds to content‐centric networking, content‐based networking, and data‐oriented networking. Future internet architecture is modelled to overcome the fundamental limitations of the present internet protocol‐based internet and to provide specific strong security. Caching is a key NDN feature in the network. However, pervasive caching strengthens security issues in particular cache pollution assaults including cache poisoning (e.g. presenting malicious content in caches as false‐locality) and cache pollution (e.g. unpopular content is ruined with cache locality as locality‐disruption). In this work, a new cache replacement method based on the radial basis function neural network (RBFNN) is proposed to detect and mitigate the cache pollution attacks in NDN. RBFNN framework is constructed utilising the input associated with the cached content inherent characteristics and output data associated with the content type, i.e. locality‐disruption, false‐locality, and healthy. Experimental results show the efficiency as well as the effectiveness of the proposed method in terms of hit damage ratio and computational time.