书发布：Introduction to Queueing Systems with Telecommunication Applications

rmatrix

1814

收藏 2014-01-09

Introduction to Queueing Systems with Telecommunication Applications-2012.pdf
大小:(3.92 MB)

只需: 100 个论坛币马上下载

Introduction to Queueing Systems with Telecommunication Applications [Hardcover]
Laszlo Lakatos (Author), Laszlo Szeidl (Author), Miklos Telek (Author)
Be the first to review this item

List Price:	$79.95
Price:	$63.96 & FREE Shipping.Details
You Save:	$15.99 (20%)

Book Description
Publication Date: December 14, 2012  | ISBN-10: 146145316X   | ISBN-13: 978-1461453161  | Edition: 2013
   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.

Editorial Reviews
Review             From the reviews:
“The authors of this new book … present the material in an elegant and concise way, resulting in a good basic text that forms a foundation for readers who want to learn more advanced topics. … Each chapter concludes with a few exercises. … The writing style is quite formal and will be easily absorbed by a person well acquainted with mathematical modeling … . the book will serve as a useful reference to quickly look up a theorem or proof.” (Piotr Cholda, Computing Reviews, August, 2013)
“The book is composed of two main parts, namely Part I – Introduction to probability theory and stochastic processes, and Part II – Queueing systems. It consists of eleven chapters and an appendix. … The book is highly recommended for students and researchers studying and working in the field of queueing theory and its applications.” (János Sztrik, zbMATH, Vol. 1269, 2013)
From the Back Cover
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.

Product Details