Finding Delay-constrained Cost-optimization Path

LANGUAGE
English
SOURCE
Proc. APCC'2001, Sept. 2001, Tokyo, Japan.
Published Date:2001-09-16
ABSTRACT
In this paper, we propose a heuristic algorithm to deal with the problem of finding delay-constrained cost-optimization path in communication networks, which is a NP-complete problem. Our algorithm uses an adjustable parameter to control the tradeoff between the probability of finding the optimal path and complexity. Simulation results show that, with relatively low complexity, the probability of finding the optimal path is high.
KEYWORDS
DCCOP, NP-complete, heuristic.