CAJ | 학술논문

RED算法是一种非常有效地避免网络拥塞的主动队列管理算法。 ARED算法也是重要的主动队列管理算法之一,RED的改进算法,通过检测平均队列长度来判定网络拥塞程度,调节最大丢包概率来稳定队列长度,存在网络的滞后性和参数设置敏感问题。为了使该算法平均队列长度更加稳定并且减小丢包率,文中提出H-ARED算法,采用分段函数对ARED算法的丢包概率函数进行优化,在平均队列长度最大阈值maxth之后增加一个参数Hth ,当平均队列长度大于maxth时数据包不会被全部丢弃。该算法充分利用路由器缓冲区的大小,控制队列长度,使之能够更好地控制网络拥塞,降低网络数据分组丢包概率。通过NS2网络仿真工具进行仿真,结果表明：H-ARED算法改善了平均队列长度的稳定性,降低了数据丢包率,对于复杂的网络环境适应性较强。
RED산법시일충비상유효지피면망락옹새적주동대렬관리산법。 ARED산법야시중요적주동대렬관리산법지일,RED적개진산법,통과검측평균대렬장도래판정망락옹새정도,조절최대주포개솔래은정대렬장도,존재망락적체후성화삼수설치민감문제。위료사해산법평균대렬장도경가은정병차감소주포솔,문중제출H-ARED산법,채용분단함수대ARED산법적주포개솔함수진행우화,재평균대렬장도최대역치maxth지후증가일개삼수Hth ,당평균대렬장도대우maxth시수거포불회피전부주기。해산법충분이용로유기완충구적대소,공제대렬장도,사지능구경호지공제망락옹새,강저망락수거분조주포개솔。통과NS2망락방진공구진행방진,결과표명：H-ARED산법개선료평균대렬장도적은정성,강저료수거주포솔,대우복잡적망락배경괄응성교강。
RED is an active queue management algorithm that avoids network congestion effectively. ARED algorithm is also one of the important active queue management algorithms, an improved RED algorithm, which can determine the degree of network congestion through detecting the average queue length,and regulate the maximum drop probability to achieve the effect of a stable queue length. However,the network is lag and cannot adapt to the network busty traffic well. In order to make average queue length more stable and re-duce packet loss rate,H-ARED algorithm is proposed in this paper,which uses piecewise function to optimize the packet loss probability function of the ARED algorithm and adds a parameter Hth after the maximum threshold maxth of the average queue length. The data will be not all dropped when the average queue length is greater than the maximum threshold maxth . Within the range of the router buffer,it takes full advantage of the router buffer, so that it can better control network congestion, reducing network packet loss probability. Through simulation using NS2 network simulation tool,the results show that H-ARED algorithm improves the stability of the average queue length,reduces packet loss rate and has a stronger robustness in the complex network environment.