A note on the hypercube model

Authors:
M.N Katehakis
Affiliations:
Department of Applied Mathematics and Statistics, State University of New York at Stony Brook, Stony Brook, NY 11794, USA
Venue:
Operations Research Letters
Year:
1985

Citing 2
Cited 0

Allocation of distinguishable servers

Computers and Operations Research
Finite State Markovian Decision Processes

Finite State Markovian Decision Processes

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a variation of the hypercube model in which there are N distinguishable servers and R types of customers. Customers that find all servers busy (blocked customers) are lost. When service times are exponentially distributed and customers arrive according to independent Poisson streams, we show that the policy which always assigns customers to the fastest available server minimizes the long-run average number of lost customers. Furthermore, we derive an upper bound for the blocking probability and the long-run average number of customers lost.