Sensitivity analysis is done on the assumption of geometric batch arrivals used by several authors in the study of tradeoffs between real-time and non-real-time trafJic in a statistical multiplexer. This work finds the geometric batch arrival assumption conservative compared with correlated MMPP’s. The Poisson arrival assumption is much more optimistic that the geometric batch arrival assumption.

This paper analyses a discrete-time Geo/G/1 retrial queue with batch arrivals in which individual arriving customers have a control of admission. We study the underlying Markov chain at the epochs immediately after the slot boundaries making emphasis on the computation of its steady-state distribution. To this end we employ numerical inversion and maximum entropy techniques. We also establish a...

In this paper, we consider retrial queueing systems with batch arrivals in which the server is subject to controllable interruptions (called vacations) and random interruptions (breakdowns). No specific assumption is taken regarding probability distributions of parametric random variables. The purpose of this work is to show effect of above mentioned parameters (in particular retrial and breakd...

A multi-server system with trunk reservation is studied. The system is offered by two types of customers (class-1 and class-2). They arrive in independent batch Poisson streams and have an exponentially distributed service time. Class-1 customers will be lost or rejected if they find all S servers busy on their arrivals. Class-2 customers will use at most S′ = S − R servers and enter a queue wi...

With Bursty Task Arrivals Chin LU and Sau-Ming LAU Computer Science Department The Chinese University of Hong Kong Shatin, Hong Kong Email: fclu, [email protected] AbstractUsually heuristic-based load balancing algorithms cannot provide satisfactory performance with bursty task arrivals because they assume stable arrival patterns. In this paper, we present an adaptive load balancing algorithm,w...

We discuss algorithms for the computation of the steady state features of PH/PH/l queues with bounded batch arrivals or batch services. Many characteristic quantities such as the mean and variance of queue length in continuous time, the mean waiting time, the waiting probability, etc. are obtained in computationaJIy tractable forms. We also show various numerical values.