On the competitiveness of AIMD-TCP within a general network
From MaRDI portal
(Redirected from Publication:690448)
Recommendations
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1304095 (Why is no real title available?)
- scientific article; zbMATH DE number 1775424 (Why is no real title available?)
- Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
- Fairness and stability of end-to-end congestion control
- Flow Control Power is Nondecentralizable
- Mathematical modelling of the internet
- Nonclairvoyant scheduling
- Optimal time-critical scheduling via resource augmentation
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Scheduling in the dark
- Speed is as powerful as clairvoyance
Cited in
(9)- LATIN 2004: Theoretical Informatics
- TCP is competitive with resource augmentation
- Exploiting the efficiency and fairness potential of AIMD-based congestion avoidance and control.
- Performance analysis of TCP/AQM with generalized AIMD under intermediate buffer sizes
- On unique ergodicity of coupled AIMD flows
- Asymptotic analysis of a nonlinear AIMD algorithm
- AIMD dynamics and distributed resource allocation
- A decentralized adaptive algorithm for fair allocation of a shared resource
- Average slowdown competitive analysis of the AAIMD algorithm
This page was built for publication: On the competitiveness of AIMD-TCP within a general network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690448)