Conditional expected sojourn times in insensitive queueing systems and networks
From MaRDI portal
Publication:5185814
DOI10.2307/1427346zbMath0559.60074OpenAlexW2318212556MaRDI QIDQ5185814
Publication date: 1984
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1427346
Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (4)
Processor-sharing queues: Some progress in analysis ⋮ Processor sharing: a survey of the mathematical theory ⋮ Insensitivity of multiclass systems with general dynamic preemptive resume queueing disciplines ⋮ Mathematical problems in the theory of processor-sharing queueing systems
This page was built for publication: Conditional expected sojourn times in insensitive queueing systems and networks