Policies for Dynamic Vote Reassignment
Voting is used commonly to enforce mutual exclusion in distributed systems. Each node is assigned a number of votes and only the group with a majority of votes is allowed to perform a restricted operation. This paper describes techniques for dynamically assigning votes upon node or link failure, in an attempt to make the system more resilient. The emphasis is on policies with which a node autonomously select its new vote value. Simulation results are presented comparing the autonomous methods to static vote assignments and to group consensus strategies.