• Contact

  • Newsletter

  • About us

  • Delivery options

  • Prospero Book Market Podcast

  • Performance Analysis of Closed Queueing Networks

    Performance Analysis of Closed Queueing Networks by Lagershausen, Svenja;

    Series: Lecture Notes in Economics and Mathematical Systems; 663;

      • GET 20% OFF

      • The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
      • Publisher's listprice EUR 53.49
      • The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.

        22 184 Ft (21 128 Ft + 5% VAT)
      • Discount 20% (cc. 4 437 Ft off)
      • Discounted price 17 748 Ft (16 902 Ft + 5% VAT)

    22 184 Ft

    db

    Availability

    printed on demand

    Why don't you give exact delivery time?

    Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.

    Product details:

    • Edition number 2013
    • Publisher Springer Berlin Heidelberg
    • Date of Publication 24 October 2012
    • Number of Volumes 1 pieces, Book

    • ISBN 9783642322136
    • Binding Paperback
    • No. of pages169 pages
    • Size 235x155 mm
    • Weight 3051 g
    • Language English
    • Illustrations XXIII, 169 p. 49 illus., 5 illus. in color. Illustrations, black & white
    • 0

    Categories

    Long description:

    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.

    More

    Table of Contents:

    1. Introduction.- 2. Closed Queueing Networks.- 3. Literature Review.- 4. Decomposition Approach.- 5. Markov-chain Approach.- 6. Distribution of the Time between Processing Starts.- 7. Conclusion.

    More