Name
Abstract | ||
|---|---|---|
In this paper, we propose a heuristic approach for finding optimal protection cycles in Wavelength-Division multiplexing (WDM) mesh networks. To guarantee optimality, all cycles are considered as candidates in our study. When the working capacity is known, our first step is to create all cycles using the Span-Based Cycles (SBC) algorithm. Then the Heuristic Cycle Efficiency Selection (HCES) algorithm is used to search this set of cycles. The objective is to achieve full protection, while minimizing the spare capacity, with a fast computation time. Overall, the results show that the proposed algorithm can achieve results within 5.4% redundancy difference from the optimal value with less than 2 seconds of computation time in large scale networks. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICON.2006.302638 | ICON: 2006 IEEE INTERNATIONAL CONFERENCE ON NETWORKS, VOLS 1 AND 2, PROCEEDINGS: NETWORKING -CHALLENGES AND FRONTIERS |
Keywords | Field | DocType |
p-cycle, wavelength-division multiplexing (WDM), survivability | Wavelength-division multiplexing,Mesh networking,Heuristic,Spare part,Computer science,Computer network,Redundancy (engineering),Multiplexing,Statistical time division multiplexing,Computation | Conference |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kungmeng Lo | 1 | 6 | 2.44 |
| Daryoush Habibi | 2 | 82 | 20.85 |
| alexander rassan | 3 | 2 | 0.85 |
| Viet Q. Phung | 4 | 9 | 6.21 |
| Hoang N. Nguyen | 5 | 3 | 1.90 |