Résumé
The routing and wavelength assignment (RWA) problem for multipoint-to-point communications in all-optical wavelength division multiplexing (WDM) networks is investigated in this paper. Two efficient algorithms, namely Reverse Shortest Path Tree routing (RSPT) and k-Bounded Edge Disjoint Path routing (EDPR), are proposed. The problem of minimizing the total cost while establishing a multipoint-to-point session can be solved by RSPT algorithm in polynomial time. Nevertheless, EDPR algorithm produces a significant reduction in the maximum number of wavelengths required per link (i.e., the link stress) by a multipoint-to-point session. Simulations demonstrate the efficiencies of these two algorithms in supporting multipoint-to-point communications in WDM networks.