Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Author: MacPhee, I
Menshikov, MV
Vachkovskaia, M
Abstract: We consider the long term behavior of a Markov chain xi(t) on Z(N) based on the N station supermarket model with general neighborhoods, arrival rates and service rates. Different routing policies for the model give different Markov chains. We show that for a broad class of local routing policies, join the least weighted queue (JLW), the N one-dimensional components xi(i)(t) can be partitioned into disjoint clusters C-k. Within each cluster C-k the speed of each component xi(j) converges to a constant V-k and under certain conditions xi is recurrent in shape on each cluster. To establish these results we have assembled methods from two distinct areas of mathematics, semi-martingale techniques used for showing stability of Markov chains together with the theory of optimal flows in networks. As corollaries to our main result we obtain the stability classification of the supermarket model under any JLW policy and can explicitly compute the C-k and V-k for any instance of the model and specific JLW policy.
Subject: Join the least weighted queue
Lyapunov functions
Network flows
Recurrence in shape
Country: EUA
Editor: Taylor & Francis Inc
Citation: Stochastic Models. Taylor & Francis Inc, v. 28, n. 4, n. 533, n. 556, 2012.
Rights: aberto
Identifier DOI: 10.1080/15326349.2012.726031
Date Issue: 2012
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.