A note on the hypercube model (Q761235)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the hypercube model |
scientific article |
Statements
A note on the hypercube model (English)
0 references
1985
0 references
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.
0 references
first passage times
0 references
Markov decision processes
0 references
alternating renewal process
0 references
hypercube model
0 references
long-run average number of lost customers
0 references
blocking probability
0 references