Abstract
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when it is driven by bottleneck capacities. Extending the paper by Edmonds, Datta, and Dymond that solves the single bottleneck case, we view AIMD as a distributed scheduling algorithm and prove that with extra resources, it is competitive against the optimal global algorithm in minimizing the average flow time of the jobs. © Springer-Verlag 2004.
Author supplied keywords
Cite
CITATION STYLE
Edmonds, J. (2004). On the competitiveness of AIMD-TCP within a general network. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2976, 567–576. https://doi.org/10.1007/978-3-540-24698-5_59
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
