...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Networks >Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
【24h】

Efficient heuristics for determining node-disjoint path pairs visiting specified nodes

机译：用于确定访问指定节点的节点不相交路径对的高效启发式方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A new recursive heuristic is proposed to calculate a shortest simple path, from a source node to a destination node, that visits a specified set of nodes in a network. To provide survivability to failures along the path, the proposed heuristic is modified to ensure that the calculated path can be protected by a node-disjoint backup path. Additionally, the case when both paths in the disjoint path pair are required to visit specific sets of nodes is studied and effective heuristics are proposed. An evaluation of the solutions of the heuristics is conducted by comparing with results from an integer linear programming (ILP) formulation for each of the considered problems, and also with previous heuristics. The ILP solver may require a significant amount of time to obtain a solution, especially in large networks, which justifies the need for effective, computationally efficient heuristics for solving these problems.
机译：提出了一种新的递归启发式算法，以计算从源节点到目标节点的最短简单路径，该路径访问网络中一组指定的节点。为了提供沿路径故障的可生存性，对提议的启发式方法进行了修改，以确保可以通过节点不相交的备用路径来保护所计算的路径。此外，研究了不相交路径对中的两个路径都需要访问特定节点集的情况，并提出了有效的启发式方法。通过将整数线性规划（ILP）公式的结果与每个所考虑的问题进行比较，并与以前的启发式方法进行比较，对启发式方法的解决方案进行评估。 ILP求解器可能需要大量时间才能获得解决方案，尤其是在大型网络中，这证明需要有效，计算效率高的启发式方法来解决这些问题。

著录项

  • 来源
    《Networks》 |2017年第4期|292-307|共16页
  • 作者

    Martins Lúcia; Gomes Teresa M.S.; Tipper David W.;

  • 作者单位

    Department of Electrical and Computer Engineering, University of Coimbra, Rua Sílvio Lima, Coimbra, Portugal,INESC Coimbra, Rua Sílvio Lima, Coimbra, Portugal;

    Department of Electrical and Computer Engineering, University of Coimbra, Rua Sílvio Lima, Coimbra, Portugal,INESC Coimbra, Rua Sílvio Lima, Coimbra, Portugal;

    Graduate Telecommunications and Networking Program, School of Computing and Information, University of Pittsburgh, 135 N. Bellefield Avenue, Pittsburgh, PA, United States;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    heuristics; min-sum; node-disjoint path pair; path-based formulation; Resilient routing; visiting a given set of nodes;

    机译：启发式最小和节点不相交路径对;基于路径的表述;弹性路由;访问给定的节点集;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号