Path Computation in Multi-Switching Multi-Layer Networks

In this paper, we study the problem of path computation in multilayer multi-switching networks. Compared to the standard shortest path problem, path computation in this context needs to take into account the heterogeneous switching capabilities of nodes. We develop a routing algorithm by adapting the Floyd-Warshall algorithm to take into account the switching technology conversion. Our algorithm solves the all-pair min-cost continuous path problem by building routing tables for each node to allows hop-to-hop routing. We then extend our efforts by developing a distributed routing algorithm to construct the routing tables based on local information and interactions with direct neighbors. We complete our algorithmic analysis with extensive simulations to demonstrate the effectiveness of the developed routing algorithms.