摘要
给出了两种新的边选择函数———费用下限函数 (LBC)和最大剩余时延 费用下限函数 (LBC RDM) ,并提出了时延约束费用最小路由的DCLC LBC和DCLC LBCRDM算法 ,大量随机网络模拟结果表明 ,DCLC LBC和DCLC LBCRDM算法性能相近 ,在费用竞争性和平均路由长度等指标上均明显好于目前的DCLC
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.
出处
《南京邮电学院学报》
2001年第1期32-36,共5页
Journal of Nanjing University of Posts and Telecommunications(Natural Science)
基金
原邮电部中青年教师科研基金 !(97部 13)资助项目
