A Dynamic Recovery And Scalable Mechanism On MPLS Networks

MPLS(Multi-Protocol Label Switching)has been proposed by IETF, It has been integrated the switching and routing technology, which is leading to further research and development efforts.It is widely accepted that layer three protection and recovery mechanisms are too slow for today's reliability requirement, in light of this, several MPLS based protection mechanisms have been researched.This paper explains and summarizes the various mechanisms that are being discussed by the IETF, The focus of this paper is on methodologies that can select routes, spanning a large areas, which can then be used for MPLS transport connections. Once the link failure occurs, the packets can not retain too long, the packet should be sent via the most nearby local repair path if one can be identified.In this thesis, we has propose the framework of five parts:1) Advertising topology information on every sub-area edge router;2) Adding fault information Mechanism to notify the edge route, once a link failure occurs,3) Present a dynamic fault recovery mechanism ;4) Adding a cycle detecting mechanism checked out an alternative path;5) Adding a path switching mechanism,send out the traffic over the new path when the local recovery path has been found.The algorithm has been implemented in Networks Simulator-2(NS-2).The simulation result show that the new Dynamic Recovery Mechanism for scalable on MPLS Networks greatly increases the rate of receiving packet and high scalability ,as the same time the proposed scheme of dynamic rerouting assist us in achieving the end-to-end delay guarantee for traffic on MPLS networks.