Qo S路由的 DCL C(Delay- Constrained L east- Cost Routing)路由问题是一个 NP—完全问题 .本文提出了一种多项式复杂度的启发式算法 DCL C- SF(Delay- Constrained L east- Cost Routing Based on Selective Function) ,DCL C- SF算法基于简单的选择函数 ,属于源路由算法 ,算法最坏情况的计算复杂度为 O(3ne) .仿真实验证明 DCL C- SF算法是一种精确的启发式算法 The routing problem of Delay-Constrained L-Cost-Routing (DCL C) for Qo S routing is an NP-complete problem. In this paper, we present a heuristic algorithm called DCL C SF (Delay-Constrained L east-Cost Routing) Based on a simple selection function, the DCL C-SF algorithm belongs to the source routing algorithm and its worst-case computation complexity is O (3ne). The simulation results show that the DCL C-SF algorithm is a precise inspiration Algorithm