/
Congestion Control Evaluation in Dynamic Network Congestion Control Evaluation in Dynamic Network

Congestion Control Evaluation in Dynamic Network - PowerPoint Presentation

myesha-ticknor
myesha-ticknor . @myesha-ticknor
Follow
380 views
Uploaded On 2018-03-21

Congestion Control Evaluation in Dynamic Network - PPT Presentation

By Bhavani manthena What is Congestion Congestion is a situation in Communication Networks in which too many packets are present in a part of the subnet performance degrades Congestion in a network may occur when the load on the ID: 659301

control congestion policy source congestion control source policy ecomputernotes packet algorithm network bucket node http images data jpg loop leaky slow traffic

Share:

Link:

Embed:

Download Presentation from below link

Download Presentation The PPT/PDF document "Congestion Control Evaluation in Dynamic..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript

Slide1

Congestion Control Evaluation in Dynamic Network

By

Bhavani manthenaSlide2

What is Congestion?

Congestion

is a situation in Communication Networks in which too many packets are present in a part of the subnet, performance degrades

.

Congestion in a network may occur when the load on the

network

is greater than the capacity of the network Slide3

Causes of Congestion

The input traffic rate exceeds the capacity of the output

lines

The routers are too slow to perform bookkeeping

tasks

The routers' buffer is too

limitedif the processors are slow and also because of the slow links.

Source: http

://ecomputernotes.com/images/Data-from-three-input-lines-at-same-time.jpgSlide4

Types of Congestion ControL

P

revents the congestion from happening (Open Loop)

R

emoves congestion after it has taken place(Closed Loop).Slide5

Source : http

://ecomputernotes.com/images/Types-of-Congestion-Control-Methods.jpgSlide6

Open Loop

Retransmission Policy:

 

The sender retransmits a packet, if it feels that the packet it has sent is lost or corrupted.

Window Policy:

selective reject window method is used for congestion control.

Acknowledgement Policy: The acknowledgement policy imposed by the receiver may also affect congestion.Discarding

Policy:

A router may discard less sensitive packets when congestion is likely to happen.

Admission

Policy:

 

is a quality-of-service mechanism, can also prevent congestion in virtual circuit networksSlide7

Closed Loop

Backpressure:

 is a node-to-node congestion control that starts with a node and propagates, in the opposite direction of data flow.

Choke

Packet:

 

congested router or node sends a special type of packet called choke packet to the source to inform it about the congestion.Implicit Signaling: there is no communication between the congested node or nodes and the source.

Explicit

Signaling:

the congested nodes explicitly send a signal to the source or destination to inform about the congestion.Slide8

Algorithms for congestion Control

Leaky Bucket

Algorithm:

It is a traffic shaping mechanism that controls the amount and the rate of the traffic sent to the network.

Source: http://ecomputernotes.com/images/Leaky-Bucket.jpgSlide9

Token bucket

Algorithm:

The leaky bucket algorithm allows only an average (constant) rate of data flow. Its major problem is that it cannot deal with

bursty

data.

Source: http://ecomputernotes.com/images/Token-bucket-Algorithm.jpgSlide10

References

http://

ecomputernotes.com/computernetworkingnotes/communication-networks/what-is-congestion-control-describe-the-congestion-control-algorithm-commonly-used

https://

en.wikipedia.org/wiki/Network_congestionSlide11

Thank You