TCP is competitive with resource augmentation

DOI10.1007/S00224-010-9249-8MaRDI QIDQ987404zbMATH OpenOpenAlexFDO

Authors Jeff Edmonds, Suprakash Datta, P. 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

competitive analysisschedulingcongestion controlequi-partitionTCP (transport control protocol)

Mathematics Subject Classification ID

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

Recommendations

• Use of competition detection in TCP for simple topology networks
• On the competitiveness of AIMD-TCP within a general network
• LATIN 2004: Theoretical Informatics
• Towards an utility-based TCP-friendly rate control
• Competitive buffer management with packet dependencies
• scientific article; zbMATH DE number 1717227
• Allocating network resources by weight between TCP traffics
• Enhancing TCP for networks with guaranteed bandwidth services

Cites work

• scientific article; zbMATH DE number 1687030 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• scientific article; zbMATH DE number 2119692 (Why is no real title available?)
• scientific article; zbMATH DE number 2119708 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
• LATIN 2004: Theoretical Informatics
• Nonclairvoyant scheduling
• On-line analysis of the TCP acknowledgment delay problem
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Scheduling in the dark
• Speed is as powerful as clairvoyance
• Stability of distributed congestion control with heterogeneous feedback delays

Cited in

(15)

• Allocating network resources by weight between TCP traffics
• Window-games between TCP flows
• A game theoretic comparison of TCP and digital fountain based protocols
• Average slowdown competitive analysis of the AAIMD algorithm
• scientific article; zbMATH DE number 1969716 (Why is no real title available?)
• On the competitiveness of AIMD-TCP within a general network
• LATIN 2004: Theoretical Informatics
• A network rate management protocol with TCP congestion control and fairness for all
• Use of competition detection in TCP for simple topology networks
• A randomized online algorithm for bandwidth utilization
• Experiences on enhancing data collection in large networks
• scientific article; zbMATH DE number 2119708 (Why is no real title available?)
• EVA: a better TCP version for resource-insufficient networks
• Transport-independent fairness
• Parallel TCP congestion control based on strength control

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987404)