With the rapid growth of rate-based services and wirelessapplications, improving Transmission Control Protocol(TCP)congestioncontrol has been becoming more important in the network researchfield. This paper first Brie...With the rapid growth of rate-based services and wirelessapplications, improving Transmission Control Protocol(TCP)congestioncontrol has been becoming more important in the network researchfield. This paper first Briefly introduces the Additive-IncreaseMultiplicative-Decrease(AIMD)(a,b)algorithm, and then presents an im-Proved TCP congestion control mechanism(D-AIMD)whose principles andsimulation results are discussed in detail. This mechanism can beeasily implemented with lower additional overheads and canefficiently improve network per- Formance.展开更多
A congestion control algorithm is proposed for resilient packet ring (RPR) in this paper. In this algorithm, nonlinear explicit rate feedback control is used to ensure fast convergence and smooth equilibrium behavior....A congestion control algorithm is proposed for resilient packet ring (RPR) in this paper. In this algorithm, nonlinear explicit rate feedback control is used to ensure fast convergence and smooth equilibrium behavior. The algorithm combines explicit rate control with a deficit round robin (DRR) scheduler, which not only ensures fairness, but also avoids the implementation difficulties of explicit rate control algorithms. The algorithm has good features of fairness, fast convergence, smooth equilibrium, low queue depth, and easy implementation. It is insensitive to the loss of congestion control packets and can adapt to a wide range of link rates and network scales. It has solved the unbalanced traffic problem of spatial reuse protocol (SRP). The algorithm can be implemented on the multi-access control layer of RPR nodes to ensure fair and efficient access of the best-effort traffic.展开更多
文摘With the rapid growth of rate-based services and wirelessapplications, improving Transmission Control Protocol(TCP)congestioncontrol has been becoming more important in the network researchfield. This paper first Briefly introduces the Additive-IncreaseMultiplicative-Decrease(AIMD)(a,b)algorithm, and then presents an im-Proved TCP congestion control mechanism(D-AIMD)whose principles andsimulation results are discussed in detail. This mechanism can beeasily implemented with lower additional overheads and canefficiently improve network per- Formance.
基金Supported by the National Natural Science Foundation of China(No.69896242)
文摘A congestion control algorithm is proposed for resilient packet ring (RPR) in this paper. In this algorithm, nonlinear explicit rate feedback control is used to ensure fast convergence and smooth equilibrium behavior. The algorithm combines explicit rate control with a deficit round robin (DRR) scheduler, which not only ensures fairness, but also avoids the implementation difficulties of explicit rate control algorithms. The algorithm has good features of fairness, fast convergence, smooth equilibrium, low queue depth, and easy implementation. It is insensitive to the loss of congestion control packets and can adapt to a wide range of link rates and network scales. It has solved the unbalanced traffic problem of spatial reuse protocol (SRP). The algorithm can be implemented on the multi-access control layer of RPR nodes to ensure fair and efficient access of the best-effort traffic.
