...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of communication systems >A new approach for fast segment-based protection in WDM mesh networks
【24h】

A new approach for fast segment-based protection in WDM mesh networks

机译：WDM网状网络中基于分段的快速保护的新方法

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

摘要

We propose a new approach for developing segment-based schemes for protection against single link/node failure in wavelength division multiplexing (WDM) mesh networks. In the proposed approach, every request is allocated a pair of link disjoint but most coupled primary and backup paths. Two paths are said to be most coupled if they share the maximum number of end nodes of some existing requests. Coupled paths reduce the total number of hops need to be traversed by a failure signal and, hence, potentially reduces the overall recovery time. We show that the problem of finding a pair of disjoint and most coupled paths is NP-complete. Accordingly, we propose an efficient and fast protection algorithm called SPXP-Segment Pre-Cross-Connected Protection, to allocate disjoint and most coupled paths. The proposed SPXP algorithm reduces the recovery time by ensuring that backup resources are pre-configured along each backup segment and, hence, is readily available upon a failure. Simulation results for different incremental traffic models and network topologies show that, for most cases, the proposed SPXP exhibits better performance in terms of blocking probability, resource usage, and recovery time compared with existing protection schemes.
机译：我们提出了一种新的方法来开发基于段的方案，以防止波分复用（WDM）网状网络中的单链路/节点故障。在提出的方法中，为每个请求分配了一对不相交但最耦合的主路径和备用路径。如果两个路径共享某些现有请求的最大末端节点数，则称这两个路径耦合性最高。耦合路径减少了故障信号需要穿越的总跳数，因此有可能减少总体恢复时间。我们表明，找到一对不相交且耦合最强的路径的问题是NP完全的。因此，我们提出了一种高效且快速的保护算法，称为SPXP段预交叉连接保护，以分配不相交的路径和最耦合的路径。所提出的SPXP算法通过确保在每个备份段上预先配置了备份资源，从而减少了恢复时间，因此在发生故障时可以随时使用。不同增量流量模型和网络拓扑的仿真结果表明，在大多数情况下，与现有的保护方案相比，建议的SPXP在阻塞概率，资源使用和恢复时间方面均表现出更好的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号