Buch, Englisch, 602 Seiten, Format (B × H): 178 mm x 254 mm, Gewicht: 1170 g
Reihe: Springer Series in Operations Research and Financial Engineering
An Introduction to Stochastic-Process Limits and Their Application to Queues
Buch, Englisch, 602 Seiten, Format (B × H): 178 mm x 254 mm, Gewicht: 1170 g
Reihe: Springer Series in Operations Research and Financial Engineering
ISBN: 978-1-4419-2969-3
Verlag: Springer
This book emphasizes the continuous-mapping approach to obtain new stochastic-process limits from previously established stochastic-process limits. The continuous-mapping approach is applied to obtain heavy-traffic-stochastic-process limits for queueing models, including the case in which there are unmatched jumps in the limit process. These heavy-traffic limits generate simple approximations for complicated queueing processes and they reveal the impact of variability upon queueing performance. The book will be of interest to researchers and graduate students working in the areas of probability, stochastic processes, and operations research. In addition this book won the 2003 Lanchester Prize for the best contribution to Operation Research and Management in English, see: http://www.informs.org/Prizes/LanchesterPrize.html
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Wirtschaftswissenschaften Betriebswirtschaft Wirtschaftsmathematik und -statistik
- Mathematik | Informatik Mathematik Stochastik Mathematische Statistik
- Mathematik | Informatik Mathematik Stochastik Wahrscheinlichkeitsrechnung
- Wirtschaftswissenschaften Volkswirtschaftslehre Volkswirtschaftslehre Allgemein Ökonometrie
Weitere Infos & Material
Experiencing Statistical Regularity.- Random Walks in Applications.- The Framework for Stochastic-Process Limits.- A Panorama of Stochastic-Process Limits.- Heavy-Traffic Limits for Fluid Queues.- Unmatched Jumps in the Limit Process.- More Stochastic-Process Limits.- Fluid Queues with On-Off Sources.- Single-Server Queues.- Multiserver Queues.- More on the Mathematical Framework.- The Space D.- Useful Functions.- Queueing Networks.- The Spaces E and F.