Analyzing priority queues with 3 classes using tree-like processes
From MaRDI portal
Publication:854994
DOI10.1007/s11134-006-8804-0zbMath1105.60071OpenAlexW2056012692MaRDI QIDQ854994
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
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (4)
Class clustering destroys delay differentiation in priority queues ⋮ Unnamed Item ⋮ On the link between Markovian trees and tree-structured Markov chains ⋮ Calculation of output characteristics of a priority queue through a busy period analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov chains with marked transitions
- Solving nonlinear matrix equations arising in tree-like stochastic processes.
- Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks
- The Nonpreemptive Priority MAP/G/1 Queue
- Priority Queues
- Computation of Steady-State Probabilities for M/M/1 Priority Queues
- ON THE QUEUE WITH PH-MARKOV RENEWAL PREEMPTIONS
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- 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
- Matrix product-form solutions for Markov chains with a tree structure
- Tree Structured QBD Markov Chains and Tree‐Like QBD Processes
- Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue
- A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
- Queues with marked customers
- A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS
This page was built for publication: Analyzing priority queues with 3 classes using tree-like processes
