Introduction to Queueing Systems with Telecommunication Applications
Our rough guess is there are 96,250 words in this book.
At a pace averaging 250 words per minute, this book will take 6 hours and 25 minutes to read. With a half hour per day, this will take 13 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Author
Contributions
- Szeidl, Laszlo - Contributor
- Telek, Miklós - Contributor
- SpringerLink (Online service) - Contributor
Publication
2013 - Springer US, Boston, MA, United States
Language
English
Word Count
96,250 words, Guess
Page Count
385 pages
Physical Format
[electronic resource] /
Identifiers
- Open LibraryOL27047043M
- ISBN-139781461453178
- OCLC Control Numberintroductiontoqu00laka
- Library of Congress Control Number2012951675
Classifications
- DDC519.2
- LCCQA273.A1-274.9
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>
Subjects
Topics
Other Editions
- Introduction to Queueing Systems with Telecommunication Applications
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!