Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking

DOI10.2307/1427381zbMath0615.60085OpenAlexW2332364634MaRDI QIDQ4722971

Debasis Mitra

Publication date: 1987

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427381

zbMATH Keywords

computationsblocking probabilitiesnetworks with blockingcircuit-switching problemline-capacities

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items

Quasi-reversible multiclass queues with order independent departure rates ⋮ Mathematical theory of queueing networks ⋮ Fast simulation of blocking probabilities in loss networks ⋮ On the Accuracy of the OPC Approximation for a Symmetric Overflow Loss Model ⋮ Computing performance measures in a multi-class multi-resource processor-shared loss system ⋮ Monte Carlo Summation Applied to Product-Form Loss Networks ⋮ Computational complexity of loss networks