Name
Abstract | ||
|---|---|---|
This paper investigates the problem of dynamic shared-path-protected lightpath provisioning in optical mesh net- works employing wavelength-division multiplexing (WDM). We prove that the problem of finding an eligible pair of working and backup paths for a new lightpath request requiring shared-path protection under the current network state is NP-complete. We develop a heuristic, called CAFES, to compute a feasible solution and an algorithm, called OPT, to optimize resource consumption for a given solution. The merits of our approaches are that they capture the essence of shared-path protection and approach to op- timal solutions without enumerating paths. We evaluate the effec- tiveness of our heuristics and the results are found to be promising. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/ICC.2003.1204598 | ICC |
Keywords | Field | DocType |
fault management,computer science,mesh network,computer networks,indexing terms,np complete,wavelength division multiplexing,multiprotocol label switching,intelligent networks,mesh networks | Heuristic,Optical mesh network,Shared Risk Resource Group,Computer science,Computer network,Heuristics,Statistical time division multiplexing,Multiplexing,Path protection,Backup,Distributed computing | Conference |
Volume | ISBN | Citations |
2 | 0-7803-7802-4 | 7 |
PageRank | References | Authors |
0.63 | 8 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Canhui Ou | 1 | 204 | 14.03 |
| Jing Zhang | 2 | 174 | 13.61 |
| Hui Zang | 3 | 1052 | 77.25 |
| Laxman H. Sahasrabuddhe | 4 | 74 | 6.00 |
| Biswanath Mukherjee | 5 | 6034 | 537.54 |