This article describes queueing systems and queueing networks which are successfully used for performance analysis of different systems such as computer, communications, transportation networks and manufacturing. It incorporates classical Markovian systems with exponential service times and a Poisson arrival process, and queueing systems with individual service. Oscillating queueing systems and...

An algorithm is developed to rapidly compute approximations for all the standard steadystate performance measures in the basic call-center queueing model M/GI/s/r+GI, which has a Poisson arrival process, IID service times with a general distribution, s servers, r extra waiting spaces and IID customer abandonment times with a general distribution. Empirical studies indicate that the service-time...

We compare two approaches for a Markovian model in flexible manufacturing systems (FMSs) using Monte Carlo simulation. The model which is a development of Fazlollahtabar and Saidi-Mehrabad (2013), considers two features of automated flexible manufacturing systems equipped with automated guided vehicle (AGV) namely, the reliability of machines and the reliability of AGVs in a multiple AGV jobsho...

The problem of estimating the value function underlying a Markovian reward process is considered. As it is well known, the value function underlying a Markovian reward process satisfied a linear fixed point equation. One approach to learning the value function from finite data is to find a good approximation to the value function in a given (linear) subspace of the space of value functions. We ...

SOA supported pervasive applications introduce new threats to service discovery. Securing service discovery impacts performance and scalability, yet the additional performance and scalability costs of solutions proposed so far have not been evaluated analytically nor by simulation. This paper addresses this problem by introducing a Markovian application layer performance model for centralized a...

Parallel zu diesen Entwicklungen stiegen die Anforderungen an die Methoden zur Leistungsanalyse derartiger Systeme. Die Warteschlangentheorie stellt klassische Modelle zur Analyse von Kommunikationsnetzen bereit. Ein Bereich in der modernen Warteschlangentheorie sind die Matrix analytischen Methoden. Hier konzentriert sich die Forschung auf den Batch Markovian Arrival Process (BMAP), welcher äq...