检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机科学》2002年第12期56-58,共3页Computer Science
摘 要:As an effective method for congestion control, Active Queue Management plays an important role in im-proving the Internet QoS. In this paper,we first analyze the properties of RED,then design an effective queue manage-ment algorithm based on gradient descent approach. With the application of this algorithm,routers in IP network ad-just its packet drop probability according to the queue length in the buffer. The main advantage of this algorithm isthat the queue length can keep stable at a low level in a varity of network environments. Simulations show that thisself-tuning queue management algorithm is efficient,stable and outperforms RED queue management algorithms sig-nificantly.As an effective method for congestion control, Active Queue Management plays an important role in improving the Internet QoS. In this paper,we first analyze the properties of RED,then design an effective queue management algorithm based on gradient descent approach. With the application of this algorithm,routers in IP network adjust its packet drop probability according to the queue length in the buffer. The main advantage of this algorithm is that the queue length can keep stable at a low level in a varity of network environments. Simulations show that this self-tuning queue management algorithm is efficient,stable and outperforms RED queue management algorithms significantly.
关 键 词:INTERNET 拥塞控制 自校正队列管理算法 路由器 计算机网络
分 类 号:TP393.4[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222