MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems

Author(s)
Gamarnik, David; Tsitsiklis, John N.; Zubeldia, Martin
Thumbnail
Downloadstsy.2017.0008.pdf (930.3Kb)
PUBLISHER_CC

Publisher with Creative Commons License

Creative Commons Attribution

Terms of use
Creative Commons Attribution 4.0 International license https://creativecommons.org/licenses/by/4.0/
Metadata
Show full item record
Abstract
We consider the following distributed service model: jobs with unit mean, exponentially distributed, and independent processing times arrive as a Poisson process of rate λn, with 0 < λ < 1, and are immediately dispatched by a centralized dispatcher to one of n First-In-First-Out queues associated with n identical servers. The dispatcher is endowed with a finite memory, and with the ability to exchange messages with the servers. We propose and study a resource-constrained “pull-based” dispatching policy that involves two parameters: (i) the number of memory bits available at the dispatcher, and (ii) the average rate at which servers communicate with the dispatcher. We establish (using a fluid limit approach) that the asymptotic, as n → ∞, expected queueing delay is zero when either (i) the number of memory bits grows logarithmically with n and the message rate grows superlinearly with n, or (ii) the number of memory bits grows superlogarithmically with n and the message rate is at least λn. Furthermore, when the number of memory bits grows only logarithmically with n and the message rate is proportional to n, we obtain a closed-form expression for the (now positive) asymptotic delay. Finally, we demonstrate an interesting phase transition in the resource-constrained regime where the asymptotic delay is non-zero. In particular, we show that for any given α > 0 (no matter how small), if our policy only uses a linear message rate αn, the resulting asymptotic delay is upper bounded, uniformly over all λ < 1; this is in sharp contrast to the delay obtained when no messages are used (α = 0), which grows as 1/(1 − λ) when λ ↑ 1, or when the popular power-of-d-choices is used, in which the delay grows as log(1/(1 − λ)).
Date issued
2017-09
URI
http://hdl.handle.net/1721.1/120714
Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems; Sloan School of Management
Journal
Stochastic Systems
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Citation
Gamarnik, David et al. “Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems.” Stochastic Systems 8, 1 (March 2018): 45–74 © 2018 The Author(s)
Version: Final published version
ISSN
1946-5238
1946-5238

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.