Queueing Theory for Telecommunications
Author | : Attahiru Sule Alfa |
Publisher | : Springer Science & Business Media |
Total Pages | : 248 |
Release | : 2010-07-28 |
ISBN-10 | : 9781441973146 |
ISBN-13 | : 1441973141 |
Rating | : 4/5 (141 Downloads) |
Download or read book Queueing Theory for Telecommunications written by Attahiru Sule Alfa and published by Springer Science & Business Media. This book was released on 2010-07-28 with total page 248 pages. Available in PDF, EPUB and Kindle. Book excerpt: Queueing theory applications can be discovered in many walks of life including; transportation, manufacturing, telecommunications, computer systems and more. However, the most prevalent applications of queueing theory are in the telecommunications field. Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System focuses on discrete time modeling and illustrates that most queueing systems encountered in real life can be set up as a Markov chain. This feature is very unique because the models are set in such a way that matrix-analytic methods are used to analyze them. Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System is the most relevant book available on queueing models designed for applications to telecommunications. This book presents clear concise theories behind how to model and analyze key single node queues in discrete time using special tools that were presented in the second chapter. The text also delves into the types of single node queues that are very frequently encountered in telecommunication systems modeling, and provides simple methods for analyzing them. Where appropriate, alternative analysis methods are also presented. This book is for advanced-level students and researchers concentrating on engineering, computer science and mathematics as a secondary text or reference book. Professionals who work in the related industries of telecommunications, industrial engineering and communications engineering will find this book useful as well.