이산시간 대기행렬 시스템에 대한 분포적 Little의 법칙의 활용

Abstract

We present a discrete-time version of the distributional Littles law, of which the continuous-time version is well known. Then we extend it to the queue in which two or more customers may depart at the same time. As a demonstration, we apply this law to various discrete-time queues such as the standard Geom/G/1 queue, the Geom/G/1 queue with vacations, the multi-server Geom/D/c queue, and the bulk-service Geom/G^b/1 queue. As a result, we obtain the probability generating functions of the numbers in system/queue and the waiting times in system/queue for those queues.