https://wiki.swarma.org/index.php?action=history&feed=atom&title=%E6%A8%A1%E6%9D%BF%3AQueueing_theory 2026-11-03T02:31:39Z 本wiki的该页面的版本历史 MediaWiki 1.35.0 https://wiki.swarma.org/index.php?title=%E6%A8%A1%E6%9D%BF:Queueing_theory&diff=31772&oldid=prev 2022-06-10T09:02:01Z

<p>导入1个版本</p> <table class="diff diff-contentalign-left diff-editfont-monospace" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="zh-Hans-CN"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">←上一版本</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">2022年6月10日 (五) 09:02的版本</td> </tr> <!-- diff cache key wiki:diff::1.12:old-31771:rev-31772 --> </table>

Swarma https://wiki.swarma.org/index.php?title=%E6%A8%A1%E6%9D%BF:Queueing_theory&diff=31771&oldid=prev 2021-10-05T17:57:09Z

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

排队论>Comp.arch