一种应用于不对称网络中的生成树拓扑抽象算法
Research of Topology Aggregation in Asymmetric Networks
-
摘要: 该文提出了一种应用于不对称网络中的拓扑抽象算法，能够完全保留网络的不对称拓扑信息，从而减小了由于拓扑抽象引起的信息失真。该算法通过构建3个不同的生成树抽象拓扑，使所有的不对称信息都能够被包含在抽象拓扑中，且保持了抽象拓扑较小的空间复杂度。仿真结果表明所提出的拓扑抽象算法具有良好的实际性能。Abstract: This paper presents a topology aggregation algorithm for asymmetric networks, which can keep all the asymmetric topology information, so that topology information distortion can be reduced. The algorithm constructs three spanning tree aggregated topologies to include all the asymmetric information with small space complexity. Simulation results show the good practical performance of the proposed algorithm.
-
ITU-T Rec. G.8080/Y.1304. Architecture for the AutomaticallySwitched Optical Network (ASON). Nov. 2001.[2]ITU-T Rec. G.7715/Y.1706. Architecture and Requirements for Routing in the Automatically Switched Optical Network. June 2002.[3]Lui K -S, Nahrstedt K, Chen S. Routing with topology aggregation in delay-bandwidth sensitive networks[J].IEEE/ACM Transaction on Networking.2004, 12(1):17-29[4]Lee W C. Spanning tree method for link state aggregation in large communication networks. Proc. IEEE INFOCOM, Boston, MA, USA, 2-6 April, 1995: 297-302.[5]Lee W C. Minimum equivalent subspanner algorithms for topology aggregation in ATM networks. Proc. 2nd Int. Conf. on ATM (ICATM), Colmar, France, 21-23 June, 1999: 351-359.[6]Lei L, Ji Y. A spanning tree based QoS aggregation algorithm in hierarchical ASON[J].IEEE Communications Letters.2005, 9(5):459-461[7]Awerbuch B, Shavitt Y. Topology aggregation for directed graphs[J].IEEE/ACM Transaction on Networking.2001, 9(1):82-90 -
计量
- 文章访问数: 2198
- HTML全文浏览量: 96
- PDF下载量: 798
- 被引次数: 0
下载:
