Diverse routing in WDM optical networks with shared risk link group (SRLG) failures

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005. Pub Date : 2005-12-27 DOI:10.1109/DRCN.2005.1563905

Xubin Luo, Bin Wang

引用次数: 22

Abstract

We study the diverse routing problem in WDM optical networks with SRLG failures. We consider a more general case of SRLG failures than those considered in Datta and Somani (2004) and Doucette and Grover (2002). All the optical links in an SRLG share a common endpoint. In addition, a link can belong to arbitrary number of SRLG groups and an SRLG may include more than two links. We develop a polynomial time optimal algorithm to find a pair of least cost SRLG-disjoint paths between a source and a destination. We prove the correctness of the algorithm which is also shown to be more time efficient than the graph transformation based algorithm of Datta and Somani (2004).

查看原文本刊更多论文

具有共享风险链路组(SRLG)故障的WDM光网络中路由的多样性

研究了具有SRLG故障的WDM光网络中的各种路由问题。与Datta和Somani(2004)以及Doucette和Grover(2002)相比，我们考虑了一个更普遍的SRLG失败案例。SRLG中的所有光链路共享一个共同的端点。此外，一条链路可以属于任意数量的SRLG组，一个SRLG可以包含两个以上的链路。我们开发了一个多项式时间最优算法来寻找一对最小代价的srsg -不相交路径在源和目标之间。我们证明了该算法的正确性，并且证明该算法比Datta和Somani(2004)基于图变换的算法更具时间效率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.

自引率

0.00%

发文量