Queueing system with selection of the shortest of two queues: An asymptotic approach

zbMATH Open0898.60095MaRDI QIDQ1389259FDOQ1389259

Authors: N. Vvedenskaya, F. I. Karpelevich, R. L. Dobrushin

Publication date: 8 July 1998

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
On the infinite server shortest queue problem: non-symmetric case
On the shortest queue version of the Erlang loss model
The shortest queue problem
Join the shortest queue among \(k\) parallel queues: tail asymptotics of its stationary distribution

asymptotic distribution queue Poisson flow increasing lengths of the queues

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (99)

Asymptotics of insensitive load balancing and blocking phases
Replica-mean-field limits for intensity-based neural networks
The pair-replica-mean-field limit for intensity-based neural networks
Two-choice regulation in heterogeneous closed networks
Stability of parallel server systems
Interference queueing networks on grids
Load balancing via random local search in closed and open systems
Power-of-two sampling in redundancy systems: the impact of assignment constraints
Large-scale join-idle-queue system with general service times
Nonlinear Markov processes in big networks
Strong approximation for the supermarket model
Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
Join the shortest queue with many servers. The heavy-traffic asymptotics
Job assignment in large-scale service systems with affinity relations
Many-server asymptotics for join-the-shortest-queue: large deviations and rare events
On a doubly dynamically controlled supermarket model with impatient customers
Dobrushin Mean-Field Approach for Queueing Large-Scale Networks with a Small Parameter
Modeling a case of herding behavior in a multi-player game
Asymptotically optimal control of parallel tandem queues with loss
The mean-field computation in a supermarket model with server multiple vacations
Asymptotic independence of servers' activity in queueing systems with limited resource pooling
Balancing queues by mean field interaction
Asymptotic independence of queues under randomized load balancing
The supermarket model with bounded queue lengths in equilibrium
Economies-of-scale in many-server queueing systems: tutorial and partial review of the QED Halfin-Whitt heavy-traffic regime
Universality of power-of-\(d\) load balancing in many-server systems
Asymptotic optimality of power-of-\(d\) load balancing in large-scale systems
Averaging over fast variables in the fluid limit for Markov chains: Application to the supermarket model with memory
On the power of two choices: balls and bins in continuous time
Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice
Open problems in refined mean field approximations
Information and memory in dynamic resource allocation
Queueing networks with mobile servers: the mean-field approach
Fast Jackson networks
Delay, memory, and messaging tradeoffs in distributed service systems
Functional central limit theorems for a large network in which customers join the shortest of several queues
Decay of tails at equilibrium for FIFO join the shortest queue networks
Point processes in fast Jackson networks
A mean field model for a class of garbage collection algorithms in flash-based solid state drives
A load balancing system in the many-server heavy-traffic asymptotics
Long-term concentration of measure and cut-off
Near equilibrium fluctuations for supermarket models with growing choices
Configuration of overloaded servers with dynamic routing
Large-scale parallel server system with multi-component jobs
Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers
Transform methods for heavy-traffic analysis
Steady-state analysis of load-balancing algorithms in the sub-Halfin-Whitt regime
Pull-based load distribution in large-scale heterogeneous service systems
Asymptotic analysis of the elephant random walk
Stationary analysis of the shortest queue problem
Zero-wait load balancing with sparse messaging
On the maximum queue length in the supermarket model
A mean-field matrix-analytic method for bike sharing systems under Markovian environment
Block-structured supermarket models
Multi-access system with many users: Stability and metastability
Spontaneous resonances and the coherent states of the queuing networks
The supermarket game
Group service system with three queues and load balancing
On the approximation error of mean-field models
A problem of random choice and its deterministic structure
On the power of (even a little) resource pooling
Practical load balancing for content requests in peer-to-peer networks
Stability of join the shortest queue networks
Diffusion approximations for load balancing mechanisms in cloud storage systems
A general ``power-of-\(d\) dispatching framework for heterogeneous systems
Distributed dispatching in the parallel server model
Stability of JSQ in queues with general server-job class compatibilities
Self-Learning Threshold-Based Load Balancing
Systems of differential equations of infinite order with small parameter and countable Markov chains
Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System
Performance analysis of joining the shortest queue model among a large number of queues
Title not available (Why is that?)
Propagation of chaos and Poisson hypothesis for replica mean-field models of intensity-based neural networks
Parallel Server Systems with Cancel-on-Completion Redundancy
Randomized longest-queue-first scheduling for large-scale buffered systems
Analysis of large urn models with local mean-field interactions
Sensitivity of mean-field fluctuations in Erlang loss models with randomized routing
Choosing among heterogeneous server clouds
Insensitivity of the mean field limit of loss systems under \(\mathrm{SQ}(d)\) routeing
Stability, memory, and messaging trade-offs in heterogeneous service systems
Queue-length-aware dispatching in large-scale heterogeneous systems
Subdiffusive load balancing in time-varying queueing systems
<scp>Steady‐state</scp> analysis of load balancing with Coxian‐2 distributed service times
Large-scale behaviour of packet-switched networks: theoretical analysis framework
MDS coding is better than replication for job completion times
Propagation of chaos and large deviations in mean-field models with jumps on block-structured networks
On the impact of job size variability on heterogeneity-aware load balancing
Mean field approximations to a queueing system with threshold-based workload control scheme
Persistent-idle load-distribution
Load-balancing for multi-skilled servers with Bernoulli routing
The hydrodynamic limit of a randomized load balancing network
Dynamics of the non-homogeneous supermarket model
Open problem: Load balancing using delayed information
Stationary distribution analysis of a queueing model with local choice
Martingales and buffer overflow for the symmetric shortest queue model
Mean-field fluctuations at diffusion scale in threshold-based randomized routing for processor sharing systems and applications
Power-of-d-Choices with Memory: Fluid Limit and Optimality
A lower bound on the queueing delay in resource constrained load balancing
Large-scale heterogeneous service systems with general packing constraints

This page was built for publication: Queueing system with selection of the shortest of two queues: An asymptotic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389259)