The critical link routing algorithm for interference minimizing has made a great success in optimizing the efficiency of network resources usage. Its method of critical links identification, however, is not very accurate in some circumstances, and it does not consider much about load balancing. This paper presents a new level based Δ-critical links routing algorithm for interference minimizing, of which the algorithm can identify critical links more precisely in some circumstances, and can perform load balancing better. Simulation results show that the algorithm proposed performs better in the resource utilization efficiency and load balancing.