Parallel Tabu Search for Optimizing the OSPF Weight Setting Problem
نویسندگان
چکیده
The problem of setting the Open Shortest Path First (OSPF) weights on links such that congestion can be avoided is proved to be NP-hard. Many iterative heuristics have been applied to solve the OSPF weight setting (OSPFWS) problem. As the size of any combinatorial optimization problem increases, it becomes more difficult to find an optimum solution using sequential algorithms. Parallelization of modern iterative heuristics has been proven to produce improved solution precision and timing. In this paper, we investigate the parallelization of Tabu Search and apply two variants of a Parallel Tabu Search (PTS) heuristic on the OSPFWS problem. It is shown through experimental results that both PTS approaches produced better solutions quality compared to the sequential heuristics; specifically for larger topologies. In one approach, we propose a new design for our parallel cooperative search algorithm, which performs better than the conventional parallel heuristic. The purpose of this new design is to induce diversification into the search to explore a larger search space. We also show that the new approach performs better than the conventional parallel heuristic. Key–Words: Open Shortest Path First (OSPF), OSPF Weight Setting Problem, NP-hard, Iterative Heuristics, Parallel Tabu Search.
منابع مشابه
Optimizing OSPF Routing Using Accelerated Iterative Heuristic
The problem of setting Open Shortest Path First (OSPF) weights on links such that congestion can be avoided is proved to be NP-hard. Many iterative heuristics have been applied to solve the OSPF weight setting (OSPFWS) problem. As the size of any combinatorial optimization problem increases, it becomes more difficult to find an optimum solution using sequential algorithms. In this paper, we inv...
متن کاملOSPF Weight Setting Optimization for Single Link Failures
In operational networks, nodes are connected via multiple links for load sharing and redundancy. This is done to make sure that a failure of a link does not disconnect or isolate some parts of the network. However, link failures have an effect on routing, as the routers find alternate paths for the traffic originally flowing through the link which has failed. This effect is severe in case of fa...
متن کاملMinimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation
In this paper, we present a scheme for minimizing the packet loss in an OSPF network by optimizing link weights using Online Simulation. For this work we have chosen packet loss rate in the network as the optimization metric as it is a good indicator of congestion and impacts the performance of the underlying applications. We have formulated packet loss rate in the network in terms of the link ...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملRobust optimization of OSPF/IS-IS weights
In this paper, we adapt the heuristic of Fortz and Thorup for optimizing the weights of Shortest Path First protocols such as Open Shortest Path First (OSPF) or Intermediate System-Intermediate System (IS-IS), in order to take into account failure scenarios. More precisely, we want to find a set of weights that is robust to all single link failures. A direct application of the original heuristi...
متن کامل