Fixed Point Approximations for Retrial Networks
Author:
- 1 April 1996
- journal article
- research article
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 10 (2) , 243-259
Abstract
Fixed point approximations for blocking probabilities arising from a link independence assumption and a light retrial rate limit are derived for circuitswitched network models that incorporate caller retrials. This approximation is a generalization of the well-known reduced load approximation for loss networks, which retains much of the versatility of this approximation.Keywords
This publication has 9 references indexed in Scilit:
- Loss NetworksThe Annals of Applied Probability, 1991
- A survey of retrial queuesQueueing Systems, 1990
- Limit theorems for loss networks with diverse routingAdvances in Applied Probability, 1989
- A survey on retrial queuesQueueing Systems, 1987
- Blocking probabilities in large circuit-switched networksAdvances in Applied Probability, 1986
- Blocking When Service Is Required From Several Facilities SimultaneouslyAT&T Technical Journal, 1985
- Insensitivity of blocking probabilities in a circuit-switching networkJournal of Applied Probability, 1984
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- The complexity of computing the permanentTheoretical Computer Science, 1979