Product form approximations for queueing networks with multiple servers and blocking

DOI10.1109/12.8732zbMath0669.68026OpenAlexW2016526105MaRDI QIDQ3823135

Ian F. Akyildiz

Publication date: 1989

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.8732

zbMATH Keywords

approximationperformance evaluationperformance measuresproduct formqueueing networksblockingfinite station capacitiesbinomial coefficient formula

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Deadlock free buffer allocation in closed queueing networks ⋮ Algorithmic product-form approximations of interacting stochastic models ⋮ `Stop=recirculate' for exponential product form queueing networks with departure blocking ⋮ Modelling deadlock in open restricted queueing networks

This page was built for publication: Product form approximations for queueing networks with multiple servers and blocking