Consider a directed graph G(V, E) where V is the set of nodes and E is the set of links in G. Each link (u, v) is associated with a set of k + 1 additive non-negative integer weights Cuv = (cuv, w 1 uv , w 2 uv , · · · , w k uv ). Here cuv is called the cost of link (u, v) and w i uv is called the i th delay of (u, v). Given any two distinguish nodes s and t, the QoS routing problem QSR(k) is to determine a minimum cost s − t path such that the i th delay on the path is atmost a specified bound. This problem is NP-complete. The LARAC algorithm based on a relaxation of the problem is a very efficient approximation algorithm for QSR (1). In this paper we present a generalization of the LARAC algorithm called GEN-LARAC. A detailed convergence analysis of GEN-LARAC with simulation results are given. Simulation results provide evidence of the excellent performance of GEN-LARAC. We also give a strongly polynomial time approximation algorithm for the QSR(1) problem.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.