A Game-Theoretic Data Assignment Scheme for P2PVoD System

Author

Xia, Fang ; Liu, Xingwei ; Liu, Huaping

Author_Institution

Sch. of Math. & Comput. Eng., Xihua Univ., Chengdu, China

fYear

2009

fDate

15-16 May 2009

Firstpage

315

Lastpage

318

Abstract

In the P2PVoD system, the data assignment is in essence a NP-hard issue and it is unable to find a polynomial time optimal algorithm. Meanwhile, selfish behavior of peers is one of the key problems that influence the optimal solution. In this paper, a game-theoretic data assignment scheme is presented.Peers are cooperating with each other in order to maximize social payoff. This scheme is also based on incentive values to make better cooperation. In the experiment, the PlanetLab data is applied for this approach and the results demonstrate the proposed method can accelerate searching speed and optimization rate. Additionally, the stabilization and expansibility of the system is improved.

Keywords

communication complexity; game theory; peer-to-peer computing; video on demand; NP-hard issue; P2PVoD system; game-theoretic data assignment scheme; polynomial time optimal algorithm; video-on-demand; Bandwidth; Computer science education; Mathematics; Network servers; Peer to peer computing; Pervasive computing; Polynomials; Streaming media; Systems engineering education; Ubiquitous computing; Game-Theoretic; PlanetLab; peer-to-peer; video-on-demand;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Ubiquitous Computing and Education, 2009 International Symposium on

Conference_Location

Chengdu

Print_ISBN

978-0-7695-3619-4

Type

conf

DOI

10.1109/IUCE.2009.32

Filename

5223078