Waiting time and queue length analysis of Markov-modulated fluid priority queues
From MaRDI portal
Publication:2210663
DOI10.1007/s11134-020-09650-2zbMath1461.60080OpenAlexW3012514093MaRDI QIDQ2210663
Publication date: 8 November 2020
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-020-09650-2
Continuous-time Markov processes on general state spaces (60J25) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Numerical analysis or methods applied to Markov chains (65C40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient analysis of the MMAP[\(K\)/PH[\(K\)]/1 priority queue]
- The Erlangization method for Markovian fluid flows
- On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals
- Mean first passage times in fluid queues
- Alternating-directional Doubling Algorithm for M-Matrix Algebraic Riccati Equations
- Priority Queues
- A single-server queue with server vacations and a class of non-renewal arrival processes
- Solving Multi-Regime Feedback Fluid Queues
- A Hessenberg-Schur method for the problem AX + XB= C
- The workload in theMAP/G/1 queue with state-dependent services:its application to a queue with preemptive resume priority
- On the relationship between queue lengths at a random instant and at a departure in the stationary queue with bmap arrivals
- A simple fluid model for servicing priority traffic
- A Stochastic Two-Dimensional Fluid Model
- On fluid queueing systems with strict priority
- A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS
- Efficient algorithms for transient analysis of stochastic fluid flow models
This page was built for publication: Waiting time and queue length analysis of Markov-modulated fluid priority queues
