A Finite MAP_K/G_K/1 Queueing System with Generalized Foreground-Background Processor-Sharing Discipline

Queuing systems with Markov arrival process, several customer types, generalized foreground-background processor-sharing discipline with minimal served length or separate finite buffers for customers of different types, or a common finite buffer for customers of all types are studied. Mathematical relations are derived and used to compute the joint stationary distribution of the number of customers of all types in a system

Two-phase queueing system with a Markov arrival process and blocking

[No abstract available

Analysis of a two-phase queueing system with a Markov arrival process and losses

[No abstract available

Two-phase queueing system with a Markov arrival process and blocking

[No abstract available

Analysis of a two-phase queueing system with a Markov arrival process and losses

[No abstract available

Analysis of the multi-server Markov queuing system with unlimited buffer and negative customers

Consideration was given to the multi-server queuing system with unlimited buffer, Markov input flow, and Markov (general) process of servicing all customers on servers with the number of process states and intensities of the inter-phase passage depending on the number of customers in the system. Additionally, a Markov flow of negative customers arrives to the system, the arriving negative customer killing the last queued positive customer. A recurrent algorithm to calculate the stationary probabilities of system states was obtained, and a method of calculation of the stationary distribution of the waiting time before starting servicing of a positive customer was proposed. © Nauka/Interperiodica 2007

Discrete-Time MAP/G/1/∞ System with InversiveProbabilistic Servicing Discipline

Consideration was given to the discrete-time MAP/G/1/∞ queuing system where the arriving customer is taken to the server with a certain probability depending only of the processed length of the customer in service and squeezes out its predecessor to the first place on the queue or, with the complementary probability, occupies the first place on the queue (inversive probabilistic servicing discipline). For this system, the main stationary operational characteristics were established

Analysis of the multi-server Markov queuing system with unlimited buffer and negative customers

Consideration was given to the multi-server queuing system with unlimited buffer, Markov input flow, and Markov (general) process of servicing all customers on servers with the number of process states and intensities of the inter-phase passage depending on the number of customers in the system. Additionally, a Markov flow of negative customers arrives to the system, the arriving negative customer killing the last queued positive customer. A recurrent algorithm to calculate the stationary probabilities of system states was obtained, and a method of calculation of the stationary distribution of the waiting time before starting servicing of a positive customer was proposed. © Nauka/Interperiodica 2007