## Abstract

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 C 1 additive nonnegative integer weights C_{uv} D (cuv;w^{1} uv;w^{2} _{uv}; : : : ;wk _{uv}). Here, c_{uv} is called the cost of link (u; v) and wi _{uv} is called the ith delay of (u; v). Given any two distinguish nodes s and t, the QoS routing (QSR) problem QSR(k) is to determine a minimum cost s-t path such that the ith delay on the path is atmost a specied 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 is given. Simulation results provide an evidence of the excellent performance of GEN-LARAC.We also give a strongly polynomial time approximation algorithm for the QSR(1) problem.

Original language | English (US) |
---|---|

Article number | 7103034 |

Pages (from-to) | 242-251 |

Number of pages | 10 |

Journal | IEEE Transactions on Emerging Topics in Computing |

Volume | 4 |

Issue number | 2 |

DOIs | |

State | Published - Apr 1 2016 |

## Keywords

- Combinatorial optimization
- Lagrangian relaxation,
- QoS routing
- algorithms

## ASJC Scopus subject areas

- Computer Science (miscellaneous)
- Information Systems
- Human-Computer Interaction
- Computer Science Applications