Distributed Diagnosis of Dynamic Events in Partitionable Arbitrary Topology Networks

Duarte, Elias P.; Weber, Andréa; Fonseca, Keiko V. O.

doi:10.1109/tpds.2011.284

Cited by 20 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Além de algoritmos distribuídos de diagnóstico de redes representáveis por um grafo completo, como o vCube, outra família importante é dos algoritmos para redes de topologia arbitrária [28], [29]. Estes algoritmos se diferenciam principalmente na forma como difundem as informac ¸ões de diagnóstico entre os processos.…”

Section: Resultados Experimentaisunclassified

Estratégia de Difusão Agressiva para Aumentar a Vazão do Algoritmo de Consenso HyperPaxos

Pereira,

Kiotheka,

Duarte Jr

2023

ReCiC

View full text Add to dashboard Cite

Algoritmos de consenso distribuído são essenciais para sistemas de armazenamento, bancos de dados, controle de acesso e orquestração de aplicações em nuvem. Este trabalho apresenta uma estratégia para melhorar a vazão do algoritmo HyperPaxos em termos de decisões por segundo. O algoritmo HyperPaxos é uma versão hierárquica de um dos principais algoritmos de consenso, o Paxos. O HyperPaxos é baseado na topologia virtual hierárquica vCube, que apresenta diversas propriedades logarítmicas. Os acceptors são organizados em clusters e os proposers executam as duas fases do Paxos escolhendo um acceptor dito difusor. O difusor é responsável por retransmitir as mensagens para os demais acceptors sobre o vCube. Neste trabalho, propomos que o difusor adote uma estratégia de difusão agressiva para transmitir, de uma só vez, as mensagens para uma maioria de acceptors paralelamente. A estratégia proposta foi implementada e comparada à versão original. Resultados obtidos mostram o desempenho superior da estratégia proposta em todos os cenários testados.

show abstract

Section: Resultados Experimentaisunclassified

Estratégia de Difusão Agressiva para Aumentar a Vazão do Algoritmo de Consenso HyperPaxos

Pereira,

Kiotheka,

Duarte Jr

2023

ReCiC

View full text Add to dashboard Cite

show abstract

“…During the life span of a WSN, a number of unexpected situations such as the misbehavior of sensor nodes, providing unexpected results and not receiving information from specific sensor nodes, are observed [3][4][5][6]. This affects the performance of WSN.…”

Section: Introductionmentioning

confidence: 99%

Energy Efficient Distributed Fault Identification Algorithm in Wireless Sensor Networks

Panda

Khilar

2014

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

A distributed fault identification algorithm is proposed here to find both hard and soft faulty sensor nodes present in wireless sensor networks. The algorithm is distributed, self-detectable, and can detect the most common byzantine faults such as stuck at zero, stuck at one, and random data. In the proposed approach, each sensor node gathered the observed data from the neighbors and computed the mean to check whether faulty sensor node is present or not. If a node found the presence of faulty sensor node, then compares observed data with the data of the neighbors and predict probable fault status. The final fault status is determined by diffusing the fault information from the neighbors. The accuracy and completeness of the algorithm are verified with the help of statistical model of the sensors data. The performance is evaluated in terms of detection accuracy, false alarm rate, detection latency and message complexity.

show abstract

“…

Alternative specification and correctness proofs of the distributed network reachability algorithm

AbstractThe Distributed Network Reachability algorithm (DUARTE-JR; WEBER; FONSECA, 2012) allows every node in a general topology network to determine which portions of the network are reachable and unreachable. The algorithm consists of three phases: test, dissemination, and reachability computation.

…”

mentioning

confidence: 99%

Alternative specification and correctness proofs of the distributed network reachability algorithm DOI 10.5752/P.2316-9451.2012v1n1p5

Weber

Duarte

Fonseca

2012

Abakos

View full text Add to dashboard Cite

Alternative specification and correctness proofs of the distributed network reachability algorithm AbstractThe Distributed Network Reachability algorithm (DUARTE-JR; WEBER; FONSECA, 2012) allows every node in a general topology network to determine which portions of the network are reachable and unreachable. The algorithm consists of three phases: test, dissemination, and reachability computation. During the testing phase each link is tested by one of the adjacent nodes at alternating testing intervals. Upon the detection of a new event, the tester starts the dissemination phase. In this work we both give an alternative specification of DNR that employs tokens at the testing phase allowing the pair of nodes connected by a link to share testing responsibilities, and give an alternative set of proofs for the algorithm.

show abstract

Distributed Diagnosis of Dynamic Events in Partitionable Arbitrary Topology Networks

Cited by 20 publications

References 25 publications

Estratégia de Difusão Agressiva para Aumentar a Vazão do Algoritmo de Consenso HyperPaxos

Estratégia de Difusão Agressiva para Aumentar a Vazão do Algoritmo de Consenso HyperPaxos

Energy Efficient Distributed Fault Identification Algorithm in Wireless Sensor Networks

Alternative specification and correctness proofs of the distributed network reachability algorithm DOI 10.5752/P.2316-9451.2012v1n1p5

Contact Info

Product

Resources

About