TCP is competitive with resource augmentation
From MaRDI portal
Publication:987404
DOI10.1007/s00224-010-9249-8zbMath1206.68055MaRDI 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
scheduling; competitive analysis; congestion control; equi-partition; TCP (transport control protocol)
68M10: Network design and communication in computer systems
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M12: Network protocols
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