NDLI: Incentivizing peer-assisted services: a fluid shapley value approach

Please wait, while we are loading the content...

Practical performance models for complex, popular applications

Elon: enabling efficient and long-term reprogramming for wireless sensor networks

On the flow-level dynamics of a packet-switched network

Optimal recovery of single disk failure in RDP code storage systems

Coloring spatial point processes with applications to peer discovery in large wireless networks

Detecting sources of computer viruses in networks: theory and experiment

Qualitative properties of α-weighted scheduling policies

Randomized load balancing with general service time distributions

Distributed caching over heterogeneous mobile networks

A distributed scheduling algorithm for wireless networks with constant overhead and arbitrary binary interference

A mean field model of work stealing in large-scale systems

Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm

Incentive compatibility and dynamics of congestion control

A query language and runtime tool for evaluating behavior of multi-tier servers

Optimal tradeoff between exposed and hidden nodes in large wireless networks

Incentivizing peer-assisted services: a fluid shapley value approach

CWS: a model-driven scheduling policy for correlated workloads

Load balancing via random local search in closed and open systems

An analytical framework to infer multihop path reliability in MANETs

Successive c-optimal designs: a scalable technique to optimize the measurements on large networks

A unifying approach to product-forms in networks with finite capacity constraints

Self-synchronizing properties of CSMA wireless multi-hop networks

Dynamics in congestion games

Small subset queries and bloom filters using ternary associative memories, with applications

Scheduling in multichannel wireless networks with flow-level dynamics

Leveraging parallelism for multi-dimensional packetclassification on software routers

RSIO: automatic user interaction detection and scheduling

A unified modeling framework for distributed resource allocation of general fork and join processing networks

Channel fragmentation in dynamic spectrum access systems: a theoretical study

Deep diving into BitTorrent locality

Optimality, fairness, and robustness in speed scaling designs

Transparent, lightweight application execution replay on commodity multiprocessor operating systems

Inferring applications at the network layer using collective traffic statistics

The price of anarchy in parallel queues revisited

Optimal propagation of security patches in mobile wireless networks: extended abstract

Managing the cost, energy consumption, and carbon footprint of internet services

Coordinated power management of voltage islands in CMPs

Rigorous statistical analysis of internet loss measurements

Semidefinite optimization for transient analysis of queues

CFTL: a convertible flash translation layer adaptive to data access patterns

A case for unsupervised-learning-based spam filtering

Distributed averaging in dynamic networks

Program behavior prediction using a statistical metric model

Delay optimal queue-based CSMA

Characterizing and modeling user activity on smartphones: summary

Detecting traffic anomalies using an equilibrium property

Characterizing the soft error vulnerability of multicores running multithreaded applications

Can multipath mitigate power law delays?: effects of parallelism on tail performance

Distributed user profiling via spectral methods

Incentivizing peer-assisted services: a fluid shapley value approach

Content Provider	ACM Digital Library
Author	Misra, Vishal Chaintreau, Augustin Massoulié, Laurent Ioannidis, Stratis
Abstract	A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating cost. In contrast with previous uncoordinated peer-to-peer schemes, users opt-in to dedicate part of the resources they own to help the content delivery, in exchange for receiving the same service at a reduced price. Such incentive mechanisms are appealing, as they simplify coordination and accounting. However, they also increase a user's expectation that she will receive a fair price for the resources she provides. Addressing this issue carefully is critical in ensuring that all interested parties--including the provider--are willing to participate in such a system, thereby guaranteeing its stability. In this paper, we take a cooperative game theory approach to identify the ideal incentive structure that follows the axioms formulated by Lloyd Shapley. This ensures that each player, be it the provider or a peer, receives an amount proportional to its contribution and bargaining power when entering the game. In general, the drawback of this ideal incentive structure is its computational complexity. However, we prove that as the number of peers receiving the service becomes large, the Shapley value received by each player approaches a fluid limit. This limit follows a simple closed form expression and can be computed in several scenarios of interest: by applying our technique, we show that several peer-assisted services, deployed on both wired and wireless networks, can benefit from important cost and energy savings with a proper incentive structure that follows simple compensation rules.
Starting Page	215
Ending Page	226
Page Count	12
File Format	PDF
ISBN	9781450300384
DOI	10.1145/1811039.1811064
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-06-14
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Incentive mechanisms Cooperative game theory
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in