Abstract
We consider a new idea for a storage model on n nodes, namely stability of shape. These nodes support K neighborhoods S i ⊂ {1, ..., n} and items arrive at the S i as independent Poisson streams with rates λ i , i = 1, ... , K . Upon arrival at S i an item is stored at node j ∈ S i where j is determined by some policy. Under natural conditions on the λ i we exhibit simple local policies such that the multidimensional process describing the evolution of the number of items at each node is positive recurrent (stable) in shape.
Similar content being viewed by others
References
Andjel ED, Menshikov MV, Sisko VV (2006) Positive recurrence of processes associated to crystal growth models. Ann Appl Probab 16(3):1059–1085
Gates DJ, Westcott M (1993) Markov models of steady crystal growth. Ann Appl Probab 3(2):339–355
Fayolle G, Malyshev VA, Menshikov MV (1995) Topics in constructive theory of countable Markov chains. Cambridge University Press
Ford Jr LR, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton, NJ
Luczak MJ, McDiarmid C (2006) On the maximum queue length in the supermarket model. Ann Probab 34(2):493–527
Rockafellar RT (1970) Convex analysis. Princeton mathematical series, no. 28. Princeton University Press, Princeton, NJ
Rockafellar RT (1984) Network flows and monotropic optimization. Pure and applied mathematics (New York). Wiley, New York. A Wiley-Interscience Publication
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Menshikov, M.V., Sisko, V.V. & Vachkovskaia, M. Introduction to Shape Stability for a Storage Model. Methodol Comput Appl Probab 15, 125–146 (2013). https://doi.org/10.1007/s11009-011-9229-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-011-9229-8