Block-structured supermarket models

DOI10.1007/S10626-014-0199-1MaRDI QIDQ503021zbMATH OpenOpenAlexFDO

Authors Quan-Lin Li, John C. S. Lui

Publication date 11 January 2017

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

Full work available at URL https://arxiv.org/abs/1406.0285

zbMATH Keywords

mean-field limitoperator semigroupmatrix-analytic methodsupermarket modelrandomized load balancingdoubly exponential tailinvariance of environment factorsMarkovian arrival processes (MAP)phase-type (PH) distributionRG-factorization

Mathematics Subject Classification ID

Markov processes (60J99) Queues and service in operations research (90B22) Adaptive control/observation systems (93C40) Stochastic systems in control theory (general) (93E03)

Abstract: Supermarket models are a class of parallel queueing networks with an adaptive control scheme that play a key role in the study of resource management of, such as, computer networks, manufacturing systems and transportation networks. When the arrival processes are non-Poisson and the service times are non-exponential, analysis of such a supermarket model is always limited, interesting, and challenging. This paper describes a supermarket model with non-Poisson inputs: Markovian Arrival Processes (MAPs) and with non-exponential service times: Phase-type (PH) distributions, and provides a generalized matrix-analytic method which is first combined with the operator semigroup and the mean-field limit. When discussing such a more general supermarket model, this paper makes some new results and advances as follows: (1) Providing a detailed probability analysis for setting up an infinite-dimensional system of differential vector equations satisfied by the expected fraction vector, where "the invariance of environment factors" is given as an important result. (2) Introducing the phase-type structure to the operator semigroup and to the mean-field limit, and a Lipschitz condition can be obtained by means of a unified matrix-differential algorithm. (3) The matrix-analytic method is used to compute the fixed point which leads to performance computation of this system. Finally, we use some numerical examples to illustrate how the performance measures of this supermarket model depend on the non-Poisson inputs and on the non-exponential service times. Thus the results of this paper give new highlight on understanding influence of non-Poisson inputs and of non-exponential service times on performance measures of more general supermarket models.

Recommendations

• On a doubly dynamically controlled supermarket model with impatient customers
• Dynamics of the non-homogeneous supermarket model
• The mean-field computation in a supermarket model with server multiple vacations
• The supermarket model with bounded queue lengths in equilibrium
• Real-time dynamic control in the supermarket models and some numerical analyses

Cites work

• scientific article; zbMATH DE number 3951715 (Why is no real title available?)
• scientific article; zbMATH DE number 1191591 (Why is no real title available?)
• scientific article; zbMATH DE number 3729228 (Why is no real title available?)
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 1488838 (Why is no real title available?)
• scientific article; zbMATH DE number 194776 (Why is no real title available?)
• scientific article; zbMATH DE number 1857645 (Why is no real title available?)
• Asymptotic distributions and chaos for the supermarket model
• Asymptotic independence of queues under randomized load balancing
• Chaoticity on path space for a queueing network with selection of the shortest queue among several
• Decay of tails at equilibrium for FIFO join the shortest queue networks
• Fast Jackson networks
• Fast Jackson networks with dynamic routing
• Functional central limit theorems for a large network in which customers join the shortest of several queues
• On the analysis of randomized load balancing schemes
• On the maximum queue length in the supermarket model
• Point processes in fast Jackson networks
• Probability and Computing
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Strong approximation for the supermarket model
• Tail probabilities in queueing processes
• The Effect of Increasing Routing Choice on Resource Pooling
• Two Types ofRG-Factorizations of Quasi-birth-and-death Processes and Their Applications to Stochastic Integral Functionals

Cited in

(10)

• Reward processes and performance optimization in asymmetric supermarket models
• Real-time dynamic control in the supermarket models and some numerical analyses
• Dynamics of the non-homogeneous supermarket model
• Supermarket model on graphs
• A model to analyze the problem of congestion in supermarket check-outs: a case study
• On a doubly dynamically controlled supermarket model with impatient customers
• A mean-field matrix-analytic method for bike sharing systems under Markovian environment
• The mean-field computation in a supermarket model with server multiple vacations
• Strong approximation for the supermarket model
• An overview for Markov decision processes in queues and networks

This page was built for publication: Block-structured supermarket models

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