Optimization of OSPF Weights using a Metaheuristic Based on Random Samplings
Siavash Sheikhizadeh

Siavash Sheikhizadeh, Zarand Higher Education Complex, Shahid Bahonar University of Kerman, Zarand, Iran.
Manuscript received on April 11, 2012. | Revised Manuscript received on April 14, 2012. | Manuscript published on May 05, 2012. | PP: 550-554 | Volume-2 Issue-2, May 2012 . | Retrieval Number: B0650042212/2012©BEIESP
Open Access | Ethics and Policies | Cite 
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: OSPF is the best-known intra-domain routing protocol which is employed all over the internet. In this research, an optimization problem has been introduced for optimizing OSPF weights and after mentioning the formulation of the problem[1][2], a heuristic search method based on random samplings[3] has been implemented to solve it. Finally results on some artificial networks has been compared to computations of a linear programming algorithm.

Keywords: Linear Programming, OSPF weights, Random Sampling, Routing Protocol.