A note on the hypercube model

DOI10.1016/0167-6377(85)90008-2MaRDI QIDQ761235zbMATH OpenOpenAlexWikidataFDO

Authors Michael N. Katehakis

Publication date 1985

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(85)90008-2

zbMATH Keywords

alternating renewal processblocking probabilityfirst passage timeshypercube modellong-run average number of lost customersMarkov decision processes

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

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.

Recommendations

• Remarks on the hypercube model
• scientific article; zbMATH DE number 1047716
• scientific article; zbMATH DE number 3970798
• scientific article; zbMATH DE number 1229713
• Matrix model and dimensions at hypercube vertices
• Asymptotic properties of hypercubes
• Multicritical hypercubic models

Cites work

• Allocation of distinguishable servers
• Finite state Markovian decision processes
• scientific article; zbMATH DE number 3885030 (Why is no real title available?)
• Optimal Repair Allocation in a Series System

Cited in

(10)

• Optimality of the fastest available server policy
• Allocation of distinguishable servers
• Load balancing in a multiserver queueing system
• Signaling for decentralized routing in a queueing network
• Minimizing expected discounted cost in a queueing loss model with discriminating arrivals
• On the optimal maintenance of systems and control of arrivals in queues
• Remarks on the hypercube model
• A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network
• DES and RES processes and their explicit solutions
• A hypercube queueing loss model with customer-dependent service rates

This page was built for publication: A note on the hypercube model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761235)