Distributed Diagnosis in Dynamic Fault Environment For Not-Completely Connected Network

P. M. Khilar, S. Mahapatra
{"title":"Distributed Diagnosis in Dynamic Fault Environment For Not-Completely Connected Network","authors":"P. M. Khilar, S. Mahapatra","doi":"10.1109/INDCON.2006.302749","DOIUrl":null,"url":null,"abstract":"This paper has considered the problem of distributed diagnosis in dynamic fault environments for not-completely connected network topologies under crash and value fault assumptions. Heartbeat based mechanisms are used to detect the failure and recovery event at a particular node. A diagnosis algorithm has been simulated and the results are presented. The result shows that failure and recovery events both take a constant time, i.e., O(1) round and has been compared with algorithm FHB. The algorithm is shown to produce significantly shorter latency and state holding time than prior algorithms, which focused primarily on minimizing the number of tests at the expense of latency","PeriodicalId":122715,"journal":{"name":"2006 Annual IEEE India Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Annual IEEE India Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDCON.2006.302749","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

This paper has considered the problem of distributed diagnosis in dynamic fault environments for not-completely connected network topologies under crash and value fault assumptions. Heartbeat based mechanisms are used to detect the failure and recovery event at a particular node. A diagnosis algorithm has been simulated and the results are presented. The result shows that failure and recovery events both take a constant time, i.e., O(1) round and has been compared with algorithm FHB. The algorithm is shown to produce significantly shorter latency and state holding time than prior algorithms, which focused primarily on minimizing the number of tests at the expense of latency
非完全连通网络动态故障环境下的分布式诊断
研究了非完全连通网络拓扑在崩溃和值故障假设下的动态故障环境中的分布式诊断问题。基于心跳的机制用于检测特定节点上的故障和恢复事件。对一种诊断算法进行了仿真,并给出了仿真结果。结果表明,故障和恢复事件都需要一个常数时间,即O(1)轮,并与FHB算法进行了比较。与之前的算法相比,该算法产生的延迟和状态保持时间明显更短,之前的算法主要侧重于以延迟为代价最小化测试数量
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信