Approximating class-departure variability in tandem queues with downtime events: Regression-based variability function

Abstract Predicting queue performance by approximating class-departure variability in tandem queues with downtime events via existing decomposition methods is neither accurate enough nor efficient enough. Analytic approximations, if conducted alone, lack accuracy but attempting to increase accuracy by incorporating simulation to analytic approximation has proved to require significant computation efforts. The aim of this paper is to reduce the latter inefficiency by modeling the Regression-Based Variability Function (RBVF) designed to approximate the between-class effect by exploiting the departure process from a single queue. The new approach predicts performance of n -tandem queues by reducing the focus to two-tandem queues for each traffic intensity level, as well as by modeling different policies of downtimes (e.g. first-come-first-served or priority). Numerical experiments demonstrate that the proposed RBVF delivers both accuracy and efficiency improvements: the relative errors associated with RBVF are about three times smaller than the best existing analytic procedures and the computation efforts associated with RBVF are about five times smaller than existing analytic procedure combined with simulation.

[1]  Wolfgang Fischer,et al.  The interdeparture-time distribution for each class in the ∑iMi/Gi/1 queue , 1989, Queueing Syst. Theory Appl..

[2]  Leon F. McGinnis,et al.  Interpolation approximations for queues in series , 2013 .

[3]  Sunkyo Kim,et al.  Taking Account of Correlations Between Streams in Queueing Network Approximations , 2005, Queueing Syst. Theory Appl..

[4]  K. T. Marshall,et al.  Some Inequalities in Queuing , 1968, Oper. Res..

[5]  David A. Stanford,et al.  Waiting and Interdeparture Times in Priority Queues with Poisson- and General-Arrival Streams , 1997, Oper. Res..

[6]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[7]  Ward Whitt,et al.  Variability functions for parametric-decomposition approximations of queueing networks , 1995 .

[8]  Ward Whitt,et al.  The heavy-traffic bottleneck phenomenon in open queueing networks , 1990 .

[9]  David A. Stanford,et al.  Characterising interdeparture times for bursty input streams in the queue with pooled renewal arrivals , 1991 .

[10]  Israel Tirkel,et al.  Approximation of single-class queueing networks with downtime-induced traffic variability , 2015 .

[11]  Gabriel R. Bitran,et al.  Multiproduct Queueing Networks With Deterministic Routing: Decomposition Approach and the Notion of Interference , 2015 .

[12]  Leon F. McGinnis,et al.  Queueing models for a single machine subject to multiple types of interruptions , 2011 .

[13]  Sunkyo Kim Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing , 2005 .

[14]  Kan Wu,et al.  Classification of queueing models for a workstation with interruptions: a review , 2014 .

[15]  Ward Whitt Towards better multi-class parametric-decomposition approximations for open queueing networks , 1994, Ann. Oper. Res..

[16]  J. Kingman Some inequalities for the queue GI/G/1 , 1962 .

[17]  John A. Buzacott,et al.  Stochastic models of manufacturing systems , 1993 .

[18]  Wolfgang Fischer,et al.  Approximations for the Per-Class Waiting Time and Interdepearture Time in the Sigma_i GI_i/GI_i/1 Queue , 1992, Perform. Evaluation.