在P2P视频点播系统中支持随机搜索的又一个服务器

Qijin Ji, Haojun Zhang, Yanpei Zhu
{"title":"在P2P视频点播系统中支持随机搜索的又一个服务器","authors":"Qijin Ji, Haojun Zhang, Yanpei Zhu","doi":"10.1109/CSIP.2012.6308822","DOIUrl":null,"url":null,"abstract":"In a P2P video-on-demand (VoD) system, the asynchronous characteristic of users' random seeking makes data sharing among peers more challenging, and raises very high capability requirement of the source video server. In this paper, we propose adding one more server in a P2P VoD system to support the random seeking operations and investigate the capacity dimensioning problem for the new server. We use a simple queuing model to characterize the access of users' random seeking data requests to the server and formulate a quantitative relationship between request arrival rate of random seeking and the required bandwidth of the server under longest tolerant waiting time constraint. The numerical results show that only fairly small server capacity is needed to satisfy the bandwidth requirement of random seeking in a P2P VoD system with thousands of users.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"One more server for supporting random seeking in a P2P video-on-demand system\",\"authors\":\"Qijin Ji, Haojun Zhang, Yanpei Zhu\",\"doi\":\"10.1109/CSIP.2012.6308822\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a P2P video-on-demand (VoD) system, the asynchronous characteristic of users' random seeking makes data sharing among peers more challenging, and raises very high capability requirement of the source video server. In this paper, we propose adding one more server in a P2P VoD system to support the random seeking operations and investigate the capacity dimensioning problem for the new server. We use a simple queuing model to characterize the access of users' random seeking data requests to the server and formulate a quantitative relationship between request arrival rate of random seeking and the required bandwidth of the server under longest tolerant waiting time constraint. The numerical results show that only fairly small server capacity is needed to satisfy the bandwidth requirement of random seeking in a P2P VoD system with thousands of users.\",\"PeriodicalId\":193335,\"journal\":{\"name\":\"2012 International Conference on Computer Science and Information Processing (CSIP)\",\"volume\":\"156 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Computer Science and Information Processing (CSIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSIP.2012.6308822\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Computer Science and Information Processing (CSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSIP.2012.6308822","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在P2P视频点播(VoD)系统中,用户随机搜索的异步特性给对等体之间的数据共享带来了很大的挑战,对源视频服务器的性能提出了很高的要求。本文提出在P2P点播系统中增加一个服务器以支持随机查找操作,并研究了新服务器的容量维度问题。我们使用一个简单的排队模型来表征用户随机查找数据请求对服务器的访问,并在最长容忍等待时间约束下,建立了随机查找请求到达率与服务器所需带宽之间的定量关系。数值结果表明,在拥有数千用户的P2P点播系统中,只需很小的服务器容量就能满足随机搜索的带宽需求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
One more server for supporting random seeking in a P2P video-on-demand system
In a P2P video-on-demand (VoD) system, the asynchronous characteristic of users' random seeking makes data sharing among peers more challenging, and raises very high capability requirement of the source video server. In this paper, we propose adding one more server in a P2P VoD system to support the random seeking operations and investigate the capacity dimensioning problem for the new server. We use a simple queuing model to characterize the access of users' random seeking data requests to the server and formulate a quantitative relationship between request arrival rate of random seeking and the required bandwidth of the server under longest tolerant waiting time constraint. The numerical results show that only fairly small server capacity is needed to satisfy the bandwidth requirement of random seeking in a P2P VoD system with thousands of users.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Network information impacting on rural education Scene detection in interference rejection combining algorithm Effects of oversample in tone reservation scheme for PAPR reduction in OFDM systems Efficient clustering index for semantic Web service based on user preference Research on fusion control of cement rotary kiln based on rough set
×
引用
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