| Author(s) | Montasser Ouaily |
| Affiliation | Ecole Nationale des Sciences de l'lnformatique, Universite de Tunis I/, 2049 Ariana, Tunisie |
| Title | Evaluation of the Blocking Probability of |
| Source | Journal of King Saud University. Computer & Information Sciences. Volume 6, No 1. (1994/1414) |
| Abstract | We derive the probability of a customer finding no available circuit in a limited access network. We analyze a limited access network with a finite number of circuits and several classes of customers. Each class of customers has an upper bound on the number of circuits being simultaneously used by customers of that class. This upper bound may differ from a class to another. Several intelligent networks are nowa-days adopting this method of access since it allows them to control the cost of communication. A common example is the Private Virtual Network which often has this capability. We provide an exact solution and a divide and conquer algorithm for determining the probabilities of finding no available circuit for each class of customers. These probabilities are essential in specifying the circuit requirements in the network. |
