Incentive compatibility and dynamics of congestion control
Authors:
Open Access
- 12 June 2010
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 38 (1) , 95-106
Abstract
His 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 complex dynamics which do not appear in the simple topologies studied in past work.Keywords
This publication has 21 references indexed in Scilit:
- A BGP-based mechanism for lowest-cost routingDistributed Computing, 2005
- Selfish behavior and stability of the internet:ACM SIGCOMM Computer Communication Review, 2002
- Sharing the Cost of Multicast TransmissionsJournal of Computer and System Sciences, 2001
- Algorithmic Mechanism DesignGames and Economic Behavior, 2001
- Resource pricing and the evolution of congestion controlAutomatica, 1999
- Promoting the use of end-to-end congestion control in the InternetIEEE/ACM Transactions on Networking, 1999
- Dynamics of random early detectionACM SIGCOMM Computer Communication Review, 1997
- Charging and rate control for elastic trafficEuropean Transactions on Telecommunications, 1997
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993