Heuristic methods for delay constrained least cost routing using κ-shortest-paths

Author

Jia, Zhanfeng ; Varaiya, Pravin

Author_Institution

Electr. Eng. & Comput. Sci. Dept., Univ. of California, Berkeley, CA, USA

Volume

51

Issue

4

fYear

2006

fDate

4/1/2006 12:00:00 AM

Firstpage

707

Lastpage

712

Abstract

The delay constrained least cost (DCLC) problem is to find the least cost path in a graph subject to a delay constraint. First formulated in the context of routing in computer networks, the DCLC model also applies to problems of path planning and other decision problems. DCLC is NP-complete. Many heuristic methods have been proposed for it. This note presents two new methods based on the κ-shortest-path (κSP) approach. These heuristic methods-one centralized, the other distributed-are both polynomial. In numerical experiments the proposed algorithms almost always find the optimal paths.

Keywords

computational complexity; directed graphs; optimisation; NP-complete problem; centralized method; delay constrained least cost routing; directed graphs; distributed method; heuristic methods; k-shortest-path approach; least cost path; Bandwidth; Computer networks; Context modeling; Costs; Delay; Jitter; Path planning; Polynomials; Quality of service; Routing; Combinatorics; QoS routing; multicriteria optimization; routing;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/TAC.2006.872827

Filename

1618852