In this note, the sequence of the interarrivals of a stationary Markovian Arrival process is shown to be ρ-mixing with a geometric rate of convergence when the driving process is ρ-mixing. This provides an answer to an issue raised in the recent paper [4] on the geometric convergence of the autocorrelation function of the stationary Markovian Arrival process. keywords: Markov renewal process AM...

introduction: patients are recently more aware and conscious. this is because of the belief that a high level of quality can translate into patient satisfaction. this is critical for healthcare providers as they deal with life. this recognition by both the service provider and service receivers made the government to establish units of service commission (servicom) in each of the governmental a...

— We define a notion of Markov process indexed by curves drawn on a compact surface and taking its values in a compact Lie group. We call such a process a two-dimensional Markovian holonomy field. The prototype of this class of processes, and the only one to have been constructed before the present work, is the canonical process under the Yang-Mills measure, first defined by Ambar Sengupta [32]...

We present an overview of recent results related to the single server queue with general independent and identically distributed service times and a batch Markovian arrival process (BMAP). The BMAP encompasses a wide range of arrival processes and yet, mathematically, the BMAP/G/I model is a relatively simple matrix generalization of the M/G/l queue. Stationary and transient distributions for t...

The advantages of using stochastic process algebra to specify performance models are well-documented. There remains, however, a reluctance in some quarters to use process algebras; this is particularly the case amongst queueing theorists. This paper demonstrates the use of a Markovian process algebra to represent a wide range of queueing models. Moreover, it shows that the most common interacti...

(Abstract) Policy based network management is a promising approach for provisioning and management of quality of service in mobile ad hoc networks. In this thesis, we focus on performance evaluation of this approach in context of the amount of service received by certain nodes called policy execution points (PEPs) or policy clients from certain specialized nodes called the policy decision point...

It is shown that all statistical properties of the generalized Langevin equation with Gaussian fluctuations are determined by a single, two-point correlation function. The resulting description corresponds with a stationary, Gaussian, non-Markovian process. Fokker-Planck-like equations are discussed, and it is explained how they can lead one to the erroneous conclusion that the process is nonst...

In this paper we propose the TBPE Transient Blocking Probability Estimation routing algorithm, an adaptive method based on Grade of Service forecast requiring limited network monitoring and computational complexity. This routing scheme is compared with the well-known routing algorithm class MDP in which Markovian Decision Process theory is used for the QoS forecast. Both routing algorithms are ...

This paper presents an algorithmic procedure to calculate the queue length and delay distribution of customers in a discrete time D-MAP/PH/1 queue, where the service time distribution of a customer depends on the inter-arrival time between himself and his predecessor. Setting up a Markov chain that keeps track of the contents of such a queue will result in a state space explosion as the inter-a...

The adoption of the cloud computing paradigm is associated with increasing security concerns. Cloud computing service models (SaaS, PaaS and IaaS) are exposed to different security threats in each level of services. The Trusted Cloud Computing Platform (TCCP) proposes a security model that protects customers VMs at the IaaS level. In this paper, we investigate methodologies for the specificatio...