Performance Analysis of Geomz/G/1 Queue with Ezhaustive Service Rule and Multiple Vacations

摘要：

In this paper,a new discrete-time Geomx/G/1 queue model with multiple vacations is analyzed. The Probability Generating Function (P.G.F.) of the queue length is obtained by using the method of an embedded Markov chain,and the mean of the queue length is obtained by using LHospital rule. Then the P.G.F. of the busy period is derived,and the probabilities for the system being in a busy state or in a vacation state are also derived.Moreover,the P.G.F. Of the waiting time is derived based on the independence between the arrival process and the waiting time.Finally,some numerical results are shown to compare the means of the queue length and the waiting time in special cases.

关键词： Geomz/G/1 queue multiple vacations embedded Markov chain ezhaustive service rule performance analysis

作者: 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 8th International Symposium on Operations Research and Its Applications(第八届运筹及其应用国际专题讨论会 ISORA09)

会议地点: 张家界

会议语种:英文

页码: 424-435

在线出版日期: 2009-09-20（万方平台首次上网日期，不代表论文的发表时间）