Question 2 [10pts]: We have shown that TCPs AIMD algorithm (additive increase, multiplicative decrease) guarantees fairness. Assume we modify AIMD algorithm to AICD (additive increase, constant decrease) algorithm as follows: the additive increase is the same as AIMD algorithm, however, if there is a packet loss, TCP decreases the window size by a constant amount. Verify whether AICD is fair or not and justify your answer. (Hint 1: You may want to illustrate your answer using a figure similar to the following figure. Hint 2: You may want to consider two cases: a) connection 1 and connection 2 decrease the same constant amount when faced packet loss and b) connection 1 and connection 2 decrease different amount facing packet loss).

Question 2 [10pts]: We have shown that TCP's AIMD algorithm (additive increase, multiplicative decrease) guarantees faimess. Assume we modify AIMD algorithm to AICD (additive increase, constant decrease) algorithm as follows: the additive increase is the same as AIMD algorithm, however, if there is a packet loss, TCP decreases the window size by a constant amount. Verify whether AICD is fair or not and justify your answer. (Hint 1: You may want to illustrate your answer using a figure similar to the following figure. Hint 2: You may want to consider two cases: a) connection 1 and connection 2 decrease the same constant amount when faced packet loss and b) connection 1 and connection 2 decrease different amount facing packet loss). equal bandwidth share Connection 2 throughput o Connection 1 throughput R