Flow-equivalent server method

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]

References

v t e Queueing theory Single queueing nodes D/M/1 queue M/D/1 queue M/D/c queue M/M/1 queue Burke's theorem M/M/c queue M/M/∞ queue M/G/1 queue Pollaczek–Khinchine formula Matrix analytic method M/G/k queue G/M/1 queue G/G/1 queue Kingman's formula Lindley equation Fork–join queue Bulk queue Queueing networks Jackson network Traffic equations Gordon–Newell theorem Mean value analysis Buzen's algorithm Kelly network G-network BCMP network Service policies FIFO LIFO Processor sharing Shortest job first Shortest remaining time Key concepts Continuous-time Markov chain Kendall's notation Little's law Product-form solution Balance equation Quasireversibility Flow-equivalent server method Arrival theorem Markovian arrival process Decomposition method Beneš method Limit theorems Fluid limit Mean field theory Heavy traffic approximation Reflected Brownian motion Extensions Fluid queue Layered queueing network Polling system Category