Results 21 to 30 of about 10,720,791 (210)
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
Queueing Inventory System in Transport Problem
In this paper, we consider the batch arrival of customers to a transport station. Customers belonging to each category is considered as a single entity according to a BMMAP.
Khamis A. K. Al Maqbali +3 more
doaj +1 more source
We consider a queueing inventory with one essential and m optional items for sale. The system evolves in environments that change randomly. There are n environments that appear in a random fashion governed by a Marked Markovian Environment change process.
Jaison Jacob +4 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
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
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
Transient Analysis of Hysteresis Queueing Model Using Matrix Geometric Method [PDF]
Various analytical methods have been proposed for the transient analysis of a queueing system in the scalar domain. In this paper, a vector domain based transient analysis is proposed for the hysteresis queueing system with internal thresholds for the ...
Wajiha Shah +2 more
doaj
An N-system with different units submitted to shock and wear is studied. The shocks cause damage and, eventually, simultaneous failures of several units. The units can also fail due to internal failures.
Delia Montoro-Cazorla +1 more
doaj +1 more source

