Optimizing OSPF routing using accelerated iterative heuristic

Authors:
Sadiq M. Sait;Mohammed H. Sqalli;Syed Asadullah
Affiliations:
Computer Engineering Department, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia;Computer Engineering Department, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia;Computer Engineering Department, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia
Venue:
AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Year:
2009

Citing 5
Cited 0

Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems

Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems
Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations

Journal of Heuristics
A parallel tabu search algorithm for solving the container loading problem

Parallel Computing - Special issue: Parallel computing in logistics
Engineering evolutionary algorithm to solve multi-objective OSPF weight setting problem

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Traffic engineering with traditional IP routing protocols

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 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.