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 June 2005 | public
Journal Article Open

Cross-layer optimization in TCP/IP networks

Abstract

TCP-AQM can be interpreted as distributed primal-dual algorithms to maximize aggregate utility over source rates. We show that an equilibrium of TCP/IP, if exists, maximizes aggregate utility over both source rates and routes, provided congestion prices are used as link costs. An equilibrium exists if and only if this utility maximization problem and its Lagrangian dual have no duality gap. In this case, TCP/IP incurs no penalty in not splitting traffic across multiple paths. Such an equilibrium, however, can be unstable. It can be stabilized by adding a static component to link cost, but at the expense of a reduced utility in equilibrium. If link capacities are optimally provisioned, however, pure static routing, which is necessarily stable, is sufficient to maximize utility. Moreover single-path routing again achieves the same utility as multipath routing at optimality.

Additional Information

© Copyright 2005 IEEE. Reprinted with permission. Manuscript received December 30, 2002; revised June 12, 2004; approved by IEEE/ACMTRANSACTIONS ON NETWORKING Editor R. Srikant. [Posted online: 2005-06-27] This work is part of the FAST project funded by the National Science Foundation, the Caltech Lee Center for Advanced Networking, the Army Research Office (ARO), the Air Force Office of Scientific Research (AFOSR), the Defense Advanced Research Projects Agency (DARPA), and Cisco. Partial and preliminary results appeared in the Proceedings of IEEE INFOCOM, San Francisco, CA, April 2003. The authors thank C. Umans of Caltech for the interpretation of Theorem 3. They also thank the anonymous reviewers, whose comments motivated most of the results in Section III, and for supplying several references in the theoretical computer science literature.

Files

WANieeeacmtn05.pdf
Files (592.0 kB)
Name Size Download all
md5:704f491ef9bcfbdefb2f4124cc0173a1
592.0 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023