Fully decentralized emulation of best-effort and processor sharing queues

Rade Stanojević, Robert Shorten

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationSIGMETRICS'08
Subtitle of host publicationProceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems
Pages383-394
Number of pages12
Edition1 SPECIAL ISSUE
DOIs
Publication statusPublished - 16 Dec 2008
Event2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS'08 - Annapolis, MD, United States
Duration: 2 Jun 20086 Jun 2008

Publication series

NameSIGMETRICS'08: Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems
Number1 SPECIAL ISSUE
Volume36

Other

Other2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS'08
CountryUnited States
CityAnnapolis, MD
Period2/6/086/6/08

    Fingerprint

Keywords

  • CDK
  • Cloud control
  • Consensus agreement
  • Rate limiting
  • Stability and convergence

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Cite this

Stanojević, R., & Shorten, R. (2008). Fully decentralized emulation of best-effort and processor sharing queues. In SIGMETRICS'08: Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (1 SPECIAL ISSUE ed., pp. 383-394). (SIGMETRICS'08: Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems; Vol. 36, No. 1 SPECIAL ISSUE). https://doi.org/10.1145/1375457.1375501