Mean sojourn times in multiclass feedback queues with gated disciplines
From MaRDI portal
Publication:4456093
DOI10.1002/NAV.10086zbMATH Open1045.90013OpenAlexW2040231795MaRDI QIDQ4456093FDOQ4456093
Authors: Tetsuji Hirayama
Publication date: 15 March 2004
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.10086
Recommendations
- scientific article; zbMATH DE number 522747
- Analysis of multiclass feedback queues and its application to a packet scheduling problem
- scientific article; zbMATH DE number 1766731
- Sojourn times in vacation and polling systems with Bernoulli feedback
- Mean waiting times in a general feedback queue with priorities
Programming involving graphs or networks (90C35) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35)
Cites Work
Cited In (6)
- Sojourn time problems in feedback queues
- Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms
- Analysis of a Markovian feedback queue with multi-class customers and its application to the weighted round-robin queue
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analysis of multiclass feedback queues and its application to a packet scheduling problem
This page was built for publication: Mean sojourn times in multiclass feedback queues with gated disciplines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4456093)