Abstract
In the communication networks, one of the major problems in the quality of service is congestion. Indeed, the phenomenon of congestion is due to the fact that many packets emitted follow the same paths. As a result, the increase the bandwidth offered can solve the problem only in the short term. In order to solve this problem, several solutions have been proposed, such as multipath routing algorithms, which distribute traffic between a source and a destination on several different paths, while taking into account the level of saturation of the intermediaries nodes, composing the different paths with a objective to avoid cluttered paths. Its purpose is to shed the excessive burden save a knot on its neighbors to improve performance and to exploit efficiently. In this paper we have analysis the load balancing in Multipath routing to achieve better network performance. We have study and reviewed the different load balancing algorithm in multipath network and based on review we have proposed a new load balancing algorithm in the multipath network. We have modified the packet of RREP and RREQ packet to transmit and receive the route information to compute the load of every path and we added a new field in RREP packet Buffer size to store the current node and their neighbor information to find the alternate route if network load in increase we have compare the performance of proposed protocol with the LB-AOMDV, SMR & AOMDV multipath routing protocols. NS2 is used for simulation
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Recent Technology and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.