Randomized pushing-out in the priority queueing with a finite buffer size
One considers a nonpreemptive priority queueing system with two classes of customers. The customers of class 1 (2) form Poisson process with rate \(\lambda _1\) (\(\lambda _2\)), the service time distribution is exponential with the same rate \(\mu \) for both types of customers. The buffer has a finite size \(N\) and it is shared by both types of customers. If the buffer is full, a new incoming customer of class 1 can push out one of class 2 with probability \(\alpha \). The paper uses the generating function approach, it requires the solution of a linear system of \(N\) equations. The steady-state distribution and the loss probabilities are found.
- An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
- Analysis of a finite buffer with non-preemptive priority scheduling
- Analysis of a finite capacity non preemptive priority queue
- Finite capacity priority queues with potential health applications
- scientific article; zbMATH DE number 49989 (Why is no real title available?)
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
This page was built for publication: Randomized pushing-out in the priority queueing with a finite buffer size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876852)
