简短声明:点对点视频点播系统的自适应内容放置

Bo Tan, L. Massoulié
{"title":"简短声明:点对点视频点播系统的自适应内容放置","authors":"Bo Tan, L. Massoulié","doi":"10.1145/1835698.1835771","DOIUrl":null,"url":null,"abstract":"In this paper, we address the problem of content placement in peer-to-peer systems, with the objective of maximizing the utilization of peers' uplink bandwidth resources. We consider system performance under a many-user asymptotic. We identify optimal content placement strategies in a particular scenario of limited content catalogue, casting the problem into the framework of loss networks. We then turn to an alternative \"large catalogue\" scaling where the catalogue size grows with the peer population. Relating the system performance to properties of a specific random graph model, we establish a content placement strategy which again maximizes system performance, provided storage space per peer grows unboundedly, although arbitrarily slowly, with system size.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Brief announcement: adaptive content placement for peer-to-peer video-on-demand systems\",\"authors\":\"Bo Tan, L. Massoulié\",\"doi\":\"10.1145/1835698.1835771\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address the problem of content placement in peer-to-peer systems, with the objective of maximizing the utilization of peers' uplink bandwidth resources. We consider system performance under a many-user asymptotic. We identify optimal content placement strategies in a particular scenario of limited content catalogue, casting the problem into the framework of loss networks. We then turn to an alternative \\\"large catalogue\\\" scaling where the catalogue size grows with the peer population. Relating the system performance to properties of a specific random graph model, we establish a content placement strategy which again maximizes system performance, provided storage space per peer grows unboundedly, although arbitrarily slowly, with system size.\",\"PeriodicalId\":447863,\"journal\":{\"name\":\"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1835698.1835771\",\"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 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1835698.1835771","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

在本文中,我们解决了对等系统中的内容放置问题,目标是最大化地利用对等体的上行带宽资源。我们考虑在多用户渐近下的系统性能。我们在有限内容目录的特定场景中确定了最佳内容放置策略,将问题置于损失网络的框架中。然后,我们转向另一种“大目录”缩放,其中目录大小随着对等人口的增长而增长。将系统性能与特定随机图模型的属性联系起来,我们建立了一个内容放置策略,该策略再次最大化系统性能,提供每个对等体的存储空间随系统大小无限增长,尽管速度任意缓慢。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Brief announcement: adaptive content placement for peer-to-peer video-on-demand systems
In this paper, we address the problem of content placement in peer-to-peer systems, with the objective of maximizing the utilization of peers' uplink bandwidth resources. We consider system performance under a many-user asymptotic. We identify optimal content placement strategies in a particular scenario of limited content catalogue, casting the problem into the framework of loss networks. We then turn to an alternative "large catalogue" scaling where the catalogue size grows with the peer population. Relating the system performance to properties of a specific random graph model, we establish a content placement strategy which again maximizes system performance, provided storage space per peer grows unboundedly, although arbitrarily slowly, with system size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信