The Pht / Pht / K Queueing System : Part II — The Multiclass Network
暂无分享,去创建一个
W demonstrate a numerically exact method for evaluating the time-dependent mean, variance, and higherorder moments of the number of entities in the multiclass Pht/Pht/ K queueing network system, as well as at the individual network nodes. We allow for multiple, independent, time-dependent entity classes and develop time-dependent performance measures by entity class at the nodal and network levels. We also demonstrate a numerically exact method for evaluating the distribution function and moments of virtual sojourn time through the network for virtual entities, by entity class, arriving to the system at time t. We include an example using software that we have developed and have put in downloadable form in the Online Supplement to this paper on the journal’s website.
[1] W. Whitt. On the heavy-traffic limit theorem for GI/G/∞ queues , 1982 .
[2] William C. Y. Lee,et al. Mobile Cellular Telecommunications Systems , 1989 .
[3] Ward Whitt,et al. Networks of infinite-server queues with nonstationary Poisson input , 1993, Queueing Syst. Theory Appl..
[4] Ward Whitt,et al. Linear stochastic fluid networks , 1999 .
[5] B. Nelson,et al. The Pht/Pht/# Queueing System: Part I—The Single Node , 2004 .