Scribd
Upload
510 views11 pages

Chapter 081

Queuing models Single server Queues Effects of congestion congestion control Traffic management, congestion control in packet switching networks. Analysis of system (network) load and performance characteristics 2 2 response time throughput performance tradeoffs are often not intuitive. Queuing theory, although mathematically complex, often makes analysis very straightforward.

Uploaded by

api-78343547
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
510 views11 pages

Chapter 081

Queuing models Single server Queues Effects of congestion congestion control Traffic management, congestion control in packet switching networks. Analysis of system (network) load and performance characteristics 2 2 response time throughput performance tradeoffs are often not intuitive. Queuing theory, although mathematically complex, often makes analysis very straightforward.

Uploaded by

api-78343547
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 11

Unit 2 contents

CONGESTION AND TRAFFIC MANAGEMENT  Queuing analysis  Queuing models  Single server Queues  Effects of congestion  Congestion control  Traffic management,  Congestion control in packet switching networks  Frame relay congestion control
Unit 2- High-Speed n/w- queing modelChapter 8 Overview of Queuing Analysis 1

Overview of Queuing Analysis

Projected vs. Actual Response Time

Unit 2- High-Speed n/w- queing modelChapter 8 Overview of Queuing Analysis

IntroductionIntroduction- Motivation
 

How to analyze changes in network workloads? (i.e., a helpful tool to use) Analysis of system (network) load and performance characteristics
response time throughput

 

Performance tradeoffs are often not intuitive Queuing theory, although mathematically complex, often makes analysis very straightforward
Unit 2- High-Speed n/w- queing modelChapter 8 Overview of Queuing Analysis 4

SingleSingle-Server Queuing System

Items Arriving (message, packet, cell)

Queuing System (Delay Box)


Items Lost

Items Departing

Unit 2- High-Speed n/w- queing modelChapter 8 Overview of Queuing Analysis

SingleSingle-Server Queuing System

Items Arriving (message, packet, cell)

Queuing System (Delay Box)

Items Departing

Unit 2- High-Speed n/w- queing modelChapter 8 Overview of Queuing Analysis

Parameters for Single-Server SingleQueuing System

Unit 2- High-Speed n/w- queing modelChapter 8 Overview of Queuing Analysis

Comments, assuming queue has infinite capacity:  At V = 1, server is working 100% of the time (saturated), so items are queued (delayed) until they can be served. Departures remain constant (for same L).  Traffic intensity, u = LP/R.  Note that Ts = L/R, so:


Pmax = 1 / Ts = 1 / (L/R) is the theoretical maximum arrival rate, and that LPmax/R = u = 1 at the theoretical maximum arrival rate
Unit 2- High-Speed n/w- queing modelChapter 8 Overview of Queuing Analysis 8

The Fundamental Task of Queuing Analysis

Determine: Items waiting, w Waiting time, Tw Items queued, r Residence time, Tr Unit 2- High-Speed n/w- queing modelChapter 8 Overview of Queuing Analysis

Given: Arrival rate, P Service time, Ts Number of servers, N

Queuing Process - Example


Depth of the Queue

General Expression: TRn+1 = TSn+1 + MAX[0, Dn An+1]

Unit 2- High-Speed n/w- queing modelChapter 8 Overview of Queuing Analysis

10

General Characteristics of Network Queuing Models




Item population
generally assumed to be infinite therefore, arrival rate is persistent

Queue size
infinite, therefore no loss finite, more practical, but often immaterial

Dispatching discipline FIFO, typical LIFO Relative/Preferential, based on QoS


11

Unit 2- High-Speed n/w- queing modelChapter 8 Overview of Queuing Analysis

You might also like