首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Conditional and unconditional distributions forM/G/1 type queues with server vacations
Authors:Bharat Doshi
Institution:(1) AT&T Bell Laboratories, HO 3M-335, 07733 Holmdel, NJ, USA
Abstract:M/G/1 queues with server vacations have been studied extensively over the last two decades. Recent surveys by Boxma 3], Doshi 5] and Teghem 14] provide extensive summary of literature on this subject. More recently, Shanthikumar 11] has generalized some of the results toM/G/1 type queues in which the arrival pattern during the vacations may be different from that during the time the server is actually working. In particular, the queue length at the departure epoch is shown to decompose into two independent random variables, one of which is the queue length at the departure epoch (arrival epoch, steady state) in the correspondingM/G/1 queue without vacations. Such generalizations are important in the analysis of situations involving reneging, balking and finite buffer cyclic server queues. In this paper we consider models similar to the one in Shanthikumar 11] but use the work in the system as the starting point of our investigation. We analyze the busy and idle periods separately and get conditional distributions of work in the system, queue length and, in some cases, waiting time. We then remove the conditioning to get the steady state distributions. Besides deriving the new steady state results and conditional waiting time and queue length distributions, we demonstrate that the results of Boxma and Groenendijk 2] follow as special cases. We also provide an alternative approach to deriving Shanthikumar's 11] results for queue length at departure epochs.
Keywords:M/G/1 type queues  server vacations  level crossing  stochastic decomposition
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号