A leader election algorithm for clustered groups

Many distributed systems have a coordinator and a number of group’s members that coordinator is responsible for coordinating them. Obviously, in such system reliable multicasting is important but offering reliable multicasting services in large groups has many problems and is difficult. One way of solving these problems is using hierarchical structures. A problem in hierarchical structure is holding election when coordinator or a local coordinator crashes. Unfortunately existence election algorithms such as bully and ring don’t support hierarchical structure. In this paper, we introduce a new election algorithm for hierarchical groups.