Performance Analysis of Closed Queueing Networks

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 i...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Lagershausen, Svenja (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
Σειρά:Lecture Notes in Economics and Mathematical Systems, 663
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02785nam a22004935i 4500
001 978-3-642-32214-3
003 DE-He213
005 20151204144638.0
007 cr nn 008mamaa
008 121026s2013 gw | s |||| 0|eng d
020 |a 9783642322143  |9 978-3-642-32214-3 
024 7 |a 10.1007/978-3-642-32214-3  |2 doi 
040 |d GrThAP 
050 4 |a TS155-TS194 
072 7 |a KJMV  |2 bicssc 
072 7 |a BUS087000  |2 bisacsh 
082 0 4 |a 658.5  |2 23 
100 1 |a Lagershausen, Svenja.  |e author. 
245 1 0 |a Performance Analysis of Closed Queueing Networks  |h [electronic resource] /  |c by Svenja Lagershausen. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2013. 
300 |a XXIII, 169 p. 49 illus., 5 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Economics and Mathematical Systems,  |x 0075-8442 ;  |v 663 
505 0 |a 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. 
520 |a 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. 
650 0 |a Business. 
650 0 |a Production management. 
650 0 |a Operations research. 
650 0 |a Decision making. 
650 0 |a Statistics. 
650 1 4 |a Business and Management. 
650 2 4 |a Operations Management. 
650 2 4 |a Operation Research/Decision Theory. 
650 2 4 |a Statistics and Computing/Statistics Programs. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642322136 
830 0 |a Lecture Notes in Economics and Mathematical Systems,  |x 0075-8442 ;  |v 663 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-32214-3  |z Full Text via HEAL-Link 
912 |a ZDB-2-SBE 
950 |a Business and Economics (Springer-11643)