An efficient scheduling algorithm for scalable video streaming over P2P networks

详细信息    查看全文

• 作者：Kai-Lung Hua ; Ge-Ming Chiu ; Hsing-Kuo Pao ; Yi-Chi Cheng
• 关键词：P2P streaming ; Scalable video coding ; Block scheduling algorithm
• 刊名：Computer Networks
• 出版年：2013
• 出版时间：4 October, 2013
• 年：2013
• 卷：57
• 期：14
• 页码：2856-2868
• 全文大小：1049 K

文摘

During recent years, the Internet has witnessed rapid advancement in peer-to-peer (P2P) media streaming. In these applications, an important issue has been the block scheduling problem, which deals with how each node requests the media data blocks from its neighbors. In most streaming systems, peers are likely to have heterogeneous upload/download bandwidths, leading to the fact that different peers probably perceive different streaming quality. Layered (or scalable) streaming in P2P networks has recently been proposed to address the heterogeneity of the network environment. In this paper, we propose a novel block scheduling scheme that is aimed to address the P2P layered video streaming. We define a soft priority function for each block to be requested by a node in accordance with the block¡¯s significance for video playback. The priority function is unique in that it strikes good balance between different factors, which makes the priority of a block well represent the relative importance of the block over a wide variation of block size between different layers. The block scheduling problem is then transformed to an optimization problem that maximizes the priority sum of the delivered video blocks. We develop both centralized and distributed scheduling algorithms for the problem. Simulation of two popular scalability types has been conducted to evaluate the performance of the algorithms. The simulation results show that the proposed algorithm is effective in terms of bandwidth utilization and video quality.