• DocumentCode
    1695907
  • Title

    Differentiated Bandwidth Allocation for Reducing Server Load in P2P VOD

  • Author

    Chen, Zhengjun ; Xue, Kaiping ; Hong, Peilin ; Hancheng Lu

  • Author_Institution
    EEIS Dept., Univ. of Sci. & Technol. of China, Hefei, China
  • fYear
    2009
  • Firstpage
    31
  • Lastpage
    36
  • Abstract
    P2P technology offers a promising scalable solution for video-on-demand (VOD) service. Recent studies have found that departure misses are the major cause of server load in P2P-based VOD. Inspired by this finding, this paper addresses the design of bandwidth allocation policy to decrease departure misses and thereby reduce server load further. We first formulate the minimum departure misses problem. Then we propose a centralized algorithm which serves as our benchmark for all other schemes. The centralized algorithm makes use of surplus bandwidth to help peers prefetch chunks, thus reducing departure misses significantly. We then propose a distributed bandwidth allocation algorithm in which a stable peer with higher playback position is able to obtain a larger share of parentspsila upload bandwidth. A simple predictor is developed for stable node identification. Simulation results show that our distributed protocol outperforms traditional approach, and close to the centralized one.
  • Keywords
    bandwidth allocation; peer-to-peer computing; protocols; video on demand; P2P VOD technology; centralized algorithm; differentiated bandwidth allocation; distributed protocol; server load reduction; video-on-demand; Bandwidth; Channel allocation; Computer networks; Grid computing; Multimedia computing; Network servers; Peer to peer computing; Prefetching; Streaming media; Web server; P2P video-on-demand; bandwidth allocation; departure misses; stability predictor;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Grid and Cooperative Computing, 2009. GCC '09. Eighth International Conference on
  • Conference_Location
    Lanzhou, Gansu
  • Print_ISBN
    978-0-7695-3766-5
  • Type

    conf

  • DOI
    10.1109/GCC.2009.42
  • Filename
    5280104