DocumentCode
2253601
Title
Streaming capacity in P2P VoD systems
Author
He, Yifeng ; Guan, Ling
Author_Institution
Dept. of Electr. & Comput. Eng., Ryerson Univ., Toronto, ON, Canada
fYear
2009
fDate
24-27 May 2009
Firstpage
742
Lastpage
745
Abstract
Peer-to-Peer (P2P) Video-on-Demand (VoD) has become a popular service on the Internet. However current P2P VoD systems can only provide a video at a low streaming rate. The upper bound of the streaming rate that a P2P VoD system can support becomes an attractive topic. In this paper, we investigate the streaming capacity in P2P VoD systems, which is defined as the maximum supported streaming rate that can be received by every receiver. We formulate the streaming capacity problem considering the bandwidth constraints, and find the optimal solution to this problem. Furthermore, we develop a proximal decomposition algorithm to achieve the streaming capacity in a distributed manner. The simulation results demonstrate that the proposed proximal decomposition algorithm can obtain the streaming capacity very close to the optimal result.
Keywords
Internet; media streaming; peer-to-peer computing; video on demand; Internet; P2P VoD systems; peer-to-peer video-on-demand; proximal decomposition algorithm; streaming capacity; Bandwidth; Bismuth; Helium; Peer to peer computing; Streaming media; Upper bound; Video sharing; Watches; Web and internet services; Web server;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2009. ISCAS 2009. IEEE International Symposium on
Conference_Location
Taipei
Print_ISBN
978-1-4244-3827-3
Electronic_ISBN
978-1-4244-3828-0
Type
conf
DOI
10.1109/ISCAS.2009.5117855
Filename
5117855
Link To Document