36 An Open Shortest Path First Area Design Problem Using Genetic Algorithm

The Open Shortest Path First (OSPF) is a dynamic routing protocol in Internet Protocol (IP) networks. Specifically, it is a link-state routing protocol and falls into the group of interior gateway protocols, operating within an Autonomous System (AS). In this paper, we deal with OSPF area design problem which is also proved to be an NPhard optimization problem. The primary aim of this paper is to design an OSPF area while considering the objective of minimizing the cost of OSPF area. First, the OSPF area considered in this study is divided into 3 levels. The 1st is the backbone level which contains main office and the 2nd is the Area Border Router (ABR) level. Lastly, the 3^rd level is branch office area. Later, to solve this 3 leveled OSPF area model, a Priority-based Genetic Algorithm (priGA) is proposed. Finally, to show the applicability and the efficiency of the proposed approach, numerical experiments are performed.