Mpls / Gmpls-based Fault Recovery

With the development of the network, many new network technologies emerge as the times require. Moreover, an initial design of a network may not be satisfactory due to changes in offered load, traffic characteristics, etc. Network resources also vary due to resource reservation and topology changes (such as node or link failures). An important part of designing the next generation QoS network concerns its reliability, which can be provided through fault management mechanisms, applied at different MPLS and the extended Generalized MPLS (GMPLS) provide fast mechanisms for recovery from failures by establishing redundant Label Switch Paths as backup paths. With these backups, traffic can always be redirected in case of failure.The main objective of this thesis is to improve some of the current MPLS/GMPLS fault recovery methods, in order to support the protection requirements of the new Internet services. Therefore, the definition and evaluation of the quality of protection provided by each fault recovery model is a main objective of this work. Some parameters, such as fault recovery time, packet loss or resource consumption, all within the scope of this quality of protection, are considered. Throughout this work, different analyses and cases supporting these decisions are presented.The thesis introduces fault recovery model first, including the architecture of the fault recovery model, the sort of the fault recovery, the main fault recovery model in MPLS/GMPLS network, and extend the fault recovery model of MPLS to optical network. This paper also introduces the Restorable routing algorithm of QoS, and then defines the reliability and the availability in detail, including a few conceptions of measuring the network reliability and how to compute the failure rate. This paper stresses on the how to reduce the failure probability, explain and analyze using a simple case. In the end, we discuss the complete process of the fault recovery based on MPLS/GMPLS andput forward a GMPLS Fault Recovery Algorithm with QoS guaranteed and based on Constrained.