Optimal Traffic Engineering in Link State Routing Protocols

Abstract

From last many years traffic in internet is increasing very rapidly. But as internet in growing up it required quality and have to increase the efficiency of network. Also it should concentrate on load balancing & resource utilization. In today's internet world mostly Open Shortest Path First (OSPF) routing protocol is used which is based on link weighs, as optimizing link weight in OSPF to the group traffic is well-know NP-Hard problem. In the consideration of current situation of the network paper introduce a new method called Multi-Shortest Path First routing protocol to achieve optimal traffic engineering in network with the help of OSPF. It will reduce the time required to compute the weight on link and find the best links to forward the packet within short time. Our concept is to split the traffic over first few multiple shortest paths to reach to destination. As traffic increases our protocol automatically sends packet through next shortest path present in the network.. As compare with the OSPF packet forwarding mechanism is same just difference is in splitting mechanism.