拓扑聚集在可扩展的路由机制中十分重要 ,如何在简化网络拓扑信息的同时获得好的性能 ,是拓扑聚集算法的关键问题 .本文提出了一个描述逻辑链路的新方法 ,能够简单有效地描述加性和乘性参数约束的网络 ,并扩展到多参数约束的情况 .在此基础上 ,提出了一个改进的星型聚集算法 .仿真结果表明该算法具有很好的性能 Topology aggregation is very important in scalable routing mechanism and how to get good performance while simplifying network topology information is a key issue in topology aggregation algorithm.This paper presents a new method to describe logical links that can be described simply and effectively Additive and multiplicative parameter constrained network, and extended to the case of multi-parameter constraints.On the basis of this, an improved star aggregation algorithm is proposed.The simulation results show that the algorithm has good performance