Some algorithms for discrete time queues with finite capacity

Queueing Systems

Volumn 25, Issue 1-4, 1997, Pages 281-305

  Sharma, Vinod ^a,b   Gangadhar, Nandyala D ^b  

^a INRS EMT   (Canada)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Algorithms; Discrete time queue; Finite capacity queue; Markov modulated arrivals; Overflow time; Probability of overflow; Regeneration cycle length

Indexed keywords

ALGORITHMS;

DISCRETE TIME QUEUES; FINITE CAPACITY QUEUES; MARKOV MODULATED ARRIVALS; OVERFLOW TIME; PROBABILITY OF OVERFLOW; REGENERATION CYCLES;

QUEUEING THEORY;

EID: 0031535120     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/a:1019196100207     Document Type: Article

References (21)

1. S. Asmussen, Applied Probability and Queues (Wiley, Chichester, 1987).
2. S. Asmussen and D. Perry, On cycle maxima, first passage problems and extreme value theory for queues, Stoch. Models 8 (1992) 421-458.
3. K. Bisidikian, J.S. Lew and A.N. Tantawi, On the tail approximations of the blocking probability of single server queues with finite capacity, in: Queueing Networks with Finite Capacity, eds. R.O. Onvural and I.F. Akyildiz (Elsevier, Amsterdam, 1993).
4. H. Bruneel, Performance of discrete time queueing systems, Comput. Oper. Res. 20(3) (1993) 303-320.
5. H. Bruneel and B.C. Kim, Discrete-Time Models for Communication Systems Including ATM (Kluwer Academic Publishers, Dordrecht, The Netherlands, 1993).
6. M.L. Chaudury and Y.A. Zhao, First passage times and busy period distributions of discrete time Markovian queues: Geom(n)/Geom(n)/1/N, Queueing Systems 18 (1994) 5-26.
7. W.W. Chu and A.G. Konheim, On the analysis and modeling of a class of computer communication systems, IEEE Trans. Comm. COM 20(3) (June 1972) 645-660.
8. I. Cidon, A. Khamisy and M. Sidi, On packet loss process in high-speed networks, in: Proc. INFOCOM '92 (IEEE, 1992) pp. 0242-0251.
9. J.W. Cohen, The Single Server Queue, revised ed. (North-Holland, Amsterdam, 1982).
10. N.D. Gangadhar, Analysis of discrete time queues with applications to ATM based B-ISDNs. M.Sc.(Engg.) thesis, Department of Electrical Engineering, Indian Institute of Science, Bangalore, India, April 1995.
11. P. Glasserman and S.G. Kou, Overflow probabilities in Jackson networks, in: Proc. IEEE Conf. Dec. and Control (1993) pp. 3178-3182.
12. K. Kobayashi and A.G. Konheim, Queueing models for computer communication system analysis, IEEE Trans. Comm. COM 25(1) (January 1977) 2-29.
13. D. Kofmann and H. Korelioglu, Loss probabilities and delay and jitter distribution in a finite buffer queue with heterogenous batch Markovian arrival process, in: Proc. GLOBECOM '93 (IEEE, 1993) pp. 830-834.
14. J.W. Pitman, Occupational measures for Markov chains, Adv. Appl. Probab. 9 (1977) 69-89.
15. N.U. Prabhu, Stochastic Storage Processes: Queues, Insurance Risks and Dams (Springer, New York, 1980).
16. J.W. Roberts, COST 224 final report - performance evaluation and design of multiserver networks, Technical report (COST, 1991).
17. V. Sharma, Reliable estimation via simulation, Queueing Systems 19 (1995) 169-192.
18. V. Sharma and N.D. Gangadhar, Asymptotics for transient and stationary probabilities for finite and infinite buffer discrete time queues, to appear in Queueing Systems.
19. T. Takine, T. Suda and T. Hasegawa, Cell loss and output process analysis of a finite buffer discrete-time ATM queueing system with correlated arrivals, in: Proc. INFOCOM '93 (IEEE, 1993) pp. 1259-1269.
20. H. Tijms, Heuristics for finite buffer queues, Probab. Engrg. Inform. Sci. 6 (1992) 277-285.
21. T.Y. Yen, On the delay analysis of a TDMA channel with finite capacity, IEEE Trans. Comm. COM 30 (1982) 1937-1941.