|M.Sc Student||Keslassy Michael|
|Subject||Establishing Multiple Survivable Connections|
|Department||Department of Electrical Engineering||Supervisor||Professor Ariel Orda|
|Full Thesis text|
We consider the establishment of connections in survivable networks, where each connection is allocated with a working (primary) path and a protection (backup) path. While many optimal solutions have been found for the establishment of a single connection, only heuristics have been proposed for the multi-connection case.
We investigate the algorithmic tractability of multi-connection establishment problems, both in online and offline frameworks. First, we focus on the special case of two connections, and study the tractability of three variants of the problem. We show that only one variant is tractable, for which we establish an optimal solution of polynomial complexity. For the other variants, which are shown to be NP-hard, heuristic schemes are proposed. These heuristics are designed based on the insight gained from our study. Through simulations, we indicate the advantages of these heuristics over more straightforward alternatives.
We extend our study to K connections, for a fixed K that is larger than 2. We prove the tractability of online and offline variants of the problem, in which sharing links along backup paths is allowed, and we establish corresponding optimal solutions. On the other hand, we show that, if the number of connections is not fixed (i.e., K is not O(1)), then the problem is, in general, NP-hard.