Assuring Consistency and Increasing Reliability in Group Communication Mechanisms in Computational Resiliency

— The Computational Resiliency library (CRLib) provides distributed systems with the ability to sustain operation and dynamically restore the level of assurance in system function during attacks or failures. In the presence of arbitrary faults, replicated threads need to agree on the values received in order to achieve consistency, when doing group communication in CRLib. To guarantee data integrity and increase reliability, we have implemented a variant of the Lamport-Shostak-Pease oral message algorithm for the Byzantine Generals problem, which provides fuzzy agreement as well as a reduction of the expected communication overhead. Instead of agreeing on the original messages, which could be extremely large, agreement is performed over the 160-bit hashes of normalized messages computed

• Type: Conference
• Year: 2003
• Where: IAW
• Authors: Norka B. Lucena, Steve J. Chapin, Joohan Lee
• Keywords: Byzantine Generals Problem, Computational Resiliency Library, IAW 2003, Information Management, Oral Message Algorithm