Results 121 to 130 of about 1,619 (228)
Modeling IP traffic using the batch Markovian arrival process
In this paper, we show how to utilize the expectation-maximization (EM) algorithm for efficient and numerical stable parameter estimation of the batch Markovian arrival process (BMAP).
Klemm, Alexander +2 more
core
This paper considers a FIFO single-server queue with service interruptions and multiple batch Markovian arrival streams. The server state (on and off), the type of arriving customers and their batch size are assumed to be governed by a continuous-time ...
Hiroyuki Masuyama, Tetsuya Takine
core +1 more source
We consider a four-arm signalized intersection with vehicle-actuated control in discrete time. Vehicles arrive at each arm according to the Markovian Arrival Process. Storage space at each arm is limited. The system is studied as two-phase signal and the
Alfa, A.S.
core +1 more source
Traffic modeling of IP networks using the batch Markovian arrival process
In this paper, we identify the batch Markovian arrival process (BMAP) as analytically tractable model of choice for aggregated traffic modeling of IP networks.
Christoph Lindemann +2 more
core
The cell loss probability and the mean cell delay are major performance metrics in analyzing a statistical multiplexer loaded with a superposition of independent and heterogeneous bursty sources.
Kim, C, Kang, KH
core +1 more source
Double-Sided Queues with Marked Markovian Arrival Processes and Abandonment
In this paper, we study a double-sided queueing model with marked Markovian arrival processes and finite discrete abandonment times. We apply the theory of multi-layer Markov modulated fluid flow (MMFF) processes to analyze the queueing model.
Wu, Haoran
core
Stationary Markovian Arrival Processes, Results and Open Problems
We consider two classes of irreducible Markovian arrival processes specified by the matrices $C$ and $D$. The Markov Modulated Poison Process (MMPP) and the Markovian Switched Poison Process (MSPP).
Nazarathy, Y, Asanjarani, Azam
core
A FINITE CAPACITY BULK SERVICE QUEUE WITH SINGLE VACATION AND MARKOVIAN ARRIVAL PROCESS
Vacation time queues with Markovian arrival process (MAP) are mainly useful in mod-eling and performance analysis of telecommunication networks based on asynchronous transfer mode (ATM) environment.
U. C. Gupta, Karabi Sikdar
core
STATIONARY DISTRIBUTION OF A TANDEM QUEUE WITH ADDITIONAL FLOWS ON THE STATIONS OF THE TANDEM
A tandem queueing system consisting of a finite number of multi-server stations without buffers is analized. The input flow at the first station is a ???????????? (Markovian arrival process).
V. I. Klimenok
doaj
Output stream analysis in a queueing model with working vacation mechanism as a power reduction strategy. [PDF]
Kobielnik M, Kempa WM.
europepmc +1 more source

