Абстрактный

Quorum generation algorithm based on distance repeat times limitation

Li Meian, Wang Fang, Wang Wei

A new symmetric quorum generation algorithm has been proposed in this paper to solve the problem that how to generate a symmetric quorum with the shortest length but has a smaller time complexity so that it can generate a symmetric quorum when the distributed system has a larger scale. The concept of permission total repeat expression times proposed firstly in this paper to limit the attempt times when a node inserted in the quorum. Selecting the nodes in the backup vector to insert the quorum can reduce the attempt times again. Comparing the attempt times with other quorum generation algorithms, the algorithm proposed in this paper will reduce the time complexity 10% at least and the quorum length is still the shortest as Maekawa.