Introduction to Queueing Systems with Telecommunication Applications
暫譯: 電信應用的排隊系統導論

Laszlo Lakatos

  • 出版商: Springer
  • 出版日期: 2015-01-28
  • 售價: $3,170
  • 貴賓價: 9.5$3,012
  • 語言: 英文
  • 頁數: 400
  • 裝訂: Paperback
  • ISBN: 1489973354
  • ISBN-13: 9781489973351
  • 相關分類: 通訊系統 Communication-systems
  • 海外代購書籍(需單獨結帳)

相關主題

商品描述

The book is composed of two main parts: mathematical background and queueing systems with applications. The mathematical background is a self containing introduction to the stochastic processes of the later studies queueing systems. It starts with a quick introduction to probability theory and stochastic processes and continues with chapters on Markov chains and regenerative processes. More recent advances of queueing systems are based on phase type distributions, Markov arrival processes and quasy birth death processes, which are introduced in the last chapter of the first part.

 The second part is devoted to queueing models and their applications. After the introduction of the basic Markovian (from M/M/1 to M/M/1//N) and non-Markovian (M/G/1, G/M/1) queueing systems, a chapter presents the analysis of queues with  phase type distributions, Markov arrival processes (from PH/M/1 to MAP/PH/1/K). The next chapter presents the classical queueing network results and the rest of this part is devoted to the application examples. There are queueing models for bandwidth charing with different traffic classes, slotted multiplexers, ATM switches, media access protocols like Aloha and IEEE 802.11b, priority systems and retrial systems.

 An appendix supplements the technical content with Laplace and z transformation rules, Bessel functions and a list of notations. The book contains examples and exercises throughout and could be used for graduate students in engineering, mathematics and sciences.

商品描述(中文翻譯)

這本書由兩個主要部分組成:數學背景和排隊系統及其應用。數學背景是一個自成體系的介紹,涵蓋了後續研究排隊系統所需的隨機過程。它首先快速介紹了概率論和隨機過程,接著是關於馬可夫鏈和再生過程的章節。排隊系統的最新進展基於相位型分佈、馬可夫到達過程和準出生死亡過程,這些內容在第一部分的最後一章中介紹。

第二部分專注於排隊模型及其應用。在介紹了基本的馬可夫排隊系統(從 M/M/1 到 M/M/1//N)和非馬可夫排隊系統(M/G/1, G/M/1)之後,有一章專門分析具有相位型分佈的排隊系統、馬可夫到達過程(從 PH/M/1 到 MAP/PH/1/K)。接下來的章節介紹了經典的排隊網絡結果,這部分的其餘內容則專注於應用範例。書中包含了針對不同流量類別的帶寬收費排隊模型、時隙多路復用器、ATM 交換機、媒體接入協議如 Aloha 和 IEEE 802.11b、優先系統和重試系統。

附錄補充了技術內容,包括拉普拉斯變換和 z 變換規則、貝塞爾函數以及符號列表。這本書包含了各種例子和練習,適合工程、數學和科學的研究生使用。