This is the first comprehensive book on the AIMD algorithm, the most widely used method for allocating a limited resource among competing agents without centralized control. The authors offer a new approach that is based on positive switched linear systems. It is used to develop most of the main results found in the book, and fundamental results on stochastic switched nonnegative and consensus systems are derived to obtain these results. The original and best known application of the algorithm is in the context of congestion control and resource allocation on the Internet, and readers will find details of several variants of the algorithm in order of increasing complexity, including deterministic, random, linear, and nonlinear versions. In each case, stability and convergence results are derived based on unifying principles. Basic and fundamental properties of the algorithm are described, examples are used to illustrate the richness of the resulting dynamical systems, and applications are provided to show how the algorithm can be used in the context of smart cities, intelligent transportation systems, and the smart grid. Audience: The book is suitable for advanced undergraduate and graduate students and researchers.
Cited By
- Wei Tan C (2022). The Value of Cooperation, ACM SIGMETRICS Performance Evaluation Review, 49:4, (8-13), Online publication date: 2-Jun-2022.
- Spatharakis D, Dimolitsas I, Vlahakis E, Dechouniotis D, Athanasopoulos N and Papavassiliou S Distributed Resource Autoscaling in Kubernetes Edge Clusters Proceedings of the 18th International Conference on Network and Service Management, (1-7)
- Vlahakis E, Athanasopoulos N and McLoone S AIMD scheduling and resource allocation in distributed computing systems 2021 60th IEEE Conference on Decision and Control (CDC), (4642-4647)
- Wirth F, Stüdli S, Yu J, Corless M and Shorten R (2019). Nonhomogeneous Place-dependent Markov Chains, Unsynchronised AIMD, and Optimisation, Journal of the ACM, 66:4, (1-37), Online publication date: 31-Aug-2019.
- Alam S, Shorten R, Wirth F and Yu J Derandomized Distributed Multi-resource Allocation with Little Communication Overhead 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), (84-91)
- Avrachenkov K, Piunovskiy A and Zhang Y Impulsive Control for G-AIMD Dynamics with Relaxed and Hard Constraints 2018 IEEE Conference on Decision and Control (CDC), (880-887)
- Avrachenkov K, Borkar V and Pattathil S Controlling G-AIMD by index policy 2017 IEEE 56th Annual Conference on Decision and Control (CDC), (120-125)
Index Terms
- AIMD Dynamics and Distributed Resource Allocation
Recommendations
Resource reconstruction algorithms for on-demand allocation in virtual computing resource pool
Resource reconstruction algorithms are studied in this paper to solve the problem of resource on-demand allocation and improve the efficiency of resource utilization in virtual computing resource pool. Based on the idea of resource virtualization and ...