Normal view MARC view ISBD view

Fundamentals of queueing theory / Donald Gross... [et al.]

Gross, Donald, 1934-.
Contributor(s): Gross, Donald.
Material type: materialTypeLabelBook; Format: print Series: Wiley series in probability and statistics.Publisher: Hoboken : John Wiley, 2008Edition: 4th ed.Description: XIII, 500 p. ; 25 cm.ISBN: 978-0-471-79127-0.Subject(s): Colas de espera, Teoría de | Resistencia de materiales
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Home library Call number Status Loan Date due Barcode Item holds Course reserves
Manuales (7 días) 02. BIBLIOTECA CAMPUS PUERTO REAL
519.872/GRO/fun (Browse shelf)   Shelving location | Bibliomaps® BIBLIOG. RECOM. 3743683302

PROPIEDADES MAGNÉTICAS Y ÓPTICAS DE LA MATERIA GRADO EN QUÍMICA Asignatura actualizada 2017-2018

MODELOS DE LA INVESTIGACIÓN OPERATIVA GRADO EN MATEMÁTICAS Asignatura actualizada 2017-2018

Manuales (7 días) 02. BIBLIOTECA CAMPUS PUERTO REAL
519.872/GRO/fun (Browse shelf)   Shelving location | Bibliomaps® BIBLIOG. RECOM. 3743683296
Total holds: 0

Enhanced descriptions from Syndetics:

Praise for the Third Edition

"This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."
-- IIE Transactions on Operations Engineering

Thoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory , Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.

This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:

Retrial queues

Approximations for queueing networks

Numerical inversion of transforms

Determining the appropriate number of servers to balance quality and cost of service

Each chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.

With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory , Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

Índices

Incluye referencias bibliográficas

Este manual está totalmente revisado y ampliado a través de los avances y nuevas investigaciones de los últimos años en el campo de la Teoría de Cola. La presente cuarta edición continúa por presentar las estadísticas básicas principales que son necesarias para el análisis de probabilidades de la cola natural.

This updated and expanded edition of Fundamentals of Queueing Theory presents the analytic modeling of queues in a very accessible style using up-to-date examples. Though the detailed coverage of the fundamentals of analytic modeling remains virtually the same, scores of new material have been added to reflect the most recent approaches to the topic. Additionally, in the treatment of the advanced material, the authors have commingled mathematical details with numerical results and intuitive arguments.

Índice: Dedication. Preface. 1. Introduction. 1.1 Description of the Queueing Problem. 1.2 Characteristics of Queueing Processes. 1.3 Notation. 1.4 Measuring System Performance. 1.5 Some General Results. 1.6 Simple Data Bookkeeping for Queues. 1.7 Poisson Process and the Exponential Distribution. 1.8 Markovian Property of the Exponential Distribution. 1.9 Stochastic Processes and Markov Chains. Problems. 2. Simple Markovian Queueing Models. 2.1 Birth Death Processes. 2.2 Single-Server Queues (M/M/1). 2.3 Multi-Server Queues (M/M/c). 2.4 Choosing the Number of Servers. 2.5 Queues with Truncation (M/M/c/K). 2.6 Erla... Etc.

Table of contents provided by Syndetics

  • Dedication (p. v)
  • Preface (p. xi)
  • Acknowledgments (p. xiii)
  • 1 Introduction (p. 1)
  • 1.1 Description of the Queueing Problem (p. 2)
  • 1.2 Characteristics of Queueing Processes (p. 3)
  • 1.3 Notation (p. 7)
  • 1.4 Measuring System Performance (p. 8)
  • 1.5 Some General Results (p. 9)
  • 1.6 Simple Data Bookkeeping for Queues (p. 12)
  • 1.7 Poisson Process and the Exponential Distribution (p. 16)
  • 1.8 Markovian Property of the Exponential Distribution (p. 20)
  • 1.9 Stochastic Processes and Markov Chains (p. 24)
  • 1.10 Introduction to the QtsPlus Software (p. 40)
  • Problems (p. 41)
  • 2 Simple Markovian Queueing Models (p. 49)
  • 2.1 Birth-Death Processes (p. 49)
  • 2.2 Single-Server Queues (M/M/1) (p. 53)
  • 2.3 Multiserver Queues (M/M/c) (p. 66)
  • 2.4 Choosing the Number of Servers (p. 73)
  • 2.5 Queues with Truncation (M/M/c/K) (p. 76)
  • 2.6 Erlang's Loss Formula (M/M/c/c) (p. 81)
  • 2.7 Queues with Unlimited Service (M/M/[infinity]) (p. 84)
  • 2.8 Finite-Source Queues (p. 85)
  • 2.9 State-Dependent Service (p. 91)
  • 2.10 Queues with Impatience (p. 95)
  • 2.11 Transient Behavior (p. 97)
  • 2.12 Busy-Period Analysis (p. 102)
  • Problems (p. 103)
  • 3 Advanced Markovian Queueing Models (p. 117)
  • 3.1 Bulk Input (M[superscript X]/M/1) (p. 117)
  • 3.2 Bulk Service (M/M[superscript Y]/1) (p. 123)
  • 3.3 Erlangian Models (p. 128)
  • 3.4 Priority Queue Disciplines (p. 141)
  • 3.5 Retrial Queues (p. 157)
  • Problems (p. 171)
  • 4 Networks, Series, and Cyclic Queues (p. 179)
  • 4.1 Series Queues (p. 181)
  • 4.2 Open Jackson Networks (p. 187)
  • 4.3 Closed Jackson Networks (p. 195)
  • 4.4 Cyclic Queues (p. 209)
  • 4.5 Extensions of Jackson Networks (p. 210)
  • 4.6 Non-Jackson Networks (p. 212)
  • Problems (p. 214)
  • 5 General Arrival or Service Patterns (p. 219)
  • 5.1 General Service, Single Server (M/G/1) (p. 219)
  • 5.2 General Service, Multiserver (M/G/c/[infinity], M/G/[infinity]) (p. 254)
  • 5.3 General Input (G/M/1, G/M/c) (p. 259)
  • Problems (p. 270)
  • 6 General Models and Theoretical Topics (p. 277)
  • 6.1 G/E[subscript k]/1, G[superscript k]/M/1, and G/PH[subscript k]/1 (p. 277)
  • 6.2 General Input, General Service (G/G/1) (p. 284)
  • 6.3 Poisson Input, Constant Service, Multiserver (M/D/c) (p. 294)
  • 6.4 Semi-Markov and Markov Renewal Processes in Queueing (p. 296)
  • 6.5 Other Queue Disciplines (p. 301)
  • 6.6 Design and Control of Queues (p. 306)
  • 6.7 Statistical Inference in Queueing (p. 317)
  • Problems (p. 325)
  • 7 Bounds and Approximations (p. 329)
  • 7.1 Bounds (p. 330)
  • 7.2 Approximations (p. 343)
  • 7.3 Network Approximations (p. 356)
  • Problems (p. 367)
  • 8 Numerical Techniques and Simulation (p. 369)
  • 8.1 Numerical Techniques (p. 369)
  • 8.2 Numerical Inversion of Transforms (p. 385)
  • 8.3 Discrete-Event Stochastic Simulation (p. 398)
  • Problems (p. 421)
  • References (p. 427)
  • Appendix A Symbols and Abbreviations (p. 439)
  • Appendix B Tables (p. 447)
  • Appendix C Transforms and Generating Functions (p. 455)
  • C.1 Laplace Transforms (p. 455)
  • C.2 Generating Functions (p. 462)
  • Appendix D Differential and Difference Equations (p. 467)
  • D.1 Ordinary Differential Equations (p. 467)
  • D.2 Difference Equations (p. 483)
  • Appendix E QtsPlus Software (p. 489)
  • E.1 Instructions for Downloading (p. 493)
  • Index (p. 495)

Author notes provided by Syndetics

Donald Gross, PhD, is Distinguished Research Professor of Operations Research and Engineering at George Mason University and Professor Emeritus of Operations Research at The George Washington University. With over forty years of experience in academia and consulting, Dr. Gross has published extensively in the area of queueing applications to repairable item inventory control, air traffic control, and Internet congestion
John F. Shortle, PhD, is Associate Professor in the Department of Systems Engineering and Operations Research at George Mason University. He has authored or coauthored over thirty published articles on the application of simulation and queueing theory in telecommunications and aviation
James M. Thompson is an Enterprise Architect at the Federal Home Loan Mortgage Corporation. His current areas of research interest include computer system performance modeling, system capacity studies and benchmarking, information architecture, and computational finance

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha