From Incomplete to Complete Networks in Asynchronous Byzantine Systems.

This paper presents a simple broadcast operation suited to n-process asynchronous message-passing systems in which (i) up to t processes may commit Byzantine faults, and (2), while the underlying communication network is connected (any pair of processes is connected by a path), not all the pairs of processes are directly connected by a communication channel. The algorithm proposed to implement this operation assumes (i) \(t

Keywords:

• Computer network
• Byzantine architecture
• Computer science
• Asynchronous communication

• Correction
• Source
• Cite
• Save
• Machine Reading By IdeaReader