How to Transform a Multilayer Network into a Colored Graph

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