Congestion Control QA
Congestion Control QA
Q1. What is the primary problem addressed in congestion control and resource allocation?
A: The main problem is how to effectively and fairly allocate resources (such as bandwidth and
Q3. What happens when too many packets contend for the same link?
- Resource allocation aims to proactively avoid congestion by limiting how much data sources send.
A: 1. FIFO (First In, First Out): Packets are processed in arrival order. Excess packets are dropped
(tail drop).
2. Priority Queuing: Packets are categorized into priority levels and transmitted accordingly.
3. Fair Queuing: Maintains separate queues for flows and serves them in a round-robin manner.
A: TCP Congestion Control determines the available capacity in the network, ensuring that sources
send data at safe rates to avoid congestion. It is critical for maintaining stability and preventing
congestion collapse.
2. Slow Start:
- Quickly ramps up the congestion window from a cold start using exponential growth.
3. Fast Retransmit and Fast Recovery:
- Reduces the waiting time for packet retransmission and eliminates the need for slow start after
packet loss.
A: Congestion avoidance mechanisms predict and mitigate congestion before it occurs. Techniques
include:
1. DEC Bit: Routers notify end hosts of impending congestion via a congestion bit.
2. Random Early Detection (RED): Routers drop packets probabilistically when queue lengths