Advertisement

Queueing Systems

, Volume 25, Issue 1–4, pp 281–305 | Cite as

Some algorithms for discrete time queues with finite capacity

  • Vinod Sharma
  • Nandyala D. Gangadhar
Article

Abstract

We consider a discrete time queue with finite capacity and i.i.d. and Markov modulated arrivals. Efficient algorithms are developed to calculate the moments and the distributions of the first time to overflow and the regeneration length. Results are extended to the multiserver queue. Some illustrative numerical examples are provided.

finite capacity queue discrete time queue algorithms overflow time regeneration cycle length probability of overflow Markov modulated arrivals 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. Asmussen, Applied Probability and Queues (Wiley, Chichester, 1987).Google Scholar
  2. [2]
    S. Asmussen and D. Perry, On cycle maxima, first passage problems and extreme value theory for queues, Stoch. Models 8 (1992) 421–458.Google Scholar
  3. [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).Google Scholar
  4. [4]
    H. Bruneel, Performance of discrete time queueing systems, Comput. Oper. Res. 20(3) (1993) 303–320.CrossRefGoogle Scholar
  5. [5]
    H. Bruneel and B.G. Kim, Discrete-Time Models for Communication Systems Including ATM (Kluwer Academic Publishers, Dordrecht, The Netherlands, 1993).Google Scholar
  6. [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.CrossRefGoogle Scholar
  7. [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.CrossRefGoogle Scholar
  8. [8]
    I. Cidon, A. Khamisy and M. Sidi, On packet loss process in high-speed networks, in: '92 (IEEE, 1992) pp. 0242–0251.Google Scholar
  9. [9]
    J.W. Cohen, The Single Server Queue, revised ed. (North-Holland, Amsterdam, 1982).Google Scholar
  10. [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.Google Scholar
  11. [11]
    P. Glasserman and S.G. Kou, Overflow probabilities in Jackson networks, in: Proc. IEEE Conf. Dec. and Control (1993) pp. 3178–3182.Google Scholar
  12. [12]
    K. Kobayashi and A.G. Konheim, Queueing models for computer communication system analysis, IEEE Trans. Comm. COM 25(1) (January 1977) 2–29.CrossRefGoogle Scholar
  13. [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: '93 (IEEE, 1993) pp. 830–834.Google Scholar
  14. [14]
    J.W. Pitman, Occupational measures for Markov chains, Adv. Appl. Probab. 9 (1977) 69–89.CrossRefGoogle Scholar
  15. [15]
    N.U. Prabhu, Stochastic Storage Processes: Queues, Insurance Risks and Dams (Springer, New York, 1980).Google Scholar
  16. [16]
    J.W. Roberts, COST 224 final report - performance evaluation and design of multiserver networks, Technical report (COST, 1991).Google Scholar
  17. [17]
    V. Sharma, Reliable estimation via simulation, Queueing Systems 19 (1995) 169–192.CrossRefGoogle Scholar
  18. [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.Google Scholar
  19. [19]
    T. Takine, T. Suda and T. Hasegawa, Cell loss and output process analysis of a finite buffer discretetime ATM queueing system with correlated arrivals, in: '93 (IEEE, 1993) pp. 1259–1269.Google Scholar
  20. [20]
    H. Tijms, Heuristics for finite buffer queues, Probab. Engrg. Inform. Sci. 6 (1992) 277–285.CrossRefGoogle Scholar
  21. [21]
    T.Y. Yen, On the delay analysis of a TDMA channel with finite capacity, IEEE Trans. Comm. COM 30 (1982) 1937–1941.CrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • Vinod Sharma
  • Nandyala D. Gangadhar

There are no affiliations available

Personalised recommendations