Question

(7 pts) Two TCP flows share the same bottleneck link with capacity R bps and they have the same RTT. Consider the following modification to the TCP congestion control algorithm: senders receive a binary synchronous feedback in discrete time steps of one RTT. If the aggregate consumption of the two flows is above the bottleneck bandwidth R, both senders receive a congestion notification signal (CN), otherwise they receive no CN. When no CN is received in a time step, each sender sets its window to 1.1 times its current value. On the other hand, for each congested time step, i.e., when both senders receive CN, each sender decreases its window to 1/2 times its current value. We can call this algorithm as Multiplicative Increase-Multiplicative Decrease (MIMD). Using the figure below, prove or disprove that MIMD achieves a fair allocation of bandwidth between the two flows, i.e., each flow getting R/2. Assume that the initial throughputs achieved by the two connections correspond to point \"A\" in the following figure.

          (7 pts) Two TCP flows share the same bottleneck link with capacity R bps and they have the same RTT. Consider the following modification to the TCP congestion control algorithm: senders receive a binary synchronous feedback in discrete time steps of one RTT. If the aggregate consumption of the two flows is above the bottleneck bandwidth R, both senders receive a congestion notification signal (CN), otherwise they receive no CN. When no CN is received in a time step, each sender sets its window to 1.1 times its current value. On the other hand, for each congested time step, i.e., when both senders receive CN, each sender decreases its window to 1/2 times its current value. We can call this algorithm as Multiplicative Increase-Multiplicative Decrease (MIMD).
Using the figure below, prove or disprove that MIMD achieves a fair allocation of bandwidth between the two flows, i.e., each flow getting R/2. Assume that the initial throughputs achieved by the two connections correspond to point \"A\" in the following figure.

(7 pts) Two TCP flows share the same bottleneck link with capacity R bps and they have the same RTT. Consider the following modification to the TCP congestion control algorithm: senders receive a binary synchronous feedback in discrete time steps of one RTT. If the aggregate consumption of the two flows is above the bottleneck bandwidth R, both senders receive a congestion notification signal (CN), otherwise they receive no CN. When no CN is received in a time step, each sender sets its window to 1.1 times its current value. On the other hand, for each congested time step, i.e., when both senders receive CN, each sender decreases its window to 1/2 times its current value. We can call this algorithm as Multiplicative Increase-Multiplicative Decrease (MIMD).
Using the figure below, prove or disprove that MIMD achieves a fair allocation of bandwidth between the two flows, i.e., each flow getting R/2. Assume that the initial throughputs achieved by the two connections correspond to point Äïn the following figure.

Added by Kristin C.

Question

Please give Ace some feedback