Advertisement

Introduction to Queueing Systems with Telecommunication Applications

  • László Lakatos
  • László Szeidl
  • Miklós Telek
Textbook

Table of contents

  1. Front Matter
    Pages i-xvii
  2. Introduction to Probability Theory and Stochastic Processes

    1. Front Matter
      Pages 1-1
    2. László Lakatos, László Szeidl, Miklós Telek
      Pages 3-62
    3. László Lakatos, László Szeidl, Miklós Telek
      Pages 63-91
    4. László Lakatos, László Szeidl, Miklós Telek
      Pages 93-177
    5. László Lakatos, László Szeidl, Miklós Telek
      Pages 179-226
    6. László Lakatos, László Szeidl, Miklós Telek
      Pages 227-281
  3. Queueing Systems

    1. Front Matter
      Pages 283-283
    2. László Lakatos, László Szeidl, Miklós Telek
      Pages 285-297
    3. László Lakatos, László Szeidl, Miklós Telek
      Pages 299-334
    4. László Lakatos, László Szeidl, Miklós Telek
      Pages 335-386
    5. László Lakatos, László Szeidl, Miklós Telek
      Pages 387-419
    6. László Lakatos, László Szeidl, Miklós Telek
      Pages 421-444
    7. László Lakatos, László Szeidl, Miklós Telek
      Pages 445-545
  4. Back Matter
    Pages 547-559

About this book

Introduction

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

Keywords

Markov chains queueing networks queueing systems stochastic models traffic engineering probability stochastic processes Markov modulated models performance analysis telecommunication systems traffic engineering

Authors and affiliations

  • László Lakatos
    • 1
  • László Szeidl
    • 2
  • Miklós Telek
    • 3
  1. 1.Eotvos Lorant UniversityBudapestHungary
  2. 2.Obuda UniversityBudapestHungary
  3. 3.Technical University of BudapestBudapestHungary

Bibliographic information