A New Approach for Open Shortest Path Weight Setting Problem (OSPFWSP)

Routing protocol is the nervous system to any network. It directs data to it´s destinations, OSPF is the famous intera-domain routing protocol at all over the world, 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 it direct data according to variable parameter named weights (cost), quality of routing depends on the setting of these parameters, OSPF routing is NP hard problem [1], OSPF weights setting problem is to find a set of OSPF weights that optimizes network performance. Although a lot of trials have been made for open shortest path setting problem (OSPFWSP), no optimal setting is found. At this paper a new algorithm is developed to solve OSPFWSP, also comparison between the new algorithm and the legacy methods is done.