VCube:一种可证明可扩展的分布式诊断算法

E. P. Duarte, L. C. E. Bona, Vinicius K. Ruoso
{"title":"VCube:一种可证明可扩展的分布式诊断算法","authors":"E. P. Duarte, L. C. E. Bona, Vinicius K. Ruoso","doi":"10.1109/ScalA.2014.14","DOIUrl":null,"url":null,"abstract":"VCube is a distributed diagnosis algorithm for virtually interconnecting network nodes. VCube presents several logarithmic properties, and is a logical hypercube when all nodes are fault-free. VCube is dynamic in the sense that nodes can leave and rejoin the system as they become faulty and are repaired. The topology re-organizes itself and keeps its logarithmic properties even if an arbitrary number of nodes are faulty. Fault diagnosis is based on tests. All fault-free nodes of a system with N nodes detect an event with a latency of at most log22 N testing rounds. In this work we specify the algorithm and show that the worst number of tests executed is Nlog2N per log2N rounds. Besides the correctness proofs, experimental results are also given.","PeriodicalId":323689,"journal":{"name":"2014 5th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"VCube: A Provably Scalable Distributed Diagnosis Algorithm\",\"authors\":\"E. P. Duarte, L. C. E. Bona, Vinicius K. Ruoso\",\"doi\":\"10.1109/ScalA.2014.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"VCube is a distributed diagnosis algorithm for virtually interconnecting network nodes. VCube presents several logarithmic properties, and is a logical hypercube when all nodes are fault-free. VCube is dynamic in the sense that nodes can leave and rejoin the system as they become faulty and are repaired. The topology re-organizes itself and keeps its logarithmic properties even if an arbitrary number of nodes are faulty. Fault diagnosis is based on tests. All fault-free nodes of a system with N nodes detect an event with a latency of at most log22 N testing rounds. In this work we specify the algorithm and show that the worst number of tests executed is Nlog2N per log2N rounds. Besides the correctness proofs, experimental results are also given.\",\"PeriodicalId\":323689,\"journal\":{\"name\":\"2014 5th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 5th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ScalA.2014.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 5th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ScalA.2014.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

摘要

VCube是一种面向虚拟互联网络节点的分布式诊断算法。VCube具有几个对数属性,当所有节点都是无故障时,它是一个逻辑超立方体。VCube是动态的,因为节点在出现故障和修复时可以离开并重新加入系统。即使任意数量的节点出现故障,拓扑结构也会自我重组并保持其对数性质。故障诊断是基于测试的。在一个有N个节点的系统中,所有无故障节点检测一个事件的延迟时间最多为log22n个测试轮。在这项工作中,我们指定了算法,并表明执行的最差测试数是每log2N轮Nlog2N。除给出了正确性证明外,还给出了实验结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
VCube: A Provably Scalable Distributed Diagnosis Algorithm
VCube is a distributed diagnosis algorithm for virtually interconnecting network nodes. VCube presents several logarithmic properties, and is a logical hypercube when all nodes are fault-free. VCube is dynamic in the sense that nodes can leave and rejoin the system as they become faulty and are repaired. The topology re-organizes itself and keeps its logarithmic properties even if an arbitrary number of nodes are faulty. Fault diagnosis is based on tests. All fault-free nodes of a system with N nodes detect an event with a latency of at most log22 N testing rounds. In this work we specify the algorithm and show that the worst number of tests executed is Nlog2N per log2N rounds. Besides the correctness proofs, experimental results are also given.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信