Search Results - subject:"Batch Markovian Arrival Process"

A simple and efficient computing procedure of the stationary system-length distributions for GIX/D/c and BMAP/D/c queues

Banik, A. D.; Chaudhry, M. L.; Wittevrongel, Sabine; … - In: Computers & operations research : and their … 138 (2022), pp. 1-13

Persistent link: https://www.econbiz.de/10013040812

A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service

Ghosh, Souvik; Banik, A. D.; Walraevens, Joris; … - In: 4OR : quarterly journal of the Belgian, French and … 20 (2022) 2, pp. 241-272

Persistent link: https://www.econbiz.de/10013259940

Waiting-time analysis of D-BMAP/G/1 queueing system

Samanta, S. K. - 2020

Persistent link: https://www.econbiz.de/10012165592

On the identifiability of the two-state BMAP

Rodríguez, Joanna; Lillo, Rosa E.; Ramírez-Cobo, Pepa - Departamento de Estadistica, Universidad Carlos III de … - 2012

The capability of modeling non-exponentially distributed and dependent inter-arrival times as well as correlated batches makes the Batch Markovian Arrival Processes (BMAP) suitable in different real-life settings as teletraffic, queueing theory or actuarial contexts. An issue to be taken into...

Persistent link: https://www.econbiz.de/10010552282

Computation of the moments of queue length in the BMAP /SM/1 queue

Klimenok, V.; Dudin, A. N.; Samojlov, Konstantin E. - In: Operations research letters 45 (2017) 5, pp. 467-470

Persistent link: https://www.econbiz.de/10011774664

On the analytic assessment of the impact of traffic correlation on queues in continuous time domain

Li, Wei; Kouvatsos, Demetres D.; Fretwell, Rod J. - In: Computers & operations research : and their … 78 (2017), pp. 316-334

Persistent link: https://www.econbiz.de/10011631339

An algorithmic analysis of the BMAP/MSP/1 generalized processor-sharing queue

Ghosh, Souvik; Banik, A. D. - In: Computers & operations research : and their … 79 (2017), pp. 1-11

Persistent link: https://www.econbiz.de/10011672809

Efficient computational analysis of stationary probabilities for the queueing system BMAP/G/1/N with or without vacation(s)

Banik, A. D.; Chaudhry, M. L. - In: INFORMS journal on computing : JOC 29 (2017) 1, pp. 140-151

Persistent link: https://www.econbiz.de/10011648543

Analysis of a finite buffer variable batch service queue with batch Markovian arrival process and server's vacation

Sikdar, K.; Samanta, S. K. - In: Opsearch : journal of the Operational Research Society … 53 (2016) 3, pp. 553-583

Persistent link: https://www.econbiz.de/10011608955

Non-identifiability of the two state Markovian Arrival process

Ramirez, Pepa; Lillo, Rosa E.; Wiper, Michael P. - Departamento de Estadistica, Universidad Carlos III de … - 2009

In this paper we consider the problem of identifiability of the two-state Markovian Arrival process (MAP2). In particular, we show that the MAP2 is not identifiable and conditions are given under which two different sets of parameters, induce identical stationary laws for the observable process.

Persistent link: https://www.econbiz.de/10008496373