By Topic

One more server for supporting random seeking in a P2P video-on-demand system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Qi-jin Ji ; School of Computer Science and Technology, Soochow University, Suzhou, China ; Hao-jun Zhang ; Yan-qin Zhu

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.

Published in:

Computer Science and Information Processing (CSIP), 2012 International Conference on

Date of Conference:

24-26 Aug. 2012