Analyzing discrete-time bulk-service Geo/Geob/m queue

Veena Goswami; Umesh C. Gupta; Sujit K. Samanta

RAIRO - Operations Research (2006)

  • Volume: 40, Issue: 3, page 267-284
  • ISSN: 0399-0559

Abstract

top
This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of b customers. The interarrival- and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time distribution in the queue have also been discussed. Finally, it is shown that in limiting case the results obtained in this paper tend to the continuous-time counterpart.

How to cite

top

Goswami, Veena, Gupta, Umesh C., and Samanta, Sujit K.. "Analyzing discrete-time bulk-service Geo/Geob/m queue." RAIRO - Operations Research 40.3 (2006): 267-284. <http://eudml.org/doc/249750>.

@article{Goswami2006,
abstract = { This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of b customers. The interarrival- and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time distribution in the queue have also been discussed. Finally, it is shown that in limiting case the results obtained in this paper tend to the continuous-time counterpart. },
author = {Goswami, Veena, Gupta, Umesh C., Samanta, Sujit K.},
journal = {RAIRO - Operations Research},
keywords = {Bulk-service; discrete-time; multi-server; queueing; waiting-time.; bulk-service; queueing; waiting-time},
language = {eng},
month = {11},
number = {3},
pages = {267-284},
publisher = {EDP Sciences},
title = {Analyzing discrete-time bulk-service Geo/Geob/m queue},
url = {http://eudml.org/doc/249750},
volume = {40},
year = {2006},
}

TY - JOUR
AU - Goswami, Veena
AU - Gupta, Umesh C.
AU - Samanta, Sujit K.
TI - Analyzing discrete-time bulk-service Geo/Geob/m queue
JO - RAIRO - Operations Research
DA - 2006/11//
PB - EDP Sciences
VL - 40
IS - 3
SP - 267
EP - 284
AB - This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of b customers. The interarrival- and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time distribution in the queue have also been discussed. Finally, it is shown that in limiting case the results obtained in this paper tend to the continuous-time counterpart.
LA - eng
KW - Bulk-service; discrete-time; multi-server; queueing; waiting-time.; bulk-service; queueing; waiting-time
UR - http://eudml.org/doc/249750
ER -

References

top
  1. J.R. Artalejo and O. Hernández-Lerma, Performance analysis and optimal control of the Geo/Geo/c queue. Perform. Evaluation1013 (2002) 1–25.  
  2. H. Bruneel and B.G. Kim, Discrete-Time Models for Communication Systems Including ATM. Kluwer Academic Publishers, Boston (1983).  
  3. W.C. Chan and D.Y. Maa, The GI/Geom/N queue in discrete-time. INFOR16 (3) (1978) 232–252.  
  4. M.L. Chaudhry and S.H. Chang, Analysis of the discrete-time bulk-service queue Geo/GY/1/N + B. Oper. Res. Lett.32 (2004) 355–363.  
  5. M.L. Chaudhry and U.C. Gupta, Transient behaviour of the discrete-time Geom/Geom/m/m Erlang loss model, in Proc. of Probability Models and Statistics, edited by A.C. Borthakur and H. Choudhury. A J. Medhi Festschrift, New age international limited, publishers, New Delhi (1996) 133–145.  
  6. M.L. Chaudhry and U.C. Gupta, Algorithmic discussions of distributions of numbers of busy channels for GI/Geom/m/m queues. INFOR.38 (2000) 51–63.  
  7. M.L. Chaudhry and U.C. Gupta, Numerical evaluation of state probabilities at different epochs in multiserver GI/Geom/m queue, in Proc. of Advances on Methodological and Applied Aspects of Probability and Statistics, edited by N. Balakrishnan. Gordon and Breach Science Publishers (2001) 31–46.  
  8. M.L. Chaudhry and N.M. Kim, A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times. Oper. Res. Lett.31 (2003) 101–107.  
  9. M.L. Chaudhry, U.C. Gupta and V. Goswami, Modelling and analysis of discrete-time multiserver queues with batch arrivals: GIX/Geom/m. Inform. J. Comput.13 (3) (2001) 172–180.  
  10. M.L. Chaudhry, U.C. Gupta and V. Goswami, On discrete-time multiserver queue with finite buffer: GI/Geom/m/N. Comput.Oper. Res.31 (2004) 2137–2150.  
  11. P. Gao, S. Wittevrongel and H. Bruneel, Discrete-time multiserver queues with geometric service times. Comput.Oper. Res.31 (2004) 81–99.  
  12. A. Gravey and G. Hébuterne, Simultaneity in discrete time single server queues with Bernoulli inputs. Perform. Evaluation14 (1992) 123–131.  
  13. U.C. Gupta and V. Goswami, Performance analysis of finite buffer discrete-time queue with bulk service. Comput.Oper. Res.29 (2002) 1331–1341.  
  14. U.C. Gupta, S.K. Samanta and R.K. Sharma, Computing queueing length and waiting time distributions in finite-buffer discrete-time multi-server queues with late and early arrivals. Comput. Math. Appl.48 (2004) 1557–1573.  
  15. J.J. Hunter, Mathematical Techniques of Applied Probability, Vol-II, Discrete Time Models: Techniques and Applications. New York, Academic Press (1983).  
  16. J. Medhi, Stochastic Models in Queueing Theory. Academic Press, Inc. (1991).  
  17. I. Rubin and Z. Zhang, Message delay and queue size analysis for circuit-switched TDMA systems. IEEE Trans. Comm.39 (1991) 905–913.  
  18. R.M. Spiegel, Schaum's outline of theory and problems of calculus of finite differences and difference equations. Mcgraw Hill Inc. (1971).  
  19. S. Wittevrongel, H. Bruneel and B. Vinck, Analysis of the Discrete-Time G(G)/Geom/c Queueing Model, in Proc. of Networking 2002-Lecture Notes in Computer Science 2345, edited by E. Gregori, M. Conti, A.T. Campbell, G. Omidyar and M. Zukerman. Pisa, Italy (2002) 757–768.  
  20. M.E. Woodward, Communication and Computer Networks: Modelling with Discrete-Time Queues. Los Alamitos, CA: California IEEE Computer Society Press (1994).  

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.