Understanding TCP Vegas

DOI10.1145/506147.506152zbMath1323.68056OpenAlexW2007594468MaRDI QIDQ3196641

Larry Peterson, Steven H. Low, Li-Min Wang

Publication date: 30 October 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/506147.506152

zbMATH Keywords

REMTCP congestion controlTCP Vegaspersistent congestion

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Related Items (15)

Dynamic decentralised balancing of CONWIP production systems ⋮ Congestion in large balanced multirate networks ⋮ Application of model-free LQG subspace predictive control to TCP congestion control ⋮ Achieving high throughput and TCP Reno fairness in delay-based TCP over large networks ⋮ Robust global stability to delays of a multi-path dual congestion control algorithm ⋮ Network congestion control with Markovian multipath routing ⋮ To be fair or efficient or a bit of both ⋮ Nash equilibrium design and price-based coordination in hierarchical systems ⋮ Pricing for fairness: distributed resource allocation for multiple objectives ⋮ Decentralized Proportional Load Balancing ⋮ Eisenberg-Gale markets: algorithms and game-theoretic properties ⋮ Fairness and stability of end-to-end congestion control ⋮ Price-based protocols for fair resource allocation ⋮ Mathematical models of traffic control in internet: new approaches based of TCP/AQM schemes ⋮ Equilibrium routing under uncertainty

This page was built for publication: Understanding TCP Vegas