更改
小
无编辑摘要
{{Navbox
| name = Queueing theory
| title = [[Queueing theory]]
| listclass = hlist
| state = {{{state<includeonly>|uncollapsed</includeonly>}}}
| group1 = Single queueing nodes
| list1 =
* [[D/M/1 queue]]
* [[M/D/1 queue]]
* [[M/D/c queue]]
* [[M/M/1 queue]]
** [[Burke's theorem]]
* [[M/M/c queue]]
* [[M/M/∞ queue]]
* [[M/G/1 queue]]
** [[Pollaczek–Khinchine formula]]
** [[Matrix analytic method]]
* [[M/G/k queue]]
* [[G/M/1 queue]]
* [[G/G/1 queue]]
** [[Kingman's formula]]
** [[Lindley equation]]
* [[Fork–join queue]]
* [[Bulk queue]]
| group2= Arrival processes
| list2 =
* [[Poisson point process]]
* [[Markovian arrival process]]
* [[Rational arrival process]]
| group3 = Queueing networks
| list3 =
* [[Jackson network]]
** [[Traffic equations]]
* [[Gordon–Newell theorem]]
** [[Mean value analysis]]
** [[Buzen's algorithm]]
* [[Kelly network]]
* [[G-network]]
* [[BCMP network]]
| group4 = Service policies
| list4 =
* [[FIFO (computing and electronics)|FIFO]]
* [[LIFO (computing)|LIFO]]
* [[Processor sharing]]
* [[Round-robin scheduling|Round-robin]]
* [[Shortest job next]]
* [[Shortest remaining time]]
| group5 = Key concepts
| list5 =
* [[Continuous-time Markov chain]]
* [[Kendall's notation]]
* [[Little's law]]
* [[Product-form solution]]
** [[Balance equation]]
** [[Quasireversibility]]
** [[Flow-equivalent server method]]
* [[Arrival theorem]]
* [[Decomposition method (queueing theory)|Decomposition method]]
* [[Beneš method]]
| group6 = Limit theorems
| list6 = * [[Fluid limit]]
* [[Mean-field theory]]
* [[Heavy traffic approximation]]
** [[Reflected Brownian motion]]
| group7 = Extensions
| list7 =
* [[Fluid queue]]
* [[Layered queueing network]]
* [[Polling system]]
* [[Adversarial queueing network]]
* [[Loss network]]
* [[Retrial queue]]
| group8 = [[Information system]]s
| list8 =
* [[Data buffer]]
* [[Erlang (unit)]]
* [[Erlang distribution]]
* [[Flow control (data)]]
* [[Message queue]]
* [[Network congestion]]
* [[Network scheduler]]
* [[Pipeline (software)]]<!-- There are other pipelines in computing, this being general -->
* [[Quality of service]]
* [[Scheduling (computing)]]
* [[Teletraffic engineering]]
| below = {{Icon|Category}} [[:Category:Queueing theory|Category]]
}}<noinclude>
{{Documentation}}
<!-- Add categories and interwikis to the /doc subpage, not here! -->
</noinclude>
| name = Queueing theory
| title = [[Queueing theory]]
| listclass = hlist
| state = {{{state<includeonly>|uncollapsed</includeonly>}}}
| group1 = Single queueing nodes
| list1 =
* [[D/M/1 queue]]
* [[M/D/1 queue]]
* [[M/D/c queue]]
* [[M/M/1 queue]]
** [[Burke's theorem]]
* [[M/M/c queue]]
* [[M/M/∞ queue]]
* [[M/G/1 queue]]
** [[Pollaczek–Khinchine formula]]
** [[Matrix analytic method]]
* [[M/G/k queue]]
* [[G/M/1 queue]]
* [[G/G/1 queue]]
** [[Kingman's formula]]
** [[Lindley equation]]
* [[Fork–join queue]]
* [[Bulk queue]]
| group2= Arrival processes
| list2 =
* [[Poisson point process]]
* [[Markovian arrival process]]
* [[Rational arrival process]]
| group3 = Queueing networks
| list3 =
* [[Jackson network]]
** [[Traffic equations]]
* [[Gordon–Newell theorem]]
** [[Mean value analysis]]
** [[Buzen's algorithm]]
* [[Kelly network]]
* [[G-network]]
* [[BCMP network]]
| group4 = Service policies
| list4 =
* [[FIFO (computing and electronics)|FIFO]]
* [[LIFO (computing)|LIFO]]
* [[Processor sharing]]
* [[Round-robin scheduling|Round-robin]]
* [[Shortest job next]]
* [[Shortest remaining time]]
| group5 = Key concepts
| list5 =
* [[Continuous-time Markov chain]]
* [[Kendall's notation]]
* [[Little's law]]
* [[Product-form solution]]
** [[Balance equation]]
** [[Quasireversibility]]
** [[Flow-equivalent server method]]
* [[Arrival theorem]]
* [[Decomposition method (queueing theory)|Decomposition method]]
* [[Beneš method]]
| group6 = Limit theorems
| list6 = * [[Fluid limit]]
* [[Mean-field theory]]
* [[Heavy traffic approximation]]
** [[Reflected Brownian motion]]
| group7 = Extensions
| list7 =
* [[Fluid queue]]
* [[Layered queueing network]]
* [[Polling system]]
* [[Adversarial queueing network]]
* [[Loss network]]
* [[Retrial queue]]
| group8 = [[Information system]]s
| list8 =
* [[Data buffer]]
* [[Erlang (unit)]]
* [[Erlang distribution]]
* [[Flow control (data)]]
* [[Message queue]]
* [[Network congestion]]
* [[Network scheduler]]
* [[Pipeline (software)]]<!-- There are other pipelines in computing, this being general -->
* [[Quality of service]]
* [[Scheduling (computing)]]
* [[Teletraffic engineering]]
| below = {{Icon|Category}} [[:Category:Queueing theory|Category]]
}}<noinclude>
{{Documentation}}
<!-- Add categories and interwikis to the /doc subpage, not here! -->
</noinclude>