Welcome to Central Library, SUST
Amazon cover image
Image from Amazon.com
Image from Google Jackets

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

By: Contributor(s): Material type: TextTextSeries: 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 resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783642322143
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 658.5 23
LOC classification:
  • TS155-TS194
Online resources:
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    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 on this title.

to post a comment.