Computational complexity of loss networks
- 14 March 1994
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 125 (1), 45-59
- https://doi.org/10.1016/0304-3975(94)90293-3
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Monte Carlo Summation Applied to Product-Form Loss NetworksProbability in the Engineering and Informational Sciences, 1992
- Computational algorithms for blocking probabilities in circuit-switched networksAnnals of Operations Research, 1992
- Loss NetworksThe Annals of Applied Probability, 1991
- Effective bandwidths at multi-class queuesQueueing Systems, 1991
- Teletraffic engineering for product-form circuit-switched networksAdvances in Applied Probability, 1990
- Congestion probabilities in a circuit-switched integrated services networkPerformance Evaluation, 1987
- Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blockingAdvances in Applied Probability, 1987
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986
- Insensitivity of blocking probabilities in a circuit-switching networkJournal of Applied Probability, 1984
- Probabilistic Models of Database LockingJournal of the ACM, 1984