Title :
An efficient protocol for voting in distributed systems
Author :
Agrawal, Gagan ; Jalote, Pankaj
Author_Institution :
Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
Abstract :
A voting protocol that can reduce the communication costs in distributed systems significantly is proposed. The technique arranges nodes in small intersecting groups, such that a site, in absence of failures, needs to communicate only with members of its group to collect the quorum. A method for constructing such logical groups is presented. It is shown that the message overhead of any operation in a system of N nodes is O(√N) when there are no or few failures in the system. The availability and the communication overheads of the proposed protocol are compared with those of existing protocols
Keywords :
computational complexity; fault tolerant computing; protocols; communication costs; communication overheads; distributed systems; logical groups; message overhead; protocol; voting; Access protocols; Availability; Communication system control; Computer science; Costs; Educational institutions; Fault tolerant systems; Partitioning algorithms; Voting; Weight control;
Conference_Titel :
Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on
Conference_Location :
Yokohama
Print_ISBN :
0-8186-2865-0
DOI :
10.1109/ICDCS.1992.235108
