Monte Carlo Summation Applied to Product-Form Loss Networks
From MaRDI portal
Publication:3416054
DOI10.1017/S0269964800002576zbMath1134.90330MaRDI QIDQ3416054
Publication date: 19 January 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)
Related Items (3)
Fast simulation of blocking probabilities in loss networks ⋮ Computing performance measures in a multi-class multi-resource processor-shared loss system ⋮ Computational complexity of loss networks
Uses Software
Cites Work
- Unnamed Item
- Teletraffic engineering for product-form circuit-switched networks
- Algorithms to determine exact blocking probabilities for multirate tree networks
- Blocking probabilities in large circuit-switched networks
- Performance evaluation and perturbation analysis of discrete event dynamic systems
- Optimal weighted Monte-Carlo methods
- Asymptotic expansions for closed Markovian networks with state-dependent service rates
- Implied costs in loss networks
- A Class of Closed Markovian Queuing Networks: Integral Representations, Asymptotic Expansions, and Generalizations*
- Integral Representations and Asymptotic Expansions for Closed Markovian Queueing Networks: Normal Usage
- An Overview of PANACEA, a Software Package for Analyzing Markovian Queueing Networks
- Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking
This page was built for publication: Monte Carlo Summation Applied to Product-Form Loss Networks