Title :
A cost transformation based routing mechanism and its applications on constraint-routing problems
Author :
Wang, Jian ; Dong, Yu
Author_Institution :
Telecommun. & Inf. technol. Inst., Florida Int. Univ., USA
Abstract :
In this paper, we discuss a cost transformation based routing mechanism. The idea is to transform any traffic engineering (TE) routing problem to a known (e.g. shortest path routing) problem, such that a solution to the known problem is a sub-optimal solution to the original. Instead of relying on human to "guess" the best transformation function for each practical problem; we developed a numerical search mechanism to automatically discover the function. So far, we have tested this mechanism on four routing problems-among them are some classic constraint-routing problems and an emerging dual-path routing problem-and the results are comparable or better than those from some well-known heuristics. More importantly, these example applications showcase how routing solutions are achieved with minimum human intervention.
Keywords :
Internet; constraint theory; search problems; telecommunication network routing; telecommunication traffic; TE; constraint-routing problem; cost transformation based routing mechanism; dual-path routing problem; numerical search mechanism; traffic engineering; Bandwidth; Costs; Humans; Information technology; Protection; Quality management; Routing; Telecommunication traffic; Tellurium; Testing;
Conference_Titel :
Next Generation Internet Networks, 2005
Print_ISBN :
0-7803-8900-X
DOI :
10.1109/NGI.2005.1431667