In recent years, mesh-pull peer-to-peer streaming systems are popular. However, the service providers of these systems have to pay high expense for the high consumption of servers’ bandwidth. Therefore, the research on providing better video quality with limited supply of bandwidth is very meaningful. However, there are few works focusing on this topic. In this paper, we analyzed the optimal throughput scheduling problem, and proposed a near optimal scheduling algorithm BBS and an effective heuristic MRBF, they eliminate or reduce scheduling waste significantly and get high throughput. The results of extensive simulations shows: our solution can provide better streaming quality or sustain higher streaming rate with limited supply of bandwidth than existing scheduling methods.

Date Published: 13 March 2013
PDF: 8 pages
Proc. SPIE 8784, Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies, 87842M (13 March 2013); doi: 10.1117/12.2021230

Published in SPIE Proceedings Vol. 8784:
Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies
Yulin Wang; Liansheng Tan; Jianhong Zhou, Editor(s)