| 时延约束费用最小路由选择算法 |
| |
| 引用本文： | 刘陈,王慧军,吴成林.时延约束费用最小路由选择算法[J].南京邮电大学学报(自然科学版),2001,21(1):32-36. |
| |
| 作者姓名： | 刘陈 王慧军 吴成林 |
| |
| 作者单位： | 1. 南京邮电学院教务处,
2. 南京邮电学院电子工程系, |
| |
| 基金项目： | 原邮电部中青年教师科研基金 !(97部 13)资助项目 |
| |
| 摘 要： | 给出了两种新的边选择函数———费用下限函数 (LBC)和最大剩余时延 费用下限函数 (LBC RDM) ,并提出了时延约束费用最小路由的DCLC LBC和DCLC LBCRDM算法 ,大量随机网络模拟结果表明 ,DCLC LBC和DCLC LBCRDM算法性能相近 ,在费用竞争性和平均路由长度等指标上均明显好于目前的DCLC RDM算法
|
| 关 键 词： | 服务质量 路由 边选择函数 |
| 文章编号： | 1000-1972(2001)01-0032-05 |
| 修稿时间： | 2000年7月9日 |
Delay-Constrained Least-Cost Routing Algorithms |
| |
| LIU Chen ,WANG Hui-jun ,WU Cheng-lin.Delay-Constrained Least-Cost Routing Algorithms[J].Journal of Nanjing University of Posts and Telecommunications,2001,21(1):32-36. |
| |
| Authors: | LIU Chen WANG Hui-jun WU Cheng-lin |
| |
| Institution: | LIU Chen 1,WANG Hui-jun 2,WU Cheng-lin 2 1.Department of Educational Administration,Nanjing University of Posts and Telecommunications,Nanjing 210003,China 2.Department of Electronic Engineering,Nanjing University of Posts and Telecommunicati |
| |
| Abstract: | Two new preferred link functions,LBC(low bound on cost)and LBC RDM (low bound on cost-residual delay maximum)are presented.Based on LBC and LBR RDM ,two algorithms DCLC-LBC and DCLC-LBCRDM are proposed for delay-constrained least-cost routing.The simulation results of random networks show that the performance of DCLC-LBC and DCLC-LBCRDM are comparable and both are much better than the existing algorithm DCLC-RDM. |
| |
| Keywords: | Quality of service Routing Preferred link function |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
