The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON COMMUNICATIONS
Transactions ID Number: 29-118
Full Name: Mohammed Sqalli
Position: Assistant Professor
Age: ON
Sex: Male
Address: P.O. Box 1447, KFUPM, Dhahran, 31261
Country: SAUDI ARABIA
Tel: +966-3-860-1725
Tel prefix:
Fax: +966-3-860-3059
E-mail address: sqalli@kfupm.edu.sa
Other E-mails: sqallim@gmail.com
Title of the Paper: Parallel Tabu Search for Optimizing the OSPF Weight Setting Problem
Authors as they appear in the Paper: Sadiq M. Sait, Mohammed H. Sqalli, and Syed Asadullah
Email addresses of all the authors: sadiq@kfupm.edu.sa,sqalli@kfupm.edu.sa,sasad@kfupm.edu.sa
Number of paper pages: 10
Abstract: 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 diffi- cult 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.
Keywords: Open Shortest Path First (OSPF), OSPF Weight Setting Problem, NP-hard, Iterative Heuristics, Parallel Tabu Search.
EXTENSION of the file: .pdf
Special (Invited) Session: Optimizing OSPF Routing Using Accelerated Iterative Heuristic
Organizer of the Session: 609-512
How Did you learn about congress:
IP ADDRESS: 212.138.69.18
