检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京邮电大学电子科学与工程学院,江苏南京210003
出 处:《计算机技术与发展》2012年第6期119-122,共4页Computer Technology and Development
基 金:江苏省普通高校研究生科研创新基金(CXLX11_0400)
摘 要:随着Internet的迅速发展,致使IP业务的快速增长和多样化,用户数量急剧增加,网络流量呈爆炸式增长,网络拥塞问题变得越来越严重,因此服务质量(QoS)成为了当今世界研究热点之一。为了能达到相对的QoS的性能指标,拥塞控制发挥着相当重要的作用,而主动式队列管理(Active Queue Management,AQM)机制又是实现拥塞控制的重要手段之一,AQM成为了IP网络拥塞控制研究领域中备受关注和深入研究的热点问题。文中在增强CHOKe算法的公平性上,提出一种新的基于时延抖动的AQM算法-CZ-CHOKe。路由器通过时延抖动和队列的平均队长检测网络拥塞,同时采用动态采样击中和自适应丢包技术。仿真结果表明,该算法能有效地保护响应流,提高非响应流的击中概率,提高其算法的公平性。With the rapid development of Internet,resulted in the IP services growth rapidly and diversification. At the same time as the number of users increase dramatically, network traffic exploding, network congestion problems become more serious, so the quality of service ( QoS ) has become one of the world's research focuses. In order to achieve the relative performance of QoS, congestion control plays an important role,while the active queue management ( Active Queue Management,AQM) mechanism is one of important means to achieve congestion control, AQM has become an attention and in-depth study of the hot issues in the field of IP network congestion control. Based on the fairness of the CHOKe, proposed a new delay jitter algorithm. The routers detect network congestion through the delay jitter and the average queue length,uses dynamic sampling hit and adaptive packet loss technology. The simulation experimental results show that the algorithm can protect the response stream effectively and improve the hit probability of non-response flow ,improve the fairness of the algorithm.
关 键 词:网络拥塞 时延抖动 主动队列管理 CZ-CHOKe
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15