In this Thesis, we present a fault recovery mechanism by considering both local and global repairs for real-time traffic conveyed over MPLS networks. To meet the end-to-end time constraints of real-time traffic flows, once a link failure occurs, the real-time packets are sent via the most nearby local repair path if one can be identified, while at the same time the probe packets are sent to the Egress router over every possible local repair paths. By monitoring all of the incoming probe packets, the Egress router can determine which path is the most suitable repair path using the minimum-delay-deviation criterion and then sends out all the remaining packets over the new path. To fulfill the delay requirements of real-time flows whenever link failures occur, the probe packets need to be periodically sent out to reflect the dynamic change of traffic loads on the pre-established LSPs. The simulation results, after running on the MSN, have demonstrated that our recovery scheme not only forwards the packets of real-time flows in time over the local repair paths, but also prevents them from possible out-of-order situations. Besides, the proposed scheme of dynamic rerouting assist us in achieving the end-to-end delay guarantee for real-time traffic on MPLS networks.