All-optical multipoint-to-point routing in WDM mesh networks

Fen Zhou (1, 2) , Miklós Molnár (3) , Bernard Cousin (1, 4)

1 ATNET - Advanced Technolgy in Networking
2 INSA Rennes - Institut National des Sciences Appliquées - Rennes
3 IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires
4 UR - Université de Rennes

In this article, the routing and wavelength assignment (RWA) problem for supporting multipoint-to-point communications in all-optical WDM mesh networks is investigated. Two efficient algorithms, namely reverse shortest path tree routing (RSPT) and k-bounded edge disjoint path routing (EDPR), are proposed. We proved that the problem of minimizing the total cost while establishing a multipoint-to-point session can be solved in polynomial time of O(|V|log|V| + |V| + |E|) by the RSPT algorithm, where |V| and |E| denote the number of nodes and the number of edges in the network, respectively. Nevertheless, the solution provided by the EDPR algorithm produces a significant reduction in the maximum number of wavelengths required per link (i.e., the link stress) for a multipoint-to-point session compared to RSPT algorithm. EDPR algorithm can also approximate to the optimal total cost with a ratio of k. Simulations are done to assess these two algorithms. Numerical results demonstrate their efficiencies in supporting multipoint-to-point communications in all-optical WDM networks.

Mots clés: WDM networks; Multipoint-to-point communication; Routing and wavelength assignment (RWA); Light-startree; Reverse shortest path tree (RSPT); Edge disjoint path routing (EDPR)

Domaines: Réseaux et télécommunications [cs.NI]

Fen Zhou, Miklós Molnár, Bernard Cousin. All-optical multipoint-to-point routing in WDM mesh networks. Annals of Telecommunications - annales des télécommunications, 2010, 66 (1-2), pp.91-101. ⟨10.1007/s12243-010-0203-1⟩. ⟨hal-00540953⟩