Queueing Modelling Fundamentals: With Applications in Communication Networks / Edition 2

Hardcover (Print)
Buy New
Buy New from BN.com
Used and New from Other Sellers
Used and New from Other Sellers
from $100.42
Usually ships in 1-2 business days
(Save 28%)
Other sellers (Hardcover)
  • All (13) from $100.42   
  • New (10) from $100.42   
  • Used (3) from $100.42   


Queueing analysis is a vital tool used in the evaluation of system performance. Applications of queueing analysis cover a wide spectrum from bank automated teller machines to transportation and communications data networks.

Fully revised, this second edition of a popular book contains the significant addition of a new chapter on Flow & Congestion Control and a section on Network Calculus among other new sections that have been added to remaining chapters. An introductory text, Queueing Modelling Fundamentals focuses on queueing modelling techniques and applications of data networks, examining the underlying principles of isolated queueing systems. This book introduces the complex queueing theory in simple language/proofs to enable the reader to quickly pick up an overview to queueing theory without utilizing the diverse necessary mathematical tools. It incorporates a rich set of worked examples on its applications to communication networks.

Features include:

  • Fully revised and updated edition with significant new chapter on Flow and Congestion Control as-well-as a new section on Network Calculus
  • A comprehensive text which highlights both the theoretical models and their applications through a rich set of worked examples, examples of applications to data networks and performance curves
  • Provides an insight into the underlying queuing principles and features step-by-step derivation of queueing results
  • Written by experienced Professors in the field

Queueing Modelling Fundamentals is an introductory text for undergraduate or entry-level post-graduate students who are taking courses on network performance analysis as well as those practicing network administrators who want to understand the essentials of network operations. The detailed step-by-step derivation of queueing results also makes it an excellent text for professional engineers.

Read More Show Less

Editorial Reviews

From the Publisher
"The book is well written and nicely illustrated. I recommend it as an introduction for graduate students and telecommunications engineers." (Computing Reviews, November 24, 2008)

"This book would serve ideally as a text for an undergraduate course on network performance analysis." (Computing Reviews, July 2008)

Read More Show Less

Product Details

  • ISBN-13: 9780470519578
  • Publisher: Wiley
  • Publication date: 6/3/2008
  • Edition number: 2
  • Pages: 292
  • Product dimensions: 6.20 (w) x 9.20 (h) x 0.90 (d)

Table of Contents

List of Tables.

List of Illustrations.


1. Preliminaries.

1.1. Probability Theory.

1.2. z-Transforms - Generating Functions.

1.3. Laplace Transforms.

1.4. Matrix Operations.


2. Introduction to Queueing Systems.

2.1. Nomenclature of a Queueing System.

2.2. Random Variables and their Relationships.

2.3. Kendall Notation.

2.4 Little's Theorem.

2.5 Resource Utilization and Traffic Intensity.

2.6 Flow Conservation Law.

2.7 Poisson Process.

2.8 Properties of Poisson Process.


3. Discrete and Continuous Markov Processes.

3.1. Stochastic Processes.

3.2. Discrete-time Markov Chains.

3.3. Continuous-time Markov Chains.

3.4. Birth-Death Processes.


4. Single-Queue Markovian Systems.

4.1. Classical M/M/1 Queue.

4.2. PASTA - Poisson Arrivals See Time Averages.

4.3. M/M/1/S Queueing Systems.

4.5. Multi-server Systems - M/M/m

4.6. Erlang's Loss Queueing Systems - M/M/m/m Systems.

4.7. Engset's Loss Systems.

4.8. Considerations for Applications of Queueing Models


5. Semi-Markovian Queueing Systems.

5.1. The M/G/1 Queueing System.

5.2 The Residual Service Time Approach.

5.3 M/G/1 Non-preemptive Priority Queueing.

5.4 Priority Queueing Systems.

5.5 The G/M/1  Queueing System.

6. Open Queueing Networks.

6.1. Markovian Queries in Tandem.

6.2. Applications of Tandem Queues in Data Networks.

6.3. Jackson Queueing Networks.


7. Closed Queueing Networks.

7.1. Jackson Closed Queueing Networks.

7.2. Steady-state Probability Distribution.

7.3. Convolution Algorithm.

7.4. Performance Measures.

7.5. Mean Value Analysis.

7.6. Application of Closed Queueing Networks.


8. Markov-Modulated Arrival Process.

8.1. Markov-modulated Poisson Process (MMPP).

8.2. Markov-modulated Bernoulli Process.

8.3. Markov-modulated Fluid Flow.

8.4. Network Calculus.

9. Flow and Congestion Control.

9.1. Introduction.

9.2. Quality of Service.

9.3. Analysis of Sliding Window Flow Control Mechanisms.

9.4. Rate Based Adaptive Congestion Control.



Read More Show Less

Customer Reviews

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

5 Star


4 Star


3 Star


2 Star


1 Star


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


  • - 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)