A protection algorithm for mesh virtual ring based on spanning tree

ZHANG Pei; DING Yan; WAN Li-hong; GU Wan-yi

doi:10.13756/j.gtxyj.2004.06.004

您当前的位置：

首页 >

文章列表页 >

A protection algorithm for mesh virtual ring based on spanning tree

- A protection algorithm for mesh virtual ring based on spanning tree
- Study on Optical communication Issue 6, Pages: 10-12(2004)
- 作者机构：
  
  1. 北京邮电大学光通信中心
  2. 北京邮电大学光通信中心北京　100876
- 作者简介：
- 基金信息：
- DOI：10.13756/j.gtxyj.2004.06.004
  CLC： TN915
- Published：2004，
扫描看全文
[1]张沛,丁焰,宛丽宏,顾畹仪.基于生成树的mesh网虚环保护算法[J].光通信研究,2004(06):10-12+26.

ZHANG Pei, DING Yan, WAN Li-hong, et al. A protection algorithm for mesh virtual ring based on spanning tree. [J]. (6):10-12(2004)
[1]张沛,丁焰,宛丽宏,顾畹仪.基于生成树的mesh网虚环保护算法[J].光通信研究,2004(06):10-12+26. DOI： 10.13756/j.gtxyj.2004.06.004.

ZHANG Pei, DING Yan, WAN Li-hong, et al. A protection algorithm for mesh virtual ring based on spanning tree. [J]. (6):10-12(2004) DOI： 10.13756/j.gtxyj.2004.06.004.

摘要

波分复用（WDM）全光网是下一代骨干网的核心

网络的生存性问题是构建WDM全光网的关键技术之一。文章对网状拓扑中的虚环保护机制进行了研究

并对一种基于生成树的虚环构成算法进行了分析。基于生成树的虚环构成算法可应用于各种网状拓扑

具有良好的适应性

同时还避免了P 圈法中复杂的"Hamilton"环的搜索问题。

Abstract

All-optical metwork of WDM is the core of next generation backbone network. This paper studied the protection mechanism for virtual ring in mesh topology

and analyzed a construction algorithm for a virtual ring based on spanning tree. This algorithm can be used in all kinds of mesh topologies

it has good adaptivity

and can avoid the issue of searching in Hamilton circle.

关键词

生成树P圈mesh网

Keywords

spanning treeP-cyclesmesh network

references

更多指标>

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

Postal code：430205
Technical support is provided by Beijing Founder electronics co., LTD 鄂ICP备2022010197 鄂公网安备 42011202002092号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.
Total Visits：75841 Visits Today：29

⁰