A Course on Queueing Models

摘要: QUEUES: BASIC CONCEPTS Introduction Queues: Features and Characteristics Graphical Methods Modelling Scope Organization MARKOVIAN QUEUES A Simple Model: Steady-State Behaviour Birth-Death Models: Erlangian Transient Waiting Time Little's Formula Busy Periods Idle 3 Networks of Queues - I Optimization Discussion REGENERATIVE NON-MARKOVIAN Markovian Input Models Service-Time Bulk Functional Relations: Heuristic Approach Discrete-Time COMPUTATIONAL METHODS Root Finding The State Reduction Method Behaviour: Numerical Approaches STATISTICAL INFERENCE AND SIMULATION Statistical Inference Solving Queueing Problems by Simulation Practical Application II Non-Markovian Solution Combinatorial Relations GENERAL Time: An Analytic Bounds for the Average Heavy Traffic Approximation Diffusion Probabilistic Duality Matrix-Geometric Block Elimination Fourier Series Inverting Transforms DISCRETE-TIME TRANSIENT SOLUTIONS Methods: Lattice Path Recurrence Algebraic MISCELLANEOUS TOPICS Priority with Infinite Servers Design Control APPENDICES INDEX Each chapter includes exercises references.