Introduction to Queueing Systems with Telecommunication Applications (Hardcover)
暫譯: 電信應用的排隊系統導論 (精裝版)

Lakatos, Laszlo, Szeidl, Laszlo, Telek, Miklos

買這商品的人也買了...

商品描述

The book is the extended and revised version of the 1st edition and 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 studied 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, 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.
Reviews of first edition:
"The organization of the book is such that queueing models are viewed as special cases of more general stochastic processes, such as birth-death or semi-Markov processes. ... this book is a valuable addition to the queuing literature and provides instructors with a viable alternative for a textbook to be used in a one- or two-semester course on queueing models, at the upper undergraduate or beginning graduate levels."
Charles Knessl, SIAM Review, Vol. 56 (1), March, 2014

商品描述(中文翻譯)

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

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

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

第一版的評價:
「這本書的組織方式使得排隊模型被視為更一般隨機過程的特例,例如出生-死亡過程或半馬可夫過程。……這本書是排隊文獻中的一個寶貴補充,為教師提供了一個可行的替代教材,用於一個或兩個學期的排隊模型課程,適合高年級本科生或初級研究生使用。」
—— Charles Knessl, SIAM Review, Vol. 56 (1), 2014年3月

作者簡介

The authors of this book have been doing research and modeling in the theoretical and practical field of queuing theory for several decades, and teaching in both BSc, MSc and doctoral programs at the Faculty of Informatics, E]otv]os Lor´and University, Faculty of Engineering Sciences, Sz´echenyi Istv´an University and the Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics (all located in Hungary).

作者簡介(中文翻譯)

本書的作者在排隊理論的理論與實務領域進行研究和建模已有數十年,並在匈牙利厄爾特大學資訊學院、塞切尼伊斯特萬大學工程科學院以及布達佩斯科技經濟大學電機工程與資訊學院的學士、碩士及博士課程中教授相關課程。

最後瀏覽商品 (20)