MPLS enables service providers to meet challenges brought about by explosive growth and provides the opportunity for differentiated services without necessitating the sacrifice of the existing infrastructure. MPLS is a highly scalable data carrying mechanism which forwards packets to outgoing interface based only on label value .MPLS network has the capability of routing with some specific constraints for supporting desired QoS. In this paper we will compare recent QoS Routing Algorithms for MPLS Networks. We are presenting simulation results which will focus on the computational complexity of each algorithm, performances under a wide range of workload, topology and system parameters.