Approximations for the performance evaluation of a discrete-time two-class queue with an alternating service discipline
From MaRDI portal
Publication:2115774
DOI10.1007/s10479-020-03776-5OpenAlexW3082259047MaRDI QIDQ2115774
Herwig Bruneel, Dieter Fiems, Arnaud Devos, Joris Walraevens
Publication date: 21 March 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://biblio.ugent.be/publication/8742356
approximationqueueing theoryjoint probability generating functiondominant singularitiestwo-class queueing model
Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A queueing model with two classes of retrial customers and paired services
- On the optimization of two-class work-conserving parameterized scheduling policies
- Power series approximations for two-class generalized processor sharing systems
- Tail asymptotics for a generalized two-demand queueing model -- a kernel method
- A polling model with an autonomous server
- Boundary value problems in queueing theory
- The asymptotic behavior of queueing systems: Large deviations theory and dominant pole approximation
- A tandem queueing model with coupled processors.
- Performance analysis of a single-server ATM queue with a priority scheduling.
- Time-limited polling systems with batch arrivals and~phase-type service times
- An analytical method in the theory of two-dimensional positive random walks
- Markov processes on a semi-infinite strip and the geometric tail algorithm
- An approximate analysis of a Bernoulli alternating service model
- Wireless three-hop networks with stealing. II: Exact solutions through boundary value problems
- Priority queueing systems: from probability generating functions to tail probabilities
- On the behavior of buffers with random server interruptions
- Power Series for Stationary Distributions of Coupled Processor Models
- Two queues with random time-limited polling
This page was built for publication: Approximations for the performance evaluation of a discrete-time two-class queue with an alternating service discipline