Entropy maximised queueing networks with blocking and multiple job classes

DOI10.1016/0166-5316(93)90041-RMaRDI QIDQ5286384zbMATH OpenFDO

Authors Demetres D. Kouvatsos, Spiros G. Denazis

Publication date 29 June 1993

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(93)90041-R

zbMATH Keywords

complete buffer sharing schemeentropy maximisationmixed service disciplinesmultiple job classesopen multi-class reversible queueing networksqueue length distributionsrepetitive-service blocking mechanism

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• MEM for arbitrary closed queueing networks with RS-blocking and multiple job classes
• Entropy maximisation and queueing network models
• scientific article; zbMATH DE number 4093151
• An ME-based approximation for multi-server queues with preemptive priority
• Maximum entropy two-station cyclic queues with multiple general servers

Cited in

(6)

• Entropy maximisation and queueing network models
• An ME-based approximation for multi-server queues with preemptive priority
• MEM for arbitrary closed queueing networks with RS-blocking and multiple job classes
• Exact analysis of queueing networks with multiple job classes and blocking-after-service
• Performance analysis of multimedia based web traffic with QoS constraints
• A unified ME algorithm for arbitrary open QNMs with mixed blocking mechanisms

This page was built for publication: Entropy maximised queueing networks with blocking and multiple job classes

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