单点网络恢复算法的设计与分析

C. E. Chow, A. Hansmats
{"title":"单点网络恢复算法的设计与分析","authors":"C. E. Chow, A. Hansmats","doi":"10.1109/PCCC.1999.749440","DOIUrl":null,"url":null,"abstract":"To improve the reliability, broadband optical networks require fast restoration from single-link failures, node failures and multiple-link failures. This paper presents two distributed network restoration algorithms based on the one prong approach. DFOP uses a depth first search approach with a time-out mechanism to collect more network topology information. BFOP uses a breadth first search approach and a time-out mechanism to explore restoration paths with shorter hop count to reduce spare usage. They can handle single-link failures, node failures, multiple link failures and area failures. Comparisons of these algorithms with an adaptive one prong algorithm are also presented.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Design and analysis of one prong network restoration algorithms\",\"authors\":\"C. E. Chow, A. Hansmats\",\"doi\":\"10.1109/PCCC.1999.749440\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To improve the reliability, broadband optical networks require fast restoration from single-link failures, node failures and multiple-link failures. This paper presents two distributed network restoration algorithms based on the one prong approach. DFOP uses a depth first search approach with a time-out mechanism to collect more network topology information. BFOP uses a breadth first search approach and a time-out mechanism to explore restoration paths with shorter hop count to reduce spare usage. They can handle single-link failures, node failures, multiple link failures and area failures. Comparisons of these algorithms with an adaptive one prong algorithm are also presented.\",\"PeriodicalId\":211210,\"journal\":{\"name\":\"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-02-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1999.749440\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1999.749440","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

为了提高可靠性,宽带光网络需要从单链路故障、节点故障和多链路故障中快速恢复。本文提出了两种基于单叉法的分布式网络恢复算法。DFOP使用深度优先搜索方法和超时机制来收集更多的网络拓扑信息。BFOP使用广度优先搜索方法和超时机制来探索跳数较短的恢复路径,以减少空闲使用。它们可以处理单链路故障、节点故障、多链路故障和区域故障。并将这些算法与自适应单叉算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Design and analysis of one prong network restoration algorithms
To improve the reliability, broadband optical networks require fast restoration from single-link failures, node failures and multiple-link failures. This paper presents two distributed network restoration algorithms based on the one prong approach. DFOP uses a depth first search approach with a time-out mechanism to collect more network topology information. BFOP uses a breadth first search approach and a time-out mechanism to explore restoration paths with shorter hop count to reduce spare usage. They can handle single-link failures, node failures, multiple link failures and area failures. Comparisons of these algorithms with an adaptive one prong algorithm are also presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An optical layer protocol for lightpath management in WDM networks PDATS II: improved compression of address traces An adaptive distributed channel allocation strategy for mobile cellular networks Validation of Turandot, a fast processor model for microarchitecture exploration Sectored renaming for superscalar microprocessors
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1