Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/26996
Title: SVM-based Analysis for Predicting Success Rate of Interest Packets in Information Centric Networks
Authors: Dutta, N
Tanwar, S
Patel, SK
Ghinea, G
Issue Date: 31-Dec-2021
Publisher: Routledge (Taylor & Francis Group)
Citation: Dutta, N. et al. (2022) 'SVM-based Analysis for Predicting Success Rate of Interest Packets in Information Centric Networks', Applied Artificial Intelligence, 2021, 36 (1), e2020488, pp. 1562 - 1583. doi: 10.1080/08839514.2021.2020488.
Abstract: Copyright © 2022 The Author(s). A consumer in Information Centric Network (ICN) generates an Interest packet by specifying the name of the required content. As the network emphasizes on content retrieval without much bothering about who serves it (a cache location or actual producer), every Content Router (CR) either provides the requested content back to the requester (if exists in its cache) or forwards the Interest packet to the nearest CR. While forwarding an Interest packet, the ICN routing by default does not provide any mechanism to predict the probable location of the content searched. However, having a predictive model before forwarding may significantly improve content retrieval performance. In this paper, a machine learning (ML) algorithm, particularly a Support Vector Machine (SVM) is used to forecast the success of the Interest packet. A CR can then send an Interest packet in the outgoing interface which is forecasted successful. The objective is to maximize the success rate which in turn minimizes content search time and maximizes throughput. The dataset used in is generated from a simulation topology designed in ndnSim comprising 10 K data points having 10 features. The linear, RBF and the polynomial kernel (with degree 3) are used to analyze the dataset. The polynomial kernel shows the best behavior with 98% accuracy. A comparative retrieval time with and without ML demonstrates around 10% improvement with SVM enable forwarding compared to normal ICN forwarding.
URI: https://bura.brunel.ac.uk/handle/2438/26996
DOI: https://doi.org/10.1080/08839514.2021.2020488
ISSN: 0883-9514
Other Identifiers: ORCID iDs: Nitul Dutta https://orcid.org/0000-0002-3399-0042; Gheorghita Ghinea https://orcid.org/0000-0003-2578-5580.
e2020488
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2022 The Author(s). Published with license by Taylor & Francis Group, LLC. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/ licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.3.29 MBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons