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

DOI10.1007/S10958-006-0312-6MaRDI QIDQ876852zbMATH OpenOpenAlexFDO

Authors G. L. Shevlyakov, Konstantin Avrachenkov, N. O. Vil'chevskij

Publication date 19 April 2007

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-006-0312-6

zbMATH Keywords

generating function approachfinite bufferpriority queueing

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• Randomized push-out disciplines in priority queueing
• Preemptive queueing system with randomized push-out mechanism
• The Push-Out-Priority Queue Discipline
• Publication:5753348
• A finite buffer queue with priorities

Cites work

• scientific article; zbMATH DE number 49989 (Why is no real title available?)
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• 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

Cited in

(4)

• The Push-Out-Priority Queue Discipline
• Preemptive queueing system with randomized push-out mechanism
• Randomized push-out disciplines in priority queueing
• scientific article; zbMATH DE number 4188957 (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)