Decomposition method (queueing theory)

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

In queueing theory, a discipline within the mathematical theory of probability, the decomposition method is an approximate method for the analysis of queueing networks where the network is broken into subsystems which are independently analyzed.[1][2]

The individual queueing nodes are considered to be independent G/G/1 queues where arrivals are governed by a renewal process and both service time and arrival distributions are parametrised to match the first two moments of data.

References

  1. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  2. ↑ Lua error in package.lua at line 80: module 'strict' not found.

<templatestyles src="Asbox/styles.css"></templatestyles>

Stub icon

This probability-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "https://infogalactic.com/w/index.php?title=Decomposition_method_(queueing_theory)&oldid=679316285"