We analyze a multiserver queue with a discrete autoregressive process of order 1 (DAR(1)) as an input. DAR(1) is a good mathematical model for VBR-coded teleconference traffic. Based on matrix analytic methods and the theory of Markov regenerative processes, we obtain the stationary distributions of the system size and the waiting time of an arbitrary packet. Numerical examples illustrate the q...

We extend the analysis of queueing systems for real-life situations, where the arrival pattern of customers is unknown. In real systems, we must understand how the choice of a method of estimation influences the configuration of the system. Using kernel smoothing, we evaluate algorithms to estimate performance measures of a GI/M/c/N system, including the invariant probability distribution of th...

We give a survey of the ParInt project for Parallel/ distributed Integration. We analyze the \generic" distributed adaptive integration algorithm and modify it to retain an eecient distribution of the global work load over the processors. With this goal we consider a distributed adaptive integration method based on a global heap priority queue, which remains load balanced and assures that the s...

This paper deals with the steady state behaviour of an Mx/G/1 queuing system with two different vacation periods under multiple vacation policy, where length of the first vacation is different from the rest of the vacations. We are concerned with the distribution of the queue size at busy period initiation epoch and distribution of the unfinished work. Further, we present a simple transform fre...

In this paper we revisit the Markovian queueing system with a single server, infinite capacity queue and one special skipping policy. Customers arrive in batches but are served by any order. The size of arriving batch becomes known upon its arrival at time instant total number customers is also known. According to adopted policy if batch, which greater than current system, arrives, all currentl...

We consider a queueing system consisting of multiple identical servers and a common queue. The service time follows an exponential distribution and the arrival process is governed by a semi-Markov process (SMP). The motivation to study the queueing system with SMP arrivals lies in that it can model the auto-correlated traffic on the high speed network generated by a real time communication, for...