Single-class bounds of multi-class queuing networks

DOI10.1145/147508.147530MaRDI QIDQ4302824zbMATH OpenOpenAlexFDO

Authors Lawrence W. Dowdy, Brian M. Carlson, Alan T. Krantz, Satish K. Tripathi

Publication date 21 August 1994

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/147508.147530

zbMATH Keywords

bounding analysisproduct-form networkqueueing networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Performance bounds for scheduling queueing networks
• Two classes of performance bounds for closed queueing networks
• Queueing networks
• A product-form approximation method for general closed queueing networks with several classes of customers
• Class aggregation for multi-class queueing networks with FCFS multi-server stations

Cited in

(4)

• Equivalent single-queue-single-server model for a pentium processor
• Performance bounds for modeling NUMA architectures
• scientific article; zbMATH DE number 3898227 (Why is no real title available?)
• scientific article; zbMATH DE number 4118138 (Why is no real title available?)

This page was built for publication: Single-class bounds of multi-class queuing networks

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