Skip to main content
SpringerLink
Log in

Asymptotic marginal independence in large networks of loss systems

  • Part I Numerical Problems In Probability
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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. We present 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.M. Akinpelu, The overload performance of engineered networks with nonhierarchical and hierarchical routing, AT&T Tech. J. 63(1984)1261.

    Google Scholar 

  2. P. Billingsley,Convergence of Probability Measures (Wiley, New York, 1968).

    Google Scholar 

  3. D.Y. Burman, J.P. Lohoczky and Y. Lim, Insensitivity of blocking probabilities in a circuit switching network, J. Appl. Prob. 21(1984)850.

    Google Scholar 

  4. D.Y. Burman, Insensitivity in queueing systems, Adv. Appl. Prob. 13(1981)846

    Google Scholar 

  5. L. Green, A queueing system in which customers require a random number of servers, Oper. Res. 28(1980)1335.

    Google Scholar 

  6. D.P. Heyman and M.J. Sobel,Stochastic Models in Operations Research, Vol. I (McGraw-Hill, New York, 1982).

    Google Scholar 

  7. A.F. Karr, Weak convergence of a sequence of Markov chains, Z. Wahrscheinlichkeitstheorie verw. Gebiete 33(1975)41.

    Google Scholar 

  8. D. Mitra and P.J. Weinberger, Probabilistic models of database locking: Solutions, computational algorithms and asymptotics, J. Assoc. Comput. Mach. 31(1984)855.

    Google Scholar 

  9. A.G. Pakes, Some conditions for ergodicity and recurrence of Markov chains, Oper. Res. 17(1969)1058.

    Google Scholar 

  10. D. Sonderman, Comparing semi-Markov processes, Math. Oper. Res. 5(1980)110.

    Google Scholar 

  11. W. Whitt, Continuity of generalized semi-Markov processes, Math. Oper. Res. 5(1980)494.

    Google Scholar 

  12. W. Whitt, Blocking when service is required from several facilities simultaneously, AT&T Tech. J. (1985)1807.

  13. E. Wolman, The camp-on problem for multiple-address traffic, Bell Syst. Tech. J. 51(1972)1363.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bell Communications Research, 07701, Red Bank, New Jersey, USA

    D. P. Heyman

Authors
  1. D. P. Heyman
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Heyman, D.P. Asymptotic marginal independence in large networks of loss systems. Ann Oper Res 8, 57–73 (1987). https://doi.org/10.1007/BF02187082

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02187082

Keywords and phrases

Search

Navigation