The Sojourn Time in a Three Node, Acyclic, Jackson Queueing Network.
Technical rept. for period ending 1981,
VIRGINIA POLYTECHNIC INST AND STATE UNIV BLACKSBURG DEPT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH
Pagination or Media Count:
In this paper we consider the three node, acyclic, Jackson queueing network discussed by Simon and Foley 1980. We provide a solution to the sojourn time problem for a given customer. To the best of our knowledge, this is the first solution to the sojourn time problem in any acyclic Jackson network with overtaking. Author
- Statistics and Probability