Martingale methods for the semi-markov analysis of queues with blocking
- 1 June 1981
- journal article
- research article
- Published by Taylor & Francis in Stochastics
- Vol. 5 (1-2) , 115-133
- https://doi.org/10.1080/17442508108833177
Abstract
This paper studies a queue with a finite buffer modelled as a semi-Markov process of consecutive visits to the empty buffer and the full buffer state. The martingale description of queues allows application of the optional sampling theorem to obtain the joint moment generating function of the length of an interval and the number of customers served in an interval. This leads to an explicit solution for an M/M/l/B queue and for a special case of a queue with constant service times. Extensions to priority queues and applications to control of queues are briefly discussed.Keywords
This publication has 7 references indexed in Scilit:
- On the longest service time in a busy period of the M⧸G⧸1 queueStochastic Processes and their Applications, 1978
- On the time to first overflow in dams with inputs forming a Markov chainJournal of Applied Probability, 1978
- Queueing Models for Computer Communications System AnalysisIEEE Transactions on Communications, 1977
- Some martingales related to cumulative sum tests and single-server queuesStochastic Processes and their Applications, 1976
- The Representation of Martingales of Jump ProcessesSIAM Journal on Control and Optimization, 1976
- The Remaining Busy Period of a Finite QueueOperations Research, 1971
- Two queues in series with a finite, intermediate waitingroomJournal of Applied Probability, 1968