Free Access
RAIRO-Oper. Res.
Volume 55, Number 3, May-June 2021
Page(s) 1231 - 1256
Published online 11 May 2021
  • L. Abolnikov and A. Dukhovny, Optimization in HIV screening problems. Int. J. Stochastic Anal. 16 (2003) 361–374. [Google Scholar]
  • A.S. Alfa, Queueing Theory for Telecommunications: Discrete-Time Modelling of a Single Node System. Springer Science & Business Media (2010). [Google Scholar]
  • A.S. Alfa, Applied Discrete-Time Queues. Springer (2016). [Google Scholar]
  • A. Banerjee, U.C. Gupta and V. Goswami, Analysis of finite-buffer discrete-time batch-service queue with batch-size-dependent service. Comput. Ind. Eng. 75 (2014) 121–128. [Google Scholar]
  • S.K. Bar-Lev, M. Parlar, D. Perry, W. Stadje and F.A. Van der Duyn Schouten, Applications of bulk queues to group testing models with incomplete identification. Eur. J. Oper. Res. 183 (2007) 226–237. [Google Scholar]
  • S.K. Bar-Lev, W. Stadje and F.A. van der Duyn Schouten, Optimal group testing with processing times and incomplete identification. Method. Comput. Appl. Probab. 6 (2004) 55–72. [Google Scholar]
  • H. Bruneel and B.G. Kim, Discrete-Time Models for Communication Systems Including ATM. Kluwer Acadmic, Boston (1993). [Google Scholar]
  • S.R. Chakravarthy, The batch markovian arrival process: a review and future work. In: Advances in Probability Theory and Stochastic Processes. edited by A. Krishnamoorthyet al.. Notable Publications Inc., NJ (2001) 21–39. [Google Scholar]
  • S.R. Chakravarthy, Markovian arrival processes. In: Wiley Encyclopedia of Operations Research and Management Science (2010). [Google Scholar]
  • M.L. Chaudhry and U.C. Gupta, Analysis of a finite-buffer bulk-service queue with discrete-Markovian arrival process: D-MAP/Ga,b/1/N. Nav. Res. Logistics (NRL) 50 (2003) 345–363. [Google Scholar]
  • M.L. Chaudhry and U.C. Gupta, Queue length distributions at various epochs in discrete-time D-MAP/G/1/N queue and their numerical evaluations. Int. J. Inf. Manage. Sci. 14 (2003) 67–84. [Google Scholar]
  • M.L. Chaudhry and J.G.C. Templeton, First Course in Bulk Queues. John Wiley and Sons (1983). [Google Scholar]
  • M.L. Chaudhry, G. Singh and U.C. Gupta, A simple and complete computational analysis of MAP/R/1 queue using roots. Method. Comput. Appl. Probab. 15 (2013) 563–582. [Google Scholar]
  • D. Claeys, B. Steyaert, J. Walraevens, K. Laevens and H. Bruneel, Analysis of a versatile batch-service queueing model with correlation in the arrival process. Perform. Eval. 70 (2013) 300–316. [Google Scholar]
  • D. Claeys, B. Steyaert, J. Walraevens, K.D. Laevens and H. Bruneel, Tail probabilities of the delay in a batch-service queueing model with batch-size dependent service times and a timer mechanism. Comput. Oper. Res. 40 (2013) 1497–1505. [Google Scholar]
  • H.R. Gail, S.L. Hantler, M. Sidi and B.A. Taylor, Linear independence of root equations for M/G/1 type Markov chains. Queueing Syst. 20 (1995) 321–339. [Google Scholar]
  • U.C. Gupta, S.K. Samanta and V. Goswami, Analysis of a discrete-time queue with load dependent service under discrete-time Markovian arrival process. J. Korean Stat. Soc. 43 (2014) 545–557. [Google Scholar]
  • U.C. Gupta, G. Singh and M.L. Chaudhry, An alternative method for computing system-length distributions of BMAP/R/1 and BMAP/D/1 queues using roots. Perform. Eval. 95 (2016) 60–79. [Google Scholar]
  • J.J. Hunter, Mathematical techniques of applied probability. In: Vol. 2 of Discrete Time Models: Techniques and Applications. Academic Press, New York (1983). [Google Scholar]
  • J. Medhi, Recent Developments in Bulk Queueing Models. Wiley Eastern Limited (1984). [Google Scholar]
  • S. Pradhan and U.C. Gupta, Modeling and analysis of an infinite-buffer batch-arrival queue with batch-size-dependent service: Formula . Perform. Eval. 108 (2017) 16–31. [Google Scholar]
  • S. Pradhan and U.C. Gupta, Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process. Ann. Oper. Res. 277 (2019) 161–196. [Google Scholar]
  • S. Pradhan and U.C. Gupta, Stationary queue and server content distribution of a batch-size-dependent service queue with batch Markovian arrival process: Formula . To appear in: Commun. Stat. Theory Methods DOI: 10.1080/03610926.2020.1813304 (2020) 1–28. [Google Scholar]
  • S.K. Samanta, Waiting-time analysis of D - BMAP/G/1 queueing system. Ann. Oper. Res. 284 (2020) 401–413. [Google Scholar]
  • H. Takagi, Queuing analysis: A Foundation of Performance Evaluation. Discrete time systems. North-Holland, Amsterdam 3 (1993). [Google Scholar]
  • M.E. Woodward, Communication and Computer Networks: Modelling with Discrete-Time Queues. Wiley-IEEE Computer Society Pr (1994). [Google Scholar]
  • M. Yu and A.S. Alfa, Algorithm for computing the queue length distribution at various time epochs in DMAP/G(1,a,b)/1/N queue with batch-size-dependent service time. Eur. J. Oper. Res. 244 (2015) 227–239. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.