Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T00:35:39.548Z Has data issue: false hasContentIssue false

On a storage allocation model with finite capacity

Published online by Cambridge University Press:  17 February 2016

EUNJU SOHN
Affiliation:
Department of Science and Mathematics, Columbia College Chicago, 600 South Michigan Avenue, Chicago, IL 60605-1996, USA email: esohn@colum.edu
CHARLES KNESSL
Affiliation:
Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago, Illinois 60607-7045, USA email: knessl@uic.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider a storage allocation model with a finite number of storage spaces. There are m primary spaces that are ranked {1,2,. . .,m} and R secondary spaces ranked {m + 1, m + 2,. . .,m + R}. Items arrive according to a Poisson process, occupy a space for a random exponentially distributed time, and an arriving item takes the lowest ranked available space. Letting N 1 and N 2 denote the numbers of occupied primary and secondary spaces, we study the joint distribution Prob[N 1 = k, N 2 = r] in the steady state. The joint process (N 1, N 2) behaves as a random walk in a lattice rectangle. We shall obtain explicit expressions for the distribution of (N 1, N 2), as well as the marginal distribution of N 2. We also give some numerical studies to illustrate the qualitative behaviors of the distribution(s). The main contribution is to study the effects of a finite secondary capacity R, whereas previous studies had R = ∞.

Information

Type
Papers
Copyright
Copyright © Cambridge University Press 2016