Analyzing priority queues with 3 classes using tree-like processes

DOI10.1007/S11134-006-8804-0MaRDI QIDQ854994zbMATH OpenOpenAlexFDO

Authors Benny Van Houdt, Chris Blondia

Publication date 20 December 2006

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://repository.uantwerpen.be/docman/irua/6a6de2/4924.pdf

zbMATH Keywords

matrix analytic methods

Mathematics Subject Classification ID

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

Review text

The authors use tree-like processes to study a general class of priority queues with three services classes. Their main result is that the queue length distributions and loss rate are obtained by applying a censoring argument on the steady state of the tree-like process. Their key approach is matrix analytic methods. Moreover, numerical examples are used to illustrate the strength of the approach.

Recommendations

• An Exact Analysis of the Multi‐classM/M/kPriority Queue with Partial Blocking
• Priority queuing systems with variable parameters. I: Absolute priority
• Multi-server queueing systems with multiple priority classes
• Analysis of nonpreemptive priority queues with multiple servers and two priority classes
• Generalized priority systems. Analytical results and numerical algorithms

Cites work

• A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
• A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS
• Computation of Steady-State Probabilities for M/M/1 Priority Queues
• Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 1132980 (Why is no real title available?)
• scientific article; zbMATH DE number 194776 (Why is no real title available?)
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Markov chains with marked transitions
• Matrix product-form solutions for Markov chains with a tree structure
• ON THE QUEUE WITH PH-MARKOV RENEWAL PREEMPTIONS
• Priority Queues
• Queues with marked customers
• Solving nonlinear matrix equations arising in tree-like stochastic processes.
• The nonpreemptive priority MAP/G/1 queue
• The quasi-birth-death type markov chain with a tree structure
• The workload in theMAP/G/1 queue with state-dependent services:its application to a queue with preemptive resume priority
• Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks
• Tree Structured QBD Markov Chains and Tree‐Like QBD Processes

Cited in

(4)

• On the link between Markovian trees and tree-structured Markov chains
• Calculation of output characteristics of a priority queue through a busy period analysis
• Class clustering destroys delay differentiation in priority queues
• Performance analysis of commercial offset printing under dynamic priority rules

This page was built for publication: Analyzing priority queues with 3 classes using tree-like processes

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