Please use this identifier to cite or link to this item:

Optimizing Substream Scheduling for Peer-to-Peer Live Streaming

Authors Chan, K. H. Kelvin
Chan, Gary Shueng Han View this author's profile
Begen, Ali C.
Issue Date 2010
Summary In peer-to-peer (P2P) live streaming using unstructured mesh, packet scheduling is an important factor on overall playback delay. The hybrid pull-push approach has been recently proposed to reduce delay compared to classical pulling method. In this approach, video are divided into substreams and packets are pushed with low delay. There has been little work addressing the scheduling problem on substream assignment. In this paper, we study the scheduling problem on assigning substreams to minimize packet delay. Given heterogeneous contents, delays and bandwidths of parents, we formulate the Substream Assignment (SA) problem to assign substreams to parents with minimum delay. The SA problem can be optimally solved in polynomial time by transforming it into a Max-Weighted Bipartite Matching problem. Simulation results show that our distributed algorithm achieves substantially lower delay as compared with traditional pull and current hybrid pull-push approaches based on greedy algorithm.
ISBN 9781424451753
Rights © 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Language English
Format Conference paper
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
optim_sub.pdf 235524 B Adobe PDF