Modeling the Interactions of Congestion Control and Switch Scheduling
In this paper, the authors study the interactions of user-based congestion control algorithms and router-based switch scheduling algorithms. They show that switch scheduling algorithms that were designed without taking into account these interactions can exhibit a completely different behavior when interacting with feedback-based Internet traffic. Previous papers neglected or mitigated these interactions, and typically found that flow rates reach a fair equilibrium. On the contrary, they show that these interactions can lead to extreme unfairness with temporary flow starvation, as well as to large rate oscillations.