We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Joining the shortest queue, non-elliptic reflected diffusions and stationarity

Formal Metadata

Title
Joining the shortest queue, non-elliptic reflected diffusions and stationarity
Title of Series
Number of Parts
19
Author
License
CC Attribution - NonCommercial - NoDerivatives 4.0 International:
You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
Consider a system of N parallel single-server queues with unit-exponential service time distribution and a single dispatcher where tasks arrive as a Poisson process of rate l(N). When a task arrives, the dispatcher assigns it to one of the servers according to the Join-the-Shortest Queue (JSQ) policy. Eschenfeldt and Gamarnik (2015) established that appropriately scaled functionals of the queueing network under the JSQ policy converge weakly to associated functionals for a certain non-elliptic reflected diffusion process as N grows. I will talk about analyzing the detailed behavior of the steady state of this non-standard diffusion process using tools from renewal theory. The tails and bulk behavior of the steady state distribution and sample path fluctuations of the diffusion process will be explored. We will also see how the steady state shows a stark difference in behavior between two regimes governed by a system parameter. This is joint work with Debankur Mukherjee.