We propose a new dynamic routing algorithm that uses traffic and network state information to minimize the blocking rate and link congestion level. Our scheme uses the currently available link capacity in calculating the link weight by modifying Wang's approach, and computes the shortest path when a new call comes into the network. We consider the blocking count based update mechanism and the timer based mechanism, and conclude that the former is better than the latter in terms of efficiency and complexity.