Analysis of a finite buffer with non-preemptive priority scheduling

DOI10.1080/15326349908807539MaRDI QIDQ4243932zbMATH OpenOpenAlexFDO

Authors Dietmar Wagner, Udo R. Krieger

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

first passage-time analysisLaplace-Stieltjes transformnon-preemptive priorityshared buffer model

Mathematics Subject Classification ID

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

Recommendations

• Analysis of a finite capacity non preemptive priority queue
• Analysis of a finite buffer model with two servers and two nonpreemptive priority classes
• Analysis of a non-preemptive priority multiserver queue
• Analysis of a discrete-time preemptive resume priority buffer
• scientific article; zbMATH DE number 6747326
• Preemptive scheduling with finite capacity input buffers
• scientific article; zbMATH DE number 5926330
• A parallel priority queueing system with finite buffers

Cited in

(22)

• Analysis of a finite capacity non preemptive priority queue
• An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
• A finite capacity multi-server multi-queueing priority model with non-renewal input
• An eigenvalue approach to analyzing a finite source priority queueing model
• On a dual queueing system with preemptive priority service discipline
• (N, n)-preemptive-priority M/G/1 queues with finite and infinite buffers
• Performance analysis of service systems with priority upgrades
• Waiting time analysis of the multiple priority dual queue with a preemptive priority service discipline
• scientific article; zbMATH DE number 3885623 (Why is no real title available?)
• Performance analysis of wireless mobile networks with queueing priority and guard channels
• Waiting times of the multiple priority dual queue with finite buffer and non-preemptive priority scheduling
• scientific article; zbMATH DE number 1535812 (Why is no real title available?)
• A finite buffer queue with priorities
• scientific article; zbMATH DE number 1783878 (Why is no real title available?)
• Analysis of the finite-source multiclass priority queue with an unreliable server and setup time
• scientific article; zbMATH DE number 1873273 (Why is no real title available?)
• Analysis of queueing model with priority scheduling by supplementary variable method
• scientific article; zbMATH DE number 6747326 (Why is no real title available?)
• Average waiting time of customers in a priority M/D/k queue with finite buffers
• Randomized pushing-out in the priority queueing with a finite buffer size
• Analysis of multi-channel bi-level queueing system with priority diacipline by using recursive solution technique
• Analysis of a finite buffer model with two servers and two nonpreemptive priority classes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243932)