Routing and grooming of scheduled lightpath demands in a multi-granularity switching network: a mathematical model

Technological improvements allow advanced optical cross-connect architectures to be developed. Multi-granularity switching optical cross-connects (MG-OXCs) are equipments able to switch wavelengths, to aggregate (disaggregate) wavelengths into (from) groups of wavelengths called wavebands and to switch wavebands. In previous studies, we described a new traffic model based on Scheduled Lightpath Demands (SLDs) that make it possible to take into account the time and space distribution of traffic in the planning of all-optical WDM mesh networks. We proposed a mathematical model to optimize the routing of a set of SLDs in a WDM with standard wavelength-switching optical Cross-Connects (WXCs). In order to compare the cost of provisioning a set of SLDs in a network of WXCs against the cost of instantiating the same set in a network of MG-OXCs, it is necessary to extend the model used for the standard case. In this paper, we present a generalization of the model that permits to solve the problem of optimally instantiating SLDs in a network equipped with MG-OXCs.

[1]  Ludovic Noirie,et al.  Multi-Granularity Optical Networks , 2000, ONDM.

[2]  Bin Wang,et al.  Traffic Grooming Under a Sliding Scheduled Traffic Model in WDM Optical Networks , 2004 .

[3]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[4]  Biswanath Mukherjee,et al.  A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks , 2003, TNET.

[5]  Maurice Gagnaire,et al.  Assessing the economic benefit of introducing multi-granularity switching cross-connects in optical transport networks , 2006, IEEE Journal on Selected Areas in Communications.

[6]  Emmanuel Dotaro,et al.  Routing and wavelength assignment of scheduled lightpath demands , 2003, IEEE J. Sel. Areas Commun..

[7]  Rajiv Ramaswami,et al.  MEMS technology for optical networking applications , 2001, IEEE Commun. Mag..

[8]  Josue Kuri,et al.  Optimization problems in WDM optical transport networks with scheduled lightpath demands , 2003 .

[9]  La constitution optimale des groupes de niveau supérieur dans le réseau national. Formulation du probléme et heuristique de résolution , 1977 .

[10]  Maurice Gagnaire,et al.  Diverse routing of scheduled lightpath demands in an optical transport network , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[11]  Zhichao. Zhang.  Traffic grooming in WDM mesh networks , 2003 .

[12]  Ori Gerstel,et al.  Cost-effective traffic grooming in WDM rings , 2000, TNET.

[13]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

[14]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[15]  Eric Mannie,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.

[16]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[17]  Emmanuel Dotaro,et al.  Routing foreseeable lightpath demands using a tabu search meta-heuristic , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[18]  Digital transmission systems – Digital networks – General aspects Architecture of transport networks based on the synchronous digital hierarchy ( SDH ) , 2001 .

[19]  Emmanuel Dotaro,et al.  ROUTING AND WAVELENGTH ASSIGNMENT OF SCHEDULED LIGHTPATH DEMANDS IN A WDM OPTICAL TRANSPORT NETWORK , 2002 .