节点文献
层次网络中的拓扑压缩算法及性能比较
Topology Aggregation Algorithm in Hierarchy Network and Performance Comparison
【摘要】 <正> 随着Internet规模的迅速扩大,QoS路由面临复杂度过高的问题。在大规模网络中实现QoS路由的主要困难在于链路QoS信息的频繁更新和QoS最优路径的计算。链路QoS信息(带宽和时延)处于不断变化的状态,需要将这些变化及时地扩散出去以使路由程序做出正确的计算。然而频繁地更新QoS信息无疑会增加网络负载,降低了可扩展性,因此尽量减少链路QoS信息的更新对于提高QoS路由算法的可扩展性起到至关重要的作用。减少链路QoS信息更新的措施包括;减少信息量和减少
【Abstract】 Future Internet will be a hierarchy topology. To guarantee peer-to-peer QoS, QoS-based routing protocol will be adopted. Considering scalability and security, topology information used by routing protocol should be compressed before distribution in network. Routing protocol would route the packets without knowing the complete network topology information. This article investigates several different topology aggregation schemes and their application area. We also compare the performance of different topology aggregation schemes under different topology structures and update policies.
- 【文献出处】 计算机科学 ,Computer Science , 编辑部邮箱 ,2002年12期
- 【分类号】TP393
- 【被引频次】6
- 【下载频次】71