在共享风险链路组的约束下，提出了一种共享路径的联合路由算法。该算法使用一种新的K对路由来选择最小代价的工作路由和风险分离的保护路由对。仿真表明，该算法能启发式地接近最佳性能，并能在资源利用率、阻塞率和保护切换时间之间进行性能折中。This paper proposes a Joint Routing Algorithm (JRA) for shared-path under Shared Risk Link Group (SRLG) constraints. JRA uses a novel K-Paths-Pairs (KPP) routing to select the minimum cost primary and SRLG-disjoint backup paths pair for each connection request. Under dynamic traffic with different load, the performances of JRA have been investigated via simulations. The results show that JRA not only can near the optimal performances but also can make the tradeoffs between the resource utilization ratio (or blocking ratio) and the protection-switching time.