Scribd
Upload
40 views29 pages

Congestion Control & Routers

Congestion occurs when network load exceeds capacity. Congestion control prevents and removes congestion through open-loop and closed-loop mechanisms. Routers use forwarding to transmit packets on output lines and routing algorithms to decide packet paths. Common routing algorithms include distance vector, link state, hierarchical, broadcast, multicast, and anycast routing. Distance vector routing uses routing tables that are periodically updated between neighbors, while link state routing avoids count to infinity problems by sharing full topology information.

Uploaded by

Rajamaheshwar Mahesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
40 views29 pages

Congestion Control & Routers

Congestion occurs when network load exceeds capacity. Congestion control prevents and removes congestion through open-loop and closed-loop mechanisms. Routers use forwarding to transmit packets on output lines and routing algorithms to decide packet paths. Common routing algorithms include distance vector, link state, hierarchical, broadcast, multicast, and anycast routing. Distance vector routing uses routing tables that are periodically updated between neighbors, while link state routing avoids count to infinity problems by sharing full topology information.

Uploaded by

Rajamaheshwar Mahesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 29

Congestion Control

&
Routers
Submitted By :- Mohd. Zunaid Submitted To :- Anjali Saini
:- GU-2017-1057 :- Assistant professor
:- Anmol Jha :- GNA University
:- GU-2017-1057
:- B.Tech CSE 4th Sem
Data Traffic
Before going towards Congestion, let us know
Data Traffic

There are some factors describing Data traffic. They are -


Traffic descriptors
Three traffic profiles
CONGESTION

 Congestion in a network may occur if the load on the


network—the number of packets sent to the network—is
greater than the capacity of the network—the number of
packets a network can handle. Congestion control refers
to the mechanisms and techniques to control the
congestion and keep the load below the capacity.
DATA

Processing
device
Principles of Congestion Control

Congestion:
 informally: “too many sources sending too much data too fast for
network to handle”
 manifestations:
 lost packets (buffer overflow at routers)
 long delays (queuing in router buffers)

 a highly important problem!


CONGESTION CONTROL

Congestion control refers to techniques and mechanisms


that can either prevent congestion, before it happens, or
remove congestion, after it has happened. In general, we
can divide congestion control mechanisms into two broad
categories: open-loop congestion control (prevention) and
closed-loop congestion control (removal).
Congestion control categories
Backpressure method for alleviating
congestion
Choke packet
Goals of congestion control

 Throughput:
 Maximize goodput
 the total number of bits end-end
 Fairness:
 Give different sessions “equal” share.
 Max-min fairness
 Maximize the minimum rate session.
 Single link:
 Capacity R
 sessions m
 Each sessions: R/m
Leaky bucket
Leaky bucket implementation

A leaky bucket algorithm shapes bursty traffic into fixed-rate traffic by averaging the data rate. It may drop the
packets if the bucket is full.
Token bucket
Routers
A router has two processes inside it.

1) Forwarding

2) Routing algorithm
Part of the network layer responsible for
deciding which output line an incoming packet
should be transmitted on.

Routing If the network uses datagrams, this decision


must be made a new path for every arriving data
algorithm packet.

If the network uses virtual circuits, routing


decisions are made only when a new virtual
circuit is being set up.
1) correctness

2) simplicity
Properties of
routing 3) robustness
algorithms
4) stability

5)fairness and efficiency


Classification of
Routing Algorithms
Non Adaptive routing algorithm is
also known as a static routing
Non Adaptive algorithm.
routing
algorithm routing paths are computed in
advance, offline, and downloaded to
the routers when the network is
booted. It does not respond to the
failure
An adaptive routing algorithm is
also known as dynamic routing
Adaptive algorithm.
Routing
algorithm These are the algorithms which
change their routing decisions
whenever network topology or
traffic load changes.
Shortest path problem

Flooding

Distance vector
Routing

Link state Routing Routing


Hierarchical Routing Algorithms
Broadcast Routing

Multicast Routing

Anycast Routing
Distance vector Routing

 It’s a Adaptive or dynamic Algorithm.


 Each maintains a Table called “vector”.
 Table has done best known distance for each routers.
 Tables are updated by exchanging information with neigbhours(Routers).
 Each router knows the best distance to reach another router.
 Also known as Bellmand Ford Algorithm.
Distance vector routing
Count to Infinity Problem

 Count to infinity problem is one of the important issues in the distance vector routing;

 In distance vector routing, routing routes usually occur when an interface goes down.
Link State Routing

Why?
Distance vector routing algorithm often took too long to coverge
after the network topology is changed(due to count infinity problem)
Idea Behind Link State Routing

 This has five parts:-


 Discover its neighbours and learn their network addresses.
 Set the distance of its each neighbour.
 Construct a packet telling all it has learnt.
 Send this packet to and receive packets from all others routers.
 Compute the shortest path to every other routers.

You might also like