Analysis of a Geom/G/1 Queue with General Limited Service and MAVs
In this paper, we present an analysis for a general limited service Geom/G/1 queue model with multiple adaptive vacations (MAVs). The Probability Generating Function (P.G.E) of the queue length is obtained by using an embedded Markov chain with a regeneration cycle approach. The P.G.F. of the waiting time is also derived based on the independence between the arrival process and the waiting time. The probabilities for the system being in various states, such as busy, idle and vacation, are also derived.
Multiple adaptive vacations general limited service embedded Markov chain method regeneration cycle approach service cycle
Zhanyou Ma Wuyi Yue Naishuo Tian
College of Science, Yanshan University, Qinhuangdao 066004, China Department of Intelligence and Informatics, Konan University, Kobe 658-8501, Japan
国际会议
The Seventh International Symposium(ISORA08)(第七届国际效力研究及其应用学术会议)
云南丽江
英文
359-368
2008-10-31(万方平台首次上网日期,不代表论文的发表时间)