Blocking in a shared resource environment with batched Poisson arrival processes

Performance Evaluation

Volumn 24, Issue 4, 1996, Pages 249-263

  Kaufman, J S ^a   Rege, Kiran M ^a,b,c,d,e  

^a LUCENT TECHNOLOGIES   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^c UNIVERSITY OF FLORIDA   (United States)

^d UNIVERSITY OF HAWAII   (United States)

^e CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING   (India)

Author keywords

Batch poisson; Blocking; Erlang; Resource sharing

Indexed keywords

EID: 0042376763     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-5316(94)00029-8     Document Type: Article

References (20)

1. E. Brockmeyer, H.L. Haistrom and A. Jensen, The Life and Works of A.K. Erlang, Danish Academy of Sciences, Copenhagen (1948).
2. R. Syski, Introduction to Congestion Theory in Telephone Systems, Oliver & Boyd, London (1960).
3. R.I. Wilkinson, Theories for toll traffic engineering in the U.S.A., Bell System Tech. J. 35 (2) (1956) 421-514.
4. A.A. Fredericks, Congestion in blocking systems - a simple approximation technique, 59 (6) (1980) 805-827.
5. L.A. Gimpelson, Analysis of mixtures of wide and narrow-band traffic, IEEE Trans. Comm. Technology 13 (3) (1965) 258-266.
6. 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.
7. F. Kelly, Blocking probabilities in large circuit-switched networks, in Adv. Appl. Probab. 18 (1986) 473-508.
8. E.W.M. Wong and T.-S. Yum, Maximum free circuit routing in circuit switched networks, Proc. IEEE INFOCOM '90, IEEE Computer Society Press, 1990, pp. 934-937.
9. J.M. Aein, A multi-user-class, blocked-calls-cleared demand access model, IEEE Trans. Comm. 26 (3) (1978).
10. J.S. Kaufman, Blocking in a shared resource environment, IEEE Trans. Comm. 29 (10) (1981) 1474-1485.
11. 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.
12. L.E.N. Delbrouck, On the steady state distribution in a service facility with different peakedness factors and capacity requirements, IEEE Trans. Comm. 31 (11) (1983) 1209-1211.
13. J.W. Roberts, Teletraffic models for the Telecom 1 integrated services network, Proc. 10th Int. Teletraffic Conf., Montreal, 1983, paper 1.1-2.
14. 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, IEEE / ACM Trans. Networking 1 (6) (1993).
15. D. Mejzler, A generalization of Erlang's formulas in queueing theory, J. Appl. Probab. 5 (1968) 143-157.
16. A. Kuczura, Trunking formulas when the input is batched, Unpublished AT & T Bell Laboratories Memorandum, 1969.
17. D.L. Mansfield and P. Tran-Gia, Analysis of a finite storage system with batch input arising out of message packetization, IEEE Trans. Comm. 30 (3) (1982) 456-463.
18. Y. Takahashi and T. Katayama, Multi-server system with batch arrivals of queueing and non-queueing customers, Trans. IECE Japan E68 (10) (1985).
19. Z. Dziong and J.W. Roberts, Congestion probabilities in a circuit-switched integrated services network, Perform. Eval. 7 (1987) 267-284.
20. R.W. Wolff, Stochastic Modeling and the Theory of Queues, Prentice-Hall, Englewood Cliffs, N.J. (1989).