An Extension of Norton's Theorem for Queueing Networks

Authors:
S. Balsamo;G. Iazeolla
Affiliations:
Istituto di Scienze dell'Informazione, University of Pisa;-
Venue:
IEEE Transactions on Software Engineering
Year:
1982

Citing 0
Cited 4

Product Form Queueing Networks

Performance Evaluation: Origins and Directions
Aggregation and Disaggregation in Product Form Queueing Petri Nets

PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Queueing networks

SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Lumping and reversed processes in cooperating automata

ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a closed BCMP queueing network, the problem is considered of studying the behavior of any subsystem a without solving for the entire system. This paper proves that this is possible for a consisting of any number of queues, arbitrarily interfacing the rest of the system, thus generalizing the classic CHW theorem, also known as Norton's theorem. A general flow-equivalent solution procedure is given and its computational complexity is compared with that of the product-form and the exact aggregation procedure. The relative merits of these procedures are also expressed in terms of a's cardinality.