1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.PR2008
Stability of a processor sharing queue with varying throughput
Pascal Moyal
In this paper, we present a stability criterion for Processor Sharing queues, in which the throughput may depend on the number of customers in the system (in such cases such as int…
math.PR2008★ 1 cited
Construction of a stationary FIFO queue with impatient customers
Pascal Moyal
In this paper, we study the stability of queues with impatient customers. Under general stationary ergodic assumptions, we first provide some conditions for such a queue to be rege…
math.PR2007
Convex comparison of service disciplines in real time queues
Pascal Moyal
We present a comparison of the service disciplines in real-time queueing systems (the customers have a deadline before which they should enter the service booth). We state that giv…