Abstract
In this paper, we present a perturbation method of solving a second-order difference equation with variable coefficients with some additional assumptions. This method can be used to devise an algorithmic solution for the moments of sojourn times in some processor sharing queues. In particular, we examine three queues. The first has exponential service and a fairly general interrupted arrival mechanism. The second is a cyclic queue. The third is a model for a computer system in which finite and infinite sources interact.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference12 articles.
1. A derivation of response time distribution for an M/G/1 processor sharing queue;Yashkov;Problems of Control and Information Theory,1983
2. A Conditional Response Time of the M/M/1 Processor-Sharing Queue
3. A new approach to the M/G/1 processor-sharing queue
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献