Finite buffer GI/Geo/ 1 batch servicing queue with multiple working vacations

P. Vijaya Laxmi; Kanithi Jyothsna

RAIRO - Operations Research - Recherche Opérationnelle (2014)

  • Volume: 48, Issue: 4, page 521-543
  • ISSN: 0399-0559

Abstract

top
This paper analyzes a discrete-time finite buffer renewal input queue with multiple working vacations where services are performed in batches of maximum size “b”. The service times both during a regular service period and vacation period and vacation times are geometrically distributed. Employing the supplementary variable and imbedded Markov chain techniques, we derive the steady-state queue length distributions at pre-arrival, arbitrary and outside observer’s observation epochs. Based on the queue length distributions, some performance measures and waiting time distribution in the queue have been discussed. Finally, numerical results showing the effect of model parameters on the key performance measures are presented.

How to cite

top

Vijaya Laxmi, P., and Jyothsna, Kanithi. "Finite buffer GI/Geo/ 1 batch servicing queue with multiple working vacations." RAIRO - Operations Research - Recherche Opérationnelle 48.4 (2014): 521-543. <http://eudml.org/doc/275074>.

@article{VijayaLaxmi2014,
abstract = {This paper analyzes a discrete-time finite buffer renewal input queue with multiple working vacations where services are performed in batches of maximum size “b”. The service times both during a regular service period and vacation period and vacation times are geometrically distributed. Employing the supplementary variable and imbedded Markov chain techniques, we derive the steady-state queue length distributions at pre-arrival, arbitrary and outside observer’s observation epochs. Based on the queue length distributions, some performance measures and waiting time distribution in the queue have been discussed. Finally, numerical results showing the effect of model parameters on the key performance measures are presented.},
author = {Vijaya Laxmi, P., Jyothsna, Kanithi},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {discrete-time; finite buffer; batch service; multiple working vacations; waiting time; batch servicing queue},
language = {eng},
number = {4},
pages = {521-543},
publisher = {EDP-Sciences},
title = {Finite buffer GI/Geo/ 1 batch servicing queue with multiple working vacations},
url = {http://eudml.org/doc/275074},
volume = {48},
year = {2014},
}

TY - JOUR
AU - Vijaya Laxmi, P.
AU - Jyothsna, Kanithi
TI - Finite buffer GI/Geo/ 1 batch servicing queue with multiple working vacations
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 2014
PB - EDP-Sciences
VL - 48
IS - 4
SP - 521
EP - 543
AB - This paper analyzes a discrete-time finite buffer renewal input queue with multiple working vacations where services are performed in batches of maximum size “b”. The service times both during a regular service period and vacation period and vacation times are geometrically distributed. Employing the supplementary variable and imbedded Markov chain techniques, we derive the steady-state queue length distributions at pre-arrival, arbitrary and outside observer’s observation epochs. Based on the queue length distributions, some performance measures and waiting time distribution in the queue have been discussed. Finally, numerical results showing the effect of model parameters on the key performance measures are presented.
LA - eng
KW - discrete-time; finite buffer; batch service; multiple working vacations; waiting time; batch servicing queue
UR - http://eudml.org/doc/275074
ER -

References

top
  1. [1] H. Bruneel and B.G. Kim, Discrete-time models for communication systems including ATM. Kluwer Academic Publishers, Boston (1983). 
  2. [2] M.L. Chaudhry and J.G.C. Templeton, A first course in bulk queues. Wiley, New York (1983). Zbl0559.60073MR700827
  3. [3] V. Goswami and G.B. Mund, Analysis of discrete-time GI/Geo/1 /N queue with multiple working vacations. J. Sys. Sci. Sys. Eng.19 (2011) 367–384. 
  4. [4] V. Goswami and P. Vijaya Laxmi, Analysis of finite-buffer discrete-time batch-service queue with multiple vacations. Int. J. Inform. Manage. Sci.22 (2011) 291–310. Zbl1255.90042MR2830201
  5. [5] A. Gravey and G. Hébuterne, Simultaneity in discrete-time single server queues with Bernoulli inputs. Perform. Eval.14 (1992) 123–131. Zbl0752.60079MR1148546
  6. [6] U.C. Gupta and V. Goswami, Performance analysis of finite buffer discrete-time queue with bulk service. Comput. Oper. Res.29 (2002) 1331–1341. Zbl0994.90047MR1905829
  7. [7] B. Hajek, The proof of a folk theorem on queueing delay with applications to routing in networks. J. Assoc. Comput. Mach.30 (1983) 834-851. Zbl0627.68035MR819133
  8. [8] J.J. Hunter, Mathematical techniques of applied probability. Volume 2. Discrete-time models: Techniques and applications. Academic Press, New York (1983). Zbl0539.60064MR719019
  9. [9] C. Jiang, T. Yinghui and Y. Miaomiao, The discrete-time bulk service Geo/Geo/ 1 queue with multiple working vacations. J. App. Math. (2013) doi.org/10.1155/2013/587269. Zbl1266.90069MR3032255
  10. [10] G. Latouche and V. Ramaswami, Introdction to matrix analytic method in stochastic modelling. SIAM and ASA, Philadelphia (1990). Zbl0922.60001
  11. [11] J. Li, N. Tian and W. Liu, Discrete-time GI/Geo/1 queue with multiple working vacations. Queueing Sys.56 (2007) 53–63. Zbl1177.90095MR2334914
  12. [12] J. Li and N. Tian, The discrete-time GI/Geo/ 1 queue with working vacations and vacation interruption. App. Math. Comput.185 (2007) 1–10. Zbl1109.60076MR2298425
  13. [13] L.D. Servi and S.G. Finn, M/M/ 1 queue with working vacations M/M/1/N/WV. Perform. Eval.50 (2002) 41–52. 
  14. [14] N. Tian, Z. Ma and M. Liu, The discrete time Geom/Geom/1 queue with multiple working vacations. App. Math. Modell.32 (2008) 2941–2953. Zbl1167.90461MR2456327
  15. [15] H. Takagi, Queueing analysis - A foundation of performance evaluation. Volume 3. Discrete-time systems. North Holland, Amsterdam (1993). Zbl0744.60114MR1255106
  16. [16] M.E. Woodward, Communication and computer networks: Modelling with discrete-time queues. Los Alamitos, CA: IEEE Computer Society, Press (1994). Zbl0825.68173
  17. [17] M. Yu, Y. Tang, Y. Fu and L. Pan, GI/Geom/ 1 /N/MWV queue with changeover time and searching for the optimum service rate in working vacation period. J. Comput. App. Math.235 (2011) 2170–2184. Zbl1209.60052MR2763133

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.