• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Ubiquitous and Future Networks >Path restoration in source routed software defined networks
【24h】

Path restoration in source routed software defined networks

机译：源路由软件定义网络中的路径恢复

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

摘要

Software defined networks have a central controller and central view of the network, allowing for source routing to be used as a scalable routing technique instead of the traditional destination based forwarding. However, with source routing the switches are reduced to simple forwarding devices, incapable of finding alternate paths in the event of link failures. In this paper we look at techniques to provide resiliency when packets are in transit and a network link failure occurs. Path restoration is one such mechanism wherein we use a bypass path for the failed link. Such bypass paths are stored locally on each of the switches, for all of its outgoing links. This mechanism ensures that the recovery mechanism is scalable since it avoids contacting the controller and takes local corrective measures. We have proposed two approaches for storing the bypass paths. In the first method we store the bypass path between all pairs of nodes. In the second method we store the bypass paths between few selected nodes. These node are the two hop neighbors, chosen using either the two colorable graph approach or the vertex cover approach. Our analysis shows that the second method, using the vertex cover approach reduces the total number of bypass paths stored, without compromising the resiliency. Also our solutions are topology dependent and not path dependent, allowing for most of the computations to be done proactively.
机译：软件定义的网络具有中央控制器和网络的中央视图，从而允许将源路由用作可伸缩路由技术，而不是传统的基于目标的转发。但是，通过源路由，交换机被简化为简单的转发设备，如果出现链路故障，则无法找到备用路径。在本文中，我们着眼于在数据包传输过程中以及网络链路发生故障时提供弹性的技术。路径恢复就是这样一种机制，其中我们对故障链接使用旁路路径。对于其所有出站链路，此类旁路路径均本地存储在每个交换机上。该机制可确保恢复机制具有可伸缩性，因为它避免了与控制器的接触并采取了局部纠正措施。我们提出了两种存储旁路路径的方法。在第一种方法中，我们存储所有节点对之间的旁路路径。在第二种方法中，我们存储一些选定节点之间的旁路路径。这些节点是使用两个可着色图形方法或顶点覆盖方法选择的两个跃点邻居。我们的分析表明，使用顶点覆盖方法的第二种方法可以减少所存储的旁路路径的总数，而不会影响弹性。同样，我们的解决方案与拓扑有关，与​​路径无关，因此可以主动进行大多数计算。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号