Queueing Networks A Fundamental Approach

Part 2 looks at monotonicity and comparison results such as for computational simplification by either of two approaches: stochastic monotonicity and ordering results based on the ordering of the proces generators, and comparison results and explicit error bounds based on an underlying Markov reward...

Full description

Bibliographic Details
Other Authors: Boucherie, Richard J. (Editor), van Dijk, Nico M. (Editor)
Format: eBook
Language:English
Published: New York, NY Springer US 2011, 2011
Edition:1st ed. 2011
Series:International Series in Operations Research & Management Science
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 04649nmm a2200433 u 4500
001 EB000362227
003 EBX01000000000000000215279
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9781441964724 
100 1 |a Boucherie, Richard J.  |e [editor] 
245 0 0 |a Queueing Networks  |h Elektronische Ressource  |b A Fundamental Approach  |c edited by Richard J. Boucherie, Nico M. van Dijk 
250 |a 1st ed. 2011 
260 |a New York, NY  |b Springer US  |c 2011, 2011 
300 |a XXIV, 800 p  |b online resource 
505 0 |a On Practical Product Form Characterizations -- Order Independent Queues -- Insensitivity in Stochastic Models -- Palm Calculus, Reallocatable GSMP and Insensitivity Structure -- Networks with Customers, Signals, and Product Form Solutions -- Discrete Time Networks with Product Form Steady States -- Decomposition and aggregation in queueing networks -- Stochastic comparison of queueing networks -- Error Bounds and Comparison Results: The Markov Reward Approach For Queueing Networks -- Stability of join-the-shortest-queue networks: analysis by fluid limits -- Methods in Diffusion Approximation for Multi-Server Systems: Sandwich, Uniform Attraction and State-Space Collapse -- Queueing networks with Gaussian inputs -- Mean values techniques -- Response time distributions in networks of queues -- Decomposition-Based Queueing Network Analysis with FiFiQueues -- Loss networks -- A Queueing Analysis of Data Networks -- Modeling a hospital queueing network 
653 |a Computer Communication Networks 
653 |a Operations Research, Management Science 
653 |a Operations research 
653 |a Management science 
653 |a Probability Theory 
653 |a Computer networks  
653 |a Computer Engineering and Networks 
653 |a Mathematical Modeling and Industrial Mathematics 
653 |a Computer engineering 
653 |a Operations Research and Decision Theory 
653 |a Probabilities 
653 |a Mathematical models 
700 1 |a van Dijk, Nico M.  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a International Series in Operations Research & Management Science 
028 5 0 |a 10.1007/978-1-4419-6472-4 
856 4 0 |u https://doi.org/10.1007/978-1-4419-6472-4?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 519.2 
520 |a Part 2 looks at monotonicity and comparison results such as for computational simplification by either of two approaches: stochastic monotonicity and ordering results based on the ordering of the proces generators, and comparison results and explicit error bounds based on an underlying Markov reward structure leading to ordering of expectations of performance measures. Part 3 presents diffusion and fluid results. It specifically looks at  the fluid regime and the diffusion regime. Both of these are illustrated through fluid limits for the analysis of system stability, diffusion approximations for multi-server systems, and a system fed by Gaussian traffic.  
520 |a Part 4 illustrates computational and approximate results through the classical MVA (mean value analysis) and QNA (queueing network analyzer) for computing mean and variance of performance measures such as queue lengths and sojourn times;numerical approximation of response time distributions; and approximate decomposition results for large open queueing networks. Part 5 enlightens selected applications as loss networks originating from circuit switched telecommunications applications, capacity sharing originating from packet switching in data networks, and a hospital application that is of growing present day interest. The book shows that the intertwined progress of theory and practice  will remain to be most intriguing and will continue to be the basis of further developments in queueing networks 
520 |a This handbook aims to highlight fundamental, methodological and computational aspects of networks of queues to provide insights and to unify results that can be applied in a more general manner.  The handbook is organized into five parts: Part 1 considers exact analytical results such as of product form type. Topics include characterization of product forms by physical balance concepts and simple traffic flow equations, classes of service and queue disciplines that allow a product form, a unified description of product forms for discrete time queueing networks, insights for insensitivity, and aggregation and decomposition results that allow subnetworks to be aggregated into single nodes to reduce computational burden.