检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安交通大学电子与信息工程学院,西安710049
出 处:《西安交通大学学报》2003年第6期595-598,共4页Journal of Xi'an Jiaotong University
基 金:陕西省重大技术创新基金资助项目(cx-2001-6).
摘 要:为了有效地解决个别大流量数据流所造成的不合理带宽占用问题,提出了一种用于路由器的对带宽进行公平分配的流量标记缓冲管理(TMBM)算法.该算法由流量分类标记算法和缓冲管理算法组成,它将每一个数据包归属到数据流,根据每种数据流发送的累计数据包进行数据流分类,按照分类的结果和该类数据流对先进先出(FIFO)缓冲区的利用情况,由缓冲管理算法来确定对该数据流的带宽分配.在不同流量组合的情况下对该算法进行了仿真,结果表明:在各种情况下它都可以达到公平的带宽分配效果,性能比Drop Tail、RED和DRR等算法优异.Some flows have so much traffic that they affect other normal flows. In order to solve this problem, a novel fair bandwidth allocation algorithm called traffic mark & buffer management (TMBM ) is proposed, which works with a first-in first-out (FIFO) queue, using perflow information to impose fair bandwidth share on each flow. A key design issue on the classification and mark of IP packets is addressed to different flows so that the buffer management scheme can process it. Simulations are carried out to study the effectiveness of TMBM and compare it to Drop Tail, deficit round robin(DDR) and random early detection(RED). The results show that TMBM is simple but works very well, and it can also protect router from hacker's Dos attack.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117