Abstract
A Leader is a Coordinator that supports a set of processes to cooperate a given task. This concept is used in several domains such as distributed systems, parallelism and cooperative support for cooperative work. In completely asynchronous systems, there is no solution for the election problem satisfying both of safety and liveness properties in asynchronous distributed systems. Therefore, to solve the election problem in those systems, one property should be weaker than the other property. If an election algorithm strengthens the safety property in sacrifice of liveness property, it would never progress. But on the contrary, an election algorithm strengthening the liveness property in sacrifice of the safety property would have the high probability of violating the safety property. In this paper, we presents a safety strengthened Leader Election protocol with an unreliable failure detector and analyses it in terms of safety and liveness properties in asynchronous distributed systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
LeLann, G.: Distributed Systems–towards a Formal Approach. In: Gilchrist, B. (ed.) Information Processing 77, North–Holland, Amsterdam (1977)
Garcia-Molian, H.: Elections in a Distributed Computing System. IEEE Transactions on Computers C-31(1), 49–59 (1982)
Abu-Amara, H., Lokre, J.: Election in Asynchronous Complete Networks with Intermittent Link Failures. IEEE Transactions on Computers 43(7), 778–788 (1994)
Sayeed, H.M., Abu-Amara, M., Abu-Avara, H.: Optimal Asynchronous Agreement and Leader Election Algorithm for Complete Networks with Byzantine Faulty Links. Distributed Computing 9(3), 147–156 (1995)
Brunekreef, J., Katoen, J.-P., Koymans, R., Mauw, S.: Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks. Distributed Computing 9(4), 157–171 (1996)
Singh, G.: Leader Election in the Presence of Link Failures. IEEE Transactions on Parallel and Distributed Systems 7(3), 231–236 (1996)
Fischer, M., Lynch, N., Paterson, M.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM (32), 374–382 (1985)
Chandra, T., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of ACM 43(2), 225–267 (1996)
Dolev, D., Strong, R.: A Simple Model For Agreement in Distributed Systems. In: Simons, B., Spector, A.Z. (eds.) Fault-Tolerant Distributed Computing. LNCS, vol. 448, pp. 42–50. Springer, Heidelberg (1990)
Chandra, T., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of ACM 43(4), 685–722 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, SH. (2003). A Probabilistically Correct Election Protocol in Asynchronous Distributed Systems. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-39425-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20054-3
Online ISBN: 978-3-540-39425-9
eBook Packages: Springer Book Archive