Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms
From MaRDI portal
Publication:1761784
DOI10.1007/s10479-011-0910-7zbMath1259.90023OpenAlexW2075266444MaRDI QIDQ1761784
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://tsukuba.repo.nii.ac.jp/record/27699/files/AOR_198-1.pdf
Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Analysis of multiclass feedback queues and its application to a packet scheduling problem
- A new approach to analysis of polling systems
- Mean value analysis for polling systems
- Flow time distributions in a \(K\) class \(M/G/1\) priority feedback queue
- A queueing network with a single cyclically roving server
- Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
- Performance analysis and optimization of a cyclic-service tandem queueing system with multi-class customers
- Waiting-time distributions in polling systems with simultaneous batch arrivals
- On the M/G/1 Bernoulli feedback queue with multi-class customers
- Polling systems and multitype branching processes
- A survey on discriminatory processor sharing
- Sojourn times in vacation and polling systems with Bernoulli feedback
- Priority Queues with Feedback
- The Analysis of Random Polling Systems
- Sojourn times in the m/g/1 queue with deterministic feedback
- Nondeterministic Polling Systems
- Mean sojourn times in multiclass feedback queues with gated disciplines
- Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems—Exact Results and Applications
- Queues Served in Cyclic Order
- Queues Served in Cyclic Order: Waiting Times
- Queues with Periodic Service and Changeover Time
This page was built for publication: Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms
