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


On the longest service time in a busy period of the M⧸G⧸1 queue
Authors:O.J. Boxma
Affiliation:Mathematical Institute, University of Utrecht, Budapestlaan 6, Utrecht, The Netherlands
Abstract:This paper considers the supremum m of the service times of the customers served in a busy period of the M?G?1 queueing system. An implicit expression for the distribution m(w) of m is derived. This expression leads to some bounds for m(w), while it can also be used to obtain numerical results. The tail behaviour of m(w) is investigated, too. The results are particularly useful in the analysis of a class of tandem queueing systems.
Keywords:M?G?1 queue  busy period  longest service
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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