Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Heuristics for Diverse Routing in Wavelength-Routed Networks with Shared Risk Link Groups

Heuristics for Diverse Routing in Wavelength-Routed Networks with Shared Risk Link Groups In this paper, we consider path protection in wavelength-routed networks with shared risk link groups (SRLGs). Specifically, we study diverse routing, where two paths without sharing any SRLG have to be found between each pair of source–destination nodes, and its applications in dynamic shared protection as well. For the NP-complete diverse routing problem, a heuristic method is proposed, which steadily outperforms an existing algorithm within the first few iterations. When more iterations of calculations are allowed, we demonstrate that the two different algorithms perform nearly the same. This interesting observation helps to achieve some insight into how to further improve the performance of the heuristics in the future. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

Heuristics for Diverse Routing in Wavelength-Routed Networks with Shared Risk Link Groups

Photonic Network Communications , Volume 11 (1) – Jan 1, 2006

Loading next page...
 
/lp/springer-journals/heuristics-for-diverse-routing-in-wavelength-routed-networks-with-109mlFk3H2

References (28)

Publisher
Springer Journals
Copyright
Copyright © 2006 by Springer Science + Business Media, Inc.
Subject
Computer Science; Computer Communication Networks; Electrical Engineering; Characterization and Evaluation of Materials
ISSN
1387-974X
eISSN
1572-8188
DOI
10.1007/s11107-006-5321-3
Publisher site
See Article on Publisher Site

Abstract

In this paper, we consider path protection in wavelength-routed networks with shared risk link groups (SRLGs). Specifically, we study diverse routing, where two paths without sharing any SRLG have to be found between each pair of source–destination nodes, and its applications in dynamic shared protection as well. For the NP-complete diverse routing problem, a heuristic method is proposed, which steadily outperforms an existing algorithm within the first few iterations. When more iterations of calculations are allowed, we demonstrate that the two different algorithms perform nearly the same. This interesting observation helps to achieve some insight into how to further improve the performance of the heuristics in the future.

Journal

Photonic Network CommunicationsSpringer Journals

Published: Jan 1, 2006

There are no references for this article.