The mean-field computation in a supermarket model with server multiple vacations

DOI10.1007/s10626-013-0171-5zbMath1302.93197OpenAlexW2051772158MaRDI QIDQ481355

Quan-Lin Li, Guirong Dai, John C. S. Lui, Yang Wang

Publication date: 12 December 2014

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-013-0171-5

zbMATH Keywords

performance analysisfixed-pointserver vacationmean-field limitoperator semigroupsupermarket modeljoin the shortest queueexpected fraction vectorrandomized load balancing

Mathematics Subject Classification ID

Related Items (4)

Nonlinear Markov processes in big networks ⋮ Mean field approximations to a queueing system with threshold-based workload control scheme ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ A mean-field matrix-analytic method for bike sharing systems under Markovian environment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decay of tails at equilibrium for FIFO join the shortest queue networks
• Asymptotic independence of queues under randomized load balancing
• A mean field approach for optimization in discrete time
• Stability of join the shortest queue networks
• Stability of queueing networks. École d'Été de probabilités de Saint-Flour XXXVI-2006
• Queueing systems with vacations - a survey
• On the stability of a partially accessible multi-station queue with state-dependent routing
• On the analysis of randomized load balancing schemes
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Vacation models in discrete time
• Fast Jackson networks
• Functional central limit theorems for a large network in which customers join the shortest of several queues
• Fast Jackson networks with dynamic routing
• Point processes in fast Jackson networks
• A particle system in interaction with a rapidly varying environment: mean field limits and applications
• Asymptotic distributions and chaos for the supermarket model
• On the maximum queue length in the supermarket model
• Vacation queueing models. Theory and applications
• Strong approximation for the supermarket model
• Generalizations of the stochastic decomposition results for single server queues with vacations
• Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
• Conditional stochastic decompositions in the M/M/c queue with server vacations
• Chaoticity on path space for a queueing network with selection of the shortest queue among several
• Advances in Queueing Theory, Methods, and Open Problems
• The Effect of Increasing Routing Choice on Resource Pooling
• Mean Field for Markov Decision Processes: From Discrete to Continuous Optimization
• Probability and Computing

This page was built for publication: The mean-field computation in a supermarket model with server multiple vacations