Skip to content

Fundamentals of Queueing Theory

ISBN-10: 0471890677

ISBN-13: 9780471890676

Edition: 2nd 1985

Authors: Donald Gross, Carl M. Harris

List price: $115.00
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

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.
Customers also bought

Book details

List price: $115.00
Edition: 2nd
Copyright year: 1985
Publisher: John Wiley & Sons, Incorporated
Binding: Hardcover
Pages: 608
Size: 6.50" wide x 9.50" long x 1.25" tall
Weight: 2.134
Language: English

Donald Gross is a diplomat, lawyer and policy expert who serves as adjunct fellow of the Pacific Forum, Center for Strategic and International Studies. A former State Department official, he has developed diplomatic strategy toward East Asia and negotiated sensitive agreements with China, Japan, South Korea and North Korea. Earlier, he was counselor of the U.S. Arms Control and Disarmament Agency and director of legislative affairs at the National Security Council in the White House.

Dedication
Preface
Acknowledgments
Introduction
Description of the Queueing Problem
Characteristics of Queueing Processes
Notation
Measuring System Performance
Some General Results
Simple Data Bookkeeping for Queues
Poisson Process and the Exponential Distribution
Markovian Property of the Exponential Distribution
Stochastic Processes and Markov Chains
Introduction to the QtsPlus Software
Problems
Simple Markovian Queueing Models
Birth-Death Processes
Single-Server Queues (M/M/1)
Multiserver Queues (M/M/c)
Choosing the Number of Servers
Queues with Truncation (M/M/c/K)
Erlang's Loss Formula (M/M/c/c)
Queues with Unlimited Service (M/M/[infinity])
Finite-Source Queues
State-Dependent Service
Queues with Impatience
Transient Behavior
Busy-Period Analysis
Problems
Advanced Markovian Queueing Models
Bulk Input (M[superscript X]/M/1)
Bulk Service (M/M[superscript Y]/1)
Erlangian Models
Priority Queue Disciplines
Retrial Queues
Problems
Networks, Series, and Cyclic Queues
Series Queues
Open Jackson Networks
Closed Jackson Networks
Cyclic Queues
Extensions of Jackson Networks
Non-Jackson Networks
Problems
General Arrival or Service Patterns
General Service, Single Server (M/G/1)
General Service, Multiserver (M/G/c/[infinity], M/G/[infinity])
General Input (G/M/1, G/M/c)
Problems
General Models and Theoretical Topics
G/E[subscript k]/1, G[superscript k]/M/1, and G/PH[subscript k]/1
General Input, General Service (G/G/1)
Poisson Input, Constant Service, Multiserver (M/D/c)
Semi-Markov and Markov Renewal Processes in Queueing
Other Queue Disciplines
Design and Control of Queues
Statistical Inference in Queueing
Problems
Bounds and Approximations
Bounds
Approximations
Network Approximations
Problems
Numerical Techniques and Simulation
Numerical Techniques
Numerical Inversion of Transforms
Discrete-Event Stochastic Simulation
Problems
References
Symbols and Abbreviations
Tables
Transforms and Generating Functions
Laplace Transforms
Generating Functions
Differential and Difference Equations
Ordinary Differential Equations
Difference Equations
QtsPlus Software
Instructions for Downloading
Index