北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2006, Vol. 29 ›› Issue (2): 55-58.doi: 10.13190/jbupt.200602.55.leil

• 论文 • 上一篇    下一篇

分层网络中用于生成树抽象的优化方法

雷蕾,张春环,纪越峰   

  1. 北京邮电大学 电信工程学院
  • 出版日期:2006-04-28 发布日期:2006-04-28

An Optimization Method for Spanning Tree Aggregation in Hierarchical Networks

LEI Lei,ZHANG Chun-huan,JI Yue-feng   

  1. School of Telecommunication Engineering, Beijing University of Posts and Telecommunications
  • Online:2006-04-28 Published:2006-04-28

摘要: 提出了一种分层网络中用于生成树拓扑抽象的优化方法,以及基于此方法的逼近算法. 使用该优化方法及逼近算法可以在不增加抽象拓扑空间复杂度的前提下,减小生成树抽象所引起的加性QoS(服务质量)参数失真. 仿真结果表明,在生成树拓扑抽象中使用此逼近算法后,可大大减少源节点由于拓扑信息不准确而产生的路由决策错误数,提高网络性能.

关键词: 拓扑抽象, 分层网络, 生成树

Abstract: An optimization method for spanning tree aggregation in hierarchical networks was proposed. And an approximation algorithm was presented. With them, the distortion of additive QoS (quality of service) parameters caused by spanning tree aggregation could be minimized without increasing the space complexity of aggregated topology. Simulation results show that the proposed algorithm can greatly reduce the routing decision errors of the source nodes due to inaccurate topology information,and improve network performance.

Key words: topology aggregation, hierarchical network, spanning tree