Jiantao Wang Lun Li Steven H. Low John C. Doyle California Institute of...  Home/Search
Context Related
| caltech.edu/pub/papers/tcpip.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: caltech.edu/pub/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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. (Update)
Cited by: More
Search Strategies in Inter-Domain Traffic Engineering - Chandrayana, Zhang.. (2002) (Correct)
Max-Min Overlay Multicast: Rate Allocation and Tree.. - Cui, Xue, Nahrstedt (2004) (Correct)
To Layer or Not To Layer: Balancing Transport and Physical Layers .. - Chiang (2004) (Correct)
Similar documents (at the sentence level):
50.7%: Can Shortest-path Routing and TCP Maximize Utility - Wang, Li, Low, Doyle (2003) (Correct)
Active bibliography (related documents): More All
0.7: FAST Protocols: Theory, Implementation, Experiment.. - Low, Almes.. (2003) (Correct)
0.2: A Low-Overhead Rate Control Algorithm for Maximizing.. - Kar, Sarkar, Tassiulas (2000) (Correct)
0.2: A Scalable, Low-Overhead Rate Control Algorithm for.. - Kar, Sarkar, Tassiulas (2002) (Correct)
Similar documents based on text: More All
0.3: Maximum and Asymptotic UDP Throughput under CHOKe - Wang, Tang, Low (2002) (Correct)
0.3: Linear Stability of TCP/RED and a Scalable Control - Low, Paganini, Wang, Doyle (2003) (Correct)
0.3: Dynamics of TCP/RED and a Scalable Control - Low, Paganini, Wang, Adlakha.. (2002) (Correct)
Related documents from co-citation: More All
2: Distributed Admission Control to Support Guaranteed Services in Core-stateless N.. - Bhatnagar, Badrinath - 2003
2: A unifying passivity framework for network flow control - Wen, Arcak - 2002
2: Dynamic load balancing through coordinated scheduling in packet data systems - Das, Viswanathan et al. - 2003
BibTeX entry: (Update)
J. Wang, L. Li, S. H. Low, and J. C. Doyle, "Can shortestpath routing and tcp maximize utility," in INFOCOM '03, San Fransisco, April 2003. http://citeseer.ist.psu.edu/wang03can.html More
@misc{ wang03can,
author = "J. Wang and L. Li and S. Low and J. Doyle",
title = "Can shortestpath routing and tcp maximize utility",
text = "J. Wang, L. Li, S. H. Low, and J. C. Doyle, Can shortestpath routing and
tcp maximize utility, in INFOCOM '03, San Fransisco, April 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/wang03can.html" }
Citations (may not include all citations):463 Rate control for communication networks: Shadow prices - Kelly, Maulloo et al. - 1998
461 Nonlinear Programming (context) - Bertsekas - 1995
335 Routing of multipoint connections (context) - Waxman - 1988
84 Bandwidth sharing: objectives and algorithms (context) - Massoulie, Roberts - 1999
83 End--to--end congestion control schemes: utility functions - Kunniyur, Srikant - 2000
73 IEEEACM Transaction Networking (context) - Low, Optimization et al. - 1999
53 A duality model of TCP and queue management algorithms - Low - 2003
41 Understanding Vegas: a duality model - Low, Peterson et al. - 2002
31 Linear and Nonlinear Programming (context) - Luenberger - 1984
27 Dynamic behavior of shortest path routing algorithms for com.. (context) - Bertsekas - 1982
22 Optimization based rate control for multirate multicast sess.. - Kar, Sarkar et al. - 2001
21 Fair end-to-end window-based congestion control - Mo, Walrand - 2000
13 Flow control and routing algorithms for data networks (context) - Gallager, Golestani - 1980
7 Congestion control for fair resource allocation in networks .. - Deb, Srikant - 2001
5 Optimization based rate control for multipath sessions (context) - Kar, Sarkar et al. - 2001
2 Compueters and intractability: a guide to the theory of NP-c.. (context) - Garey, Johnson - 1979
2 Dynamic behavior of a class of adaptive routing protocols (context) - Low, Varaiya - 1993
2 Can TCP and shortest-path routing maximize utility (context) - Wang, Li et al. - 2003
Documents on the same site (http://netlab.caltech.edu/pub/index.html): More
FAST Kernel: Background Theory and Experimental.. - Jin, Wei, Low.. (2003) (Correct)
Understanding CHOKe - Tang, Wang, Low (2003) (Correct)
Linear Stability of TCP/RED and a Scalable Control - Low, Paganini, Wang, Doyle (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC