【摘要】 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算法是一种精确的启发式算法更多还原

【Abstract】 The DCLC routing problem in QoS routing is NP-complete. In this paper, We present a heuristic solution which is polynomial complexity, called the dela y-constrained least-cost routing based on selective function (DCLC-SF) algori thm. The DCLC-SF is source routing algorithm, based on simple selective functio n. The computation complexity of DCLC-SF is O(3ne).Simalation results prove tha t DCLC-SF is effective and accurate.更多还原