Evaluation of fairness at routers in the situation of coexisting flows with different end-to-end congestion control mechanisms

摘要

In this paper, we evaluate fairness issue for RED, FRED, and CSFQ in the situation of coexisting flows with different end-to-end congestion control mechanisms. As the end-to-end congestion control, three types of AIMD congestion control mechanisms are assumed. They are a window-based congestion control mechanism modeling TCF and a window-based and a rate-based congestion control mechanism which are TCF-friendly and adjust its window or its transmission rate in a smoother fashion than TCF. We focus on how much the end-to-end congestion control mechanisms' difference in their responsiveness to congestion and their traffic pattern (i.e. bursty or evenly-spaced) influences the fairness of RED, FRED, and CSFQ. Our simulation results show that CSFQ achieves the highest level of fairness among the three in the Sit nation of coexisting flows with the different end-to-end congestion control mechanisms.