Distributed resilient architecture for Ethernet networks

J. Farkas, Csaba Antal, Gábor Tóth, L. Westberg
{"title":"Distributed resilient architecture for Ethernet networks","authors":"J. Farkas, Csaba Antal, Gábor Tóth, L. Westberg","doi":"10.1109/DRCN.2005.1563919","DOIUrl":null,"url":null,"abstract":"The authors proposed an enhanced resilient Ethernet architecture that is based on multiple pre-established spanning trees to connect a set of edge nodes. Fast failover is achieved so that edge nodes switch to a non-affected tree after a link or node failure. A fast and robust procedure was also proposed for edge nodes to detect failures and notify other edge nodes. The other contribution of the paper is an algorithm that calculates multiple spanning trees for input topologies so that at least one tree provides connectivity after a node or a link failure. The algorithm provides minimal number of spanning trees to make input networks fault tolerant. The performance of the algorithm was tested via simulations.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRCN.2005.1563919","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 27

Abstract

The authors proposed an enhanced resilient Ethernet architecture that is based on multiple pre-established spanning trees to connect a set of edge nodes. Fast failover is achieved so that edge nodes switch to a non-affected tree after a link or node failure. A fast and robust procedure was also proposed for edge nodes to detect failures and notify other edge nodes. The other contribution of the paper is an algorithm that calculates multiple spanning trees for input topologies so that at least one tree provides connectivity after a node or a link failure. The algorithm provides minimal number of spanning trees to make input networks fault tolerant. The performance of the algorithm was tested via simulations.
以太网的分布式弹性架构
作者提出了一种增强的弹性以太网架构,该架构基于多个预先建立的生成树来连接一组边缘节点。实现快速故障转移,以便在链路或节点故障后边缘节点切换到不受影响的树。同时,提出了一种快速、鲁棒的边缘节点故障检测方法。本文的另一个贡献是计算输入拓扑的多个生成树的算法,以便在节点或链路故障后至少有一棵树提供连接。该算法提供了最少数量的生成树,使输入网络具有容错性。通过仿真测试了该算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信