{"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