Preemptive queueing system with randomized push-out mechanism
From MaRDI portal
Publication:907205
DOI10.1016/j.cnsns.2014.08.020zbMath1329.90043OpenAlexW2049472381MaRDI QIDQ907205
Vladimir Zaborovsky, Oleg Zayats, Vladimir Muliukha, Alexander Ilyashenko
Publication date: 25 January 2016
Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cnsns.2014.08.020
Queueing theory (aspects of probability theory) (60K25) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (4)
Modeling the permissive-only left-turn queue at signals ⋮ Preface to the special issue NUMTA 2013 ⋮ On the parameter selection of a query flow control system using the probabilistic pushing out mechanism ⋮ Transient analysis of \(\mathrm{M}^{[X_1},\mathrm{M}^{[X_2]}/\mathrm{G}_1,\mathrm{G}_2/1\) retrial queueing system with priority services, working vacations and vacation interruption, emergency vacation, negative arrival and delayed repair]
Cites Work
- Unnamed Item
- Unnamed Item
- Jittering performance of random deflection routing in packet networks
- Randomized push-out disciplines in priority queueing
- Queuing with Preemptive Priorities or with Breakdown
- Two Queues Under Preemptive Priority with Poisson Arrival and Service Rates
- A Single Server with a Finite Queue and Items of Several Types
This page was built for publication: Preemptive queueing system with randomized push-out mechanism