友对友网络中分布式缓存管理的模拟器

Keynan Pratt, C. Williamson
{"title":"友对友网络中分布式缓存管理的模拟器","authors":"Keynan Pratt, C. Williamson","doi":"10.1145/2901378.2901398","DOIUrl":null,"url":null,"abstract":"Multimedia streaming services such as YouTube and Netflix consume a staggering amount of Internet bandwidth [1]. Furthermore, traditional mechanisms such as proxy caches, content distribution networks, and redundant traffic elimination are rendered ineffective by copyright concerns, regulatory issues, and the growing prevalence of end-to-end encryption. One possible solution is a peer-to-peer caching system with social relationships at the core of its topology construction. A social topology carries an implicit level of trust, and induces a relatively high degree of correlation between users that can be exploited by the system as a whole. For example, two users with shared interests are more likely to have relevant videos in cache for each other. This short paper discusses the design of a simulator for such a system to provide insight into the performance of different cache management policies.","PeriodicalId":325258,"journal":{"name":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Simulator for Distributed Cache Managementin Friend-to-Friend Networks\",\"authors\":\"Keynan Pratt, C. Williamson\",\"doi\":\"10.1145/2901378.2901398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multimedia streaming services such as YouTube and Netflix consume a staggering amount of Internet bandwidth [1]. Furthermore, traditional mechanisms such as proxy caches, content distribution networks, and redundant traffic elimination are rendered ineffective by copyright concerns, regulatory issues, and the growing prevalence of end-to-end encryption. One possible solution is a peer-to-peer caching system with social relationships at the core of its topology construction. A social topology carries an implicit level of trust, and induces a relatively high degree of correlation between users that can be exploited by the system as a whole. For example, two users with shared interests are more likely to have relevant videos in cache for each other. This short paper discusses the design of a simulator for such a system to provide insight into the performance of different cache management policies.\",\"PeriodicalId\":325258,\"journal\":{\"name\":\"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2901378.2901398\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2901378.2901398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

YouTube和Netflix等多媒体流媒体服务消耗了惊人的互联网带宽[1]。此外,由于版权问题、监管问题和端到端加密的日益流行,代理缓存、内容分发网络和冗余流量消除等传统机制变得无效。一种可能的解决方案是点对点缓存系统,其拓扑结构的核心是社会关系。社会拓扑承载了一种隐含的信任级别,并在用户之间诱导了一种相对高度的相关性,这种相关性可以被整个系统利用。例如,两个有共同兴趣的用户更有可能在缓存中为彼此提供相关的视频。这篇短文讨论了这样一个系统的模拟器的设计,以便深入了解不同缓存管理策略的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Simulator for Distributed Cache Managementin Friend-to-Friend Networks
Multimedia streaming services such as YouTube and Netflix consume a staggering amount of Internet bandwidth [1]. Furthermore, traditional mechanisms such as proxy caches, content distribution networks, and redundant traffic elimination are rendered ineffective by copyright concerns, regulatory issues, and the growing prevalence of end-to-end encryption. One possible solution is a peer-to-peer caching system with social relationships at the core of its topology construction. A social topology carries an implicit level of trust, and induces a relatively high degree of correlation between users that can be exploited by the system as a whole. For example, two users with shared interests are more likely to have relevant videos in cache for each other. This short paper discusses the design of a simulator for such a system to provide insight into the performance of different cache management policies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信