NBCC: Simulation of a new Caching strategy using Naive Bayes Classifier in NDN

Abdelkader Tayeb Herouala, B. Ziani, Kerrache Chaker Abdelaziz, C. Calafate, N. Lagraa, Juan-Carlos Cano
{"title":"NBCC: Simulation of a new Caching strategy using Naive Bayes Classifier in NDN","authors":"Abdelkader Tayeb Herouala, B. Ziani, Kerrache Chaker Abdelaziz, C. Calafate, N. Lagraa, Juan-Carlos Cano","doi":"10.1109/DS-RT55542.2022.9932128","DOIUrl":null,"url":null,"abstract":"Named Data Networking (NDN) is attracting increasing attention from researchers and companies due to its characteristics and its promised results as a better alternative to the current TCP/IP Internet. Among these features are the use of names instead of addresses, and the use of caches in the nodes. Both have proved to be an excellent addition to network functionality that allow receiving information from a nearby location while relieving the pressure on the main servers. Yet, caches are still limited compared to the huge amount of data consumed. Most research has focused on finding and caching the most relevant data, to retrieve it in the future from the nearest point. Most research agrees that the data that needs to be stored is the one that is constantly requested by many consumers, and this theory has been generally effective in most research works. However, high data consumption levels are not always considered important, especially in academic or corporate environment. This is particularly true whenever the consumption of data associated to the institution’s own servers is very low compared to the other data, such as entertainment videos and private messages from social networking sites. Hence, the data that is stored and delivered in a short time is not essential for these institutions. Also, the servers that are discharged from the pressure are not affiliated with these institutions either. The existence of these cases proved by our study on real consumption data belonging to the Amar Telidji University of Laghouat in Algeria, where we found through simulations that only 4% of the overall traffic is associated with data belonging to the university itself. In this paper, we propose a new placement strategy named NBCC (Naive Bayes Classifier for Caching). The NBCC is used to cache the imported data by classifying the received content using a Multinomial Naive Bayes classifier that can classify the received data using only their names. The strategy is shown to be effective and provides the best results compared to other state-of-art strategies.","PeriodicalId":243042,"journal":{"name":"2022 IEEE/ACM 26th International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE/ACM 26th International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DS-RT55542.2022.9932128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Named Data Networking (NDN) is attracting increasing attention from researchers and companies due to its characteristics and its promised results as a better alternative to the current TCP/IP Internet. Among these features are the use of names instead of addresses, and the use of caches in the nodes. Both have proved to be an excellent addition to network functionality that allow receiving information from a nearby location while relieving the pressure on the main servers. Yet, caches are still limited compared to the huge amount of data consumed. Most research has focused on finding and caching the most relevant data, to retrieve it in the future from the nearest point. Most research agrees that the data that needs to be stored is the one that is constantly requested by many consumers, and this theory has been generally effective in most research works. However, high data consumption levels are not always considered important, especially in academic or corporate environment. This is particularly true whenever the consumption of data associated to the institution’s own servers is very low compared to the other data, such as entertainment videos and private messages from social networking sites. Hence, the data that is stored and delivered in a short time is not essential for these institutions. Also, the servers that are discharged from the pressure are not affiliated with these institutions either. The existence of these cases proved by our study on real consumption data belonging to the Amar Telidji University of Laghouat in Algeria, where we found through simulations that only 4% of the overall traffic is associated with data belonging to the university itself. In this paper, we propose a new placement strategy named NBCC (Naive Bayes Classifier for Caching). The NBCC is used to cache the imported data by classifying the received content using a Multinomial Naive Bayes classifier that can classify the received data using only their names. The strategy is shown to be effective and provides the best results compared to other state-of-art strategies.
NDN中基于朴素贝叶斯分类器的缓存策略仿真
命名数据网络(NDN)由于其自身的特点和作为当前TCP/IP互联网更好替代品的预期结果,正吸引着越来越多的研究人员和公司的关注。这些特性包括使用名称而不是地址,以及在节点中使用缓存。事实证明,两者都是对网络功能的绝佳补充,允许从附近位置接收信息,同时减轻主服务器的压力。然而,与消耗的大量数据相比,缓存仍然是有限的。大多数研究都集中在寻找和缓存最相关的数据,以便将来从最近的点检索它。大多数研究一致认为,需要存储的数据是许多消费者不断要求的数据,这一理论在大多数研究工作中普遍有效。然而,高数据消耗水平并不总是被认为是重要的,特别是在学术或企业环境中。与其他数据(如娱乐视频和来自社交网站的私人消息)相比,与机构自己的服务器相关的数据消耗非常低时尤其如此。因此,在短时间内存储和交付的数据对于这些机构来说并不是必需的。而且,被解除压力的服务器也不属于这些机构。我们对阿尔及利亚Laghouat的Amar Telidji大学的真实消费数据的研究证明了这些案例的存在,我们通过模拟发现,只有4%的总流量与属于该大学本身的数据相关。在本文中,我们提出了一种新的放置策略NBCC(朴素贝叶斯缓存分类器)。NBCC用于缓存导入的数据,方法是使用多项式朴素贝叶斯分类器对接收到的内容进行分类,该分类器仅使用接收到的数据的名称对其进行分类。与其他最先进的策略相比,该策略被证明是有效的,并提供了最好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信