Analysis of a discrete-time G/sup (X)//D/1-S queueing system with applications in packet-switching systems

Abstract

The authors present and solve a discrete-time G/sup (X)//D/1-S queuing system with a finite queue size and batch arrivals with a general batch size distribution. The motivation for this model arises from performance modeling of a statistical multiplexer with synchronous transmission of fixed-size data units in synchronous time slots. The arrival process to the multiplexer, for example, may originate from a number of independent sources with packets of variable lengths. Hence, a packet arrival corresponds to an arrival of a batch of data units. Different performance measures such as percentage of packet loss and data-unit loss are considered under two different admission policies of packets into the queue.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>