The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
- 1 January 1984
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 31 (1) , 128-133
- https://doi.org/10.1145/2422.322419
Abstract
Consider a closed cyclic queuing system consisting of M exponential queues. The Laplace- Stieltjes transform of the joint d~stribution of the consecutive sojourn times of a customer at the M queues is determined and shown to have a product form. The proof is based on a reverslbdity argument.Keywords
This publication has 10 references indexed in Scilit:
- The Time for a Round Trip in a Cycle of Exponential QueuesJournal of the ACM, 1983
- On response time and cycle time distributions in a two-stage cyclic queuePerformance Evaluation, 1982
- Passage times for overtake-free paths in Gordon–Newell networksAdvances in Applied Probability, 1982
- The Distribution of Queuing Network States at Input and Output InstantsJournal of the ACM, 1981
- Sojourn times and the overtaking condition in Jacksonian networksAdvances in Applied Probability, 1980
- The Cycle Time Distribution of Exponential Cyclic QueuesJournal of the ACM, 1980
- The multiple phase service network with generalized processor sharingActa Informatica, 1979
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Closed Queuing Systems with Exponential ServersOperations Research, 1967
- Jobshop-Like Queueing SystemsManagement Science, 1963