The Pht/Pht/ Queueing System: Part I—The Single Node

Abstract

W develop a numerically exact method for evaluating the time-dependent mean, variance, and higherorder moments of the number of entities in a Pht/Pht/ queueing system. We also develop a numerically exact method for evaluating the distribution function and moments of the virtual sojourn time for any time t; in our setting, the virtual sojourn time is equivalent to the service time for virtual entities arriving to the system at that time t. We include several examples using software that we have developed and have put in downloadable form in the Online Supplement to this paper on the journal’s website.

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{Nelson2004ThePQ, title={The Pht/Pht/ Queueing System: Part I—The Single Node}, author={Barry L. Nelson and Michael R. Taaffe}, year={2004} }