Introduction to Queueing Systems with Telecommunication Applications
By: by Laszlo Lakatos, Laszlo Szeidl, Miklos Telek
Contributors: Szeidl, Laszlo; Telek, Miklós; SpringerLink (Online service)
Publisher: Springer US; Imprint: Springer
Published: 2013
Place of publication: Boston, MA
Language: eng
Format: [electronic resource] /
Number of pages: 385
ISBN-13: 9781461453178
Subjects: Probability Theory and Stochastic Processes; Telecommunication; Distribution (Probability theory); Networks Communications Engineering; Computer system performance; Mathematics; Management Science Operations Research; System Performance and Evaluation
Description: <p>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.</p><p> 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.</p><p> 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.</p>
Table of contents: title: Preface; title: Introduction to probability theory; title: Introduction to stochastic processes; title: Markov chains; title: Renewal and regenerative processes; title: Markov chains with special structures; title: Introduction to queueing systems; title: Markovian queueing systems; title: Non-Markovian queueing systems; title: Queueing systems with structured Markov chains; title: Queueing networks; title: Applied queueing systems; title: Functions and transforms; title: Exercises; title: References.-.