CS 2060

HIGH SPEED NETWORKS

UNIT 2
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.
UEUING NALYSIS
Introduction
Queues Behavior example
Why Queuing Analysis Purpose
Queuing Models - 2 types
Single server queue
Multi server Queue

2
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
NTRODUCTION
Computer Networking we have to predict the effect
of some changes in a system. (load increases or N/w
modified)

Performance throughput response time


Queue Behavior example
Web server serves each request at 1/ms
1. at uniform rate
2. at variable rate queue formed.


3
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
EXAMPLE

4
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
WHY QUEUING ANALYSIS..??
4 approaches

Fact analysis actual data

Simple projection by scaling up from past to
future.

Queuing theory analytical model

Simulation model
5
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ODELS
2 models;
Single server queue
Multi-server queue

Each includes
Introduction
Queue parameters
Analysis
Key features
Model characteristics





6
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
INGLE SERVER UEUE

7
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ARAMETERS
Items arrive at the facility at some average rate (items
arriving per second)

At any given time, a certain number of items will be
waiting in the queue (zero or more)

The average number waiting is w, and the mean time
that an item must wait is Tw.

The server handles incoming items with an average
service time Ts.



8
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ARAMETERS
Utilization, , is the fraction of time that the server is
busy, measured over some interval of time.

Finally, two parameters apply to the system as a
whole.

The average number of items resident in the system,
including the item being served (if any) and the items
waiting (if any), is r;

and the average time that an item spends in the
system, waiting and being served, is Tr; mean
residence time

9
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
NALYSIS
As the arrival rate increases utilization increases
and with it, congestion queue becomes longer
increasing waiting time.

At = 1, the server becomes saturated, working 100%
of the time.

Thus, the theoretical maximum input rate that can be
handled by the system is:

max = 1/Ts

10
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
EY EATURES
Consider the realization of queuing process;
11
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ONTD
For an item i, spends on the system

For item 2 , residence time

+ (

)
For item 3 , residence time

+(

)

12
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ONTD
Therefore item n departs before the arrival of
n+1

General expression;

+
=
+

+

=
+
+(

+
)
=
+
+ [,

+
]



13
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
CHARACTERISTICS
Assumptions

1. Item population infinite
2. Queue size infinite
3. Dispatching discipline FIFO or FCFS
14
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ULTI SERVER QUEUE

15
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ULTI SERVER QUEUE

16
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
NALYSIS
For multi server queue for N servers:
max = N/Ts

Key characteristics same as SSQ

MSQ-2 has high impact on performance
17
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ASIC
UEUING
ELATIONSHIPS
18
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ITTLE S FORMULA
Average number of customers in a system =
average arrival rate * average time spent in the
system

r = Tr *
w = Tw *
Tr = Tw + Ts

19
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ITTLE S FORMULA

20
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ENEFITS OF ITTLE S FORMULA
Given the inputs
Arrival rate
Service time
Number of servers

we can calculate the outputs are
Items waiting
Waiting time
Items queued
Residence time
21
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ASSUMPTIONS
For greater analysis requires the knowledge of
Probability distribution of inter-arrival times & service
time.

Assumptions
inter-arrival times Exponential distribution
arrivals Poisson distribution

mean and standard deviation of arrival rate &
service time
22
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ENDALL S OTATION
Summarizing the assumptions queuing model
X/Y/N
X dist. Of inter-arrival time
Y dist. Of service time
N number of servers

In general,
G general dist of IAT or ST
GI general dist of IAT with IAT is independent
M negative exponential dist
D deterministic arrivals
M/M/1 Single server with Poisson arrivals and Exponential
service times
23
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ORMULAE
Follows M/G/1 model.
Scaling factor(A) o/p variables calculated
2 cases;
Case-1 : S.D = mean S.T exponential
(M/M/1)

Case-2 : S.D = 0, constant service time
(M/D/1)
Assumptions:
Poisson arrival rate
dispatching discipline not service times
S.D dispatching is FIFO
No items discarded from queue

24
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II

25
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II




Based on

/
;
Four regions namely;
zero rare case of CST.
ratio < 1 near to EST, using M/M/1 model values
calculated
ratio = 1 EST -- random service
ratio > 1 using M/G/ 1
26
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ULTI ERVER
In this case M/M/N,
Exponential service times are identical to all servers.
Erlang-C function is used

Assumptions:
Poisson arrival rate
Exponential service time
all servers equally loaded
all servers mean service time
FIFO
no items discarded.
27
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II

28
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II

30
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
Congestion exceeds the packet handling
capacity

Congestion control maintains the packets
within the level.
UEUING HEORY
Data network (Nodes) is a network of queues.

If arrival rate > transmission rate
then queue size grows without bound
packet delay goes to infinity

31
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
FFECTS OF ONGESTION
Queuing situation
32
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
AT SATURATION POINT,
Discard any incoming packet if no buffer
available

Saturated node exercises flow control over
neighbors
May cause congestion to propagate
throughout the network

33
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
NTERACTION OF UEUE IN W

34
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
DEAL ERFORMANCE

35
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II

36
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ONGESTION CONTROL
4 main mechanisms to control congestion;
Back Pressure
Choke packet
Implicit congestion signaling
Explicit congestion signaling
37
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ONGESTION CONTROL
Backpressure:
Applied on selected channels only.
Connection oriented networks (X.25 based)
Request from destination to source to reduce rate


Choke packet:
a control Packet sends to source from the
congested node.
Eg:- ICMP Source Quench Packet internet
Crude technique not used.

38
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ONGESTION CONTROL
Implicit congestion signaling
Source detects congestion from transmission delays
and discarded packets reduces flow.
End systems responsible for Signaling.
Used in both connection & connection-less N/ws

Explicit congestion signaling
Purpose fully used the n/w resources +
congestion control.
In 2 ways backward and forward
3 Categories binary, credit-based, rate-
based.
39
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ONGESTION CONTROL
40
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
RAFFIC MANAGEMENT
Fairness
Last-in-first-discarded may not be fair
Overcomes by maintaining separate queues for
each logical connection at a node.

Quality of Service
Voice, video: delay sensitive, loss insensitive
File transfer, mail: delay insensitive, loss sensitive
Interactive computing: delay and loss sensitive

Reservations
Purpose Avoid congestion + good service.eg:-
Policing
41
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
ONGESTION CONTROL IN S
Choke packet adds additional traffic during
congestion.
Routing algorithms
End to end probe packet.
Adds congestion information in packets. (i.e) similar to
FECN & BECN
42
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
FRAME RELAY CONGESTION CONTROL
OBJECTIVES:
Minimize frame discard
Minimize monopolization of network resources
Simple to implement with little overhead
Minimal additional network traffic
Resources distributed fairly
Limit spread of congestion
Operate effectively regardless of flow
Have minimum impact other systems in N/w.

43
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
YPES
In frame relay
Network (Collection of nodes) monitors
congestion
End ponits provides congestion control

Types-:
Discard strategy
Congestion avoidance
Congestion recovery
44
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
RAFFIC ATE ANAGEMENT
Committed Information Rate (CIR)
Rate that network agrees to support

Aggregate of CIRs < N/w capacity
For node and user-network interface (access rate)


45
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
RAFFIC ATE ANAGEMENT
Committed Burst Size (

)
Maximum data that N/w agrees to transfer over an
interval T

Excess Burst Size(

)
Maximum data in excess of

that network will
attempt to transfer

CIR,

, T are related as
T =

/CIR
46
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
CONGESTION AVOIDANCE WITH EXPLICIT SIGNALING
2 strategies
Congestion always occurred slowly, almost
always at egress nodes
forward explicit congestion avoidance

Congestion grew very quickly in internal nodes
and required quick action
backward explicit congestion avoidance


47
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II
2 BITS FOR EXPLICIT SIGNALING
Forward Explicit Congestion Notification
For traffic in same direction as received frame
This frame has encountered congestion

Backward Explicit Congestion Notification
For traffic in opposite direction of received frame
Frames transmitted may encounter congestion

48
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II

49
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II

50
JJCET\ECE\Final year\VII Semester\CS2060 High Speed Networks\Unit-II