A finite buffer queue with priorities

DOI10.1016/S0166-5316(01)00053-0MaRDI QIDQ4538624zbMATH OpenFDO

Authors Vinod Sharma, Jorma Virtamo

Publication date 14 July 2002

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0166-5316(01)00053-0

zbMATH Keywords

queue models

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• A simple fluid model for servicing priority traffic
• An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
• Partially shared buffers with full or mixed priority
• Analysis of a finite buffer with non-preemptive priority scheduling
• Analysis of a finite buffer model with two servers and two nonpreemptive priority classes

Cited in

(18)

• An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
• A reader-writer queue with reader preference
• Randomized push-out disciplines in priority queueing
• Performance analysis of the \(DAR(1)/D/c\) priority queue under partial buffer sharing policy
• A preemptive priority queue with balking
• Proof of monotone loss rate of fluid priority-queue with finite buffer
• Buffer's size optimization in a queue system with multiple classes of clients and different requirements of retards and losses
• A two-stage approach in solving the state probabilities of the multi-queue M/G/1 model
• Performance analysis of voice over internet protocol via non Markovian loss system with preemptive priority and server break down
• A token based parallel processing queueing system with priority
• Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation
• The Impact of Buffer Finiteness on the Loss Rate in a Priority Queueing System
• An N-Server Cutoff Priority Queue
• Loss behavior in space priority queue with batch Markovian arrival process — discrete-time case
• Loss tandem networks with blocking -- a semi-Markov approach
• Influence of real-time queue capacity on system contents in DiffServ's expedited forwarding per-hop-behavior
• Partially shared buffers with full or mixed priority
• Randomized pushing-out in the priority queueing with a finite buffer size

This page was built for publication: A finite buffer queue with priorities

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