1. 1 Computer Communication & Networks Lecture 25 Transport Layer: Congestion Control http://web.uettaxila.edu.pk/CMS/coeCCNbsSp09/index.asp Waleed Ejaz waleed.ejaz@uettaxila.edu.pk

2. 2 Transport Layer

3. 3 Transport Layer Topics to Cover UDP, TCP, STCP Congestion Control

4. 4 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.

5. 5 Question: Is it possible to avoid/reduce congestion by increasing buffer size? Congestion in packet switching networks

6. 6 NO Buffer is larger, then waiting time is longer. It will cause time out and retransmit packets, thus more congestion. If buffer size is infinite, then packet can delay forever. Congestion control is a very hard problem Congestion in packet switching networks

7. 7 Packet delay and throughput as functions of load

8. 8 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)  closed-loop congestion control (removal)

9. 9 Example To better understand the concept of congestion control, let us give an example: Congestion Control in TCP.

10. 10 Slow Start, Exponential Increase In the slow-start algorithm, the size of the congestion window increases exponentially until it reaches a threshold.

11. 11 Congestion Avoidance: Additive Increase In the congestion avoidance algorithm, the size of the congestion window increases additively until congestion is detected.

12. 12 Congestion Example

13. 13 Quiz 5 (1) Use the Bellman Ford algorithm to find the shortest paths from all other nodes to node 3.

14. 14 Quiz 5 (2) Apply Dijkstra’s algorithm to the following network to generate a shortest-path-tree for node E, and build a routing table for node E.