Queueing system with selection of the shortest of two queues: An asymptotic approach
From MaRDI portal
Publication:1389259
zbMath0898.60095MaRDI QIDQ1389259
N. D. Vvedenskaya, F. I. Karpelevich, Roland Lvovich Dobrushin
Publication date: 8 July 1998
Published in: Problems of Information Transmission (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (95)
Point processes in fast Jackson networks ⋮ Choosing among heterogeneous server clouds ⋮ Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers ⋮ Queueing networks with mobile servers: the mean-field approach ⋮ Nonlinear Markov processes in big networks ⋮ Asymptotic independence of servers' activity in queueing systems with limited resource pooling ⋮ Practical load balancing for content requests in peer-to-peer networks ⋮ Analysis of large urn models with local mean-field interactions ⋮ Open problems in refined mean field approximations ⋮ Asymptotics of insensitive load balancing and blocking phases ⋮ On a doubly dynamically controlled supermarket model with impatient customers ⋮ Systems of Differential Equations of Infinite Order with Small Parameter and Countable Markov Chains ⋮ 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 ⋮ Self-Learning Threshold-Based Load Balancing ⋮ MDS coding is better than replication for job completion times ⋮ Decay of tails at equilibrium for FIFO join the shortest queue networks ⋮ Asymptotic independence of queues under randomized load balancing ⋮ Load balancing via random local search in closed and open systems ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Zero-wait load balancing with sparse messaging ⋮ Load-balancing for multi-skilled servers with Bernoulli routing ⋮ <scp>Steady‐state</scp> analysis of load balancing with Coxian‐2 distributed service times ⋮ Stationary analysis of the shortest queue problem ⋮ Stability of Parallel Server Systems ⋮ Stochastic coordination in heterogeneous load balancing systems ⋮ Mean field approximations to a queueing system with threshold-based workload control scheme ⋮ A lower bound on the queueing delay in resource constrained load balancing ⋮ Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems ⋮ On the Approximation Error of Mean-Field Models ⋮ Universality of Power-of-d Load Balancing in Many-Server Systems ⋮ Open Problem—Load Balancing Using Delayed Information ⋮ Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System ⋮ Propagation of chaos and large deviations in mean-field models with jumps on block-structured networks ⋮ Persistent-Idle Load-Distribution ⋮ Averaging over fast variables in the fluid limit for Markov chains: Application to the supermarket model with memory ⋮ Stability of join the shortest queue networks ⋮ Stability of JSQ in queues with general server-job class compatibilities ⋮ Subdiffusive Load Balancing in Time-Varying Queueing Systems ⋮ Multi-access system with many users: Stability and metastability ⋮ Modeling a case of herding behavior in a multi-player game ⋮ Stationary Distribution Analysis of a Queueing Model with Local Choice ⋮ A mean field model for a class of garbage collection algorithms in flash-based solid state drives ⋮ Transform Methods for Heavy-Traffic Analysis ⋮ The mean-field computation in a supermarket model with server multiple vacations ⋮ Information and Memory in Dynamic Resource Allocation ⋮ Steady-state analysis of load-balancing algorithms in the sub-Halfin–Whitt regime ⋮ Dobrushin Mean-Field Approach for Queueing Large-Scale Networks with a Small Parameter ⋮ Block-structured supermarket models ⋮ Many-server asymptotics for join-the-shortest-queue: large deviations and rare events ⋮ A problem of random choice and its deterministic structure ⋮ The supermarket model with bounded queue lengths in equilibrium ⋮ Large-scale behaviour of packet-switched networks: theoretical analysis framework ⋮ Functional central limit theorems for a large network in which customers join the shortest of several queues ⋮ On the maximum queue length in the supermarket model ⋮ Randomized longest-queue-first scheduling for large-scale buffered systems ⋮ Performance Analysis of Joining the Shortest Queue Model Among a Large Number of Queues ⋮ Large-scale join-idle-queue system with general service times ⋮ On the impact of job size variability on heterogeneity-aware load balancing ⋮ Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice ⋮ Asymptotically optimal control of parallel tandem queues with loss ⋮ Interference queueing networks on grids ⋮ Diffusion approximations for load balancing mechanisms in cloud storage systems ⋮ Insensitivity of the mean field limit of loss systems under SQ(d) routeing ⋮ Replica-Mean-Field Limits for Intensity-Based Neural Networks ⋮ Pull-based load distribution in large-scale heterogeneous service systems ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ Job assignment in large-scale service systems with affinity relations ⋮ Spontaneous resonances and the coherent states of the queuing networks ⋮ Large-scale parallel server system with multi-component jobs ⋮ Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics ⋮ Power-of-d-Choices with Memory: Fluid Limit and Optimality ⋮ Asymptotic Optimality of Power-of-d Load Balancing in Large-Scale Systems ⋮ The Pair-Replica-Mean-Field Limit for Intensity-based Neural Networks ⋮ Configuration of overloaded servers with dynamic routing ⋮ Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin--Whitt Heavy-Traffic Regime ⋮ Large-scale heterogeneous service systems with general packing constraints ⋮ A mean-field matrix-analytic method for bike sharing systems under Markovian environment ⋮ The Supermarket Game ⋮ Group service system with three queues and load balancing ⋮ Sensitivity of mean-field fluctuations in Erlang loss models with randomized routing ⋮ Fast Jackson networks ⋮ The hydrodynamic limit of a randomized load balancing network ⋮ On the power of two choices: balls and bins in continuous time ⋮ Strong approximation for the supermarket model ⋮ Balancing queues by mean field interaction ⋮ A general ``power-of-\(d\) dispatching framework for heterogeneous systems ⋮ Asymptotic analysis of the elephant random walk ⋮ Power-of-two sampling in redundancy systems: the impact of assignment constraints ⋮ Unnamed Item ⋮ Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems ⋮ Parallel Server Systems with Cancel-on-Completion Redundancy ⋮ Dynamics of the Non-Homogeneous Supermarket Model ⋮ Two-choice regulation in heterogeneous closed networks
This page was built for publication: Queueing system with selection of the shortest of two queues: An asymptotic approach
