Performance Analysis of Different Routing Algorithms for Load Distribution in Multipath Packet Switched Network

This paper is a quantities analysis on packet switched network with a view to generalize load balancing and determination of appropriate routing algorithm in multipath environment. Several routing algorithms have been introduced for routing of packets from source to destination. Some of them promised that they will route accurately but it seems with increased workload. Some of them promised that they will drastically cut down workload. A few of them promised that they will find out a minimum workload deviation for both UDP and TCP packets. We simulate those approaches in a well defined simulator and evaluate its performance against one with each other routing algorithms. After expanding our analysis with varying weights and number of paths we found that the newly invented routing algorithm which entitled as Mixed Weighted Fair Routing (MWFR) is a one step ahead of the existing routing algorithms. It can be helpful to reduce the routing and network overhead in order to save the scarce bandwidth and CPU consumption for the packet switching networks.