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
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
| Single queueing nodes | |
|---|---|
| Arrival processes | |
| Queueing networks | |
| Service policies | |
| Key concepts | |
| Limit theorems | |
| Extensions | |
| Information systems | |
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This probability-related article is a stub. You can help Wikipedia by expanding it. |
