Quorum Generation Algorithm Based on the Longest-shortest Distance
|
| Title | Quorum Generation Algorithm Based on the Longest-shortest Distance |
| Authors | |
| 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. |
| Publisher | kassel university press GmbH |
| Date | 2013-06-26 |
| Source | 1868-1646 |
| Rights | The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission. Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY What does this mean?). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors. This journal has been awarded the SPARC Europe Seal for Open Access Journals (What´s this?) |