A New Heuristics for Finding the Delay Constrained Least Cost Path

Document Type

Conference Proceeding

Publication Date

1-1-2003

Abstract

In this paper, we investigate the problem of finding the Delay Constrained Least Cost path (DCLC) in a network, which is NT-complete and has been extensively studied. Many proposed algorithms tackle this problem by transforming it into the shortest path selection problem or the k-shortest paths selection problem, which are P-complete, with an integrated weight function that maps the delay and cost each link into a single weight. However, they suffer from either high computational complexity or low success ratio in finding the optimal paths (the least cost path satisfying a given delay constraint). Based on the Extended Bellman-Ford (EB) algorithm, we propose a high performance algorithm, Dual Extended Bellman-Ford (DEB) algorithm, which achieves a high success ratio in finding the least cost path subject to a delay constraint with low computational complexity. Extensive simulations show that DEB outperforms its contender on all the worst-case computational complexity, average cost of the solutions, and the success ratio in finding the delay constrained least cost path.

Identifier

0842332372 (Scopus)

Publication Title

Globecom IEEE Global Telecommunications Conference

First Page

3711

Last Page

3715

Volume

7

This document is currently not available here.

Share

COinS