Abstract
The M/G/1 processor-sharing queue is studied by way of an approximating sequence of models featuring a round-robin discipline and operating in discrete time. In particular, residence-time distributions of jobs are derived.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献