A NEW APPROACH FOR THE STUDY OF THE MX/G/1 QUEUE USING RENEWAL ARGUMENTS
- 21 February 2001
- journal article
- Published by Taylor & Francis in Stochastic Analysis and Applications
- Vol. 19 (1) , 151-156
Abstract
The MX /G/1 queueing system as well as several of its variants have long ago been studied by considering the embedded discrete-time Markov chain at service completion epochs. Alternatively other approaches have been proposed such as the theory of regenerative processes, the supplementary variable method, properties of the busy period, etc. In this note we study the MX /G/1 queue via a simple new method that uses renewal arguments. This approach seems quite powerful and may become fruitful in the investigation of other queueing systems as well.Keywords
This publication has 7 references indexed in Scilit:
- Approximations for the GI/G/c queueJournal of Applied Probability, 1986
- Poisson Arrivals See Time AveragesOperations Research, 1982
- Computational Methods for Single-Server and Multi-Server Queues with Markovian Input and General Service Times1982
- Approximations for the steady-state probabilities in theM/G/cqueueAdvances in Applied Probability, 1981
- A Simple Proof of the Equivalence of the Limiting Distributions of the Continuous-Time and the Embedded Process of the Queue Size in the M/G/1 QueueStatistica Neerlandica, 1976
- Compound Poisson DistributionsJournal of the Operational Research Society, 1966
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov ChainThe Annals of Mathematical Statistics, 1953