12 citations · 26 across the 31 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.PF2013★ 2 cited
Analysis of a non-work conserving Generalized Processor Sharing queue
Fabrice Guillemin
We consider in this paper a non work-conserving Generalized Processor Sharing (GPS) system composed of two queues with Poisson arrivals and exponential service times. Using general…
cs.PF2013
Stationary analysis of the "Shortest Queue First" service policy: the asymmetric case
Fabrice Guillemin, Alain Simonian
As a follow-up to a recent paper considering two symmetric queues, the \textit{Shortest Queue First} service discipline is presently analysed for two general asymmetric queues. Usi…
cs.PF2013
Stationary analysis of the Shortest Queue First service policy
Fabrice Guillemin, Alain Simonian
We analyze the so-called Shortest Queue First (SQF) queueing discipline whereby a unique server addresses queues in parallel by serving at any time that queue with the smallest wor…