Title
Truthful prioritization for dynamic bandwidth sharing
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.
Year
DOI
Venue
2014
10.1145/2632951.2632956
MobiHoc
Keywords
Field
DocType
bandwidth sharing,mechanism design,miscellaneous
Revenue,Incentive compatibility,Incentive,Open architecture,Computer science,Pooling,Computer network,Mechanism design,Dynamic bandwidth allocation,Access network
Conference
Citations 
PageRank 
References 
0
0.34
15
Authors
4
Name
Order
Citations
PageRank
Victor Shnayder11393117.15
David C. Parkes23293342.69
Vikas Kawadia323619.43
Jeremy Hoon4271.51