Transient analysis of M/M/1 queues in discrete time by general server vacations
-
Published:1994
Issue:A
Volume:31
Page:115-129
-
ISSN:0021-9002
-
Container-title:Journal of Applied Probability
-
language:en
-
Short-container-title:J. Appl. Probab.
Author:
Böhm W.,Mohanty S. G.
Abstract
In this contribution we consider an M/M/1 queueing model with general server vacations. Transient and steady state analysis are carried out in discrete time by combinatorial methods. Using weak convergence of discrete-parameter Markov chains we also obtain formulas for the corresponding continuous-time queueing model. As a special case we discuss briefly a queueing system with a T-policy operating.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Professor Lajos Takács: A Tribute;Lattice Path Combinatorics and Applications;2019