A K-rounds Scheduling Algorithm for Live Media Streaming in Peer-to-Peer Networks

In this work, we present a K-rounds scheduling algorithm for live media streaming in P2P networks. We propose a linear programming approach for optimizing the network's throughput while assuming a semi-static network forK rounds. Starting with a group of neighboring peers, each with a set of available media blocks and an upload bandwidth, we device a streaming setting to optimize the overall throughput in the K rounds. We experimentally show the superior performance of our approach in comparison to the random and LRF algorithms

* Research was carried out towards the M.Sc. degree, supervised by Dr. Yosi Keller


10/03/2013 - 14:00
Sara Mirsky
דוא"ל להרשמה: 
Bar Ilan University
building 1103, Room 329