ICN缓存策略CDO的缓存阈值设计

Kota Tohno, Ryo Nakamura, N. Kamiyama
{"title":"ICN缓存策略CDO的缓存阈值设计","authors":"Kota Tohno, Ryo Nakamura, N. Kamiyama","doi":"10.1109/ICOIN50884.2021.9333943","DOIUrl":null,"url":null,"abstract":"In recent years, Information-Centric Networking (ICN) which mainly focuses on the transferred data rather than the sending and receiving hosts has attracted attention. To realize ICN as a future Internet architecture, it is required that ICN is robust against network failures such as a disaster and errors of network equipments. In our previous work, we proposed a caching strategy called CDO (Caching based on Distance to Originals), which achieves the high content availability at network failure in ICN. In the CDO, a router caches a content only when the hop distance between the origin of the content and itself is greater than or equal to a given caching threshold. However, in our previous work, we focused on only maximizing the AMDC (Average Maximum hop Distance to Caching copies) which leads to the content availability at the network failure, and did not sufficiently consider the cache hit ratio, i.e., the probability that the requested content is returned from one of routers. Therefore, in this paper, we study how to design the caching threshold of the CDO, which aimed at achieving the high AMDC and the high cache hit ratio using the CDO. Especially, we consider the optimal design method of caching threshold using a weighted sum and the design method of caching threshold for each content. As a result of investigating the effectiveness of the two types of the design methods through experiments, we show that the cache hit ratio can be significantly improved while maintaining the high AMDC by appropriately designing the caching threshold of the CDO.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"110 1","pages":"615-620"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On Design of Caching Threshold of Caching Strategy CDO for ICN\",\"authors\":\"Kota Tohno, Ryo Nakamura, N. Kamiyama\",\"doi\":\"10.1109/ICOIN50884.2021.9333943\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, Information-Centric Networking (ICN) which mainly focuses on the transferred data rather than the sending and receiving hosts has attracted attention. To realize ICN as a future Internet architecture, it is required that ICN is robust against network failures such as a disaster and errors of network equipments. In our previous work, we proposed a caching strategy called CDO (Caching based on Distance to Originals), which achieves the high content availability at network failure in ICN. In the CDO, a router caches a content only when the hop distance between the origin of the content and itself is greater than or equal to a given caching threshold. However, in our previous work, we focused on only maximizing the AMDC (Average Maximum hop Distance to Caching copies) which leads to the content availability at the network failure, and did not sufficiently consider the cache hit ratio, i.e., the probability that the requested content is returned from one of routers. Therefore, in this paper, we study how to design the caching threshold of the CDO, which aimed at achieving the high AMDC and the high cache hit ratio using the CDO. Especially, we consider the optimal design method of caching threshold using a weighted sum and the design method of caching threshold for each content. As a result of investigating the effectiveness of the two types of the design methods through experiments, we show that the cache hit ratio can be significantly improved while maintaining the high AMDC by appropriately designing the caching threshold of the CDO.\",\"PeriodicalId\":6741,\"journal\":{\"name\":\"2021 International Conference on Information Networking (ICOIN)\",\"volume\":\"110 1\",\"pages\":\"615-620\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Information Networking (ICOIN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN50884.2021.9333943\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN50884.2021.9333943","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

近年来,信息中心网络(Information-Centric Networking, ICN)引起了人们的关注,它主要关注传输的数据而不是发送和接收主机。为了使ICN成为未来的互联网架构,要求ICN对网络故障(如网络设备的灾难和错误)具有鲁棒性。在我们之前的工作中,我们提出了一种名为CDO (caching based on Distance to Originals)的缓存策略,实现了ICN在网络故障时的高内容可用性。在CDO中,只有当内容源与路由器之间的跳距大于或等于给定的缓存阈值时,路由器才会缓存内容。然而,在我们之前的工作中,我们只关注最大化导致网络故障时内容可用性的AMDC(到缓存副本的平均最大跳距离),而没有充分考虑缓存命中率,即请求的内容从其中一个路由器返回的概率。因此,本文研究了如何设计CDO的缓存阈值,旨在利用CDO实现高AMDC和高缓存命中率。特别地,我们考虑了基于加权和的缓存阈值优化设计方法和针对每个内容的缓存阈值设计方法。通过实验考察了两种设计方法的有效性,结果表明,通过合理设计CDO的缓存阈值,可以在保持较高AMDC的同时显著提高缓存命中率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On Design of Caching Threshold of Caching Strategy CDO for ICN
In recent years, Information-Centric Networking (ICN) which mainly focuses on the transferred data rather than the sending and receiving hosts has attracted attention. To realize ICN as a future Internet architecture, it is required that ICN is robust against network failures such as a disaster and errors of network equipments. In our previous work, we proposed a caching strategy called CDO (Caching based on Distance to Originals), which achieves the high content availability at network failure in ICN. In the CDO, a router caches a content only when the hop distance between the origin of the content and itself is greater than or equal to a given caching threshold. However, in our previous work, we focused on only maximizing the AMDC (Average Maximum hop Distance to Caching copies) which leads to the content availability at the network failure, and did not sufficiently consider the cache hit ratio, i.e., the probability that the requested content is returned from one of routers. Therefore, in this paper, we study how to design the caching threshold of the CDO, which aimed at achieving the high AMDC and the high cache hit ratio using the CDO. Especially, we consider the optimal design method of caching threshold using a weighted sum and the design method of caching threshold for each content. As a result of investigating the effectiveness of the two types of the design methods through experiments, we show that the cache hit ratio can be significantly improved while maintaining the high AMDC by appropriately designing the caching threshold of the CDO.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Study on the Cluster-wise Regression Model for Bead Width in the Automatic GMA Welding GDFed: Dynamic Federated Learning for Heterogenous Device Using Graph Neural Network A Solution for Recovering Network Topology with Missing Links using Sparse Modeling Real-time health monitoring system design based on optical camera communication Multimedia Contents Retrieval based on 12-Mood Vector
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1