Error bounds for asymptotic approximations of the partition function
From MaRDI portal
Publication:1362313
DOI10.1007/BF01206558zbMath0879.60090MaRDI QIDQ1362313
Alexander Birman, Yaakov Kogan
Publication date: 3 August 1997
Published in: Queueing Systems (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Another approach to asymptotic expansions for large closed queueing networks
- Exact and asymptotic solutions for models of new telecommunication services
- Asymptotic expansions for closed Markovian networks with state-dependent service rates
- Integral Representations and Asymptotic Expansions for Closed Markovian Queueing Networks: Normal Usage
- Asymptotic evaluation of closed queueing networks with many stations
- A simple approximation for the Erlang loss function
- Aspects of the solution of some multiclass loss systems
- Calculating normalization constants of closed queueing networks by numerically inverting their generating functions
- An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models
This page was built for publication: Error bounds for asymptotic approximations of the partition function