"Random Quantum Allocation: A New Approach to Waiting Time Distributions for M/M/N Processor Sharing Queues". ^ Braband, Jens Schassberger, Rolf (21–23 September 1993)."Waiting time distributions for closed M/M/N processor sharing queues". "Waiting time distributions for M/M/N processor sharing queues". "ITU/ITC Teletraffic Engineering Handbook" (PDF). "Idle and busy periods in stable M / M / k queues". "Analysis and Applications of the Delay Cycle for the M/M/c Queueing System". "Analysis of the Busy Period for the M/M/c Queue: An Algorithmic Approach". ^ a b Barbeau, Michel Kranakis, Evangelos (2007)."Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain". Performance Modelling of Communication Networks and Computer Architectures. Analysis of Queues: Methods and Applications. Any further arrivals to the queue are considered "lost". In an M/M/ c/ K queue only K customers can queue at any one time (including those in service ). An approximation has been offered for the response time distribution. The Laplace–Stieltjes transform of the response time distribution has been shown to be a solution to a Volterra integral equation from which moments can be computed. This means that arrivals after a job of interest can impact the service time of the job of interest. 2.3.2 Customers in processor sharing disciplineĪn M/M/c queue is a stochastic process whose state space is the set where n is the number of jobs in the system.2.3.1 Customers in first-come, first-served discipline.