On the competitiveness of AIMD-TCP within a general network

DOI10.1016/j.tcs.2012.07.033zbMath1252.68046OpenAlexW2174619083MaRDI QIDQ690448

Jeff Edmonds

Publication date: 27 November 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.033

zbMATH Keywords

fairnessflow timeTCPAIMDmulti-bottleneckonline competitive ratio

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27)

Cites Work

• Nonclairvoyant scheduling
• Fairness and stability of end-to-end congestion control
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Flow Control Power is Nondecentralizable
• Speed is as powerful as clairvoyance
• Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
• Scheduling in the dark
• Optimal time-critical scheduling via resource augmentation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the competitiveness of AIMD-TCP within a general network