Routing Optimization in Ospf : A Matrix Usage Method for Load Balancing in Shortest Path Routing

The Open Shortest Path First (OSPF) protocol is ahierarchical interior gateway protocol (IGP) forrouting in Internet Protocol. Traffic flows routedalong shortest path and splits the load equally atnodes where a number of outgoing links on theshortest paths to the same destination IP address.Network operator defines shortest paths based on alink weights value assigned to each link in thenetwork. The OSPF link weight-setting problem seeks aset of link weights to optimize a cost function andnetwork performance, typically associated with anetwork congestion measure. These researcheshighlight the importance of managing network resourceand avoiding congested point in the current widelydeployed shortest path routing.