A Survey for Open Shortest Path First Weight Setting (OSPFWS) Problem
Ahmed Abo Ghazala, Ayman El‐Sayed, Mervat Mousa · 2008
Open shortest path first (OSPF) is the most commonly used intera-domain routing protocol. It used to select the paths along which traffic is routed within autonomous systems (AS), OSPF calculates routes as follow. Each link is assigned weights by operator. Each node in the autonomous system computes shortest paths and creates destination tables used to route data to next node on the path to its destination. Shortest paths are selected according to path cost. Path cost is determined by sum of its weight links. Then link weights determine the shortest paths, in which turn determine the routing of network traffic flow. OSPF weights setting problem is to find a set of OSPF weights that optimizes network performance. OSPF weights setting problem is an NP-hard problem. In the last couple of years, various algorithms for OSPF weights setting problem have been proposed. In this paper, we present a survey of OSPF weights setting algorithms and compare their performances.