Quorum Generation Algorithm Based on the Longest-shortest Distance

Abstract

Many algorithms on quorum generation have been proposed but those algorithms with cyclic quorum usually had a common defect that the nodes would congregate in a special area of the quorum at the end of the algorithm(Called this problem as CE). For resolving this problem, a new algorithm on quorum generation based on the longest-shortest distance has been proposed in this paper. This algorithm has the same quorum length and time complexity as Liâ??s algorithm[8],but the space complexity is O( ), lower than Liâ??s algorithm[8]. And this algorithm has not the problem of CE. So based on the longest-shortest distance to chose a node to insert the quorum is an executive method on resolving the problem CE.