On bulk-service MAP/PHL,N/1/N G-Queues with repeated attempts

On bulk-service MAP/PHL,N/1/N G-Queues with repeated attempts

0.00 Avg rating0 Votes
Article ID: iaor20062933
Country: Netherlands
Volume: 141
Issue: 1
Start Page Number: 109
End Page Number: 137
Publication Date: Jan 2006
Journal: Annals of Operations Research
Authors: ,
Keywords: markov processes
Abstract:

We consider a retrial queue with a finite buffer of size N, with arrivals of ordinary units and of negative units (which cancel one ordinary unit), both assumed to be Markovian arrival processes. The service requirements are of phase type. In addition, a PHL,N bulk service discipline is assumed. This means that the units are served in groups of size at least L, where 1 ⩽ LN. If at the completion of a service fewer than L units are present at the buffer, the server switches off and waits until the buffer length reaches the threshold L. Then it switches on and initiates service for such a group of units. On the contrary, if at the completion of a service L or more units are present at the buffer, all units enter service as a group. Units arriving when the buffer is full are not lost, but they join a group of unsatisfied units called ‘orbit’. Our interest is in the continuous-time Markov chain describing the state of the queue at arbitrary times, which constitutes a level dependent quasi-birth-and-death process. We start by analyzing a simplified version of our queueing model, which is amenable to numerical calculation and is based on spatially homogeneous quasi-birth-and-death processes. This leads to modified matrix-geometric formulas that reveal the basic qualitative properties of our algorithmic approach for computing performance measures.

Reviews

Required fields are marked *. Your email address will not be published.