Reconfiguring Network Slices with Migration Graphs

Reconfiguring network slices involves migrating a set of Virtual Network Functions (VNFs) from their original hosts to the ones declared in the new configuration. Nevertheless, identifying the best way of ordering the VNF migrations is a challenging task that has been largely overlooked. We propose to build a migration graph, which represents all the sequences of VNF migrations that can be used to reconfigure the network slices, and to model the problem as a graph traversal problem. We tackle the complexity of this problem by leveraging the properties of the migration graph to improve the performance of classic graph traversal techniques on the migration graph.