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

DOI10.1016/0166-5316(88)90004-1zbMATH Open0644.60094OpenAlexW2025364194MaRDI QIDQ3787258FDOQ3787258

Authors: André B. Bondi, Yie-Min Chuang 

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

Recommendations

• MVA approximations for SJN scheduling
• Approximating nonstationary two-priority non-preemptive queueing systems
• An analysis of an approximation algorithm for queueing networks
• Closed two node priority queueing networks
• PAM—A noniterative approximate solution method for closed multichain queueing networks

zbMATH Keywords

Numerical resultspreemptive priority serverqueueing network models of computer systems

Mathematics Subject Classification ID

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

Cited In (4)

• Performance analysis of scheduling policies in re-entrant manufacturing systems
• Entropy maximisation and queueing network models
• A maximum entropy priority approximation for a stable G/G/1 queue
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787258)