Analysis of the M/G/1 processor-sharing queue with bulk arrivals
Author:
- 9 April 2003
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 31 (5) , 401-405
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Distribution Estimation Using Laplace TransformsINFORMS Journal on Computing, 1998
- An Approximation Method for the Analysis of GI/G/1 QueuesOperations Research, 1997
- A benchmark for ph estimation algorithms: results for acyclic-phCommunications in Statistics. Stochastic Models, 1994
- On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processesAdvances in Applied Probability, 1992
- A Functional Equation Arising in a Queue With a Gating MechanismProbability in the Engineering and Informational Sciences, 1989
- Approximation with generalized hyperexponential distributions: Weak convergence resultsQueueing Systems, 1986
- The sojourn-time distribution in the M/G/1 queue by processor sharingJournal of Applied Probability, 1984
- The processor‐sharing queueing model for time‐shared systems with bulk arrivalsNetworks, 1971
- Time-shared SystemsJournal of the ACM, 1967
- A use of complex probabilities in the theory of stochastic processesMathematical Proceedings of the Cambridge Philosophical Society, 1955