• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

用于可靠波分复用网状网络的动态段共享保护算法

Dynamic segment shared protection algorithm for reliable wavelength-division-multiplexing mesh networks.

作者信息

Cao Jin, Guo Lei, Yu Hongfang, Li Lemin

出版信息

Opt Express. 2005 Apr 18;13(8):3087-95. doi: 10.1364/opex.13.003087.

DOI:10.1364/opex.13.003087
PMID:19495205
Abstract

With the maturation of the technology of Wavelength-Division-Multiplexing (WDM) in optical networks, the survivable design has become a key issue. In this paper, we propose a Segment Shared Protection Algorithm (SSPA), which is based on the reliability of the networks and the different levels of the fault tolerance requested by the users, to protect the single-link failure in WDM optical networks. The main idea of the SSPA is to provide a backup path for a segment, which is divided in accordance with the policy of the Differentiated Reliability (DiR), on the primary path of each connection request. Under the guarantee of the blocking probability and the connection's reliability, the SSPA has higher resource utilization ratio and faster recovery time than the previous algorithm PSPA-DiR. We evaluate the effectiveness of the SSPA and the results are found to be promising.

摘要

随着光网络中波分复用(WDM)技术的成熟,可生存性设计已成为一个关键问题。在本文中,我们提出了一种段共享保护算法(SSPA),该算法基于网络的可靠性以及用户所要求的不同容错级别,用于保护WDM光网络中的单链路故障。SSPA的主要思想是在每个连接请求的主路径上,为根据差异化可靠性(DiR)策略划分的段提供一条备份路径。在阻塞概率和连接可靠性的保证下,SSPA比先前的算法PSPA-DiR具有更高的资源利用率和更快的恢复时间。我们评估了SSPA的有效性,结果很有前景。

相似文献

1
Dynamic segment shared protection algorithm for reliable wavelength-division-multiplexing mesh networks.用于可靠波分复用网状网络的动态段共享保护算法
Opt Express. 2005 Apr 18;13(8):3087-95. doi: 10.1364/opex.13.003087.
2
Joint routing-selection algorithm for a shared path with differentiated reliability in survivable wavelength-division-multiplexing mesh networks.可生存波分复用网状网络中具有差异化可靠性的共享路径联合路由选择算法
Opt Express. 2004 May 31;12(11):2327-37. doi: 10.1364/opex.12.002327.
3
A new heuristic algorithm with shared segment-backup paths for trap avoidance in survivable optical networks.一种用于可生存光网络中避免陷阱的具有共享段备份路径的新型启发式算法。
Opt Express. 2006 Nov 13;14(23):10990-5. doi: 10.1364/oe.14.010990.
4
Path protection algorithm with trade-off ability for survivable wavelength-division-multiplexing mesh networks.具有权衡能力的可生存波分复用网状网络路径保护算法
Opt Express. 2004 Nov 29;12(24):5834-9. doi: 10.1364/opex.12.005834.
5
Hybrid survivable configuration for optical wavelength-division-multiplexing mesh networks.用于光波长分复用网状网络的混合可生存配置
Opt Express. 2007 Feb 5;15(3):834-8. doi: 10.1364/oe.15.000834.
6
Dynamic lightpath provisioning with signal quality guarantees in survivable translucent optical networks.在可生存半透明光网络中具有信号质量保证的动态光路配置
Opt Express. 2005 Dec 26;13(26):10457-68. doi: 10.1364/opex.13.010457.
7
Crosstalk Analysis and Performance Evaluation for Torus-Based Optical Networks-on-Chip Using WDM.基于环面的片上光波分复用网络的串扰分析与性能评估
Micromachines (Basel). 2020 Oct 31;11(11):985. doi: 10.3390/mi11110985.
8
A novel multicast routing algorithm and its application for protection against single-link and single-link/node failure scenarios in optical WDM mesh networks.一种新型组播路由算法及其在光WDM网状网络中针对单链路和单链路/节点故障场景的保护应用。
Opt Express. 2011 Dec 12;19(26):B471-7. doi: 10.1364/OE.19.00B471.
9
Wavelength-division-multiplexing optical packet switch with heterogeneous wavelength conversion capabilities.具有异构波长转换能力的波分复用光分组交换机。
Appl Opt. 2007 Dec 1;46(34):8218-28. doi: 10.1364/ao.46.008218.
10
On-chip multiplexing conversion between wavelength division multiplexing-polarization division multiplexing and wavelength division multiplexing-mode division multiplexing.芯片上的波分复用-偏振分复用和波分复用-模式复用之间的复用转换。
Opt Lett. 2014 Feb 15;39(4):758-61. doi: 10.1364/OL.39.000758.