2010
DOI: 10.1007/978-3-642-12963-6_25
|View full text |Cite
|
Sign up to set email alerts
|

Server Guaranteed Cap: An Incentive Mechanism for Maximizing Streaming Quality in Heterogeneous Overlays

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 contribu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2010
2010
2015
2015

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 17 publications
0
8
0
Order By: Relevance
“…An unbalanced data exchange is a problem that decreases a P2P system's potential performance in terms of bandwidth utilization [13][14][15][16]. Both the unwillingness to share by users and inferior data exchanges as a result of the distributed algorithms form a huge challenge when designing a P2P streaming applications.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…An unbalanced data exchange is a problem that decreases a P2P system's potential performance in terms of bandwidth utilization [13][14][15][16]. Both the unwillingness to share by users and inferior data exchanges as a result of the distributed algorithms form a huge challenge when designing a P2P streaming applications.…”
Section: Related Workmentioning
confidence: 99%
“…Constraint (14) ensures that when a destination node d receives video layer l i+1 , also, video layer l i is received on one of d's direct incoming links. Constraint (15) imposes that when a destination node d receives layer l, there must be (at least) a virtual path starting from the injector node z.…”
Section: Injector and Destination Node Constraintsmentioning
confidence: 99%
“…Silverston et al [17] proposed a different incentive mechanism where peers unable to serve data should answer with pointers to other peers that are able to serve. Chatzidrossos et al [4] argued that many noncooperative peers are unable to upload as much data as they download due asymmetric DSL or HSDPA connections. To maximize the social welfare, they proposed to reserve a fraction of server upload bandwidth to altruistic peers that upload more data than they download.…”
Section: Related Workmentioning
confidence: 99%
“…There are various techniques for detecting non-cooperative peers [2,8,14] and incentivizing peer cooperation [4,16,17] in live streaming applications. Our motivation for investigating the benefit of exploiting centrality metrics for that purposes lies in the observation that many P2P live applications keep a centralized server (tracker) that periodically receives control messages from each peer.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation