| 词条 | Decomposition method (queueing theory) |
| 释义 |
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. References1. ^{{Cite journal | last1 = Kuehn | first1 = P. | doi = 10.1109/TCOM.1979.1094270 | title = Approximate Analysis of General Queuing Networks by Decomposition | journal = IEEE Transactions on Communications | volume = 27 | pages = 113–126 | year = 1979 | pmid = | pmc = }} {{Queueing theory}}{{probability-stub}}2. ^{{Cite journal | last1 = Caldentey | first1 = R. | title = Approximations for Multi-Class Departure Processes| journal = Queueing Systems | volume = 38 | issue = 2 | pages = 205–212 | doi = 10.1023/A:1010910531975 | year = 2001 | pmid = | pmc = | url = http://people.stern.nyu.edu/rcaldent/papers/QuestaApprox.pdf}} 1 : Queueing theory |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。