一種應(yīng)用于不對稱網(wǎng)絡(luò)中的生成樹拓?fù)涑橄笏惴?/h2>
Research of Topology Aggregation in Asymmetric Networks
-
摘要: 該文提出了一種應(yīng)用于不對稱網(wǎng)絡(luò)中的拓?fù)涑橄笏惴ǎ軌蛲耆Ａ艟W(wǎng)絡(luò)的不對稱拓?fù)湫畔?，從而減小了由于拓?fù)涑橄笠鸬男畔⑹д?。該算法通過構(gòu)建3個不同的生成樹抽象拓?fù)?，使所有的不對稱信息都能夠被包含在抽象拓?fù)渲?，且保持了抽象拓?fù)漭^小的空間復(fù)雜度。仿真結(jié)果表明所提出的拓?fù)涑橄笏惴ň哂辛己玫膶?shí)際性能。
-
關(guān)鍵詞:
- 不對稱網(wǎng)絡(luò); 拓?fù)涑橄? 分層路由; 生成樹
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 -
計量
- 文章訪問數(shù): 2213
- HTML全文瀏覽量: 99
- PDF下載量: 798
- 被引次數(shù): 0
下載:
