Description
Applied Discrete-Time Queues (2nd Ed., Softcover reprint of the original 2nd ed. 2016)
Author: Alfa Attahiru
Language: EnglishSubjects for Applied Discrete-Time Queues:
Keywords
matrix-analytic methods; queues with time-varying parameters; telecommunication applications; discrete-time queues; discrete-time Markov chains; phase type distributions; probability generating function; queue lengths; waiting time; busy period; optimization of queueing systems; single node queues; tandem node queues; network of queueing nodes; numerical solution of queues
Approximative price 105.49 €
In Print (Delivery period: 15 days).
Add to cart the book of Alfa AttahiruPublication date: 03-2019
383 p. · 15.5x23.5 cm · Paperback
Approximative price 105.49 €
In Print (Delivery period: 15 days).
Add to cart the print on demand of Alfa AttahiruPublication date: 12-2015
Support: Print on demand
Description
/li>Contents
/li>Comment
/li>
This bookintroduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems.
Itpresents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered.
Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are included.
Includes complete coverage of discrete-time queues from theory to application
Presents how most queueing models in discrete-time can be set up as discrete-time Markov chains
Introduces single node systems, tandem system and queueing networks
Includes examples and exercises throughout the book
Includes supplementary material: sn.pub/extras