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


On the GI/M/1/N queue with multiple working vacations—analytic analysis and computation
Authors:AD Banik  UC Gupta  SS Pathak
Institution:1. Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, India;2. Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur 721302, India
Abstract:We consider finite buffer single server GI/M/1 queue with exhaustive service discipline and multiple working vacations. Service times during a service period, service times during a vacation period and vacation times are exponentially distributed random variables. System size distributions at pre-arrival and arbitrary epoch with some important performance measures such as, probability of blocking, mean waiting time in the system etc. have been obtained. The model has potential application in the area of communication network, computer systems etc. where a single channel is allotted for more than one source.
Keywords:GI/M/1 queue  Finite buffer  Multiple working vacations
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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