Linear network optimization: algorithms and codes
Linear network optimization: algorithms and codes
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Understanding TCP Vegas: a duality model
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Mathematical Models of Traffic Control in Internet: New Approaches Based of TCP/AQM Schemes
Automation and Remote Control
Stability of multi-path dual congestion control algorithms
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Eisenberg-Gale markets: algorithms and structural properties
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Joint routing and flow rate optimization in multi-rate ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Rethinking internet traffic management: from multiple decompositions to a practical protocol
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Optimal and distributed protocols for cross-layer design of physical and transport layers in MANETs
IEEE/ACM Transactions on Networking (TON)
Congestion-aware channel assignment for multi-channel wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A unified approach to congestion control and node-based multipath routing
IEEE/ACM Transactions on Networking (TON)
Measuring the utility/path diversity trade off in multipath protocols
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
How bad is single-path routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Network resource allocation for competing multiple description transmissions
IEEE Transactions on Communications
Utility functionals associated with available congestion control algorithms
INFOCOM'10 Proceedings of the 29th conference on Information communications
Layering as optimization decomposition: questions and answers
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Convergence of the fixed point algorithm of analytical models of reliable internet protocols (TCP)
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Cost of not splitting in routing: characterization and estimation
IEEE/ACM Transactions on Networking (TON)
Distributed rate allocation for multi-path routing based on network utility maximization
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part II
| Hi-index | 0.00 |
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 multi-path routing at optimality.