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

MaRDI QIDQ1389259zbMATH OpenFDO

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)

zbMATH Keywords

asymptotic distributionqueuePoisson flowincreasing lengths of the queues

Mathematics Subject Classification ID

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)

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

Cited in

(99)

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

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)