An Extension of Norton's Theorem for Queueing Networks

DOI10.1109/TSE.1982.235424MaRDI QIDQ3944306zbMATH OpenOpenAlexFDO

Authors Simonetta Balsamo, G. G. Iazeolla

Publication date 1982

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tse.1982.235424

zbMATH Keywords

aggregationclosed BCMP queueing networkcomputational complexitycomputer/communication networksdecompositionequivalent networkexact aggregation proceduregeneral flow-equivalent solution procedureNorton's theoremproduct-form procedure

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Analytic circuit theory (94C05)

Cited in

(6)

• Theory of queuing networks and its applications to the analysis of information-computing systems
• NORTON'S THEOREM FOR BATCH ROUTING QUEUEING NETWORKS
• Lumping and reversed processes in cooperating automata
• Multilevel aggregation of central server models: a minimum relative entropy approach
• On the resistance distance and Kirchhoff index of K_n-chain(ring) network
• Mathematical theory of queueing networks

This page was built for publication: An Extension of Norton's Theorem for Queueing Networks

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