Central Library

Normal view MARC view ISBD view

Performance Analysis of Closed Queueing Networks [electronic resource] / by Svenja Lagershausen.

By: Lagershausen, Svenja [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Economics and Mathematical Systems: 663Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013Description: XXIII, 169 p. 49 illus., 5 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642322143.Subject(s): Business | Production management | Operations research | Decision making | Statistics | Business and Management | Operations Management | Operation Research/Decision Theory | Statistics and Computing/Statistics ProgramsAdditional physical formats: Printed edition:: No titleDDC classification: 658.5 Online resources: Click here to access online
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.
In: Springer eBooksSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

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.

There are no comments for this item.

Log in to your account to post a comment.