Sciweavers

Share
SIGMETRICS
2010
ACM

Incentive compatibility and dynamics of congestion control

9 years 4 months ago
Incentive compatibility and dynamics of congestion control
This paper studies under what conditions congestion control schemes can be both efficient, so that capacity is not wasted, and incentive compatible, so that each participant can maximize its utility by following the prescribed protocol. We show that both conditions can be achieved if routers run strict priority queueing (SPQ) or weighted fair queueing (WFQ) and end-hosts run any of a family of protocols which we call Probing Increase Educated Decrease (PIED). A natural question is whether incentive compatibility and efficiency are possible while avoiding the per-flow processing of WFQ. We partially address that question in the negative by showing that any policy satisfying a certain “locality” condition cannot guarantee both properties. Our results also have implication for convergence to some steady-state throughput for the flows. Even when senders transmit at a fixed rate (as in a UDP flow which does not react to congestion), feedback effects among the routers can result in...
Brighten Godfrey, Michael Schapira, Aviv Zohar, Sc
Added 18 Jul 2010
Updated 18 Jul 2010
Type Conference
Year 2010
Where SIGMETRICS
Authors Brighten Godfrey, Michael Schapira, Aviv Zohar, Scott Shenker
Comments (0)
books