The M/G/1 queueing model with preemptive random priorities

For the M/G/1 model, we look into a preemptive priority scheme in which the priority level is decided by a lottery. Such a scheme has no effect on the mean waiting time in the non-preemptive case (in comparison with the First Come First Served (FCFS) regime, for example). This is not the case when p...

Full description

Bibliographic Details
Main Author: Moshe Haviv
Format: Article
Language:English
Published: European Alliance for Innovation (EAI) 2015-11-01
Series:EAI Endorsed Transactions on Internet of Things
Subjects:
Online Access:https://eudl.eu/pdf/10.4108/icst.valuetools.2014.258240