This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Solving Vector Consensus with a Wormhole
December 2005 (vol. 16 no. 12)
pp. 1120-1131

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 \geq 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.

[1] R. Guerraoui and A. Schiper, “Consensus Service: A Modular Approach for Building Fault-Tolerant Agreement Protocols in Distributed Systems,” Proc. 26th IEEE Int'l Symp. Fault-Tolerant Computing Systems, pp. 168-177, June 1996.
[2] M.J. Fischer, N.A. Lynch, and M.S. Paterson, “Impossibility of Distributed Consensus with One Faulty Process,” J. ACM, vol. 32, no. 2, pp. 374-382, Apr. 1985.
[3] A. Doudou and A. Schiper, “Muteness Failure Detectors for Consensus with Byzantine Processes,” Technical Report 97/30, École Polytechnique Fédérale de Lausanne, 1997.
[4] R. Baldoni, J. Helary, M. Raynal, and L. Tanguy, “Consensus in Byzantine Asynchronous Systems,” Proc. Int'l Colloquium Structural Information and Comm. Complexity, pp. 1-16, June 2000.
[5] T. Chandra and S. Toueg, “Unreliable Failure Detectors for Reliable Distributed Systems,” J. ACM, vol. 43, no. 2, pp. 225-267, Mar. 1996.
[6] D. Malkhi and M. Reiter, “Unreliable Intrusion Detection in Distributed Computations,” Proc. 10th Computer Security Foundations Workshop, pp. 116-124, June 1997.
[7] K.P. Kihlstrom, L.E. Moser, and P.M. Melliar-Smith, “Byzantine Fault Detectors for Solving Consensus,” The Computer J., vol. 46, no. 1, pp. 16-35, Jan. 2003.
[8] A. Doudou, B. Garbinato, R. Guerraoui, and A. Schiper, “Muteness Failure Detectors: Specification and Implementation,” Proc. Third European Dependable Computing Conf., pp. 71-87, Sept. 1999.
[9] K. Julisch and M. Dacier, “Mining Intrusion Detection Alarms for Actionable Knowledge,” Proc. Eighth ACM Int'l Conf. Knowledge Discovery and Data Mining, pp. 366-375, July 2002.
[10] H. Debar and A. Wespi, “Aggregation and Correlation of Intrusion-Detection Alerts,” Proc. Fourth Int'l Symp. Recent Advances in Intrusion Detection, 2001.
[11] A. Doudou, B. Garbinato, and R. Guerraoui, “Encapsulating Failure Detection: From Crash-Stop to Byzantine Failures,” Proc. Int'l Conf. Reliable Software Technologies, pp. 24-50, June 2002.
[12] P. Veríssimo, “Uncertainty and Predictability: Can They Be Reconciled?” Future Directions in Distributed Computing, pp. 108-113, 2003.
[13] M. Correia, P. Veríssimo, and N.F. Neves, “The Design of a COTS Real-Time Distributed Security Kernel,” Proc. Fourth European Dependable Computing Conf., pp. 234-252, Oct. 2002.
[14] C. Dwork, N. Lynch, and L. Stockmeyer, “Consensus in the Presence of Partial Synchrony,” J. ACM, vol. 35, no. 2, pp. 288-323, Apr. 1988.
[15] D. Dolev, C. Dwork, and L. Stockmeyer, “On the Minimal Synchronism Needed for Distributed Consensus,” J. ACM, vol. 34, no. 1, pp. 77-97, Jan. 1987.
[16] F. Cristian and C. Fetzer, “The Timed Asynchronous Distributed System Model,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 6, pp. 642-657, 1999.
[17] A.J. Menezes, P.C.V. Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography. CRC Press, 1997.
[18] M.O. Rabin, “Randomized Byzantine Generals,” Proc. 24th Ann. IEEE Symp. Foundations of Computer Science, pp. 403-409, Nov. 1983.
[19] M. Ben-Or, “Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols,” Proc. Second ACM Symp. Principles of Distributed Computing, pp. 27-30, Aug. 1983.
[20] A. Casimiro, P. Martins, and P. Veríssimo, “How to Build a Timely Computing Base Using Real-Time Linux,” Proc. IEEE Int'l Workshop Factory Comm. Systems, pp. 127-134, Sept. 2000.
[21] P. Cloutier, P. Mantegazza, S. Papacharalambous, I. Soanes, S. Hughes, and K. Yaghmour, “DIAPM-RTAI Position Paper,” Real-Time Linux Workshop, Nov. 2000.
[22] B. Tobotras, “Linux Capabilities FAQ 0.2,” 1999.
[23] M. Castro and B. Liskov, “Proactive Recovery in a Byzantine-Fault-Tolerant System,” Proc. Fourth Symp. Operating Systems Design and Implementation, pp. 273-288, Oct. 2000.
[24] A. Schiper, “Early Consensus in an Asynchronous System with a Weak Failure Detector,” Distributed Computing, vol. 10, pp. 149-157, Oct. 1997.
[25] L. Lamport, “Time, Clocks, and the Ordering of Events in a Distributed System,” Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[26] G. Bracha and S. Toueg, “Asynchronous Consensus and Broadcast Protocols,” J. ACM, vol. 32, no. 4, pp. 824-840, Oct. 1985.
[27] C. Fetzer and F. Cristian, “On the Possibility of Consensus in Asynchronous Systems,” Proc. Pacific Rim Int'l Symp. Fault-Tolerant Systems, Dec. 1995.
[28] A. Mostefaoui, S. Rajsbaum, and M. Raynal, “Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems,” Proc. 33rd ACM Symp. Theory of Computing, pp. 152-162, July 2001.
[29] N. Lynch, “A Hundred Impossibility Proofs for Distributed Computing,” Proc. Eighth Ann. ACM Symp. Principles of Distributed Computing, pp. 1-28, Aug. 1989.
[30] M. Pease, R. Shostak, and L. Lamport, “Reaching Agreement in the Presence of Faults,” J. ACM, vol. 27, no. 2, pp. 228-234, 1980.
[31] P. Veríssimo, A. Casimiro, and C. Fetzer, “The Timely Computing Base: Timely Actions in the Presence of Uncertain Timeliness,” Proc. Int'l Conf. Dependable Systems and Networks, pp. 533-542, June 2000.
[32] R. Baldoni, C. Marchetti, and S. Piergiovanni, “Asynchronous Active Replication in Three-Tier Distributed Systems,” Proc. Ninth Pacific Rim Int'l Symp. Dependable Computing, Dec. 2002.

Index Terms:
Distributed systems, Byzantine asynchronous protocols, consensus.
Citation:
Nuno F. Neves, Miguel Correia, Paulo Ver?ssimo, "Solving Vector Consensus with a Wormhole," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 12, pp. 1120-1131, Dec. 2005, doi:10.1109/TPDS.2005.153
Usage of this product signifies your acceptance of the Terms of Use.