Code: 01661778

Performance Analysis of Closed Queueing Networks

Name: Performance Analysis of Closed Queueing Networks
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 01661778
Price: 61.46 EUR
Availability: InStock

by Svenja Lagershausen

Language: English
Binding: Paperback
Number of pages: 169
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 2012
More about this

61.46 €

Low in stock at our supplier
Shipping in 13 - 16 days

Potřebujete více kusů?Máte-li zájem o více kusů, prověřte, prosím, nejprve dostupnost titulu na naši zákaznické podpoře.

Add to wishlist

Mutually Assured Domination
16.85 € -18 %
Buy
Gurkil will nach Spanien
13.11 € -6 %
Buy

Give this book as a present today

Order book and choose Gift Order.
We will send you book gift voucher at once. You can give it out to anyone.
Book will be send to donee, nothing more to care about.

Book gift voucher sample Read more

More about Performance Analysis of Closed Queueing Networks

Book details
Synopsis
Trending among others

You get 154 loyalty points

Book synopsis

This book deals with the performance analysis of closed queueing networks with general processing times and finite buffer spaces. It offers a detailed introduction to the problem and a comprehensive literature review. Two approaches to the performance of closed queueing networks are presented. One is an approximate decomposition approach, while the second is the first exact approach for finite-capacity networks with general processing times. In this Markov chain approach, queueing networks are analyzed by modeling the entire system as one Markov chain. As this approach is exact, it is well-suited both as a reference quantity for approximate procedures and as extension to other queueing networks. Moreover, for the first time, the exact distribution of the time between processing starts is provided.This book deals with the performance analysis of closed queueing networks with general processing times and finite buffer spaces. It offers a detailed introduction to the problem and a comprehensive literature review. Two approaches to the performance of closed queueing networks are presented. One is an approximate decomposition approach, while the second is the first exact approach for finite-capacity networks with general processing times. In this Markov chain approach, queueing networks are analyzed by modeling the entire system as one Markov chain. As this approach is exact, it is well-suited both as a reference quantity for approximate procedures and as extension to other queueing networks. Moreover, for the first time, the exact distribution of the time between processing starts is provided.