一种不共享风险的双路径选路算法

A ROUTING ALGORITHM FOR FINDING LOW-COST PAIR OF NO-SHARED-RISK PATHS

光网络中,为一个连接请求建立连接时,从光路保护方面来说,不仅需要为其寻找到一条工作路由,而且需要提供一条备份路由,并要求这两条路径物理分离,对于光网络还提出了共享风险链路组的概念。该文提出一种新的启发式算法,完成两条路径共享风险链路组分离,同时总费用尽量低,并对算法进行了分析与仿真。

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.