Name
Abstract | ||
|---|---|---|
The design of WDM optical networks is an issue for telecom operators since the spreading of this technology will not occur unless enough performance guarantees are provided. Motivated by the quest for efficient algorithms for the Routing and Wavelength Assignment problem ( RWA), we address ap- proximations of the fractional multicommodity flow problem which is the central part of a complex randomized rounding algorithm for the integral problem. Through the use of dynamic shortest path computations and other combinatorial approaches, we improve on the best known algorithm. We also provide directions for further improvements. |
Year | Venue | Keywords |
|---|---|---|
2003 | SIROCCO | dynamic shortest paths.,multicommodity flow,rwa,wdm networks design,randomized rounding |
Field | DocType | Citations |
Wavelength-division multiplexing,Mathematical optimization,Shortest path problem,Telecom operators,Approximations of π,Routing and wavelength assignment,Randomized rounding,Multi-commodity flow problem,Mathematics,Computation | Conference | 2 |
PageRank | References | Authors |
0.55 | 10 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohamed Bouklit | 1 | 19 | 2.31 |
| David Coudert | 2 | 52 | 4.29 |
| Jean-François Lalande | 3 | 24 | 6.44 |
| Christophe Paul | 4 | 2 | 1.90 |
| Hervé Rivano | 5 | 270 | 31.29 |