Sync Preempted Probability Algorithm in the Integrated Services (IntServ) MPLS Network

This work presents an implementation of an algorithm Sync Pre-empted Probability Algorithm for Integrated Services MPLS network under Windows platform. The algorithm, which comprises of Maximum Probability of LSPs (Label Switching Paths) selection and the network resource allocation, embed in to the ingress router to transfer traffic between client and server. In traditional network, the shortest path is used to forward packets. This may Cause congestion on a link. In this manner the link utilization is very low in the network. We try to avoid all of the traffic congesting with the shortest path. In case of overload situation the next incoming traffic will be routed to another LSP then the link utilization will be promoted. Hence, we maintain the quality of services throughout all of the links from entry point to exit and we promote the link utilization and resource management to achieve Quality of Service requirements efficiently. The experimental results of the work shows that this approach can optimize network resources efficiently and distribute the traffic over the MPLS network.