MPLS, a next generation backbone architecture, can speed up packet forwarding to destination by label switching. However, if there exists no backup LSP when the primary LSP fails, MPLS frames cannot be forwarded to destination. Therefore, fault recovery has become an important research area in MPLS Traffic Engineering. Makam approach and Haskin approach are the most famous two among the previous literatures. Besides, IETF has made strict definitions for MPLS Recovery in RFC 3469 in February, 2003. We propose a Reverse Labeling Scheme to handle fault recovery in this thesis. We establish a virtual reverse LSP along the completely reverse direction of the primary path. When there is a link failure in the primary LSP, LSR will forward packets back to Ingress by virtual reverse LSP instead of using the primary LSP. This idea of building virtual reverse LSP makes Haskin approach practical in implementation. In addition, we save network resources by designing a scheme such that LSR is easier to convert from the primary LSP to the backup LSP. In order to solve the out-of-order packets in Haskin approach, Hundessa adds buffering on every LSR. The buffer can temporarily store the packets once a link failure has been detected. By adopting the basic idea of Hundessa approach, we embed our Reverse Labeling Scheme and implement it on Linux platform. We also make some modifications to solve the buffering problems. Finally, we demonstrate this Reverse Labeling Scheme by several experiments. We not only show the low packet loss rate, but also solve the packet out-of-order problems. The significant decrease of out-of-order packets can further improve the efficiency of TCP flow transmission.