Title :
Solving vector consensus with a wormhole
Author :
Neves, Nuno F. ; Correia, Miguel ; Veríssimo, Paulo
Author_Institution :
Departamento de Informatica, Univ. de Lisboa, Portugal
Abstract :
This paper presents a solution to the vector consensus problem for Byzantine asynchronous systems augmented with wormholes. Wormholes prefigure a hybrid distributed system model, embodying the notion of an enhanced part of the system with "good" properties otherwise not guaranteed by the "normal" weak environment. A protocol built for this type of system runs in the asynchronous part, where f out of n≥3f+1 processes might be corrupted by malicious adversaries. However, sporadically, processes can rely on the services provided by the wormhole for the correct execution of simple operations. One of the nice features of this setting is that it is possible to keep the protocol completely time-free and, in addition, to circumvent the FLP impossibility result by hiding all time-related assumptions in the wormhole. Furthermore, from a performance perspective, it leads to the design of a protocol with a good time complexity.
Keywords :
computational complexity; fault tolerant computing; protocols; Byzantine asynchronous system; distributed system model; fault tolerant computing; protocol; time complexity; vector consensus problem; wormhole; Broadcasting; Computer crashes; Computer hacking; Detectors; Distributed computing; Event detection; Floods; Intrusion detection; Protocols; Voting; Byzantine asynchronous protocols; Distributed systems; consensus.;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
DOI :
10.1109/TPDS.2005.153