|
|
|
| Game Theoretical Bandwidth Request Allocation Policy in P2P Streaming Network |
| Chen Zhuo①③ Feng Gang① Zhou Jiang① Zhou Yang② |
①(National Key Laboratory of Science and Technology on Communications, University of Electronic Science and Technology of China, Chengdu 611731, China)
②(College of Computing, Georgia Institute of Technology, Atlanta GA 30332, USA)
③(College of Computer Science and Engineering, Chongqing University of Technology, Chongqing 400054, China) |
|
|
|
|
Abstract Due to the merits of lower bandwidth consumption at streaming server and higher scalability, P2P streaming systems are widely adopted and deployed. However, the heterogeneity of bandwidth resource and playback position at peers may easily lead to load unbalancing problem. This may severely deteriorate video playback quality at peers. This paper focuses on the issue of bandwidth request allocation, aiming at substantially balancing the load at the peers in P2P streaming network. The problem of contending service from multiple neighboring peers is modeled as a non-cooperative game, and the optimal bandwidth request allocation policy, called Game based Bandwidth Request Allocation (GBRA), is obtained through searching the Nash equilibrium of this game. Numerical results show that the proposed policy can effectively improve the load balancing of the P2P streaming networks and decrease the latency of streaming data retrieval at peers when compared with the classical bandwidth request allocation policies.
|
|
Received: 07 December 2012
|
|
|
|
Corresponding Authors:
Chen Zhuo
E-mail: chenzhuo@cqut.edu.cn
|
|
|
|
|
|
|
2013, Vol. 35 
