Flow-equivalent server method
{{Short description|Mathematical process}}
In queueing theory, a discipline within the mathematical theory of probability, the flow-equivalent server method (also known as flow-equivalent aggregation technique,{{Cite journal | last1 = Casale | first1 = G.| title = A note on stable flow-equivalent aggregation in closed networks | doi = 10.1007/s11134-008-9093-6 | journal = Queueing Systems| volume = 60 | issue = 3–4 | pages = 193–202 | year = 2008 | url = http://www.doc.ic.ac.uk/~gcasale/content/questa09cmva.pdf| hdl = 10044/1/18300 | hdl-access = free }} Norton's theorem for queueing networks or the Chandy–Herzog–Woo method{{Cite journal | last1 = Chandy | first1 = K. M. | author-link1 = K. Mani Chandy| last2 = Herzog | first2 = U. | last3 = Woo | first3 = L. | title = Parametric Analysis of Queuing Networks | doi = 10.1147/rd.191.0036 | journal = IBM Journal of Research and Development | volume = 19 | pages = 36 | year = 1975 }}) is a divide-and-conquer method to solve product form queueing networks inspired by Norton's theorem for electrical circuits.{{cite book|first=Peter G.|last=Harrison|author-link=Peter G. Harrison|first2=Naresh M.|last2=Patel|title=Performance Modelling of Communication Networks and Computer Architectures|publisher=Addison-Wesley|year=1992|pages=[https://archive.org/details/performancemodel0000harr/page/249 249–254]|isbn=0-201-54419-9|url-access=registration|url=https://archive.org/details/performancemodel0000harr/page/249}} 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.{{Cite journal | last1 = Marie | first1 = R. A. | doi = 10.1109/TSE.1979.234214 | title = An Approximate Analytical Method for General Queueing Networks | journal = IEEE Transactions on Software Engineering | issue = 5 | pages = 530–538 | year = 1979 }}{{Cite journal | last1 = Marie | first1 = R. A.| title = Calculating equilibrium probabilities for λ(n)/Ck/1/N queues | doi = 10.1145/1009375.806155 | journal = ACM SIGMETRICS Performance Evaluation Review | volume = 9 | issue = 2 | pages = 117 | year = 1980 | doi-access = free }}