一种基于TTL的主动队列管理算法  

An AQM Algorithm Based on TTL

作　　者：吕建斌[1] 廖晓峰[2] 

机构地区：[1]重庆大学图书馆,重庆400044 [2]重庆大学计算机学院,重庆400044

出　　处：《计算机工程与应用》2006年第7期122-125,155,共5页Computer Engineering and Applications

摘　　要：文章提出了一种新颖的主动队列管理算法TRED——基于TTL(TimetoLive)的ECN及BECN的综合。ECN和BECN在指示拥塞的过程中各有优缺点,二者的综合可望提高拥塞指示的效率。TTL是在网络上传输的分组必需的属性,且每一次转发都要经过检测,以决定该分组的处理方式——转发或丢弃。通过对TTL的判断来决定网络拥塞指示的方式——ECN或BECN。该机制可利用ECN及BECN的优势,同时不会对反向链路造成很大的压力。仿真结果显示算法在队列长度以及吞吐量方面都取得了不错的效果。This paper proposes a novel algorithm TRED,combination of ECN and BECN based on the value of the TTL （Time to Live）,the hops that a packet has been ever retransferred.Since both ECN and BECN have advantages and disadvantages,the combination would be hoped to enhance the effectiveness of the congestion indication.A default attribute of a data packet transmitted on a network,the TTL must be checked on each inner node （such as muter or switcher） to decide whether to drop or forward.Based on the value of the qTL,ECN or BECN will be selected to inform the congestion condition to the sender,which would react to the indication.The mechanism can exploit the advantages of both ECN and BECN,and would not worsen the reverse link heavily.The simulation results show measurable improvement in both queue length and throughput.

关 键 词：随机早期检测 显式拥塞控制 后向显式拥塞控制 TTL 主动队列管理 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]