Alternative specification and correctness proofs of the distributed network reachability algorithm
Abakós
Endereço:
Av. Dom José Gaspar, 500 - Belo Horizonte - MG
Belo Horizonte / MG
30535-901
Site: http://periodicos.pucminas.br/index.php/abakos
Telefone: (31)3319-4117
ISSN: 23169451
Editor Chefe: Lucila Ishitani
Início Publicação: 31/10/2012
Periodicidade: Semestral
Área de Estudo: Multidisciplinar
Alternative specification and correctness proofs of the distributed network reachability algorithm
Ano: 2012 | Volume: 1 | Número: 1
Autores: Andréa Weber, Elias Procóprio Duarte Jr., Keiko Verônica Ono Fonseca
Autor Correspondente: Andréa Weber | [email protected]
Autor Correspondente: Andréa Weber | [email protected]
Palavras-chave: Alcançabilidade da rede, Diagnóstico distribuÃdo, Assinalamento de testes baseado em token, Sistemas particionáveis, Recuperação de enlaces
Resumos Cadastrados
Resumo Inglês:
The Distributed Network Reachability algorithm 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.
