Research On Multiprotocol Label Switch Traffic Engineering Based On Minimum Interference Routing Algorithm

In this research thesis a new condition for critical links and a concept of critical nodes are introduced, these enhancements are aimed at improving the resource (bandwidth) usability. All critical links with the capacity less than average critical link capacity should be eliminated, this condition aims at improving the resource usability. The establishment of critical nodes aims at reducing the congestion and helps rerouting to some other selected path and hence reducing traffic interference. These are node such that many source destination pairs will prefer to route their traffic through them.Multiprotocol Label Switching (MPLS) is a modern technique for forwarding network data. It broadens routing according to path controlling and packet forwarding. It is this feature which makes MPLS more preferred in network traffic engineering. Minimum Interference Routing Algorithm (MIRA) is an online routing algorithm, which means that it doesn’t need to have prior information of the incoming traffic load in order to route it. It identifies the so called critical links. These are links that if heavily loaded, would make it impossible to satisfy future demands between certain ingress-egress pairs. MIRA eliminate the critical links before routing the traffic load of the current ingress-egress pair so that it doesn’t interfere with the future routing demands from other ingress-egress pairs. Though the eliminated links are critical to other certain ingress-egress pairs, but sometimes removing them without additional condition reduces the resource usability. The newly introduced conditions help to increase the resource usability.The experiment has been done using Network simulation tool NS2and the result shows that, by introducing these two conditions, the end to end throughput has increased, link delay has decreased and has improved the data rate received at the destination.