Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 2007 | Published
Book Section - Chapter Open

Reverse Engineering TCP/IP-like Networks using Delay-Sensitive Utility Functions


TCP/IP can be interpreted as a distributed primal-dual algorithm to maximize aggregate utility over source rates. It has recently been shown that an equilibrium of TCP/IP, if it exists, maximizes the same delay-insensitive utility over both source rates and routes, provided pure congestion prices are used as link costs in the shortest-path calculation of IP. In practice, however, pure dynamic routing is never used and link costs are weighted sums of both static as well as dynamic components. In this paper, we introduce delay-sensitive utility functions and identify a class of utility functions that such a TCP/IP equilibrium optimizes. We exhibit some counter-intuitive properties that any class of delay-sensitive utility functions optimized by TCP/IP necessarily possess. We prove a sufficient condition for global stability of routing updates for general networks. We construct example networks that defy conventional wisdom on the effect of link cost parameters on network stability and utility.

Additional Information

© 2007 IEEE. Issue Date: 6-12 May 2007; Date of Current Version: 29 May 2007.

Attached Files

Published - Pongsajapan2007p9289Ieee_Infocom_2009_-_Ieee_Conference_On_Computer_Communications_Vols_1-5.pdf



Additional details

August 19, 2023
October 20, 2023