A new MVA-based approximation for closed queueing networks with a preemptive priority server

DOI10.1016/0166-5316(88)90004-1zbMath0644.60094OpenAlexW2025364194MaRDI QIDQ3787258

Yie-Min Chuang, André B. Bondi

Publication date: 1988

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(88)90004-1

zbMATH Keywords

Numerical resultspreemptive priority serverqueueing network models of computer systems

Mathematics Subject Classification ID

Markov renewal processes, semi-Markov processes (60K15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (3)

Performance analysis of scheduling policies in re-entrant manufacturing systems ⋮ A maximum entropy priority approximation for a stable G/G/1 queue ⋮ Entropy maximisation and queueing network models

This page was built for publication: A new MVA-based approximation for closed queueing networks with a preemptive priority server