Tail probabilities of the delay in a batch-service queueing model with batch-size dependent service times and a timer mechanism

Abstract

We deduce approximations for the tail probabilities of the customer delay in a discrete-time queueing model with batch arrivals and batch service. As in telecommunications systems transmission times are dependent on packet sizes, we consider a general dependency between the service time of a batch and the number of customers within it. The model also incorporates a timer mechanism to avoid excessive delays stemming from the requirement that a service can only be initiated when the number of present customers reaches or exceeds a service threshold. The service discipline is first-come, first-served (FCFS). We demonstrate in detail that our approximations are very useful for the purpose of assessing the order of magnitude of the tail probabilities of the customer delay, except in some special cases that we discuss extensively. We also illustrate that neglecting batch-size dependent service times or a timer mechanism can lead to a devastating assessment of the tail probabilities of the customer delay, which highlights the necessity to include these features in the model. The results from this paper can, for instance, be applied to assess the quality of service (QoS) of Voice over IP (VoIP) conversations, which is typically expressed in terms of the order of magnitude of the probability of Computers & Operations Research May 1, 2013 packet loss due to excessive delays. Preprint submitted to

Revisiting Street Intersections Using Slot-Based Systems

“…Characterizing the capacity and delays of BATCH requires one to extend existing queuing theory tools [ 13 – 22 ] to the unexplored realm of continuous time and batch-size dependent service times ( S1 Supporting Information ). Defined N as the upper bound on the number of vehicles that can be served in a batch, the obtained capacity value C B ( N ) is an increasing function of N , with .…”

Complete analysis of a discrete-time batch service queue with batch-size-dependent service time under correlated arrival process: D-MAP/Gn(a,b)/1

“…Moreover, in modern telecommunication systems, the transfer of information (data, voice, videos, and images) occurs in batches of packets where the transmission time depends on the batch size of packets. In recent years, many researchers have focussed on studying batch-size dependent service queues, both with finite buffer (see Yu and Alfa [27] as well as Banerjee et al [4]) and infinite buffer (see Claeys et al [14,15] as well as Pradhan and Gupta [21,22]). Claeys et al [15] provided the application of batch-size dependent service policy mainly in the area of telecommunication system and illustrated the effect of neglecting batch-size dependent service times on the performance measures of the system.…”

Queue Length and Server Content Distribution in an Infinite-Buffer Batch-Service Queue with Batch-Size-Dependent Service

“…As a counterpart of continuous-time queues, in discretetime queues, a series of papers, considered by Claeys et al [4][5][6] deals with such queues. In [4], they considered Geo / ( , ) /1 queue and obtained joint pgf of the queue and the server content and from this they extracted marginal pgfs.…”

“…They also elaborated upon the influence of correlation of the arrival process on the mean system content. Furthermore, in [6], they approximated tail probabilities of the customer delay in Geo / ( , ) /1 queue. It has been emphasized that neglecting of batch-size-dependent service can lead to a devastating inaccuracy of the approximation of the tail probabilities.…”