分散式编码缓存,跨数据和奇偶校验服务器分布式存储

Monolina Dutta;Anoop Thomas;Frank Y. Li
{"title":"分散式编码缓存,跨数据和奇偶校验服务器分布式存储","authors":"Monolina Dutta;Anoop Thomas;Frank Y. Li","doi":"10.1109/LNET.2024.3479914","DOIUrl":null,"url":null,"abstract":"Traditional single server based coded caching may face server saturation and service vulnerability problems. In this letter, we integrate decentralized coded caching with a multi-server architecture comprising both data and parity servers. For file distribution in this network, a method referred to as file stripping is adopted, and a novel file delivery scheme is proposed. Closed-form expressions for the total transmission rate achieved by this scheme are derived, considering all the operational servers along with the worst-case transmission rate amongst these servers. Additionally, a comparative analysis between the proposed scheme and the conventional decentralized coded caching scheme is presented. The simulation results demonstrate the viability of our proposed scheme.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"26-30"},"PeriodicalIF":0.0000,"publicationDate":"2024-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Decentralized Coded Caching With Distributed Storage Across Data and Parity Servers\",\"authors\":\"Monolina Dutta;Anoop Thomas;Frank Y. Li\",\"doi\":\"10.1109/LNET.2024.3479914\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditional single server based coded caching may face server saturation and service vulnerability problems. In this letter, we integrate decentralized coded caching with a multi-server architecture comprising both data and parity servers. For file distribution in this network, a method referred to as file stripping is adopted, and a novel file delivery scheme is proposed. Closed-form expressions for the total transmission rate achieved by this scheme are derived, considering all the operational servers along with the worst-case transmission rate amongst these servers. Additionally, a comparative analysis between the proposed scheme and the conventional decentralized coded caching scheme is presented. The simulation results demonstrate the viability of our proposed scheme.\",\"PeriodicalId\":100628,\"journal\":{\"name\":\"IEEE Networking Letters\",\"volume\":\"7 1\",\"pages\":\"26-30\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Networking Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10715687/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Networking Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10715687/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

传统的基于单服务器的编码缓存可能会面临服务器饱和和服务漏洞问题。在这封信中,我们将分散式编码缓存与由数据服务器和奇偶校验服务器组成的多服务器架构整合在一起。对于该网络中的文件分发,我们采用了一种称为文件剥离的方法,并提出了一种新颖的文件传输方案。考虑到所有运行服务器以及这些服务器之间最坏情况下的传输速率,得出了该方案所实现的总传输速率的闭式表达式。此外,还对所提出的方案和传统的分散编码缓存方案进行了比较分析。模拟结果证明了我们提出的方案是可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Decentralized Coded Caching With Distributed Storage Across Data and Parity Servers
Traditional single server based coded caching may face server saturation and service vulnerability problems. In this letter, we integrate decentralized coded caching with a multi-server architecture comprising both data and parity servers. For file distribution in this network, a method referred to as file stripping is adopted, and a novel file delivery scheme is proposed. Closed-form expressions for the total transmission rate achieved by this scheme are derived, considering all the operational servers along with the worst-case transmission rate amongst these servers. Additionally, a comparative analysis between the proposed scheme and the conventional decentralized coded caching scheme is presented. The simulation results demonstrate the viability of our proposed scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信