A preferred link functions for delay-constrained least-cost routing

This paper presents two new preferred link functions: LBC(low bound on cost) and LBC/sub RDM/ (low bound on cost-residual delay maximum). Based on LBC and LBC/sub RDM/, we propose two algorithms DCLC LBC and DCLC LBCRDM for delay constrained least cost routing. The computation results of random networks show that the performances of DCLC LBC and DCLC LBCRDM are comparable, and they are obviously better than the algorithm DCLC-RDM.