一種不共享風(fēng)險(xiǎn)的雙路徑選路算法
A Routing algorithm for finding low-cost pair of no-shared-risk paths
-
摘要: 光網(wǎng)絡(luò)中,為一個(gè)連接請(qǐng)求建立連接時(shí),從光路保護(hù)方面來說,不僅需要為其尋找到一條工作路由,而且需要提供一條備份路由,并要求這兩條路徑物理分離,對(duì)于光網(wǎng)絡(luò)還提出了共享風(fēng)險(xiǎn)鏈路組的概念。該文提出一種新的啟發(fā)式算法,完成兩條路徑共享風(fēng)險(xiǎn)鏈路組分離,同時(shí)總費(fèi)用盡量低,并對(duì)算法進(jìn)行了分析與仿真。
-
關(guān)鍵詞:
- 共享風(fēng)險(xiǎn)鏈路組; K路由
Abstract: In optical network, for anyone connection in order to provide protection mechanism, not only one working path for the traffic flow should be computed, but also one backup path should be provided, and they should be physical-disjoint. This paper proposes one heuristic algorithm, which can compute two SRLG-disjoint paths simultaneously, and the total cost of the two paths is near optimal. In this paper, some simulations and analysis are also given out. -
計(jì)量
- 文章訪問數(shù): 2025
- HTML全文瀏覽量: 106
- PDF下載量: 777
- 被引次數(shù): 0
下載:
