An Extension of Norton's Theorem for Queueing Networks

DOI10.1109/TSE.1982.235424zbMath0484.90038OpenAlexW2140852100MaRDI QIDQ3944306

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

aggregationcomputational complexitydecompositionNorton's theoremequivalent networkclosed BCMP queueing networkcomputer/communication networksexact aggregation proceduregeneral flow-equivalent solution procedureproduct-form procedure

Mathematics Subject Classification ID

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

Related Items (5)

Lumping and reversed processes in cooperating automata ⋮ Multilevel aggregation of central server models: a minimum relative entropy approach ⋮ Mathematical theory of queueing networks ⋮ NORTON'S THEOREM FOR BATCH ROUTING QUEUEING NETWORKS ⋮ Theory of queuing networks and its applications to the analysis of information-computing systems

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