A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Can shortest-path routing and TCP maximize utility
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
TCP-AQM protocols can be interpreted as distributed primal-dual algorithms over the Internet to maximize aggregate utility over source rates. In this paper we study whether TCP-AQM together with shortest-path routing can maximize utility over both rates and routes. We show that this is generally impossible because the addition of route maximization makes the problem NPhard. We exhibit an inevitable tradeoff between routing stability and utility maximization. For the special case of ring
doi:10.1109/infcom.2003.1209226
dblp:conf/infocom/WangLLD03
fatcat:xcw2oilmgracfdg63dhgf4nbsm