TCP is competitive with resource augmentation

DOI10.1007/s00224-010-9249-8zbMath1206.68055OpenAlexW1981571357MaRDI QIDQ987404

Jeff Edmonds, Suprakash Datta, Patrick W. Dymond

Publication date: 13 August 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-010-9249-8

zbMATH Keywords

schedulingcompetitive analysiscongestion controlequi-partitionTCP (transport control protocol)

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Cites Work

• Nonclairvoyant scheduling
• Rate control for communication networks: shadow prices, proportional fairness and stability
• On-line analysis of the TCP acknowledgment delay problem
• Speed is as powerful as clairvoyance
• Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
• Stability of distributed congestion control with heterogeneous feedback delays
• Scheduling in the dark
• LATIN 2004: Theoretical Informatics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: TCP is competitive with resource augmentation