A multicast routing restoration algorithm based on the n-person non-cooperative game in multi-domain optical networks

Abstract

Aiming at the restoration problems for multicast service in multi-domain optical networks, a multicast routing restoration algorithm in multi-domain optical networks based on the n-person non-cooperative game is proposed by adopting the Breadth First Search (BFS) strategy and n-person non-cooperative game theory. This algorithm optimizes the searching sequence of BFS algorithm and reduces the searching scope by the competitive selection relation of the game theory. The algorithm analysis and experimental results show that the algorithm has low time complexity, reduces the computational time of the restoration path, and reduces the blocking rate of the multicast restoration service.