4. Random Early Detection (RED) is a buffer management mechanism that is intended to avoid congestion in a router by keeping average queue length small. The RED algorithm continuously compares a short- time average queue length with two thresholds: minh and maxth. When the average queue length is below minh, RED does not drop any packets. When the average queue length is between minh and maxh RED drops an arriving packet with a certain probability that is an increasing function of the average queue length. The random packet drop is used to notify the sending TCP to reduce its rate before the queue becomes full. When the average queue length exceeds maxth, RED drops each arriving packet (a) What impact does RED have on the tendency of TCP receivers to synchronize during congestion? (b) What is the effect of RED on network throughput? (c) Discuss the implementation complexity of the RED algorithm 4. Random Early Detection (RED) is a buffer management mechanism that is intended to avoid congestion in a router by keeping average queue length small. The RED algorithm continuously compares a short- time average queue length with two thresholds: minh and maxth. When the average queue length is below minh, RED does not drop any packets. When the average queue length is between minh and maxh RED drops an arriving packet with a certain probability that is an increasing function of the average queue length. The random packet drop is used to notify the sending TCP to reduce its rate before the queue becomes full. When the average queue length exceeds maxth, RED drops each arriving packet (a) What impact does RED have on the tendency of TCP receivers to synchronize during congestion? (b) What is the effect of RED on network throughput? (c) Discuss the implementation complexity of the RED algorithm