Analysis of a finite buffer with non-preemptive priority scheduling

DOI10.1080/15326349908807539zbMath0931.60072OpenAlexW2078223610MaRDI QIDQ4243932

Udo R. Krieger, Dietmar Wagner

Publication date: 27 February 2000

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349908807539

zbMATH Keywords

Laplace-Stieltjes transformnon-preemptive priorityfirst passage-time analysisshared buffer model

Mathematics Subject Classification ID

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

Related Items (5)

On a dual queueing system with preemptive priority service discipline ⋮ Randomized pushing-out in the priority queueing with a finite buffer size ⋮ Performance analysis of wireless mobile networks with queueing priority and guard channels ⋮ Analysis of a finite buffer model with two servers and two nonpreemptive priority classes ⋮ Waiting time analysis of the multiple priority dual queue with a preemptive priority service discipline

This page was built for publication: Analysis of a finite buffer with non-preemptive priority scheduling