Traffic grooming in bidirectional WDM ring networksReportar como inadecuado

Traffic grooming in bidirectional WDM ring networks - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués 2 Applied Mathematics IV Department 3 ALGCO - Algorithmes, Graphes et Combinatoire LIRMM - Laboratoire d-Informatique de Robotique et de Microélectronique de Montpellier

Abstract : We study the minimization of ADMs Add-Drop Multiplexers in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely formulate the problem in terms of graph decompositions, and state a general lower bound for all the values of the grooming factor C and N, the size of the ring. We first study exhaustively the cases C = 1, C = 2, and C = 3, providing improved lower bounds, optimal constructions for several infinite families, as well as asymptotically optimal constructions and approximations. We then study the case C > 3, focusing specifically on the case C = kk + 1-2 for some k ≥ 1. We give optimal decompositions for several congruence classes of N using the existence of some combinatorial designs. We conclude with a comparison of the cost functions in unidirectional and bidirectional WDM rings.

Keywords : combinatorial designs Traffic grooming SONET ADM optical WDM network graph decomposition combinatorial designs.

Autor: Jean-Claude Bermond - Xavier Muñoz - Ignasi Sau -



Documentos relacionados