By using some new results on the exact simulation of FIFO GI/GI/1 queues introduced by J. Blanchet and A. Wallwater, we show how to simulate exactly the stationary distribution of the FIFO GI/GI/c queue, c ≥ 2. This method uses dominated coupling from the past (DCFP) as well as the Random Assignment (RA) discipline, and complements the earlier work of K. Sigman in which Poisson arrivals were assumed. In addition, we show how to also exactly simulate from some other multidimensional models, including some simple multi-class networks.Non UBCUnreviewedAuthor affiliation: Columbia UniversityFacult
In this paper we consider the distributed simulation of queueing networks of FCFS servers with infin...
Classical queueing theory is often not suitable to model modern computer and communication systems, ...
Many queueing problems can be modeled as random walks on a multidimensional grid A timedependent an...
In this paper we describe a perfect simulation algorithm for the stableM/G/c queue. Sigman (2011: Ex...
In this paper we describe a perfect simulation algorithm for the stable M/G/c queue. Sigman (2011: E...
This dissertation contains two parts. The first part introduces the first class of perfect sampling ...
This dissertation focuses on the development and analysis of exact simulation algorithms with applic...
Perfect simulation of a class of Markovian queueing networks with finite buffers is examined in this...
In this paper, we consider a single-server queue fed by K independent renewal arrival streams, each ...
We provide the first algorithm that under minimal assumptions allows to simulate the stationary wait...
Traditional product form property of Markovian queue-ing networks usually is vanished when capacity ...
In the paper we consider a GI/GI/∞ queuing system with n types of customers under the assumptions th...
In this paper we consider the dynamics of large-scale queueing systems with an infinite number of se...
Many interesting parameters in queue theory study either have not theoretical results or, existing, ...
The need for understanding of various real-life queueing situations has caused the theory of queues ...
In this paper we consider the distributed simulation of queueing networks of FCFS servers with infin...
Classical queueing theory is often not suitable to model modern computer and communication systems, ...
Many queueing problems can be modeled as random walks on a multidimensional grid A timedependent an...
In this paper we describe a perfect simulation algorithm for the stableM/G/c queue. Sigman (2011: Ex...
In this paper we describe a perfect simulation algorithm for the stable M/G/c queue. Sigman (2011: E...
This dissertation contains two parts. The first part introduces the first class of perfect sampling ...
This dissertation focuses on the development and analysis of exact simulation algorithms with applic...
Perfect simulation of a class of Markovian queueing networks with finite buffers is examined in this...
In this paper, we consider a single-server queue fed by K independent renewal arrival streams, each ...
We provide the first algorithm that under minimal assumptions allows to simulate the stationary wait...
Traditional product form property of Markovian queue-ing networks usually is vanished when capacity ...
In the paper we consider a GI/GI/∞ queuing system with n types of customers under the assumptions th...
In this paper we consider the dynamics of large-scale queueing systems with an infinite number of se...
Many interesting parameters in queue theory study either have not theoretical results or, existing, ...
The need for understanding of various real-life queueing situations has caused the theory of queues ...
In this paper we consider the distributed simulation of queueing networks of FCFS servers with infin...
Classical queueing theory is often not suitable to model modern computer and communication systems, ...
Many queueing problems can be modeled as random walks on a multidimensional grid A timedependent an...