• DocumentCode
    2932261
  • Title

    Improving the streaming capacity in P2P VoD systems with helpers

  • Author

    He, Yifeng ; Guan, Ling

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Ryerson Univ., Toronto, ON, Canada
  • fYear
    2009
  • fDate
    June 28 2009-July 3 2009
  • Firstpage
    790
  • Lastpage
    793
  • Abstract
    Peer-to-peer (P2P) video-on-demand (VoD) is a promising solution to provide video service to a large number of users. Streaming capacity in a P2P VoD system is defined as the maximal streaming rate that every user can receive. Due to the upload bottleneck, the streaming capacity in the P2P VoD system is limited. In this paper, we introduce helpers in the P2P VoD system and then optimize the helper resources to improve the streaming capacity. Specifically, we first optimize the helper assignment using a greedy algorithm. Then we develop a proximal distributed algorithm to maximize the streaming capacity by optimizing the link rates. Through simulations, we demonstrate that the P2P VoD system with optimized helpers can obtain a much higher streaming capacity compared to the P2P VoD system without any helper or the one with randomly assigned helpers.
  • Keywords
    distributed algorithms; greedy algorithms; peer-to-peer computing; video on demand; video streaming; P2P VoD system helpers; greedy algorithm; helper assignment; peer-to-peer systems; proximal distributed algorithm; randomly assigned helpers; streaming capacity; upload bottleneck; video service; video-on-demand systems; Bandwidth; Distributed algorithms; Greedy algorithms; Helium; Peer to peer computing; Scalability; Streaming media; Video on demand; Web and internet services; Web server; Peer-to-peer video on demand; helper; optimization; streaming capacity;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multimedia and Expo, 2009. ICME 2009. IEEE International Conference on
  • Conference_Location
    New York, NY
  • ISSN
    1945-7871
  • Print_ISBN
    978-1-4244-4290-4
  • Electronic_ISBN
    1945-7871
  • Type

    conf

  • DOI
    10.1109/ICME.2009.5202613
  • Filename
    5202613