close
Performance Analysis of Closed Queueing Networks | Zookal Textbooks | Zookal Textbooks
  • Author(s) Svenja Lagershausen
  • Edition
  • Published10242012
  • PublisherSpringer Nature
  • ISBN9783642322143
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.

Performance Analysis of Closed Queueing Networks

Format
Get it instantly

Zookal account needed

$122.60 $129.00 Save $6.40
Add Zookal Study FREE trial and save a further 0% 

NEW PRICE

$122.60 + free shipping

(0% off - save $0.00)

Zookal Study Free trial

14-day FREE trial. $14.95/mo after. Cancel anytime.

*Discount will apply at checkout.

 See terms and conditions

You will get a further 0% off for this item ($122.60 after discount) because you have added Zookal Study Premium Free Trial to your bag.

For this discount to apply, you will need to complete checkout with the Zookal Study Premium Free Trial in your bag.

-
+
  • Author(s) Svenja Lagershausen
  • Edition
  • Published10242012
  • PublisherSpringer Nature
  • ISBN9783642322143
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.
translation missing: en.general.search.loading