Queuing analysis of a non-pre-emptive MMPP/D/1 priority system

Computer Communications

Volumn 20, Issue 11, 1997, Pages 999-1018

  Venkataramani, B ^a   Bose, Sanjay K ^b   Srivathsan, K R ^b  

^a NATIONAL INSTITUTE OF TECHNOLOGY   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

ATM networks; Markov modulated Poisson process (MMPP); Semi Markov sequences (SMCs)

Indexed keywords

APPROXIMATION THEORY; ASYNCHRONOUS TRANSFER MODE; COMPUTER SIMULATION; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; QUEUEING THEORY;

DUAL NON PREEMPTIVE PRIORITY SYSTEMS; MARKOV MODULATED POISSON PROCESS (MMPP); SEMI MARKOV PROCESS (SMP);

CONGESTION CONTROL (COMMUNICATION);

EID: 0031245534     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(97)00104-7     Document Type: Article

References (26)

1. S. Kowtha, D.R. Vaman, A generalized ATM traffic model and its application in bandwidth allocation, Proc. ICC, 1992, pp. 1009-1013.
2. A. Kuczura, The interrupted Poisson process as an overflow process, BSTJ 52 (1987) 347-448.
3. I. Ide, Superposition of interrupted Poisson processes and its application to packetized voice multiplexers, Proc. ITC-12, Torino, 1988.
4. H. Heffs, D. M. Lucantoni, A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performances, IEEE J. Select. Areas Commun. 6 (1986) 856-867.
5. E. Dutkiewics, G. Anido, Connection admission control in ATM networks, Proc. ITC Specialist Seminar, Kracow, 1990, pp. 166-176.
6. A. Baiochhi, Loss performance analysis of an ATM multiplexer loaded with high speed on-off sources, IEEE J. Select. Areas Commun. 9 (3) (1991) 388-393.
7. O.O. Raif, Asynchronous Transfer Mode Networks: Performance Issues. Artech House, Boston, 1994.
8. L.K. Jacob, A. Kumar, Comparative performance of scheduling strategies for switching and multiplexing in a hub-based ATM network: a simulation study, ITC Specialist Seminar, Bangalore, 1993, pp. 35-44.
9. A. Gravey, G. Hebuterne, Mixing time and loss priorities in a single server queue, Proc. ITC-13, Copenhagen, 1991, pp. 147-152.
10. A.K. Gupta and N.D. Georganos, Priority performance of ATM packet switches, Proc. Infocom-92, 1992, 5D.2.1.
11. J. Schormans, J. Pitts, E. Scharf, Priorities in ATM switches, Proc. ITC-3, Copenhagen, 1991, pp. 527-532.
12. M.F. Neuts, Structured Stochastic Matrices of the M/G/1 Type and their Application, Marcel Dekker Inc., New York, 1989.
13. V. Ramaswami, The N/G/1 queue and its detailed analysis, Adv. Appl. Prob. 12 (1980) 222-261.
14. B. Venkataramani, Queuing analysis of a non-preemptive MMPP/D/ 1/K priority system for applications in ATM networks, Ph.D. Thesis, IIT, Kanpur, 1994.
15. R.E. Barlow, F. Poschan, Mathematical Theory of Reliability, Wiley, New York, 1965.
16. C. Blondia. The N/G/1 finite capacity queue, Commun. Stat. Stochastic Model 5 (2) (1989) 373-394.
17. B. Venkataramani, S.K. Bose, K.R. Srivathsan, Queue length density and busy period distribution of MMPP/D/1 queue with non-preemptive priority for use in ATM networks, Proc. ITC Seminar, Bangalore, India, 1993, pp. 121-128.
18. B. Venkataramani, S.K. Bose, K.R. Srivathsan, An exact model for the queuing analysis of MMPP/D/1 queue with non-preemptive priority for applications in ATM networks, Proc. ICCS-94, Singapore, 1991, pp. 104-108.
19. B. Venkataramani, S.K. Bose, K.R. Srivathsan, Queuing analysis of a non-preemptive MMPP/D/1/K priority system, Proc. National Communications Conf. 1996, I.I.T., Bombay, India, February 1996, pp. 243-246.
20. B. Venkataramani, S.K. Bose, K.R. Srivathsan, Computation of queuing delays of a non-preemptive MMPP/D/1 priority system, Proc. National Communications Conf. 1991, I.I.T., Madras, India, 1991, pp. 12-16.
21. L. Kleinrock, Communication Nets: Stochastic Message Flow and Delay, McGraw-Hill, New York, 1964.
22. W. Fischer, K. Meier-Hallstern, The Markov modulated Poisson process (MMPP) cookbook, Performance Evaluation 18 (1993) 149-171.
23. R.W. Conway, W.L. Maxwell, L.W. Miller, Theory of Scheduling, Addison-Wesley, Massachusetts, 1967.
24. V. Ramaswami, The busy period of queues which have a matrix-geometric steady state probability vector, Opsearch 19 (1982) 238-261.
25. M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach, The Johns Hopkins University Press, 1981.
26. D.M. Lucantoni, New results on the single server with a batch Markovian arrival process, Commun. Stat. Stochastic Models 7 (1) (1991) 1-46.