Routing for Multi-Constrained Path Problem with Imprecise Additive Link State Information
This paper discusses the NP-complete multiconstrained path problem with imprecise state information, and a heuristic pre-computation algorithm based on flooding with imprecise additive link state information is presented. This algorithm uses limited flooding policy based on selective non-dominated path and can find paths from present node to all other nodes only running once. And the algorithm deals with imprecise additive link state information without any imprecision assumption. Selecting limited non-dominated paths kept at each node reduces space complexity and limited usage time of each link during a routing computation reduces time complexity. Several simulations indicate that the algorithm is efficient, scaleable, and can provide satisfied call acceptance probability with imprecise additive link state information.
QoS routing multi-constrained path flooding precomputation imprecise state information
Xin Jin
Physics & Electronics Information Technology Department Xiangfan University Xiangfan, Hubei, China
国际会议
太原
英文
472-475
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）