Results 11 to 20 of about 10,720,791 (210)
On Markovian modelling of arrival processes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gely Basharin +2 more
core +5 more sources
Nonidentifiability of the Two-State Markovian Arrival Process [PDF]
In this paper we consider the problem of identifiability for the two-state Markovian arrival process (MAP2). In particular, we show that the MAP2is not identifiable, providing the conditions under which two different sets of parameters induce identical stationary laws for the observable process.
Wiper, Michael Peter +2 more
openaire +5 more sources
On some queueing systems with server vacations, extended vacations, breakdowns, delayed repairs and stand-bys [PDF]
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This research investigates a batch arrival queueing system with a Bernoulli scheduled vacation and random system breakdowns.
Khalaf, Rehab
core +7 more sources
Robust filtering for discrete-time Markovian jump delay systems [PDF]
Copyright [2004] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services.
Liu, X, Wang, Z, Lam, J
core +7 more sources
Some descriptors of the Markovian arrival process
The Markovian Arrival Process (MAP) is a tractable, versatile class of Markov renewal processes which has been extensively used to model arrival (or service) processes in queues.
Narayana, Surya, 1962-
core +4 more sources
On Two Interacting Markovian Queueing Systems
In this paper, we study a Markovian queuing system consisting of two subsystems of an arbitrary structure. Each subsystem generates a multi-class Markovian arrival process of customers arriving to the other subsystem.
Valeriy A. Naumov +2 more
doaj +1 more source
MARKOVIAN QUEUES WITH CORRELATED ARRIVAL PROCESSES [PDF]
In an attempt to examine the effect of dependencies in the arrival process on the steady state queue length process in single server queueing models with exponential service time distribution, four different models for the arrival process, each with marginally distributed exponential inter-arrivals to the queueing system, are considered.
openaire +3 more sources
Burst ratio for a versatile traffic model.
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.
Andrzej Chydzinski
doaj +3 more sources
Priority Multi-Server Queueing System with Heterogeneous Customers
In this paper, we analyze a multi-server queueing system with heterogeneous customers that arrive according to a marked Markovian arrival process. Customers of two types differ in priorities and parameters of phase type distribution of their service time.
Valentina Klimenok +2 more
doaj +1 more source
Analysis of a k-Stage Bulk Service Queuing System with Accessible Batches for Service
In most of the service systems considered so far in queuing theory, no fresh customer is admitted to a batch undergoing service when the number in the batch is less than a threshold.
Achyutha Krishnamoorthy +2 more
doaj +1 more source

