INSTITUTE - AIT

DEPARTMENT - CSE
Bachelor of Engineering (Computer Science & Engineering)
Subject Name – Computer Networks and Code – CST 309

Congestion Control DISCOVER . LEARN . EMPOWER

 • Space for visual (size 24)

Network Layer
Design Issues 1. Congestion Prevention
Policies
2. Congestion Control in
Course Outcome Datagram Subnets
CO Title Level 3. Load Shedding
Number 4. Jitter Control
CO1 Routing Algorithms Understand
5. Data Flow Control
Algorithms
CO1 Congestion Control Understand

CO2 Inter-Networking Understand

CO3 Elements of Transport Layer Protocol Understand

CO3 Transport Layer in Internet Understand

2
 Congestion
• Simple Definition – Analysis on Allowed number of packet vs Actual number of present packets
• Technical Definition – When too many packets are present in Network then it is called as congestion
• Congested Network – Is when traffic occurs very high then intermediate nodes start losing Packets
• Several Factors of Congestion
• QUEUE
• Insufficient Memory

• Nagle’s View
• TTL of a Packet gets expire when there is infinite memory resulting in longer queue

• Slow Processor
• Bookkeeping Tasks

• Low Bandwidths
• Frequent Mismatch between parts of system.

3
 Congestion Control vs Flow Control
• Congestion Control
• Is all about making subnet capable enough for carrying required traffic

• Flow Control
• Related to P2P traffic between Sender and Receiver
• Make sure that sender does not transmit data faster than capacity of Receiver to absorb it
• Sliding Window Protocol

• Example Congestion Control

• Two or more same type system are trying to send more than 100kb data using 100 kbps transmission media

• Example Flow Control

• Transmission of data from Super computer to Normal Computer on fiber optics media of 1gigabit/Sec speed

4
 Principles of Congestion Control
• General Principles of Congestion Control
• Monitor the System
• Passing of Information to places where action can be taken
• Adjust System operation to correct Problem

• Types of Correction
• Open Loop correction
• Closed Loop Correction – Works on Feedback
• Monitoring of System – Metric Used where rising number indicates increasing congestion
• %age of discarded Packets due to lack of Buffer space
• Average Queue Length
• Number of packets timed out
• Average Delay
• Information Passing
• Transferring congestion from the point it got detected to the point where something can be done
• System Adjustments

5
 Congestion Prevention Policies
• Congestion Prevention Policies –
• Work in open loop environment
• Stops Congestion at first place
• Hence uses some polices on different layer for congestion control

• Transport Layer Policies

• Retransmission Policy
• Out of order Policy
• Acknowledgement Policy – Piggybacking
• Flow Control policy
• Time Out Determination Policy

• Network Layer Policies

• Virtual Subnet vs Datagram inside the subnet
• Packet Queue
• One Queue – Input Line
• One Queue – Output Line
• Both
• Packet Discard Policy
• Packet Lifetime Management

6
 Congestion Prevention Policies
• Data Link Layer Policies
• Retransmission Policy
• Out of order caching policy
• Acknowledgement Policy
• Flow Control Policy

7
 Congestion Control in Virtual Circuit Subnet
• Admission Control Technique
Explanation : Idea is when congestion occurs then no more Virtual Circuits will be developed, until previous congestion gets resolved
• It means transport layer will be at hold situation

• Alternative Approach
Explanation : It allows creation of new Virtual Circuit
• But Virtual Circuit should be handled carefully at congested area

• Another Strategy
Explanation : Is to set up Virtual Circuit with some negotiations
• Shape and Volume of Traffic
• QOS
• Reserved Resources for New Virtual Circuits
• Disadvantage is wastage of resources

8
 Congestion Control in Datagram Subnet
• The Warning Bit
• Choke Packets
• Hop by Hop Choke Packets

9
 Congestion Control (Continue)
• Load Shedding
• Random Early Detection (RED)
• Jitter Control

10
 Quality of Service
• Requirement
• Techniques of achieving Load QOS
• Leaky Bucket Algorithm
• Token Bucket Algorithms

11
 Assessment Pattern (size:44)
• By solving Numerical
• Understanding Examples
• Learning Problem statement
• Finding optimal solutions

12
 APPLICATIONS
• Different Dynamic Routing Protocols Like
• RIP
• IGRP
• EIGRP
• OSPF
• BGP
• Static Routing Method
• Congestion Control
• Sliding Window Protocol
• Bottlenecking
• Network total Overhead
• Network Overhead calculations

13
 REFERENCES
• Following are the references for the topics

• Computer Network by Andrew S Tanenbaum

• NPTEL
• Available on Internet

14
 THANK YOU

For queries
Email: cn_cst309_2019@gmail.com