Font Size: a A A

Research On Fast Reroute And Multi-fault Recovery Mechanisms Based On MPLS

Posted on:2009-04-19Degree:MasterType:Thesis
Country:ChinaCandidate:D ZhaoFull Text:PDF
GTID:2178360278956838Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
With the development of network technology, IP network carries more economic applications than ever, which requires the increasment of reliability and availability. The IP protocols have definite robustness and survivability, but the recovery speed relies on the convergence time, which cannot satisfy the constraints of some critical serveices and real-time traffic. Multi-protocol label switching has embedded the fast response ability for the network faults, meanwhile providing faults recovery mechanisms including rerouting and protection switching. Fast rerouting combines the advantages of rerouting and protection switching, so it has better performance and applicability. The article deeply reserches on the supporting technology of fast rerouting, and mainly introduces Makam and Haskin model.We validate the performance of fast rerouting through simulating experiments. The recovery performance has consanguineous relationship with network statues. We analyze this relationship through Makam and Haskin models, and simulate the two models in order to compare the advantages and disadvantages, as well as validate our deduations to guide the algorithms design.As the network has been faced with the multi-fault environment, we consider designing effective multi-fault recovery algorithm. Based on the sufficient analysis of the current multi-fault recovery technologies, we decide that splitting to convert the problem to local recovery is an effective method. So we propose ana idea of segmented recovery under multi-constraint, and design an algorithm named MCSR which takes the recovery time and shared resources as the constraints. This algorithm segmented the network into several SPD and adopts the Haskin model as the in-domain recovery.We simulate MCSR under several scenarios to show the performance.The result indicates that the proposed algorithm can reduce the recovery time and packet loss efficiently, while enhancing the utilization rate of resources. It reaches the requirements of multi-fault recovery efficiency. Through the QoSP analyzing, the article compares the performance between Haskin's model and the MCSR algorithm. The comparing results proves that the proposed algorithm fulfil the fast fault recovery as well as the QoSP requirement.
Keywords/Search Tags:MPLS, fast reroute, Makam, Haskin, multi-fault recovery, MCSR algorithm, QoSP
PDF Full Text Request
Related items