Exploiting social relationships for free-riders detection in minimum-delay P2P scalable video streaming

In this paper we describe a game theoretic framework for scalable video streaming over a peer-to-peer network that exploits social relationships. The proposed system integrates optimal resource allocation functionalities with an incentive provision mechanism for data sharing. First of all, we introduce an algorithm for packet scheduling that allows users to download a specific sub-set of the original scalable bit-stream, depending on the current network conditions. Furthermore, we present an algorithm that aims both at identifying free-riders and minimising transmission delay by exploiting social relationships among peers. Non social/uncooperative peers are cut out of this system, while users upload more data to those which have less to share, in order to fully exploit the resources of all the users.