| 分布式服务质量路由预计算算法 | |
| 崔勇 ; 吴建平 ; CUI Yong ; WU Jian-ping | |
| 2010-06-09 ; 2010-06-09 | |
| 关键词 | 多约束 分布式计算 服务质量 路由 预计算 multiple constraints distributed computing QoS(quality of service) routing precomputation TP393.4 |
| 其他题名 | Distributed Precomputation for QoS Routing |
| 中文摘要 | 服务质量路由作为下一代IP互联网提供服务质量(QoS)控制的一种重要方案,如何提高其可扩展性和路由性能是有待解决的难题.本文提出了基于聚类的分布式预计算算法,以具有多种QoS参数的路由表预计算为目标,引入了支持QoS参数的扩展距离向量,通过网络中各个节点的分布式协同计算,大大降低了单个路由器的计算复杂度.文章分析了优势路径及其选取策略,给出了路由计算中优势路径聚集的聚类方法,实现了QoS路由表的高效聚集压缩.实验结果进一步验证了该算法具有计算量小和QoS路由性能高的优点,在QoS度量维数和网络规模方面均具有良好的可扩展性,并对域间算法研究提供了重要依据.; Finding a multi-constrained path is an important potential solution to provide quality of service(QoS) for next-generation networks,where the scalability and routing performance are still open problems.We propose an approach,clusteringbased distributed precomputation algorithm,to the problem.Aiming to precompute the routing table with multiple QoS parameters,we introduce the extended distance vector with multiple QoS parameters,based on which the distributed computation greatly decreases the computational complexity on a single node.After dominating path selection is analyzed to omitting numerous dominated paths,a clustering technique is further presented for dominating path aggregation in routing computation.These two techniques in turn achieve efficient aggregation of the QoS routing table.Simulation results confirm that the proposal not only has low computational complexity,but also achieves high routing performance with good scalability on both QoS parameters and the network scale.The proposal also provides an important basis to further study the interdomain QoS routing.; 国家重点基础研究发展规划(973计划)项目(No.2003CB314801); 国家自然科学基金(No.60403035) |
| 语种 | 中文 ; 中文 |
| 内容类型 | 期刊论文 |
| 源URL | [http://hdl.handle.net/123456789/55831]  |
| 专题 | 清华大学 |
| 推荐引用方式 GB/T 7714 | 崔勇,吴建平,CUI Yong,等. 分布式服务质量路由预计算算法[J],2010, 2010. |
| APA | 崔勇,吴建平,CUI Yong,&WU Jian-ping.(2010).分布式服务质量路由预计算算法.. |
| MLA | 崔勇,et al."分布式服务质量路由预计算算法".(2010). |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论