基于六元组的混合式QoS信息聚合算法  

A Hybrid Algorithm for QoS Information Aggregation based on Six-tuple Array

作　　者：熊轲[1,2] 裘正定[1] 张煜[1] 张宏科[2] 

机构地区：[1]北京交通大学信息科学研究所,北京100044 [2]北京交通大学下一代互联网互联设备国家工程实验室,北京100044

出　　处：《高技术通讯》2009年第7期686-692,共7页Chinese High Technology Letters

基　　金：973计划(2007CB307101);863计划(2007AA01Z202);教育部科技创新工程重大项目培育资金(706005);高等学校学科创新引智计划'111计划'(B08002)资助项目。

摘　　要：针对层次路由中的QoS信息表述问题,首先提出了一种均匀折线的几何聚合方法,采用均匀折线来表示两个边界路由器间多条路径的QoS支持区域。为进一步提高聚合性能,将均匀折线法与线段聚合法相结合,提出了一种基于六元组的混合式QoS信息几何聚合算法。该算法可根据聚合精确度适应性地从直线模型和均匀多折线模型中选择最佳的模型进行聚合,聚合后的信息仅用六元组数据便可表示。定义了聚合误差率,以此作为准则来精确衡量几何聚合算法性能的优劣。实验结果表明,文中所提混合式聚合算法的性能优于现有算法,可以实现更低的聚合误差率。In order to solve the problem of QoS information representation in hierarchical routing, this paper first proposes a geometric scheme called the regular polyline （RPL） aggregation algorithm which uses a RPL model to represent the QoS information of all paths between any two border reuters. To further improve the aggregation performance, the paper then proposes a novel six-tuple based hybrid algorithm by combining the proposed RPL algorithm with the existing line segment （IS） approach. In the hybrid algorithm, a better model between the RPL model and the LS one can be adopted automatically to do aggregation according to the aggregation accuracy, and only a six-tuple array is required to represent the aggregated result. Moreover, the aggregation error rate is defined to evaluate the performances of geometric aggregation schemes more accurately. The experimental results show that the proposed hybrid algorithm outperforms the existing ones in terms of lower aggregation error rate.

关 键 词：拓扑聚合 QoS信息表示 聚合误差率 层次路由 服务质量路由 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]