6. This question is about TCP fairness. [10 marks] We know that TCP's AIMD (additive increase,...

Transcribed Image Text:

6. This question is about TCP fairness. [10 marks] We know that TCP's AIMD (additive increase, multiplicative decrease) algorithm guarantees fairness among TCP sessions. 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: You may consider two connections scenario for cases: a) two connections decrease the same constant amount when facing packet loss and b) two connections decrease different amount when facing packet loss). 6. This question is about TCP fairness. [10 marks] We know that TCP's AIMD (additive increase, multiplicative decrease) algorithm guarantees fairness among TCP sessions. 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: You may consider two connections scenario for cases: a) two connections decrease the same constant amount when facing packet loss and b) two connections decrease different amount when facing packet loss).