The goal of QoS routing is to find a loopless path through a network that can satisfy a given set of constraints on parameters such as bandwidth, delay and cost. QoS routing algorithms can be classified into three categories. They are Source routing, Distributed routing and Hierarchical routing. In this paper we propose a distributed QoS routing algorithm that gives high call admission rates in a congested network for constraints on metrics like bandwidth, buffer, and CPU usage with a low message complexity.