On the basis of minimum cut theory, the article proposes a min-cut multi-path (MCMP) routing algorithm, which select key paths of small quantity and distribute traffic evenly among the paths. MCMP is apt to implement and control congestion at bottleneck links. With real traffic datasets, experiments are carried on European and North American backbone networks. By comparisons with OSPF (open shortest path first) routing algorithm commonly used in intra-domain network and a multi-path routing algorithm used in optimal model, the maximum link load resulted from MCMP routing algorithm decreases over 41% and 20% separately.