임의의 횟수의 휴가를 갖는 MX/G/1 및 GeoX/G/1 대기행렬의 분석

Abstract

By using the arrival time approach of Chae et al.[6].we derive various performance including the queue length distributions(in PGFS)and the waiting time distributions (in LST and PGF)for both Mx/G/1 and GeoX/G/1 queueing systems both under the assumption that the server when it becomes idle takes multiple vacations up to a random maximum number. This is an extension of both Choudhury[7] and zhang and tian[11] A few mistakes in Zhang and tian are corrected and meaningful interpretations are supplemented. By using the arrival time approach of Chae et at. [6], we derive various performance measures including the queue length distributions (in PGFs) and the waiting time distributions (in LST and PGF) for both M$^{x}$ /G/1 and Geo$^{x}$ /G/1 queueing systems, both under the assumption that the server, when it becomes idle, takes multiple vacations up to a random maximum number. This is an extension of both Choudhury[7] and Zhang and Tian [11]. A few mistakes in Zhang and Tian are corrected and meaningful interpretations are supplemented.