Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1

Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1

0.00 Avg rating0 Votes
Article ID: iaor19981486
Country: United States
Volume: 44
Issue: 6
Start Page Number: 559
End Page Number: 576
Publication Date: Sep 1997
Journal: Naval Research Logistics
Authors: , ,
Abstract:

A queueing system characterized by the discrete batch Markovian arrival process (D-BMAP) and a probability of phase type distribution for the service time is one that arises frequently in the area of telecommunications. Under this arrival process and service time distribution we derive the waiting time distribution for three queue disciplines: first in first out (FIFO), last in first out (LIFO), and service in random order (SIRO). We also outline efficient algorithmic procedures for computing the waiting time distributions under each discipline.

Reviews

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