| DCLC路由的选择函数法DCLC-SF |
| |
| 引用本文： | 王征应,石冰心,马涛.DCLC路由的选择函数法DCLC-SF[J].小型微型计算机系统,2000,21(12):1267-1269. |
| |
| 作者姓名： | 王征应 石冰心 马涛 |
| |
| 作者单位： | 华中理工大学电信系,武汉,430074 |
| |
| 摘 要： | QoS路由的DCLC(Delay-Constrained Least-Cost Routing)路由问题是一个NP--完全问题。本文提出了一种多项式复杂度的启发式算法DCLC-SF(Delay-Constrained Least-Cost Routing Based on Selective Function），DCLC-SF算法基于简单的选择函数，属于源路由算法，算法最坏情况的计算复杂度为O（3ne)。仿真实验证明DCLC-SF算法是一种精确的启发式算法。
|
| 关 键 词： | QoS路由 DCLC－SF 选择函数法 NP问题 |
| 文章编号： | 1000-1220(2000)12-1267-05 |
DCLE ROUTING ALGORITHM BASED ON SELECTIVE FUNCTION |
| |
| WANG Zheng-ying,SHI Bing-xin,MA Tao.DCLE ROUTING ALGORITHM BASED ON SELECTIVE FUNCTION[J].Mini-micro Systems,2000,21(12):1267-1269. |
| |
| Authors: | WANG Zheng-ying SHI Bing-xin MA Tao |
| |
| 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. |
| |
| Keywords: | QoS routing Unicast routing NP-complete pr oblem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
