• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on the Design of Reliable Communication Networks >The Minimum Cost D-Geodiverse Anycast Routing with Optimal Selection of Anycast Nodes
【24h】

The Minimum Cost D-Geodiverse Anycast Routing with Optimal Selection of Anycast Nodes

机译：最优选播节点的最小成本D-Geodiverse选播路由

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Consider a geographical network with associated link costs. In anycast routing, network nodes are partitioned into two sets - the source nodes and the anycast (destination) nodes - and the traffic of each source node is routed towards the anycast node providing the minimum routing cost path. By considering a given geographical distance parameter D, we define an anycast routing solution as D-geodiverse when for each source node there are two routing paths, each one towards a different anycast node, such that the geographical distance between the two paths is at least D. Such a solution has the property that any disaster with a coverage diameter below D affecting one routing path (but without involving neither the source node nor its entire set of outgoing links) cannot affect the other path, enhancing in this way the network robustness to natural disasters. The selection of the anycast nodes has an impact both on the feasibility and cost of a D- geodiverse anycast routing solution. Therefore, for a desired number of anycast nodes R, we define the minimum cost D- geodiverse anycast problem (MCD-GAP) aiming to identify a set of R anycast nodes that obtain a minimum cost routing solution. The problem is defined based on integer linear programming and is extended to consider the existence of vulnerability regions in the network, i.e., by imposing the geographical distance D only between network elements belonging to the same region. We present computational results showing the tradeoff between D and R in the optimal solutions obtained with and without vulnerability regions.
机译：考虑具有相关链接成本的地理网络。在任播路由中，网络节点被分为两组-源节点和任播（目标）节点-每个源节点的流量都被路由到任播节点，从而提供了最小的路由成本路径。通过考虑给定的地理距离参数D，当对于每个源节点都有两条路由路径（每条路径指向不同的任播节点）时，我们将任播路由解决方案定义为D-geodiverse，这样两条路径之间的地理距离至少为D.这种解决方案具有以下特性：覆盖直径小于D的任何灾难都影响一条路由路径（但不涉及源节点或其整个出站链路集）都不会影响另一条路径，从而增强了网络的健壮性遭受自然灾害。选播节点的选择对D地理分集选播路由解决方案的可行性和成本都有影响。因此，对于所需数量的任意播节点R，我们定义了最低成本D地理分集任意播问题（MCD-GAP），旨在识别一组获得最低成本路由解决方案的R个任意播节点。该问题是基于整数线性规划来定义的，并且被扩展为考虑网络中易受攻击区域的存在，即通过仅在属于同一区域的网络元素之间施加地理距离D来考虑该问题。我们提供了计算结果，显示了在有和没有脆弱区域的情况下，在最佳解决方案中D和R之间的权衡。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号