Elements for the study of stability and performances in real-time queues

In this paper, we focus on a study of the performance of some real-time queues, where customers have temporal constraints to be serviced. The aim is to estimate some performances in the non-preemptive EDF-D case. First, the problem of stability for the queue was considered to ensure that a steady state is reached. Then, some results for the estimation of the loss probability of the queue are presented, including a work on the FIFO queue with impatient customers.