We consider the GI/M/1/K queue where the server takes exponentially distributed vacations when there are no customers left to serve in the queue. We obtain the queue length distribution at arrival epochs and random epochs for the multiple vacation case. We present heuristic algorithms to compute the blocking probability for this system. Several numerical examples are presented to analyze the behaviour of the blocking probability and to test the performance of the heuristics.
机构:
Yokohama Natl Univ, Fac Educ & Human Sci, Dept Math Educ, Yokohama, Kanagawa 2408501, JapanYokohama Natl Univ, Fac Educ & Human Sci, Dept Math Educ, Yokohama, Kanagawa 2408501, Japan
机构:
UNIV ELECT SCI & TECHNOL CHINA,DEPT MATH APPL,CHENGDU 610054,PEOPLES R CHINAUNIV ELECT SCI & TECHNOL CHINA,DEPT MATH APPL,CHENGDU 610054,PEOPLES R CHINA