An infinite-server queueing model MMAPkGk in semi-Markov random environment with marked MAP arrival and subject to catastrophes

05/23/2018
by   K. Kerobyan, et al.
0

In the present paper the infinite-server MMAPkGk queueing model with random resource vector of customers, marked MAP arrival and semi-Markov (SM) arrival of catastrophes is considered. The joint generating functions (PGF) of transient and stationary distributions of number of busy servers and numbers of different types served customers, as well as Laplace transformations (LT) of joint distributions of total accumulated resources in the model at moment and total accumulated resources of served customers during time interval are found. The basic differential and renewal equations for transient and stationary PGF of queue sizes of customers are found.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/24/2022

Non-asymptotic near optimal algorithms for two sided matchings

A two-sided matching system is considered, where servers are assumed to ...
research
02/04/2018

Uncertainty Quantification of the time averaging of a Statistics Computed from Numerical Simulation of Turbulent Flow

Rigorous assessment of the uncertainty is crucial to the utility of nume...
research
08/20/2017

When to arrive at a queue with earliness, tardiness and waiting costs

We consider a queueing facility where customers decide when to arrive. A...
research
12/16/2020

On the fractional queueing model with catastrophes

Customers arrive at a service facility according to a Poisson process. U...
research
02/22/2023

Using infinite server queues with partial information for occupancy prediction

Motivated by demand prediction for the custodial prison population in En...
research
05/31/2020

Staffing for many-server systems facing non-standard arrival processes

Arrival processes to service systems often display (i) larger than antic...

Please sign up or login with your details

Forgot password? Click here to reset