Randomized pushing-out in the priority queueing with a finite buffer size (Q876852)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Randomized pushing-out in the priority queueing with a finite buffer size
scientific article

    Statements

    Randomized pushing-out in the priority queueing with a finite buffer size (English)
    0 references
    19 April 2007
    0 references
    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.
    0 references
    0 references
    priority queueing
    0 references
    finite buffer
    0 references
    generating function approach
    0 references
    0 references