Queueing Theory
Queueing Theory
复制标题
DOI：
10.1036/1097-8542.564700
复制
发表时间：
2021-11
影响因子：
2.7
通讯作者：
Hu Jin
中科院分区：
文献类型：
--
作者：
Hu Jin
单个排队节点通常使用肯德尔符号以A/S/C的形式描述，其中A描述到达队列之间的时间，S是作业的大小，C是节点处的服务器数量。[5][6]排队论中的许多定理可以通过将队列简化为称为马尔可夫链的数学系统来证明，该系统首先由安德烈·马尔可夫在他1906年的论文中描述。[7]Agner Krarup Erlang是一位丹麦工程师，曾在哥本哈根电话交换局工作，他在1909年发表了第一篇关于现在被称为“电话理论”的论文。[8][9][10]他用泊松过程模拟了到达交换机的电话呼叫数量，并在1917年解决了M/D/1队列，在1920年解决了M/D/k排队模型。[11]在Kendall的符号中：
Single queueing nodes are usually described using Kendall’s notation in the form A/S/C where A describes the time between arrivals to the queue, S the size of jobs and C the number of servers at the node.[5][6] Many theorems in queueing theory can be proved by reducing queues to mathematical systems known as Markov chains, first described by Andrey Markov in his 1906 paper.[7] Agner Krarup Erlang, a Danish engineer who worked for the Copenhagen Telephone Exchange, published the first paper on what would now be called queueing theory in 1909.[8][9][10] He modeled the number of telephone calls arriving at an exchange by a Poisson process and solved the M/D/1 queue in 1917 and M/D/k queueing model in 1920.[11] In Kendall’s notation: