Server guaranteed cap: an incentive mechanism for maximizing streaming quality in heterogeneous overlays

  • Authors:
  • Ilias Chatzidrossos;György Dán;Viktória Fodor

  • Affiliations:
  • School of Electrical Engineering, KTH, Royal Institute of Technology, Stockholm, Sweden;School of Electrical Engineering, KTH, Royal Institute of Technology, Stockholm, Sweden;School of Electrical Engineering, KTH, Royal Institute of Technology, Stockholm, Sweden

  • Venue:
  • NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We address the problem of maximizing the social welfare in a peer-to-peer streaming overlay given a fixed amount of server upload capacity. We show that peers' selfish behavior leads to an equilibrium that is suboptimal in terms of social welfare, because selfish peers are interested in forming clusters and exchanging data among themselves. In order to increase the social welfare we propose a novel incentive mechanism, Server Guaranteed Cap (SGC), that uses the server capacity as an incentive for high contributing peers to upload to low contributing ones. We prove that SGC is individually rational and incentive compatible. We also show that under very general conditions, there exists exactly one server capacity allocation that maximizes the social welfare under SGC, hence simple gradient based method can be used to find the optimal allocation.