Applied Discrete-Time Queues
Autor Attahiru Alfaen Limba Engleză Hardback – 26 dec 2015
It presents 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.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 645.79 lei 6-8 săpt. | |
Springer – 30 mar 2019 | 645.79 lei 6-8 săpt. | |
Hardback (1) | 652.17 lei 6-8 săpt. | |
Springer – 26 dec 2015 | 652.17 lei 6-8 săpt. |
Preț: 652.17 lei
Preț vechi: 767.26 lei
-15% Nou
Puncte Express: 978
Preț estimativ în valută:
124.80€ • 129.56$ • 104.07£
124.80€ • 129.56$ • 104.07£
Carte tipărită la comandă
Livrare economică 22 martie-05 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781493934188
ISBN-10: 149393418X
Pagini: 383
Ilustrații: XXI, 383 p. 26 illus.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.74 kg
Ediția:2nd ed. 2016
Editura: Springer
Colecția Springer
Locul publicării:New York, NY, United States
ISBN-10: 149393418X
Pagini: 383
Ilustrații: XXI, 383 p. 26 illus.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.74 kg
Ediția:2nd ed. 2016
Editura: Springer
Colecția Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Introduction.- Arrival and Service Processes.- Discrete-Time Markov Chains.- Numerical Computations with Discrete-Time Markov Chains.- Basic Single Node Queueing Models with Infinite Buffers.- Basic Single Node Queueing Models with Finite Buffers.- Multiserver Single Node Queueing Models.- Single Node Queuing Models with Server Vacations.- Single Node Queueing Models with Priorities.- Special Single Node Queueing Models.- Queues with Time Varying Parameters.- Tandem Queues and Queueing Networks.- Optimization and Control of Discrete-Time Queues.
Caracteristici
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