A Practical Approach for Computing Optimal Vote Assignments

Résumé du livre

Abstract: "This paper investigates the problem of finding an optimal static pessimistic replica control scheme. It has been widely accepted that coteries (proposed by Garcia-Molina and Barbara) provide the most general framework for such schemes. Assuming that, we demonstrate that the voting scheme is an optimal static pessimistic scheme for Ethernet systems. We propose a modification of the algorithm of Tong and Kain for the best voting in operation independent case so that it runs in linear time (rather than exponential) with no practical degradation of the solution. We also offer a polynomial time algorithm for a near optimal vote assignment for Ethernet systems."