Among various protection and restoration schemes it is hard to decide which is the best to be used in a certain situation. First, we propose a method to find the best possible shared protection scheme among all possib...
详细信息
ISBN:
(纸本)9781467380515
Among various protection and restoration schemes it is hard to decide which is the best to be used in a certain situation. First, we propose a method to find the best possible shared protection scheme among all possible shared protection schemes. We provide optimisation and simulation results. Second, we prove the optimality of the proposed method in terms of minimal resource usage for any single demand to be routed with any shared protection: shared link, shared segment, and shared end-to-end path protection.
We consider the directed Steiner network problem, where given a weighted directed graph G and p pairs of vertices P = {(s(1), t(1)), . . . ,(s(p), t(p))}, one has to find the minimum weight subgraph H of G that contai...
详细信息
We consider the directed Steiner network problem, where given a weighted directed graph G and p pairs of vertices P = {(s(1), t(1)), . . . ,(s(p), t(p))}, one has to find the minimum weight subgraph H of G that contains path from s(i) to t(i) for all i. We search for the main cause of the complexity of the problem and introduce the notions of junction vertex and shared segment in an optimal solution. We study the parameterized complexity of the problem with respect to these parameters and achieve several parameterized hardness results. Also, we present two output-sensitive algorithms for the problem, which are much simpler and easier to implement than the previously best known one;and in addition, when the paths corresponding to the input pairs have few shared vertices or arcs in the optimal solution, these algorithms outperform the previous one.
暂无评论