Decentralized Voting Protocols and their Communication Structures

Amane NAKAJIMA

Decentralized Voting Protocols and their Communication Structures

Amane NAKAJIMA

Full Text Views

0

Share
Cite this

Summary :

Voting is a general way of achieving mutual exclusion and synchronization in distributed systems with replicated data. In centralized voting protocols, a requesting node, which works as a central controller, exchanges messages in order to collect votes from other nodes. This paper proposes decentralized voting protocols, in which all nodes execute the same protocol and reach the same result in a decentralized and autonomous way. When a decentalized voting protocol is implemented by using one-round message exchange, it requires n(n1) messages, where n is the number of nodes. The number of messages can be reduced by using multiple-round message exchange. The paper describes the computation in each node in the form of the finite state automaton, and gives communication structures for it. It is shown that kn(n^1/k1) messages are enough when messages are exchanged in k rounds.

Publication: IEICE TRANSACTIONS on Information Vol.E78-D No.4 pp.355-362

Publication Date: 1995/04/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Computer Systems

Cite this

Copy

Amane NAKAJIMA, "Decentralized Voting Protocols and their Communication Structures" in IEICE TRANSACTIONS on Information, vol. E78-D, no. 4, pp. 355-362, April 1995, doi: .
Abstract: Voting is a general way of achieving mutual exclusion and synchronization in distributed systems with replicated data. In centralized voting protocols, a requesting node, which works as a central controller, exchanges messages in order to collect votes from other nodes. This paper proposes decentralized voting protocols, in which all nodes execute the same protocol and reach the same result in a decentralized and autonomous way. When a decentalized voting protocol is implemented by using one-round message exchange, it requires n(n1) messages, where n is the number of nodes. The number of messages can be reduced by using multiple-round message exchange. The paper describes the computation in each node in the form of the finite state automaton, and gives communication structures for it. It is shown that kn(n^1/k1) messages are enough when messages are exchanged in k rounds.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e78-d_4_355/_p

Copy

@ARTICLE{e78-d_4_355,
author={Amane NAKAJIMA, },
journal={IEICE TRANSACTIONS on Information},
title={Decentralized Voting Protocols and their Communication Structures},
year={1995},
volume={E78-D},
number={4},
pages={355-362},
abstract={Voting is a general way of achieving mutual exclusion and synchronization in distributed systems with replicated data. In centralized voting protocols, a requesting node, which works as a central controller, exchanges messages in order to collect votes from other nodes. This paper proposes decentralized voting protocols, in which all nodes execute the same protocol and reach the same result in a decentralized and autonomous way. When a decentalized voting protocol is implemented by using one-round message exchange, it requires n(n1) messages, where n is the number of nodes. The number of messages can be reduced by using multiple-round message exchange. The paper describes the computation in each node in the form of the finite state automaton, and gives communication structures for it. It is shown that kn(n^1/k1) messages are enough when messages are exchanged in k rounds.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - Decentralized Voting Protocols and their Communication Structures
T2 - IEICE TRANSACTIONS on Information
SP - 355
EP - 362
AU - Amane NAKAJIMA
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E78-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 1995
AB - Voting is a general way of achieving mutual exclusion and synchronization in distributed systems with replicated data. In centralized voting protocols, a requesting node, which works as a central controller, exchanges messages in order to collect votes from other nodes. This paper proposes decentralized voting protocols, in which all nodes execute the same protocol and reach the same result in a decentralized and autonomous way. When a decentalized voting protocol is implemented by using one-round message exchange, it requires n(n1) messages, where n is the number of nodes. The number of messages can be reduced by using multiple-round message exchange. The paper describes the computation in each node in the form of the finite state automaton, and gives communication structures for it. It is shown that kn(n^1/k1) messages are enough when messages are exchanged in k rounds.
ER -