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

DOI10.1007/S10958-006-0312-6zbMATH Open1117.60084OpenAlexW2052507224MaRDI QIDQ876852FDOQ876852

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

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Analysis of a finite capacity non preemptive priority queue
• Finite capacity priority queues with potential health applications
• 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

Cited In (3)

• The Push-Out-Priority Queue Discipline
• Randomized push-out disciplines in priority queueing
• Title not available (Why is that?)

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)