Title :
How to Transform a Multilayer Network into a Colored Graph
Author :
Voge, Marie-Emilie
Author_Institution :
CNRS-INRIA-UNSA
Abstract :
Along with GMPLS new network survivability issues arose, and new models and tools were needed to cope with them. In this context the notion of Shared Risk Resource Group have been proposed, and then the colored graph model to answer these needs. In this work the basic definitions about colored graphs are reminded. Then the question of the transformation of a multilayer network into a colored graph is studied, since the way in which it is done can have a great impact on the quality of the solutions of some essential optimization problems in survivability issues, such as the shortest path problem, or the disjoint paths problem
Keywords :
graph colouring; multiprotocol label switching; optical fibre networks; optimisation; telecommunication network reliability; GMPLS; colored graph model; disjoint paths problem; multilayer network; network survivability; shortest path problem; Context modeling; Cost function; Electronic mail; Graph theory; Joining processes; Nonhomogeneous media; Shortest path problem; Telecommunications; Tree graphs; SRRG; colored graph; multilayer network; network survivability;
Conference_Titel :
Transparent Optical Networks, 2006 International Conference on
Conference_Location :
Nottingham
Print_ISBN :
1-4244-0235-2
Electronic_ISBN :
1-4244-0236-0
DOI :
10.1109/ICTON.2006.248415
