A spindle graph based singular multipath routing using Labelle Merging Algorithm

A key feature of Open Shortest Path First protocol mainly managing huge networks and providing the speedy destination result using a Dijkstra´s Algorithm. A utilization of network recourses and exceed utilization of network resources are the not focusing in literature in OSPF based single path routing. Single path routing causes traffic congestion and less optimum bandwidth utilization where as techniques causes over bandwidth utilization. Singular Multipath routing is good tradeoff between less and exceed limit and also overcomes drawbacks in OSPF paths discovery process. A fault tolerance level is also accelerated in Singular Multipath routing. Load balancing and repeated single paths with small difference are found and merged using spindle graph based Labelle Merging Algorithm. Simulation is carried using ns2 and simulation result proves that the Manhattan Distance based pseudo Sources Neighbors Discovery Algorithm gives closest neighbors and spindle graph based Labelle Merging gives effective resources utilization.