检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:范光宇[1] 陈惠芳[1] 赵问道[1] 应必娣[1]
机构地区:[1]浙江大学信息与电子工程系,浙江杭州310027
出 处:《电路与系统学报》2006年第6期65-69,共5页Journal of Circuits and Systems
摘 要:在区分服务模型中,具有不同微流数量、分组长度和目标速率的流聚集在资源共享时往往无法获得公平带宽。本文在自适应RIO算法基础上提出了一种区分RIO算法(DifferentiatedRIO,DRIO),DRIO对具有不同目标速率的流区别对待,使得无论在何种情况下都可以很好地保证各流聚集在共享带宽资源上的公平性,而且算法实现简单。仿真结果表明,DRIO对提高流聚集之间的公平性有很明显的效果。In DiffServ model, the different aggregated traffics with different number of microflows, packet size and target rate usually can not be assigned with the fairness of resource sharing. In this paper, we design an Differentiated RIO (DRIO) based on Adaptive RIO. The aggregated traffics with different target rate are dealt with differently in DRIO. So that DRIO can assure the fairness of bandwidth sharing among aggregated traffics very well. Otherwise, the algorithm can be put in practice simply. The simulation results indicate that the DRIO algorithm has best effect on improving the fairness of bandwidth sharing between aggregated traffics.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.137.162.63