A note on the hypercube model
type: Item
instance of: scholarly article
title: A note on the hypercube model
zbMATH Open document ID: 0556.90022
DOI: 10.1016/0167-6377(85)90008-2
published in: Operations Research Letters
publication date: 1985-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 3887400
zbMATH Keywords: first passage times
zbMATH Keywords: Markov decision processes
zbMATH Keywords: alternating renewal process
zbMATH Keywords: hypercube model
zbMATH Keywords: long-run average number of lost customers
zbMATH Keywords: blocking probability
author: Michael N. Katehakis
MaRDI profile type: Publication
full work available at URL: 0167-6377(85)90008-2
OpenAlex ID: W2040934630
Wikidata QID: Q56518217
cites work: Finite state Markovian decision processes
cites work: Optimal Repair Allocation in a Series System
cites work: Allocation of distinguishable servers
cites work: Q3218851
Recommended article: Remarks on the hypercube model
Recommended article: Q4347883
Recommended article: Q3737464
Recommended article: Q4222152
Recommended article: Matrix model and dimensions at hypercube vertices
Recommended article: Q3500911
Recommended article: Multicritical hypercubic models
description: scientific article; zbMATH DE number 3887400