This paper deals with the optimal operation of a single removable and unreliable server in an Npolicy two-phase M/M/1 queueing system with gating, server startups and unpredictable breakdowns. Arrivals occur in batches according to a compound Poisson process and waiting customers receive batch service all at a time in the first phase and proceed to the second phase to receive individual service...

In the past, many researchers have analysed queueing models with batch service. In such models, the server typically postpones service until the number of present customers reaches a service threshold, whereupon service is initiated of a batch consisting of several customers. In addition, correlation in the customer arrival process has been studied for many different queueing models. However, c...

We perform an analysis of the transient delay in a discrete-time FIFO buffer with batch arrivals. As transient delay is an ambiguous concept, we first discuss different possible definitions of the term (delay of the k-th customer, delay of a customer arriving at time t, etc). In this paper, we focus on the analysis of the delay of a customer arriving in slot t, also sometimes called virtual del...

In this paper, we present a synthetic traffic model for the Universal Mobile Telecommunication Systems (UMTS) based on measured trace data. The analysis and scaling process of the measured trace data with respect to different bandwidth classes constitutes the basic concept of the UMTS traffic characterization. Furthermore, we introduce an aggregated traffic model for UMTS networks that is analy...

A generalization of the M/G/« queueing system with batch arrivals to one with time dependent arrival rates, service times, and batch size distributions is considered. It is shown that both W(t) , the number of people being served at t , and S(t) , the number of people who have completed service by t , are distributed as compound Poisson laws. The distributions of the traffic time average -1 T T...

, Abstract We study an eMcient iterative algorithm fbr computing the stationary distributions ih MX/G/IZN queues with arbitrary state-dependent arrivals, that is, ., MX(k)/C/1/N queues. MX(k)/G/1/N queues include the well studied specidl cases, such as PBAS (partially batch acceptance strategy) At(,X/G/1/N queues and tt WBAS (whole batch acceptance strategy) MX/C/1/N queues. We only require the...