Results 21 to 30 of about 5,395,978 (153)
The Queueing Model MAP|PH|1|N with Feedback Operating in a Markovian Random Environment
Queueing systems with feedback are well suited for the description of message transmission and manufacturing processes where a repeated service is required. In the present paper we investigate a rather general single server queue with a Markovian Arrival
A.N. Dudin +4 more
doaj +1 more source
Analysis of queueing model with processor sharing discipline and customers impatience
Queueing systems with processor sharing represent the adequate models for sharing the resources, e.g., components of a computer or a bandwidth of communication systems.
A.N. Dudin +3 more
doaj +1 more source
Performance Analysis of Hybrid MTS/MTO Systems with Stochastic Demand and Production
We present a comprehensive numerical approach with reasonably light complexity in terms of implementation and computation for assessing the performance of hybrid make-to-stock (MTS)/make-to-order (MTO) systems.
Dieter Fiems +3 more
doaj +1 more source
Delayed Capital Injections for a Risk Process with Markovian Arrivals [PDF]
AbstractIn this paper we propose a generalisation to the Markov Arrival Process (MAP) risk model, by allowing for a delayed receipt of required capital injections whenever the surplus of an insurance firm is negative. Delayed capital injections often appear in practice due to the time taken for administrative and processing purposes of the funds from a
A. S. Dibu +3 more
openaire +3 more sources
Moment characterization of matrix exponential and Markovian arrival processes [PDF]
The authors establish a relation between the various moments of a matrix exponential and Markovian processes. They present an algorithm to determine any moment and joint moment of the matrix exponential process based on a set of required low order moments. Following \textit{Q.-M. He} and \textit{H. Zhang} [Adv. Appl. Probab.
Levente Bodrog +2 more
openaire +4 more sources
Compound Binomial Model with Batch Markovian Arrival Process [PDF]
A compound binomial model with batch Markovian arrival process was studied, and the specific definitions are introduced. We discussed the problem of ruin probabilities. Specially, the recursion formulas of the conditional finite-time ruin probability are obtained and the numerical algorithm of the conditional finite-time nonruin probability is proposed.
Fang Jin, Chengxun Wu, Hui Ou
openaire +2 more sources
On identifiability of MAP processes [PDF]
Two types of transitions can be found in the Markovian Arrival process or MAP: with and without arrivals. In transient transitions the chain jumps from one state to another with no arrival; in effective transitions, a single arrival occurs.
Lillo Rodríguez, Rosa Elvira +2 more
core +1 more source
Shock models under a Markovian arrival process
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rafael Pérez-Ocón +1 more
openaire +4 more sources
A single-server queueing system with an infinite buffer is considered. The service of a customer is possible only in the presence of at least one unit of energy, and during the service the number of available units decreases by one.
Dudin Alexander +2 more
doaj +1 more source
As various video services become popular, video streaming will dominate the mobile data traffic. The H.264 standard has been widely used for video compression.
Jianyu Cao +4 more
doaj +1 more source

