Can Shortest-path Routing and TCP Maximize Utility

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 network, we prove rigorously that shortest-path routing based purely on congestion prices is unstable. Adding a sufficiently large static component to link cost stabilizes it, but the maximum utility achievable by shortest-path routing decreases with the weight on the static component. We present simulation results to illustrate that these conclusions extend to general network topology, and that rouging instability can reduce utility to less than that achievable by the necessarily stable static rout...

• Type: Conference
• Year: 2003
• Where: INFOCOM
• Authors: Jiantao Wang, Lun Li, Steven H. Low, John Doyle
• Keywords: Communications, INFOCOM 2003, Shortest-path Routing, Shortest-path Routing Decreases, Static Component