Truthful prioritization for dynamic bandwidth sharing

DSpace/Manakin Repository

Truthful prioritization for dynamic bandwidth sharing

Citable link to this page

 

 
Title: Truthful prioritization for dynamic bandwidth sharing
Author: Shnayder, Victor; Parkes, David C.; Kawadia, Vikas; Hoon, Jeremy

Note: Order does not necessarily reflect citation order of authors.

Citation: Shnayder, Victor, Vikas Kawadia, Jeremy Hoon, and David C. Parkes. 2014. Truthful Prioritization for Dynamic Bandwidth Sharing. In Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing, Philadelphia, PA, August 11-14, 2014, 235-244. New York: ACM.
Full Text & Related Files:
Abstract: We design a protocol for dynamic prioritization of data on shared routers such as untethered 3G/4G devices. The mechanism prioritizes bandwidth in favor of users with the highest value, and is incentive compatible, so that users can simply report their true values for network access. A revenue pooling mechanism also aligns incentives for sellers, so that they will choose to use prioritization methods that retain the incentive properties on the buy-side. In this way, the design allows for an open architecture. In addition to revenue pooling, the technical contribution is to identify a class of stochastic demand models and a prioritization scheme that provides allocation monotonicity. Simulation results confirm efficiency gains from dynamic prioritization relative to prior methods, as well as the effectiveness of revenue pooling.
Published Version: doi:10.1145/2632951.2632956
Terms of Use: This article is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#OAP
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:33009648
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters