首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于减弱信息量滞后影响的RED算法
引用本文:周广民.基于减弱信息量滞后影响的RED算法[J].天津理工大学学报,2006,22(3):9-11.
作者姓名:周广民
作者单位:暨南大学,信息技术研究所,广州,510075
摘    要:大量的测量表明,实际的网络业务普遍存在着在统计意义上的不可聚集性.在这种业务特性下,网络研究中的业务建模和性能分析都产生了许多新的问题.RED算法是一种十分重要的队列管理算法.目前国内研究RED算法的成果中,考虑到通信量滞后性的很少.本文主要研究了一种能减弱滞后性的负

关 键 词:网络仿真  随机早期检测算法  通信量
文章编号:1673-095X(2006)03-0009-03
收稿时间:2006-04-05
修稿时间:2006-04-05

The RED Algorithm that bases on do effect of decreasing information lag
ZHOU Guang-min.The RED Algorithm that bases on do effect of decreasing information lag[J].Journal of Tianjin University of Technology,2006,22(3):9-11.
Authors:ZHOU Guang-min
Institution:Research Institute of Information Technology, Jinan University, Guangzhou 510075, China
Abstract:The measure on Ethernet traffic,shows that the real traffic has long relativity. So I develop a RED Algorithm that can get rid of the bad affect of long relativity. The Algorithm that bases on the share memory sets a lot of monitor points. It knows the current situation that follows the long relativity with the iteration that is up to the old situation. I can set the size of queue and the maximum and the minimum,which can get rid of the bad affect of long relativity.
Keywords:network simulation  stochastic earlytest algorithm  flow of commuuicatlon
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号