---
title: Flow-equivalent server method
slug: flow-equivalent-server-method
qid: 
snapshot: enwiki-001361842958
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1361842958
tags: [23112492, 23468805, 23603337, 25730970, 26220375]
---

# Flow-equivalent server method

> [!note] Provenance
> Snapshot `enwiki-001361842958` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1361842958> · Licensed CC BY-SA 4.0

In queueing theory, a discipline within the mathematical theory of probability, the flow-equivalent server method (also known as flow-equivalent aggregation technique, Norton's theorem for queueing networks or the Chandy–Herzog–Woo method ) is a divide-and-conquer method to solve product form queueing networks inspired by Norton's theorem for electrical circuits. 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.

In queueing theory, a discipline within the mathematical theory of probability, the flow-equivalent server method (also known as flow-equivalent aggregation technique, Norton's theorem for queueing networks or the Chandy–Herzog–Woo method ) is a divide-and-conquer method to solve product form queueing networks inspired by Norton's theorem for electrical circuits. 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. ==References==
