Queueing Modelling Fundamentals: With Applications in Communication Networks

ISBN-13: 9780470519578 / Angielski / Twarda / 2008 / 320 str.

Chee-Hock Ng

Opis

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.

Recenzje

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

Spis treści

List of Tables.

List of Illustrations.

Preface.

1. Preliminaries.

1.1. Probability Theory.

1.2. z–Transforms – Generating Functions.

1.3. Laplace Transforms.

1.4. Matrix Operations.

Problems.

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.

Problems.

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.

Problems.

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

Problems.

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.

Problems.

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.

Problems.

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.

References.

Index.

O autorze

Chee–Hock Ng, Nanyang Technological University, Singapore
Chee–Hock Ng is currently an Associate Professor in the School of Electrical & Electronic Engineering, Nanyang Technological University (NTU). He is also serving as an external examiner and assessor to the SIM University for its computer science programmes. The author of the first edition of "Queueing Modelling Fundamentals", Chee–Hock Ng runs short courses to the industry and other statuary bodies in the area of networking.? A Chartered Engineer and a Senior Member of IEEE, he has also published many papers in international journals and conferences in the areas of networking.

Boon–Hee Soong, Nanyang Technological University, Singapore
Soong Boon–Hee is currently an Associate Professor with the School of Electrical and Electronic Engineering, Nanyang Technological University. Previously a Visiting Research Fellow at the Department of Electrical and Electronic Engineering, Imperial College, London, under the Commonwealth Fellowship Award, he has served as a consultant for many companies including Mobile IP in a recent technical field trial of Next–Generation Wireless LAN initiated by IDA (InfoComm Development Authority, Singapore). Boon–Hee Soong was awarded the Tan Chin Tuan Fellowship in 2004. Author of over 100 international journals, book chapters and conference papers, he is currently a Senior member of IEEE and a member of ACM.

Blurb

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 and 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 amongst other new material. 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 queueing 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 as well as operations. The detailed step–by–step derivation of queueing results also makes it an excellent text for professional engineers.