Robustness in the Distributed Election Strategies Based on the bidirectional preference of a Node


KIPS Transactions on Software and Data Engineering, Vol. 1, No. 2, pp. 254-262, Feb. 1994
10.3745/KIPSTE.1994.1.2.254, Full Text:

Abstract

Most of traditional approaches to leader election have been based on a node ID number. As performances were not considered in these approaches, they were not very practical. So there has been a study on leader election strategies based on performances. This paper proposes new preference based on performances. While link failures occur during the election period, the elected leader's performance may not be the expected one. We simulate these effects of link failures on the robustness at election strategies. In particular, we tries in this study to find the best of the distributed election strategies based on the bidirectional preference from the standpoint of the robustness through simulation.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
C. K. Bum, C. K. Hee and L. Hyung, "Robustness in the Distributed Election Strategies Based on the bidirectional preference of a Node," KIPS Journal (1994 ~ 2000), vol. 1, no. 2, pp. 254-262, 1994. DOI: 10.3745/KIPSTE.1994.1.2.254.

[ACM Style]
Chin Ki Bum, Choi Kyung Hee, and Lee Hyung. 1994. Robustness in the Distributed Election Strategies Based on the bidirectional preference of a Node. KIPS Journal (1994 ~ 2000), 1, 2, (1994), 254-262. DOI: 10.3745/KIPSTE.1994.1.2.254.