Flow-equivalent server method explained

In queueing theory, a discipline within the mathematical theory of probability, the flow-equivalent server method (also known as flow-equivalent aggregation technique,[1] Norton's theorem for queueing networks or the Chandy–Herzog–Woo method[2]) is a divide-and-conquer method to solve product form queueing networks inspired by Norton's theorem for electrical circuits.[3] The network is successively split into two, one portion is reconfigured to a closed network and evaluated.

Marie's algorithm is a similar method where analysis of the sub-network are performed with state-dependent Poisson process arrivals.[4] [5]

Notes and References

  1. Casale . G.. A note on stable flow-equivalent aggregation in closed networks . 10.1007/s11134-008-9093-6 . Queueing Systems. 60 . 3–4 . 193–202 . 2008 . 10044/1/18300 . free .
  2. Chandy . K. M. . K. Mani Chandy. Herzog . U. . Woo . L. . Parametric Analysis of Queuing Networks . 10.1147/rd.191.0036 . IBM Journal of Research and Development . 19 . 36 . 1975 .
  3. Book: Harrison, Peter G.. Peter G. Harrison. Naresh M.. Patel. Performance Modelling of Communication Networks and Computer Architectures. Addison-Wesley. 1992. 249–254. 0-201-54419-9. registration.
  4. Marie . R. A. . 10.1109/TSE.1979.234214 . An Approximate Analytical Method for General Queueing Networks . IEEE Transactions on Software Engineering . 5 . 530–538 . 1979 .
  5. Marie . R. A.. Calculating equilibrium probabilities for λ(n)/Ck/1/N queues . 10.1145/1009375.806155 . ACM SIGMETRICS Performance Evaluation Review . 9 . 2 . 117 . 1980 . free .

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Flow-equivalent server method".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.