The Batch Markovian Arrival Process Subject to Renewal Generated Geometric Catastrophes
Stochastic Models, 2007 We deal with a population of individuals that grows stochastically according to a batch Markovian arrival process and is subject to renewal generated geometric catastrophes. Our interest is in the semi-regenerative process that describes the population size at arbitrary times.
Antonis Economou +1 more
exaly +6 more sources
Analysis of a Queueing Model with Batch Markovian Arrival Process and General Distribution for Group Clearance. [PDF]
Methodol Comput Appl Probab, 2021 In this paper we consider a single server queueing model with under general bulk service rule with infinite upper bound on the batch size which we call group clearance. The arrivals occur according to a batch Markovian point process and the services are generally distributed.
Chakravarthy SR, Shruti, Rumyantsev A.
europepmc +5 more sources
Informatika, 2016 In the paper, a queueing system with unreliable server and so called «cold» redundancy is analyzed. The system consists of an infinite buffer, the main unreliable server and the reliable reserve server.
V. I. Klimenok
doaj +2 more sources
Burst ratio for a versatile traffic model. [PDF]
PLoS One, 2022 We deal with a finite-buffer queue, in which arriving jobs are subject to loss due to buffer overflows. The burst ratio parameter, which reflects the tendency of losses to form long series, is studied in detail.
Chydzinski A.
europepmc +4 more sources
Computational and Numerical Investigation of the Batch Markovian Arrival Process Subject to Renewal Generated Geometric Catastrophes. [PDF]
Int J Appl Comput Math, 2021 In this paper, we consider a stochastic model in which the population grows according to the batch Markovian arrival process and is subjected to renewal generated geometric catastrophes. Our analytical work starts from the vector generating function (VGF) of the population size at post-catastrophe epoch.
Kumar N, Gupta UC, Singh G.
europepmc +4 more sources
A queueing system with a batch Markovian arrival process and varying priorities
Журнал Белорусского государственного университета: Математика, информатика, 2022 We consider herein a single-server queueing system with a finite buffer and a batch Markovian arrival process. Customers staying in the buffer may have a lower or higher priority.
Valentina I. Klimenok
doaj +5 more sources
Mathematics, 2021 A single-server queuing-inventory system in which arrivals are governed by a batch Markovian arrival process and successive arrival batch sizes form a finite first-order Markov chain is considered in this paper.
Achyutha Krishnamoorthy +2 more
exaly +3 more sources
Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process
Annals of Operations Research, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sourav Pradhan, U C Gupta
exaly +6 more sources
Demographic History and Genetic Diversity of Rātā Moehau (<i>Metrosideros bartlettii</i>; Myrtaceae), a Critically Endangered Aotearoa New Zealand Endemic Tree. [PDF]
Ecol EvolRātā Moehau (Metrosideros bartlettii), a critically endangered tree endemic to Aotearoa New Zealand, is represented by only 14 wild individuals. We assembled its first genome, analysed genetic diversity in wild and cultivated individuals and found long‐term population decline and reduced diversity in cultivated plants—providing key insights to support ...
Prebble JM +5 more
europepmc +2 more sources
Stationary characteristics of unreliable queueing system with a batch Markovian arrival process
Informatika, 2019 Unreliable queuing systems are of considerable interest both in mathematical terms and for applications. Systems with stationary Poisson flows of customers and breakdowns and exponentially distributed service and repair times are mainly considered.
V. I. Klimenok
doaj +1 more source