The Pht/Pht/∞ queueing system: Part I – The single node

The Pht/Pht/∞ queueing system: Part I – The single node

0.00 Avg rating0 Votes
Article ID: iaor2007469
Country: United States
Volume: 16
Issue: 3
Start Page Number: 266
End Page Number: 274
Publication Date: Jun 2004
Journal: INFORMS Journal On Computing
Authors: ,
Keywords: queueing networks
Abstract:

We develop a numerically exact method for evaluating the time-dependent mean, variance, and higher-order 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.

Reviews

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