A randomized voting algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

A randomized algorithm for vote assignment is described. Given a collection of sites where copies of a file are replicated, and the individual site reliabilities, the algorithm assigns votes to sites so as to maximize overall availability. It is based on the concept of simulated annealing which has been successfully applied for various complex problems (for instance, the traveling salesman problem) for which no efficient optimal algorithm is known. The authors tested their algorithm for 5-, 6-, 7-, 8-, and 9-site examples and compared the vote assignments produced by it with those produced by an optimal algorithm based on solving an integer programming model. The results produced by the randomized algorithm were remarkably close to those produced by the optimal one.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Distributed Computing Systems
Editors Anon
PublisherPubl by IEEE
Pages412-419
Number of pages8
ISBN (Print)0818621443
StatePublished - May 1 1991
EventProceedings of the 11th International Conference on Distributed Computing Systems - Arlington, TX, USA
Duration: May 20 1991May 24 1991

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Other

OtherProceedings of the 11th International Conference on Distributed Computing Systems
CityArlington, TX, USA
Period5/20/915/24/91

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Kumar, A. (1991). A randomized voting algorithm. In Anon (Ed.), Proceedings - International Conference on Distributed Computing Systems (pp. 412-419). (Proceedings - International Conference on Distributed Computing Systems). Publ by IEEE.