Publication
Performance Evaluation
Paper

Simulation for passage times in closed, multiclass networks of queues with unrestricted priorities

View publication

Abstract

Regenerative simulation for passage times in networks of queues with priorities among job classes (and one or more job types) can be based on observation of a fully augmented job stack process which maintains the position of each of the jobs in a linear 'job stack', an enumeration of the jobs by service center and job class. In this paper we develop an estimation procedure for passage times through a subnetwork of queues. Observed passage times for all the jobs enter into the construction of point and interval estimates. The confidence intervals obtained using this estimation procedure are shorter than those obtained from simulation using a marked job. © 1982.

Date

01 Jan 1982

Publication

Performance Evaluation

Authors

Share