Enhancing fault tolerance capabilities in quorum-based cycle routing

C. J. Kleinheksel, Arun Kumar Somani
{"title":"Enhancing fault tolerance capabilities in quorum-based cycle routing","authors":"C. J. Kleinheksel, Arun Kumar Somani","doi":"10.1109/RNDM.2015.7324305","DOIUrl":null,"url":null,"abstract":"In this paper we propose a generalized R redundancy cycle technique that provides optical networks almost fault-tolerant communications. More importantly, when applied using only single cycles rather than the standard paired cycles, the generalized R redundancy technique is shown to almost halve the necessary light-trail resources in the network while maintaining the fault-tolerance and dependability expected from cycle-based routing. For efficiency and distributed control, it is common in distributed systems and algorithms to group nodes into intersecting sets referred to as quorum sets. Optimal communication quorum sets forming optical cycles based on light-trails have been shown to flexibly and efficiently route both point-to-point and multipoint-to-multipoint traffic requests. Commonly cycle routing techniques will use pairs of cycles to achieve both routing and fault-tolerance, which uses substantial resources and creates the potential for underutilization. Instead, we intentionally utilize R redundancy within the quorum cycles for fault-tolerance such that every point-to-point communication pairs occur in at least R cycles. The result is a set of R = 3 redundant cycles with 93.23-99.34% fault coverage even with two simultaneous faults all while using 38.85-42.39% fewer resources.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"165 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RNDM.2015.7324305","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper we propose a generalized R redundancy cycle technique that provides optical networks almost fault-tolerant communications. More importantly, when applied using only single cycles rather than the standard paired cycles, the generalized R redundancy technique is shown to almost halve the necessary light-trail resources in the network while maintaining the fault-tolerance and dependability expected from cycle-based routing. For efficiency and distributed control, it is common in distributed systems and algorithms to group nodes into intersecting sets referred to as quorum sets. Optimal communication quorum sets forming optical cycles based on light-trails have been shown to flexibly and efficiently route both point-to-point and multipoint-to-multipoint traffic requests. Commonly cycle routing techniques will use pairs of cycles to achieve both routing and fault-tolerance, which uses substantial resources and creates the potential for underutilization. Instead, we intentionally utilize R redundancy within the quorum cycles for fault-tolerance such that every point-to-point communication pairs occur in at least R cycles. The result is a set of R = 3 redundant cycles with 93.23-99.34% fault coverage even with two simultaneous faults all while using 38.85-42.39% fewer resources.
增强基于群体的周期路由的容错能力
本文提出了一种广义R冗余循环技术,该技术可提供光网络几乎容错的通信。更重要的是,当仅使用单周期而不是标准成对周期时,广义R冗余技术被证明可以在保持基于周期的路由所期望的容错性和可靠性的同时,将网络中必要的轻路径资源减少近一半。为了提高效率和分布式控制,在分布式系统和算法中,将节点分组为称为仲裁集的相交集是很常见的。基于光迹形成光周期的最优通信仲裁集已被证明可以灵活有效地路由点对点和多点对多点的业务请求。通常,循环路由技术将使用对循环来实现路由和容错,这将使用大量资源,并可能导致未充分利用。相反,我们有意在仲裁周期内利用R冗余来实现容错,以便每个点对点通信对至少在R个周期内发生。结果是一组R = 3个冗余循环,即使同时发生两个故障,故障覆盖率也达到93.23-99.34%,而使用的资源却减少了38.85-42.39%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信