Elements Of Queueing Theory
Elements Of Queueing Theory
复制标题
DOI：
10.1007/978-3-662-11657-9
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
F. Baccelli;P. Brémaud
中科院分区：
文献类型：
--
作者：
F. Baccelli;P. Brémaud
排队论是应用概率论中一门令人着迷的学科，有两个相互矛盾的原因：它有时需要最复杂的随机过程工具，而且通常会得出简单而明确的答案。更重要的是，自 Erlang 于 1917 年在电话呼叫阻塞方面的开创性工作，到最近在宽带通信网络设计和计算机体系结构性能评估方面的应用，人们对它的兴趣一直在稳步增长。所有这些导致了数学严谨程度不同的大量文献、文章和书籍。关于数学方法，大多数明确的结果是在做出特定假设（马尔可夫，更新）时获得的。本书的目的绝不是系统地阐述排队论的公式及其应用，而是给出一个总体框架，在这个框架中可以最好地理解和最容易得出这些结果。阅读这本书需要具备哪些关于如此大量文献的知识？正如书名所示，我们相信即使没有排队论的先验知识也可以阅读本书，尽管所提出的框架的统一性对于已经研究过经典马尔可夫方法的读者来说当然更有意义。
Queueing theory is a fascinating subject in Applied Probability for two con tradictory reasons: it sometimes requires the most sophisticated tools of stochastic processes, and it often leads to simple and explicit answers. More over its interest has been steadily growing since the pioneering work of Erlang in 1917 on the blocking of telephone calls, to the more recent applications on the design of broadband communication networks and on the performance evaluation of computer architectures. All this led to a huge literature, articles and books, at various levels of mathematical rigor. Concerning the mathematical approach, most of the explicit results have been obtained when specific assumptions (Markov, re newal) are made. The aim of the present book is in no way to give a systematic account of the formulas of queueing theory and their applications, but rather to give a general framework in which these results are best understood and most easily derived. What knowledge of this vast literature is needed to read the book? As the title of the book suggests, we believe that it can be read without prior knowledge of queueing theory at all, although the unifying nature of the proposed framework will of course be more meaningful to readers who already studied the classical Markovian approach.