1,721,058 research outputs found
Approximate Solution of Queuing Networks based on Exact and Bounded Aggregation Technique
No full textNorth-Hollan
An Extension of Norton's Theorem for Queueing Networks
No full textGiven a closed BCMP queueing network, the problem is considered of studying the behavior of any subsystem σ without solving for the entire system. This paper proves that this is possible for σ 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 σ's cardinality. Copyright © 1982 by The Institute of Electrical and Electronics Engineers, Inc
Parallel Discrete Event Simulation in a Distributed Memory System
No full textSIMULATION THEORY AND PRACTIC
Decomposability for General Markovian Networks
No full textThe conditions under which queueing networks with general service times enjoy the property of near complete decomposability are discussed, and the expression is given (in terms of the network topology) of a new condition for network decomposability
Proceedings of ACM WOSP 2002, Third International Workshop on Software and Performance
No full textProc. of ACM WOSP 2002, July 24-26, 2002, Rom
- …
