A matrix usage of load balancing heuristic for shortest path routing

Open shortest path first (OSPF) is a hierarchical interior gateway protocol (IGP) that can routes traffic flows along shortest paths. It splits the load equally at nodes where several outgoing links are on the shortest paths to the same destination. Shortest paths are defined based on a link weights value assigned to each link in the network. OSPF routing suffers from unutilizing network resources, thus appearance of congested links. This research aim is to study the problems of finding another matrix that can replace or minimize the usage of demand matrix. The results show that the routing performance of the new proposed method matrix usage method (MUM) is better than the routing performance of the previous evenly balancing methods (EBH) due to providing a balancing load and optimizing the usage of link with counting selection in the shortest path routing. MUM execution times are also improved comparing with the previous work.