Abstract: A new minimum interference routing algorithm P-DMIR (profile-dynamic minimum interference routing) was proposed, which is divided into offline and online stages. In the offline stage the critical values of all links are determined with both the topology information and traffic profile introduced to make the algorithm available to process more information concretely without increased complexity. In the online stage the cost function coefficient of every link is calculated according to the types of the services on arrival, then the weights of links are calculated according to the reciprocal of available bandwidth and the critical value of every link so as to minimize the interference with the algorithm complexity reduced. Furthermore, the updating mechanism is provided regularly via the critical values of links, thus making the traffic profile instant and accurate. The simulation results showed that P-DMIR can allocate the different traffic flows to different paths rationally and avoid the network congestion effectively, and that it is superior to conventional algorithms in respect to the reject rate of requests and throughput of network.