Randomized push-out disciplines in priority queueing
The paper considers a queueing system with two classes of packets. The packets of different classes arrive at the system according to the Poisson processes with different rates. The service time has the exponential distribution with the same rate for each class. The buffer has a finite size and is shared by both types of customers. If the buffer is full, a newly arriving customer of class 1 can push out of the buffer a customer of class 2 with a predetermined probability. To solve steady-state Kolmogorov equations, the paper uses a generating function approach, which only requires the solution of a finite linear system of equations.
- On the parameter selection of a query flow control system using the probabilistic pushing out mechanism
- The Push-Out-Priority Queue Discipline
- Stalling for solving slow server problem
- scientific article; zbMATH DE number 4188957 (Why is no real title available?)
- Randomized pushing-out in the priority queueing with a finite buffer size
- Preemptive queueing system with randomized push-out mechanism
This page was built for publication: Randomized push-out disciplines in priority queueing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781659)