Sojourn times in a random queue with and without preemption

✍ Scribed by A.J. Field; P.G. Harrison

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 115 KB
• Volume: 112
• Category: Article
• ISSN: 0377-2217
• DOI: 10.1016/s0377-2217(97)00407-4

✦ Synopsis

We consider an equilibrium M/M/1 queue in which customers arrive at a random position, both for the preemptive and non-preemptive cases. The Laplace±Stieltjes transforms of their sojourn time distributions are derived and in the latter case it is veri®ed that the result is that of an M/M/1 queue where the server chooses the next task to serve at random.