Exact computation of time and call blocking probabilities in large, multi-traffic, multi-resource loss systems

Performance Evaluation

Volumn 25, Issue 1, 1996, Pages 41-58

  Awater, Geert A ^a,b   Van De Vlag, Harry A B ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Blocking probabilities; BPP arrival process; Call congestion; Efficient computation; Erlang formula; Loss systems; Resource sharing; Time congestion

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBABILITY DENSITY FUNCTION; RANDOM PROCESSES; SWITCHING NETWORKS; TELECOMMUNICATION TRAFFIC;

BERNOULL-POISSON-PASCAL PROCESS; CALL BLOCKING PROBABILITIES; COMPUTATION TIME; ERLANG FORMULA; LOSS SYSTEMS; RECURSION FORMULA; RESOURCE SHARING; TELETRAFFIC THEORY; TIME CONGESTION;

TELEPHONE SYSTEMS;

EID: 0030107774     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-5316(93)00043-6     Document Type: Article

References (30)

1. J.M. Aein, A multi-user-class, blocked-calls-cleared demand access mode, IEEE Trans. Comm., 26(3) (1978) 378-385.
2. E. Arthurs and J.S. Kaufman, Sizing a message store subject to blocking criteria, in: M. Arato, A. Butrimenko and E. Gelembe (Eds.), Performance of Computer Systems, North-Holland, Amsterdam (1979) 547-564.
3. G. Barbaris and R. Brignolo, Capacity allocation in a DAMA satellite system, IEEE Trans. Comm. 30(7) (1982) 1750-1757.
4. D. Burman, J. Lehoczky and Y. Lim, Insensitivity of blocking probabilities in a circuit-switching network, J. Appl. Prob. 21 (1984) 850-859.
5. G.L. Chaudury, K.K. Leung and W. Whitt, An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models, Adv. Appl. Prob., to appear.
6. A.E. Conway and E. Pinsky, A decomposition method for the exact analysis of circuit-switched networks, Proc. IEEE INFOCOM'92, Florence, Italy, May 4-8 1992, pp. 996-1003.
7. L.E.N. Delbrouck, A unified approximate evaluation of congestion functions for smooth and peaky traffic, IEEE Trans. Comm. 29(2) (1981) 85-91.
8. L.E.N. Delbrouck, On the steady-state distribution in a service facility carrying mixtures of traffic with different peakedness factors and capacity requirements, IEEE Trans. Comm. 31(11) (1983) 1209-1211.
9. Z. Dziong and J.W. Roberts, Congestion probabilities in a circuit-switched integrated services network, Performance Evaluation 7(4) (1987) 267-284.
10. G. Fredrikson, Analysis of channel utilization in traffic concentrators, IEEE Trans. Comm. 22(8) (1974) 1122-1129.
11. A. Jafari, T. Saadawi and M. Schwartz, Blocking probabilities in two-way distributed circuit-switched CATV, IEEE Trans. Comm. 34(10) (1986) 977-984.
12. S.A. Johnson, A performance analysis of integrated communications systems, Br. Telecom Tech. J. 3(4) (1985) 36-45.
13. F. Kamoun and L. Kleinrock, Analysis of shared finite storage in a computer network node environment under general traffic conditions, IEEE Trans. Comm. 28(7) (1980) 992-1003.
14. J.S. Kaufman, Blocking in a shared resource environment, IEEE Trans. Comm. 29(10) (1981) 1474-1481.
15. J.S. Kaufman, Blocking in a completely shared resource environment with state-dependent resource and residency requirements, Proc. IEEE INFOCOM'92, Florence, Italy, May 4-8 1992, pp. 2224-2232.
16. J.S. Kaufman, Blocking with retrials in a completely shared resource environment, Performance Evaluation 15 (1992) 99-113.
17. F.P. Kelly, Blocking probabilities in large circuit-switched networks, Adv. Appl. Prob. 18 (1986) 473-505.
18. H. Kobayashi, System design and performance analysis using analytical models, in: K.M. Chandy and R.T. Yeh (Eds.), Current Trends in Programming Methodology Vol. III, Software Modeling, Prentice-Hall, Englewood Cliffs, NJ (1978).
19. J.P. Labourdette and G.W. Hart, Blocking probabilities in multitraffic loss systems: insensitivity, asymptotic behavior and approximations, IEEE Trans. Comm. 40(8) (1992) 1355-1366.
20. S. Lam, Store-and-forward buffer requirements in a packed-switching network, IEEE Trans. Comm. 24(4) (1976) 394-403.
21. E. Pinsky and A.E. Conway, Exact computation of blocking probabilities in state-dependent multi-facility blocking models, in: T. Hasegawa, H. Takagi and Y. Takahashi (Eds.), Perfomance of Distributed Systems and Communications Networks, Elsevier, Amsterdam (1992) 383-392.
22. E. Pinsky and A.E. Conway, Computational algorithms for blocking probabilities in circuit-switched networks, Ann. Oper. Res. 35 (1992) 31-41.
23. J.W. Roberts, A service system with heterogeneous user requirements, in: G. Pujolle (Ed.), Performance of Data Communications Systems and Their Applications, North-Holland, Amsterdam (1981) 423-431.
24. K. Ross and D. Tsang, The stochastic knapsack problem, IEEE Trans. Comm. 37(7) (1989) 740-747.
25. K. Ross and D. Tsang, Teletraffic engineering for product-form circuit-switched networks, Adv. Appl. Prob. 22(3) (1990) 657-675.
26. D. Tsang and K. Ross, Algorithms to determine exact blocking probabilities for multirate tree networks, IEEE Trans. Comm. 38(8) (1990) 1266-1271.
27. E.A. van Doorn, A note on Delbrouck's approximate solution to the heterogeneous blocking problem, IEEE Trans. Comm. 32(11) (1984) 1210-1211.
28. E.A. van Doorn and F.J.M. Panken, Blocking probabilities in a loss system with arrivals in geometrically distributed batches and heterogeneous service requirements, ACM/IEEE Trans. Networking 1(6) (1993) 664-667.
29. R.I. Wilkinson, Theories for toll traffic engineering in the U.S.A., Bell System Tech. J. 35(2) (1956) 421-514.
30. R.W. Wolff, Poisson arrivals see time averages, Oper. Res. 30(2) (1982) 223-231.