Real Time Traffic Splitting and Efficient Flooding Mechanism in LSRP

Abstract

From last many years traffic in internet is increasing very rapidly. But as internet in growing up we required to maintain quality and have to increase the efficiency of network. Also we should concentrate on efficient mechanism of flooding, load balancing & resource utilization. In today’s internet world mostly Link state routing protocols like 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 we introduce a new method called Real time traffic splitting & efficient flooding mechanism in network with the help of OSPF. We will reduce the time required to compute the weight on link and find the best links to forward the packet within short time. The concept is to first minimize link state advertisement packets & 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. We can increase the performance of network & achieve optimal traffic engineering. As compare with the OSPF packet forwarding mechanism is same which is destination based & hop by hop forwarding just difference is in splitting mechanism.