Accession Number:

ADA110412

Title:

The Sojourn Time in a Three Node, Acyclic, Jackson Queueing Network.

Descriptive Note:

Technical rept. for period ending 1981,

Corporate Author:

VIRGINIA POLYTECHNIC INST AND STATE UNIV BLACKSBURG DEPT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH

Personal Author(s):

Report Date:

1982-01-27

Pagination or Media Count:

20.0

Abstract:

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

Subject Categories:

  • Statistics and Probability

Distribution Statement:

APPROVED FOR PUBLIC RELEASE