Abstract | ||
---|---|---|
A simple derivation for the time derivative of a large class of statistics associated with the size of a queue is presented. This method is based on a discrete time approximation in conjunction with conditional expectation and is suitable for any queueing system with multiple interconnected and controlled queues such that the overall dynamics can be modeled as a continuous-time Markov chain. The general procedure is specialized to obtain the Jackson network time-varying k th moment of system size (queue+server) as well as several special cases. Results are also obtained for a network of queues with Erlangian servers. Applications of these results to closure approximations for Jackson networks and to the approximation of statistics of controlled queues are also given. |
Year | DOI | Venue |
---|---|---|
1989 | 10.1016/0166-5316(89)90051-5 | Perform. Eval. |
Keywords | Field | DocType |
simple derivation,transient queue statistic,transient analysis,‘erlangian’ network,closure approximations,jackson network,moments,time-varying analysis,erlangian servers,control of queues | Erlang distribution,Computer science,Queue,Markov chain,Conditional expectation,Time derivative,Real-time computing,Discrete time and continuous time,Fork–join queue,Statistics,Distributed computing,Jackson network | Journal |
Volume | Issue | ISSN |
10 | 2 | Performance Evaluation |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Wei K. Tsai | 1 | 103 | 11.47 |
Pierce E. Cantrell | 2 | 0 | 0.34 |