A Heuristic Algorithm on QoS Routing

This paper focuses on solving the delay-constratined least-cost routing problem,and propose a simple,distributed heuristic solution,called distributed recursive delay-constriained least-cost (DR-DCLC)unicast routing algorithm.DR-DCLC only requires local information to find the near-optimal solution.The correctness of DR-DCLC is proued by showing that it is always capable of constructing a loop-free delay-constrained path within finite time,if such a path exists,Simulation is also used to compare DR-DCLC to the optimal DCLC algorithm and other algorithms.