Data networks
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Algorithms for provisioning virtual private networks in the hose model
IEEE/ACM Transactions on Networking (TON)
Globally Distributed Content Delivery
IEEE Internet Computing
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
An adaptive virtual queue (AVQ) algorithm for active queue management
IEEE/ACM Transactions on Networking (TON)
FAST TCP: motivation, architecture, algorithms, performance
IEEE/ACM Transactions on Networking (TON)
Cloud control with distributed rate limiting
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
A Survey of Cloud Platforms and Their Future
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part I
Load balancing vs. distributed rate limiting: an unifying framework for cloud control
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Distributed dynamic speed scaling
INFOCOM'10 Proceedings of the 29th conference on Information communications
An experimental evaluation of distributed rate limiting for cloud computing applications
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
mClock: handling throughput variability for hypervisor IO scheduling
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Proportional Allocation of Resources on Shared Ring Buffer for Virtualization
International Journal of Cloud Applications and Computing
A disk bandwidth allocation mechanism with priority
The Journal of Supercomputing
| Hi-index | 0.00 |
Control of large distributed cloud-based services is a challenging problem. The Distributed Rate Limiting (DRL) paradigm was recently proposed as a mechanism for tackling this problem. The heuristic nature of existing DRL solutions makes their behavior unpredictable and analytically untractable. In this paper we treat the DRL problem in a mathematical framework and propose two novel DRL algorithms that exhibit good and predictable performance. The first algorithm Cloud Control with Constant Probabilities (C3P) solves the DRL problem in best effort environments, emulating the behavior of a single best-effort queue in a fully distributed manner. The second problem we approach is the DRL in processor sharing environments. Our algorithm, Distributed Deficit Round Robin (D2R2), parameterized by parameter α, converges to a state that is, at most, O(1/α) away from the exact emulation of centralized processor sharing queue. The convergence and stability properties are fully analyzed for both C3P and D2R2. Analytical results are validated empirically through a number of representative packet level simulations. The closed-form nature of our results allows simple design rules which, together with extremely low communication overhead, makes the presented algorithms practical and easy to deploy.