Skip to main content
Article thumbnail
Location of Repository

Optimal Peer Selection for Minimum-Delay Peer-to-Peer Streaming with Rateless Codes

By et al. Chuan Wu

Abstract

Due to the limitation of peer upload capacities and high bandwidth demand of multimedia applications, optimal peer selection to construct high-quality streaming topology represents a major challenge in peer-to-peer streaming. In this paper, we propose a fully distributed algorithm to achieve optimal peer selection and streaming rate allocation, which minimizes end-to-end latencies in the streaming sessions. We design this efficient distributed algorithm based on the solution to a linear optimization model, which optimizes towards a latency-related objective to decide the best streaming rates among peers. Combining this optimal peer selection algorithm with our coding scheme based on rateless codes, we obtain a complete, fully decentralized minimum-delay peer-to-peer streaming scheme. Our scheme is resilient to network dynamics that is characteristic in peer-to-peer networks. The validity and effectiveness of our approach are demonstrated in extensive simulations

Topics: C.2.4 [Computer-Communication Networks, Distributed Systems—Distributed Applications, H.3.5 [Information Storage and Retrieval, Online Information Services—Data sharing General Terms Algorithms, Design, Performance Keywords Peer-To-Peer, Media Streaming, Peer Selection, Optimization, Rateless Codes
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.1908
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.comp.nus.edu.sg/~bl... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.