Fitting second-order acyclic Marked Markovian Arrival Processes
2013 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2013 Markovian Arrival Processes (MAPs) are a tractable class of point-processes useful to model correlated time series, such as those commonly found in network traces and system logs used in performance analysis and reliability evaluation. Marked MAPs (MMAPs) generalize MAPs by further allowing the modeling of multi-class traces, possibly with cross ...
SANSOTTERA, ANDREA +2 more
openaire +5 more sources
A Fast EM Algorithm for Fitting Marked Markovian Arrival Processes with a New Special Structure [PDF]
, 2013 This paper presents an EM algorithm for fitting traces with Markovian arrival processes (MAPs). The proposed algorithm operates on a special subclass of MAPs.
Horváth, Gábor, Okamura, Hiroyuki
openaire +4 more sources
On some queueing systems with server vacations, extended vacations, breakdowns, delayed repairs and stand-bys [PDF]
, 2012 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]
, 2004 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
A Multi-Server Heterogeneous Queuing-Inventory System with Class-Dependent Inventory Access
Mathematics, 2021 In this paper, we consider a queuing inventory system with heterogeneous customers of K types arriving according to a marked Markovian arrival process.
Karumbathil Rasmi +3 more
doaj +1 more source
An SDN Controller-Based Network Slicing Scheme Using Constrained Reinforcement Learning
IEEE Access, 2022 In order to meet the strong diversification of services that demand network flexibility that will be able to serve the dire need for transmission resources, network slicing was embraced as a plausible solution.
Mduduzi C. Mduduzi Hlophe +1 more
doaj +1 more source
A retrial queueing system with processor sharing and impatient customers
Informatika, 2022 Objectives. The problem of constructing and investigating a mathematical model of a stochastic system with processor sharing, repeated calls, and customer impatience is considered. This system is formalized in the form of a queueing system. The operation
V. I. Klimenok
doaj +1 more source
Queueing Network with Moving Servers as a Model of Car Sharing Systems
Mathematics, 2019 We consider a queueing network with a finite number of nodes and servers moving between the nodes as a model of car sharing. The arrival process of customers to various nodes is defined by a marked Markovian arrival process.
Chesoong Kim, Sergei Dudin, Olga Dudina
doaj +1 more source
Priority Multi-Server Queueing System with Heterogeneous Customers
Mathematics, 2020 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
Some descriptors of the Markovian arrival process
, 1991 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