The performance of parallel discrete event models is highly dependent on lookahead, particularly when a conservative algorithm is employed. Unfortunately lookahead is known to be problem-dependant, which restricts the implementations of conservative algorithms. This paper uses a simple queuing network to show how this lookahead affects performance and discusses various techniques for automatic ...

 In this paper we develop queuing model results for a single “automated” workstation that receives jobs from another automated workstation. An automated workstation is a server with deterministic processing times that experiences random operating times between failures, and then subsequent random repair times. We develop analytical expressions for the queue size distribution, the average numbe...

Let X be a discrete random variable with support S and f : S → S′ be a bijection. Then it is wellknown that the entropy of X is the same as the entropy of f(X). This entropy preservation property has been well-utilized to establish non-trivial properties of discrete stochastic processes, e.g. queuing process [1]. Entropy as well as entropy preservation is well-defined only in the context of pur...

Discrete-process simulation, long used in the manufacturing sector of the economy for process analysis and improvement, has more recently, yet extensively, proved its value in the service industry for the same purposes. Very simple queuing situations are amenable to closed-form analysis; however, queuing environments typical of actual contexts in the service industry defy such analyses, except ...

The importance for this tutorial is to introduce the students into the loss systems, and, to underline the difference between the concepts of call-blocking and time-blocking probabilities, and to understand under which conditions these probabilities are identical. The selected exercises introduce, also, the Erlang tables, which is an important tool for easy calculations for the blocking probabi...

A new concept of subway station capacity (SSC) is defined according to the gathering and scattering process. A queuing network analytical model of station is created for calculating SSC, which is built by M/G/C/C state dependent queuing network and discrete time Markov chain (DTMC). Based on the definition and the analytical queuing network, a SSC optimization model is developed, whose objectiv...

The aim of this paper is to use a very simple queuing model to compare a number of models from the literature which have been used to replicate the statistical nature of internet traffic and, in particular, the long-range dependence of this traffic. The four models all have the form of discrete time Markov-modulated processes (two other models are introduced for comparison purposes). While it i...