We study a fork-join network with a single class of jobs, which are forked into a fixed number
of parallel tasks upon arrival to be processed at the corresponding multi-server stations …

The motivation of mixing distributions in communication/queueing systems modeling is that
some input data (eg, service time in queueing models) may follow several distinct …

We define a wide class of Markovian load balancing networks of identical single-server
infinite-buffer queues. These networks may implement classic parallel server or work …

В работе предложены подходы к исследованию стохастических моделей
вычислительных сетей из персональных компьютеров с помощью многосерверных …

We provide the first perfect sampling algorithm for a generalized Jackson network of first-in,
first-out queues under arbitrary topology and non-Markovian assumptions on the input of the …

In this paper we study the extreme behavior of waiting time in steady-state GI/G/1 systems
with Exponential-Pareto service times. We show that this distribution belongs to the subclass …

В работе предложены подходы к исследованию стохастических моделей
вычислительных сетей из персональных компьютеров с помощью многосерверных …

A number of perfect simulation algorithms for multi-server First Come First Served queues
have recently been developed. Those of Connor and Kendall [6] and Blanchet et al.[4] use …

This thesis mainly studies perfect simulation methodology for the time-varying queueing
systems including time varying queue with a single server (Mt/Gt/1 and Gt/G/1) and time …