%0 Journal Article
%T Normal Measure Based Multi-Constrained Path Selection<br>基于矢量测量的多约束路径选择
%A ZHENG Yan-Xing
%A WANG Xiao-Qing
%A TIAN Jing
%A <br>郑彦兴
%A 汪晓庆
%A 田菁
%J 软件学报
%D 2007
%I 
%X Multi-constrained path (MCP) selection is one of the great challenges that QoS routing (QoSR) faces. Existing algorithms cannot make a good tradeoff among computation complexity, response speed and preventing from losing feasible solutions. Furthermore, neither linear path length function (LPLF) nor non-linear path length function (NLPLF) alone can solve QoS routing problems. A novel normal measure based path length function is defined and based on it, a normal measure based MCP (NMMCP) algorithm is proposed to solve m-constrained MCP problems. NMMCP makes a good tradeoff not only between on-demand computation and pre-computation, but also between LPLF and NLPLF based algorithms. By introducing Pareto optimal mechanism, NMMCP has nonlinear look-ahead ability. Extensive simulations show that NMMCP is very efficient when both performance and computation cost are taken into account.
%K multiple-constrained path selection
%K multiple objective optimization
%K Pareto optimal
%K look-ahead<br>多约束路径选择
%K 多目标优化
%K Pareto最优
%K 前瞻
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=12E14741D17BD620&yid=A732AF04DDA03BB3&vid=13553B2D12F347E8&iid=38B194292C032A66&sid=9BF3B0483F192149&eid=9107B2E171152411&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=4