| Article ID: | iaor19882 |
| Country: | Switzerland |
| Volume: | 8 |
| Start Page Number: | 57 |
| End Page Number: | 73 |
| Publication Date: | Jul 1987 |
| Journal: | Annals of Operations Research |
| Authors: | Heyman D.P. |
| Keywords: | communications, queues: theory, markov processes |
Network models in which each node is a loss system frequently arise in telephony. Models with several hundred nodes are common. Suppose a customer requires a server from each of several nodes. It would be convenient if the probability that the required servers are all free were approximately a product, where each term is the probability a required node has a free server. This paper presents some theorems to support this approximation. Most of the theorems are restricted to nodes with one server. Some of the difficulties in analyzing nodes with multiple servers are described.