| 本文已被：浏览 5479次 下载 6352次 |
码上扫一扫！ |
|
|
| 基于矢量测量的多约束路径选择 |
|
郑彦兴1,2, 汪晓庆2,3, 田菁4
|
|
1.国防科学技术大学,计算机学院,湖南,长沙,410073;2.北京系统工程研究所,北京,100101;3.清华大学,计算机科学与技术系,北京,100084;4.国防科学技术大学,机电工程与自动化学院,湖南,长沙,410073
|
|
| 摘要: |
| 多约束路径(multi-constrained path,简称MCP)选择问题是QoS路由问题面临的重要挑战之一.现有的MCP算法不能兼顾降低计算复杂性、提高响应速度和防止可行解丢失等方面的缺点.另外,单纯依靠线性路径长度方程(LPLF)或非线性路径长度方程(NLPLF)都不能有效解决QoS路由问题.定义了崭新的法线测量路径长度方程,并基于该方程提出了解决m约束MCP问题的NMMCP(normal measure based MCP)算法.NMMCP不仅是在线计算与预计算,同时也是LPLF与NLPLF的良 |
| 关键词: 多约束路径选择 多目标优化 Pareto最优 前瞻 |
| DOI： |
| 分类号: |
| 基金项目: |
|
| Normal Measure Based Multi-Constrained Path Selection |
|
ZHENG Yan-Xing,WANG Xiao-Qing,TIAN Jing
|
| Abstract: |
| 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. |
| Key words: multiple-constrained path selection multiple objective optimization Pareto optimal look-ahead |
