{"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}
引用次数: 0
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.