BN.com Gift Guide

Overview

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 ...
See more details below
Fundamentals of Queueing Theory

Available on NOOK devices and apps  
  • NOOK Devices
  • Samsung Galaxy Tab 4 NOOK 7.0
  • Samsung Galaxy Tab 4 NOOK 10.1
  • NOOK HD Tablet
  • NOOK HD+ Tablet
  • NOOK eReaders
  • NOOK Color
  • NOOK Tablet
  • Tablet/Phone
  • NOOK for Windows 8 Tablet
  • NOOK for iOS
  • NOOK for Android
  • NOOK Kids for iPad
  • PC/Mac
  • NOOK for Windows 8
  • NOOK for PC
  • NOOK for Mac
  • NOOK for Web

Want a NOOK? Explore Now

NOOK Book (eBook)
$90.99
BN.com price
(Save 42%)$159.00 List Price
Note: This NOOK Book can be purchased in bulk. Please email us for more information.

Overview

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 valuableresource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

About the Author:
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

About the Author:
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

About the Author:
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

"...updated and expanded, presenting the analytic modeling of queues using up-to-date examples...contains additional proofs, material, and discussions...with a fresh emphasis on the telecommunications boom that enlivens the text."

Read More Show Less

Editorial Reviews

Booknews
Presents the analytical modeling of queues in an accessible style, using modern examples. Treatment mingles mathematical details with numerical results and intuitive arguments, and pedagogical features include chapter problems using Excel and Quattro and boxed equations. This third edition contains additional proofs and new material on areas including reversibility, mean-value analysis, and rootfinding involved in G/M/c, as well as an emphasis on telecommunications. A spreadsheet program for Excel and Quattro is available on an ftp site. Contains more than enough material for a one-quarter or one-semester course for students with a knowledge of undergraduate differential and integral calculus, elements of differential equations and matrix manipulations, and calculus-based probability and statistics. Annotation c. by Book News, Inc., Portland, Or.
From the Publisher
"Despite its title, the book is rather advanced, so it is appropriate for practitioners, those in academia, and upper-class students. However, any reader will benefit from the concise introductions to the problems, the detailed descriptions supported with step-by-step formulas, the solutions provided by the manual, and the QtsPlus software." (Computing Reviews, 1 December 2011)

"This is an accessible and attractive book with good writing all the way through. It has the advantage of years of classroom testing. The exercises are extensive and creative." (MAA Reviews, March 19, 2009)

Read More Show Less

Product Details

  • ISBN-13: 9781118211649
  • Publisher: Wiley
  • Publication date: 9/23/2011
  • Series: Wiley Series in Probability and Statistics , #627
  • Sold by: Barnes & Noble
  • Format: eBook
  • Edition number: 4
  • Pages: 528
  • File size: 26 MB
  • Note: This product may take a few minutes to download.

Meet the Author

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 WashingtonUniversity. 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.

The Late CARL M. HARRIS, PhD, was BDM International Professor and the founding chair of the Systems Engineering and Operations Research Department at George Mason University. For his research contributions to the areas of applied probability and statistics, queueing theory, simulation, and public systems analysis, Dr. Harris was awarded the George E. Kimball Medal by the Institute for Operations Research and the Management Sciences (INFORMS) in 1999.

Read More Show Less

Table of Contents

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 Erlang's Loss Formula (M/M/c/c).

2.7 Queues with Unlimited Service (M/M/1).

2.8 Finite Source Queues.

2.9 State-Dependent Service.

2.10 Queues with Impatience.

2.11 Transient Behavior.

2.12 Busy-Period Analysis.

Problems.

3. Advanced Markovian Queueing Models.

3.1 Bulk Input (M[X]/M/1).

3.2 Bulk Service (M/M[Y ]/1).

3.3 Erlangian Models.

3.4 Priority Queue Disciplines.

3.5 Retrial Queues.

4. Networks, Series, and Cyclic Queues.

4.1 Series Queues.

4.2 Open Jackson Networks.

4.3 Closed Jackson Networks.

4.4 Cyclic Queues.

4.5 Extensions of Jackson Networks.

4.6 Non-Jackson Networks.

5. General Arrival or Service Patterns.

5.1 General Service, Single Server (M/G/1).

5.2 General Service, Multi-Server (M/G/c/ú, M/G/1).

5.3 General Input (G/M/1, G/M/c).

6. More General Models and Theoretical Topics.

6.1 G/Ek/1, G[k]/M/1, and G/PHk/1.

6.2 General Input, General Service (G/G/1) .

6.3 Multichannel Queues with Poisson Input and Constant Service (M/D/c).

6.4 Semi-Markov and Markov Renewal Processes in Queueing.

6.5 Other Queue Disciplines.

6.6 Design and Control of Queues.

6.7 Statistical Inference in Queueing.

7. Bounds and Approximations.

7.1 Bounds.

7.2 Approximations.

7.3 Network Approximations.

Problems.

8. Numerical Techniques and Simulation.

8.1 Numerical Techniques.

8.2 Numerical Inversion of Transforms.

8.3 Discrete-Event Stochastic Simulation.

Problems.

Bibliography.

Appendix 1. Symbols and Abbreviations.

Appendix 2. Tables.

Appendix 3. Transforms and Generating Functions.

A3.1 Laplace Transforms.

A3.2 Generating Functions.

Appendix 4. Differential and Difference Equations.

A4.1 Ordinary Differential Equations.

A4.2 Difference Equations.

Appendix 5. QTSPlus Software.

A5.1 Instructions for Downloading.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)