Optimal prefetching scheme in P2P VoD applications with guided seeks

  • Authors:

  • Yifeng He;Guobin Shen;Yongqiang Xiong;Ling Guan

  • Affiliations:

  • Ryerson University, Toronto, ON, Canada;Microsoft Research Asia, Beijing, China;Microsoft Research Asia, Beijing, China;Ryerson University, Toronto, ON, Canada

  • Venue:
  • IEEE Transactions on Multimedia
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

It has been well recognized as an efficient approach for broadcasting popular videos by partitioning a video data stream into multiple segments and launching each segment through an individual channel simultaneously and periodically. Based on the design premises, some recent studies, including skyscraper broadcasting (SkB), client-centric approach (CCA), greedy disk-conserving broadcasting (GDB), and reverse fast broadcasting (RFB) schemes, etc., have been reported. To study the client segment downloading process, this paper first introduces an applicable sequence-based broadcasting model that can be used to minimize the required buffer size. By extending RFB, this paper further proposes a reverse sequence-based broadcasting model, which can generally improve the existing schemes such as SkB, CCA, GDB, and FB in terms of the relaxed client buffer size. To have a deeper understanding on the proposed reverse model, the upper bound of the client buffer requirement is obtained through a comprehensive analysis, which is proved to be much smaller than the conventional sequence model by 25% to 50%. Based on the proposed reverse model, a reverse sequence-based broadcasting scheme is developed for achieving smaller delay than CCA and GDB.