Community hub
0 subscribers7 pages, 0 posts
Recent from talks
All channels
Be the first to start a discussion here.
Be the first to start a discussion here.
Be the first to start a discussion here.
Be the first to start a discussion here.
Contribute something
Welcome to the community hub built to collect knowledge and have discussions related to Decomposition method (queueing theory).
Nothing was collected or created yet.
Decomposition method (queueing theory)
View on Wikipediafrom Wikipedia
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
[edit]- ^ Kuehn, P. (1979). "Approximate Analysis of General Queuing Networks by Decomposition". IEEE Transactions on Communications. 27: 113–126. doi:10.1109/TCOM.1979.1094270.
- ^ Caldentey, R. (2001). "Approximations for Multi-Class Departure Processes" (PDF). Queueing Systems. 38 (2): 205–212. doi:10.1023/A:1010910531975. S2CID 14383294.
| Single queueing nodes | |
|---|---|
| Arrival processes | |
| Queueing networks | |
| Service policies | |
| Key concepts | |
| Limit theorems | |
| Extensions | |
| Information systems | |
 | This probability-related article is a stub. You can help Wikipedia by expanding it. |