Skip to main content
SpringerLink
Log in

Computational algorithms for blocking probabilities in circuit-switched networks

  • Loss Networks
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, we develop two new general purpose recursive algorithms for the exact computation of blocking probabilities in multi-rate product-form circuit-switched networks with fixed routing. The first algorithm is a normalization constant approach based on the partition function of the state distribution. The second is a mean-value type of algorithm with a recursion cast in terms of blocking probabilities and conditional probabilities. The mean value recursion is derived from the normalization constant recursion. Both recursions are general purpose ones that do not depend on any specific network topology. The relative advantage of the mean-value algorithm is numerical stability, but this is obtained at the expense of an increase in computational costs.

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. Aein, A multi-user class, blocked calls cleared demand access model, IEEE Trans. Commun. COM-26(1978)378–385.

    Article  Google Scholar 

  2. E. Arthurs and J. Kaufman, Sizing a message store subject to blocking criteria, in:Performance of Computer Systems, ed. M. Arato, A. Butrimenko and E. Gelenbe (North-Holland, Amsterdam, 1979), pp. 547–564.

    Google Scholar 

  3. G. Barberis and R. Brignolo, Capacity allocation in a DAMA satellite system, IEEE Trans. Commun. COM-30(1982)1750–1757.

    Article  Google Scholar 

  4. S. Bruell and G. Balbo,Computational Algorithms for Closed Queueing Networks (Elsevier, New York, 1980).

    Google Scholar 

  5. D. Burman, J. Lehoczky and Y. Lim, Insensitivity of blocking probabilities in a circuit-switched network, J. Appl. Prob. 21(1984)850–859.

    Google Scholar 

  6. K. Chandy and D. Neuse, Linearizer: A heuristic algorithm for queueing network models of computing systems, C. ACM 25(1982)126–134.

    Article  Google Scholar 

  7. A. Conway, E. de Souza c Silva and S. Lavenberg, Mean value analysis by chain of product form queueing networks, IEEE Trans. Comput. C-38(1989)432–442.

    Article  Google Scholar 

  8. A. Conway and N. Georganas, A new method for computing the normalization constant of multiple-chain queueing networks, INFOR 24(1986)184–198.

    Google Scholar 

  9. A. Conway and N. Georganas, RECAL — A new efficient algorithm for the exact analysis of multiple chain closed queueing networks, J. ACM 33(1986)768–791.

    Article  Google Scholar 

  10. A. Conway and N. Georganas,Queueing Networks — Exact Computational Algorithms: A Unified Theory Based on Decomposition and Aggregation (The MIT Press, Cambridge, MA, 1989).

    Google Scholar 

  11. R. Cooper,Introduction to Queueing Theory (North-Holland, New York, 1981).

    Google Scholar 

  12. E. de Souza c Silva, S. Lavenberg and R. Muntz, A perspective on iterative methods for the approximate analysis of closed queueing networks, in:Mathematical Computer Performance and Reliability, ed. G. Iazeolla, P. Courtois and A. Hordijk (North-Holland, 1984).

  13. Z. Dziong and J. Roberts, Congestion probabilities in a circuit-switched integrated services network, Perform. Eval. 7(1987)267–284.

    Article  MathSciNet  Google Scholar 

  14. G. Foschini and B. Gopinath, Sharing memory optimally, IEEE Trans. Commun. COM-31(1983)352–360.

    Article  Google Scholar 

  15. G. Fredrikson, Analysis of channel utilization in traffic concentrators, IEEE Trans. Commun. COM-22(1974)1122–1129.

    Article  Google Scholar 

  16. A. Gersht and K. Lee, Virtual circuit load control in fast packet-switched broadband networks, in:Proc. IEEE INFOCOM, Miami, FL (April 1988), pp. 214–220.

  17. L. Gimpelson, Analysis of mixtures of wide and narrow band traffic, IEEE Trans. Commun. COM-13(1965)258–266.

    Article  Google Scholar 

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

    Article  Google Scholar 

  19. M. Irland, Buffer management in a packet switch, IEEE Trans. Commun. COM-26(1978)328–337.

    Article  Google Scholar 

  20. A. Jafari, T. Saadawi and M. Schwartz, Blocking probability in two-way distributed circuit-switched CATV, IEEE Trans. Commun. COM-34(1986)977–984.

    Article  Google Scholar 

  21. D. Jagerman, Methods in traffic calculations, Bell Syst. Tech. J. 63(1984)1283–1310.

    Google Scholar 

  22. F. Kamoun and L. Kleinrock, Analysis of shared finite storage in a computer network node environment under general traffic conditions, IEEE Trans. Commun. COM-28(1980)992–1003.

    Article  Google Scholar 

  23. J. Kaufman, Blocking in a shared resource environment, IEEE Trans. Commun. COM-29(1981)1474–1481.

    Article  Google Scholar 

  24. F. Kelly, Blocking probabilities in large circuit-switched networks, Adv. Appl. Prob. 18(1986)473–505.

    Google Scholar 

  25. F. Kelly, Routing in circuit-switched networks: Optimization, shadow prices and decentralization, Adv. Appl. Prob. 20 (1988).

  26. S. Lam, Store-and-forward buffer requirements in a packet switching network, IEEE Trans. Commun. COM-24(1976)394–403.

    Article  Google Scholar 

  27. S. Lavenberg,Computer Performance Modeling Handbook (Academic Press, New York, 1983).

    Google Scholar 

  28. D. Mitra, Some results from an asymptotic analysis of a class of simple circuit-switched networks, in:Teletraffic Analysis and Computer Performance Evaluation, ed. O.J. Boxma et al. (North-Holland, 1986), pp. 47–63.

  29. E. Pinsky and A. Conway, Exact computation of blocking probabilities in state-dependent multifacility blocking models, in:Proc. Int. Conf. on the Performance of Distributed Systems and Integrated Communication Networks, Kyoto, Japan (Sept. 1991), pp. 353–362.

  30. K. Ross and D. Tsang, Teletraffic engineering for product-form circuit switched networks, Adv. Appl. Prob. 22(1990)657–675.

    Google Scholar 

  31. D. Tsang and K. Ross, Algorithms to determine exact blocking probabilities for multi-rate tree networks, IEEE Trans. Commun. COM-38(1990)1266–1271.

    Article  Google Scholar 

  32. W. Whitt, Blocking when service is required from several facilities simultaneously, Bell Syst. Tech. J. 64(1985)1807–1856.

    Google Scholar 

  33. T. Yum and C. Dou, Buffer allocation strategies with blocking requirements, Perform. Eval. 4(1984)285–295.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Boston University, 02215, Boston, MA, USA

    Eugene Pinsky

  2. GTE Laboratories Incorporated, 40 Sylvan Road, 02254, Waltham, MA, USA

    Adrian E. Conway

Authors
  1. Eugene Pinsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adrian E. Conway
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The results of section 2 were presented in part at the 7th ITC Seminar on Broadband Technologies, Morristown, NJ, October 1990.

Supported in part by the National Science Foundation, Grant No. CCR-9015717.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pinsky, E., Conway, A.E. Computational algorithms for blocking probabilities in circuit-switched networks. Ann Oper Res 35, 31–41 (1992). https://doi.org/10.1007/BF02023089

Download citation

  • Issue Date:

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

Keywords

Search

Navigation