2n⌈√<n>⌉ Symmetric Communication Structure for Decentralized Consensus Protocols Using a Duality of Indices

スポンサーリンク

概要

• 論文の詳細を見る

• Distributed algorithms that entail successive rounds of message exchange are called decentralized consensus protocols. Several consensus protocols use a finite projective plane as a communication structure and require 4n⌊√<n>⌋ messages in two rounds, where n is the number of nodes. This paper presents an efficient communication structure that uses a finite projective plane with a duality of indices. The communication structure requires 2n ⌈√<n>⌉ messages in two rounds, and can therefore halve the number of messages. It is shown that a finite projective plane with a duality can be constructed from a difference set, and that the presented communication structure has two kinds of symmetry.

• 社団法人電子情報通信学会の論文
• 1994-06-25

著者

• Nakajima Amane

  Tokyo Research Laboratory Ibm Japan Ltd.

関連論文

• A Two-Way Dual-View Teleteaching System Conveying Gestures and Chalkboard Contents (Special Issue on Networked Reality)
• 2n⌈√⌉ Symmetric Communication Structure for Decentralized Consensus Protocols Using a Duality of Indices
• Decentralized Voting Protocols and their Communication Structures

スポンサーリンク