Software Development

Emergent Chief

Written by admin


One of many widespread methods utilized in peer-to-peer techniques is to
order cluster nodes in line with their ‘age’. The oldest member of
the cluster performs the position of the coordinator for the cluster.
The coordinator is answerable for deciding on membership modifications
in addition to making selections equivalent to the place
Mounted Partitions ought to be positioned
throughout cluster nodes.

To kind the cluster,
one of many cluster nodes acts as a seed node or an introducer node.
All of the cluster nodes be part of the cluster by contacting the seed node.

Each cluster node is configured with the seed node handle.
When a cluster node is began, it tries to contact the seed node
to affix the cluster.

class ClusterNode…

  MembershipService membershipService;
  public void begin(Config config) {
      this.membershipService =  new MembershipService(config.getListenAddress()); part of(config.getSeedAddress());

The seed node might be any of the cluster nodes. It is configured with its personal
handle because the seed node handle and is the primary node that’s began.
It instantly begins accepting requests. The age of the seed node is 1.

class MembershipService…

  Membership membership;
  public void be part of(InetAddressAndPort seedAddress) {
      int maxJoinAttempts = 5;
      for(int i = 0; i < maxJoinAttempts; i++){
          attempt {
          } catch (Exception e) {
    "Be a part of try " + i + "from " + selfAddress + " to " + seedAddress + " failed. Retrying");
      throw new JoinFailedException("Unable to affix the cluster after " + maxJoinAttempts + " makes an attempt");

  personal void joinAttempt(InetAddressAndPort seedAddress) throws ExecutionException, TimeoutException {
      if (selfAddress.equals(seedAddress)) {
          int membershipVersion = 1;
          int age = 1;
          updateMembership(new Membership(membershipVersion, Arrays.asList(new Member(selfAddress, age, MemberStatus.JOINED))));
      lengthy id = this.messageId++;
      CompletableFuture<JoinResponse> future = new CompletableFuture<>();
      JoinRequest message = new JoinRequest(id, selfAddress);
      pendingRequests.put(id, future);
      community.ship(seedAddress, message);

      JoinResponse joinResponse = Uninterruptibles.getUninterruptibly(future, 5, TimeUnit.SECONDS);

  personal void begin() {
      startSplitBrainChecker(); + " joined the cluster. Membership=" + membership);

  personal void updateMembership(Membership membership) {
      this.membership  = membership;

There will be multiple seed node. However seed nodes begin accepting
requests solely after they themselves be part of the cluster. Additionally the cluster
will probably be practical if the seed node is down, however no new nodes will probably be ready
so as to add to the cluster.

Non seed nodes then ship the be part of request to the seed node.
The seed node handles the be part of request by creating a brand new member file
and assigning its age.
It then updates its personal membership record and sends messages to all of the
present members with the brand new membership record.
It then waits to make it possible for the response is
returned from each node, however will finally return the be part of response
even when the response is delayed.

class MembershipService…

  public void handleJoinRequest(JoinRequest joinRequest) {

  personal void handleNewJoin(JoinRequest joinRequest) {
      Record<Member> existingMembers = membership.getLiveMembers();
      ResultsCollector resultsCollector = broadcastMembershipUpdate(existingMembers);
      JoinResponse joinResponse = new JoinResponse(joinRequest.messageId, selfAddress, membership);
      resultsCollector.whenComplete((response, exception) -> {
"Sending be part of response from " + selfAddress + " to " + joinRequest.from);
          community.ship(joinRequest.from, joinResponse);

class Membership…

  public Membership addNewMember(InetAddressAndPort handle) {
      var newMembership = new ArrayList<>(liveMembers);
      int age = yongestMemberAge() + 1;
      newMembership.add(new Member(handle, age, MemberStatus.JOINED));
      return new Membership(model + 1, newMembership, failedMembers);

  personal int yongestMemberAge() {
      return -> m.age).max(Integer::examine).orElse(0);

If a node which was already a part of the cluster is attempting to rejoin
after a crash, the failure detector state associated to that member is

class MembershipService…

  personal void handlePossibleRejoin(JoinRequest joinRequest) {
      if (membership.isFailed(joinRequest.from)) {
          //member rejoining
  + " rejoining the cluster. Eradicating it from failed record");

It is then added as a brand new member. Every member must be recognized
uniquely. It may be assigned a novel identifier at startup.
This then supplies a degree of reference that makes it attainable to
test whether it is an present cluster node that’s rejoining.

The membership class maintains the record of dwell members in addition to
failed members. The members are moved from dwell to failed record
in the event that they cease sending HeartBeat as defined within the
failure detection part.

class Membership…

  public class Membership {
      Record<Member> liveMembers = new ArrayList<>();
      Record<Member> failedMembers = new ArrayList<>();
      public boolean isFailed(InetAddressAndPort handle) {
          return -> m.handle.equals(handle));

Sending membership updates to all the prevailing members

Membership updates are despatched to all the opposite nodes concurrently.
The coordinator additionally wants to trace whether or not all of the members
efficiently acquired the updates.

A standard method is to ship a a method request to all nodes
and count on an acknowledgement message.
The cluster nodes ship acknowledgement messages to the coordinator
to verify receipt of the membership replace.
A ResultCollector object can monitor receipt of all of the
messages asynchronously, and is notified each time
an acknowledgement is acquired for a membership replace.
It completes its future as soon as the anticipated
acknowledgement messages are acquired.

class MembershipService…

  personal ResultsCollector broadcastMembershipUpdate(Record<Member> existingMembers) {
      ResultsCollector resultsCollector = sendMembershipUpdateTo(existingMembers);
      resultsCollector.orTimeout(2, TimeUnit.SECONDS);
      return resultsCollector;

  Map<Lengthy, CompletableFuture> pendingRequests = new HashMap();
  personal ResultsCollector sendMembershipUpdateTo(Record<Member> existingMembers) {
      var otherMembers = otherMembers(existingMembers);
      ResultsCollector collector = new ResultsCollector(otherMembers.measurement());
      if (otherMembers.measurement() == 0) {
          return collector;
      for (Member m : otherMembers) {
          lengthy id = this.messageId++;
          CompletableFuture<Message> future = new CompletableFuture();
          future.whenComplete((outcome, exception)->{
              if (exception == null){
          pendingRequests.put(id, future);
          community.ship(m.handle, new UpdateMembershipRequest(id, selfAddress, membership));
      return collector;

class MembershipService…

  personal void handleResponse(Message message) {

  personal void completePendingRequests(Message message) {
      CompletableFuture requestFuture = pendingRequests.get(message.messageId);
      if (requestFuture != null) {

class ResultsCollector…

  class ResultsCollector {
      int totalAcks;
      int receivedAcks;
      CompletableFuture future = new CompletableFuture();
      public ResultsCollector(int totalAcks) {
          this.totalAcks = totalAcks;
      public void ackReceived() {
          if (receivedAcks == totalAcks) {
      public void orTimeout(int time, TimeUnit unit) {
          future.orTimeout(time, unit);
      public void whenComplete(BiConsumer<? tremendous Object, ? tremendous Throwable> func) {
      public void full() {

To see how ResultCollector works, take into account a cluster
with a set of nodes: let’s name them athens, byzantium and cyrene.
athens is appearing as a coordinator. When a brand new node – delphi –
sends a be part of request to athens, athens updates the membership and sends the updateMembership request
to byantium and cyrene. It additionally creates a ResultCollector object to trace
acknowledgements. It information every acknowledgement acquired
with ResultCollector. When it receives acknowledgements from each
byzantium and cyrene, it then responds to delphi.

Frameworks like Akka
use Gossip Dissemination and Gossip Convergence
to trace whether or not updates have reached all cluster nodes.

An instance state of affairs

Think about one other three nodes.
Once more, we’ll name them athens, byzantium and cyrene.
athens acts as a seed node; the opposite two nodes are configured as such.

When athens begins, it detects that it’s itself the seed node.
It instantly initializes the membership record and begins
accepting requests.

When byzantium begins, it sends a be part of request to athens.
Word that even when byzantium begins earlier than athens, it’s going to hold
attempting to ship be part of requests till it might probably hook up with athens.
Athens lastly provides byzantium to the membership record and sends the
up to date membership record to byzantium. As soon as byzantium receives
the response from athens, it might probably begin accepting requests.

With all-to-all heartbeating, byzantium begins sending heartbeats
to athens, and athens sends heartbeat to byzantium.

cyrene begins subsequent. It sends be part of requests to athens.
Athens updates the membership record and sends up to date membership
record to byantium. It then sends the be part of response with
the membership record to cyrene.

With all to all heartbeating, cyrene, athens and byzantium
all ship heartbeats to one another.

Dealing with lacking membership updates

It is attainable that some cluster nodes miss membership updates.
There are two options to deal with this drawback.

If all members are sending heartbeat to all different members,
the membership model quantity will be despatched as a part of the heartbeat.
The cluster node that handles the heartbeat can
then ask for the most recent membership.
Frameworks like Akka which use Gossip Dissemination
monitor convergence of the gossiped state.

class MembershipService…

  personal void handleHeartbeatMessage(HeartbeatMessage message) {
      if (isCoordinator() && message.getMembershipVersion() < this.membership.getVersion()) {
          membership.getMember(message.from).ifPresent(member -> {
    "Membership model in " + selfAddress + "=" + this.membership.model + " and in " + message.from + "=" + message.getMembershipVersion());

    "Sending membership replace from " + selfAddress + " to " + message.from);

Within the above instance, if byzantium misses the membership replace
from athens, will probably be detected when byzantine sends the heartbeat
to athens. athens can then ship the most recent membership to byzantine.

Alternatively every cluster node can test the lastest membership record periodically,
– say each one second – with different cluster nodes.
If any of the nodes work out that their member record is outdated,
it might probably then ask for the most recent membership record so it might probably replace it.
To have the ability to examine membership lists, typically
a model quantity is maintained and incremented everytime
there’s a change.

Failure Detection

Every cluster additionally runs a failure detector to test if
heartbeats are lacking from any of the cluster nodes.
In a easy case, all cluster nodes ship heartbeats to all the opposite nodes.
However solely the coordinator marks the nodes as failed and
communicates the up to date membership record to all the opposite nodes.
This makes positive that not all nodes unilaterally deciding if
another nodes have failed. Hazelcast is an instance
of this implementation.

class MembershipService…

  personal boolean isCoordinator() {
      Member coordinator = membership.getCoordinator();
      return coordinator.handle.equals(selfAddress);

  TimeoutBasedFailureDetector<InetAddressAndPort> failureDetector
          = new TimeoutBasedFailureDetector<InetAddressAndPort>(Length.ofSeconds(2));

  personal void checkFailedMembers(Record<Member> members) {
      if (isCoordinator()) {

      } else {
          //if failed member consists of coordinator, then test if this node is the following coordinator.

  void removeFailedMembers() {
      Record<Member> failedMembers = checkAndGetFailedMembers(membership.getLiveMembers());
      if (failedMembers.isEmpty()) {

Avoiding all-to-all heartbeating

All-to-all heartbeating just isn’t possible in massive clusters.
Usually every node will obtain heartbeats from
just a few different nodes. If a failure is detected,
it is broadcasted to all the opposite nodes
together with the coordinator.

For instance in Akka a node ring is shaped
by sorting community addresses and every cluster node sends
heartbeats to just a few cluster nodes.
Ignite arranges all of the nodes within the cluster
in a hoop and every node sends heartbeat solely to the node subsequent
to it.
Hazelcast makes use of all-to-all heartbeat.

Any membership modifications, due to nodes being added or
node failures have to be broadcast to all the opposite
cluster nodes. A node can join to each different node to
ship the required info.
Gossip Dissemination can be utilized
to broadcast this info.

Break up Mind State of affairs

Regardless that a single coordinator node decides when to
mark one other nodes as down, there isn’t any specific leader-election
taking place to pick which node acts as a coordinator.
Each cluster node expects a heartbeat from the prevailing
coordinator node; if it does not get a heartbeat in time,
it might probably then declare to be the coordinator and take away the prevailing
coordinator from the memberlist.

class MembershipService…

  personal void claimLeadershipIfNeeded(Record<Member> members) {
      Record<Member> failedMembers = checkAndGetFailedMembers(members);
      if (!failedMembers.isEmpty() && isOlderThanAll(failedMembers)) {
          var newMembership = membership.failed(failedMembers);

  personal boolean isOlderThanAll(Record<Member> failedMembers) {
      return -> m.age < thisMember().age);

  personal Record<Member> checkAndGetFailedMembers(Record<Member> members) {
      Record<Member> failedMembers = members
              .filter(member -> !member.handle.equals(selfAddress) && failureDetector.isMonitoring(member.handle) && !failureDetector.isAlive(member.handle))
              .map(member -> new Member(member.handle, member.age, member.standing)).gather(Collectors.toList());

          failureDetector.take away(member.handle);
 + " marking " + member.handle + " as DOWN");
      return failedMembers;

This may create a scenario the place there are two or extra subgroups
shaped in an present cluster, every contemplating the others
to have failed. That is known as split-brain drawback.

Think about a 5 node cluster, athens, byzantium, cyrene, delphi and euphesus.
If athens receives heartbeats from dephi and euphesus, however
stops getting heartbeats from byzantium, cyrene, it marks
each byzantium and cyrene as failed.

byzantium and cyrene might ship heartbeats to one another,
however cease receiving heartbeats from cyrene, dephi and euphesus.
byzantium being the second oldest member of the cluster,
then turns into the coordinator.
So two separate clusters are shaped one with athens as
the coordinator and the opposite with byzantium because the coordinator.

Dealing with cut up mind

One widespread technique to deal with cut up mind situation is to
test whether or not there are sufficient members to deal with any
consumer request, and reject the request if there
aren’t sufficient dwell members. For instance,
Hazelcast means that you can configure
minimal cluster measurement to execute any consumer request.

public void handleClientRequest(Request request) {
    if (!hasMinimumRequiredSize()) {
        throw new NotEnoughMembersException("Requires minium 3 members to serve the request");

personal boolean hasMinimumRequiredSize() {
    return membership.getLiveMembers().measurement() > 3;

The half which has the vast majority of the nodes,
continues to function, however as defined within the Hazelcast
documentation, there’ll at all times be a
time window
wherein this safety has but to come back into impact.

The issue will be averted if cluster nodes are
not marked as down until it is assured that they
will not trigger cut up mind.
For instance, Akka recommends
that you just don’t have nodes
marked as down
by the failure detector; you may as a substitute use its
cut up mind resolver.

Recovering from cut up mind

The coordinator runs a periodic job to test if it
can hook up with the failed nodes.
If a connection will be established, it sends a particular
message indicating that it needs to set off a
cut up mind merge.

If the receiving node is the coordinator of the subcluster,
it’s going to test to see if the cluster that’s initiating
the request is a part of the minority group. Whether it is,
it’s going to ship a merge request. The coordinator of the minority group,
which receives the merge request, will then execute
the merge request on all of the nodes within the minority sub group.

class MembershipService…

  splitbrainCheckTask = taskScheduler.scheduleWithFixedDelay(() -> {
          1, 1, TimeUnit.SECONDS);

class MembershipService…

  personal void searchOtherClusterGroups() {
      if (membership.getFailedMembers().isEmpty()) {
      Record<Member> allMembers = new ArrayList<>();
          if (isCoordinator()) {
          for (Member member : membership.getFailedMembers()) {
    "Sending SplitBrainJoinRequest to " + member.handle);
              community.ship(member.handle, new SplitBrainJoinRequest(messageId++, this.selfAddress, membership.model, membership.getLiveMembers().measurement()));

If the receiving node is the coordinator of the bulk subgroup, it asks the
sending coordinator node to merge with itself.

class MembershipService…

  personal void handleSplitBrainJoinMessage(SplitBrainJoinRequest splitBrainJoinRequest) { + " Dealing with SplitBrainJoinRequest from " + splitBrainJoinRequest.from);
      if (!membership.isFailed(splitBrainJoinRequest.from)) {

      if (!isCoordinator()) {

      if(splitBrainJoinRequest.getMemberCount() < membership.getLiveMembers().measurement()) {
          //requesting node ought to be part of this cluster.
 + " Requesting " + splitBrainJoinRequest.from + " to rejoin the cluster");
          community.ship(splitBrainJoinRequest.from, new SplitBrainMergeMessage(splitBrainJoinRequest.messageId, selfAddress));

      } else {
          //we have to be part of the opposite cluster


  personal void mergeWithOtherCluster(InetAddressAndPort otherClusterCoordinator) {
      handleMerge(new MergeMessage(messageId++, selfAddress, otherClusterCoordinator)); //provoke merge on this node.

  personal void askAllLiveMembersToMergeWith(InetAddressAndPort mergeToAddress) {
      Record<Member> liveMembers = membership.getLiveMembers();
      for (Member m : liveMembers) {
          community.ship(m.handle, new MergeMessage(messageId++, selfAddress, mergeToAddress));

Within the instance mentioned within the above part, when athens
can talk with byzantium, it’s going to ask byzantium to merge
with itself.

The coordinator of the smaller subgroup,
then asks all of the cluster nodes
inside its group to set off a merge.
The merge operation shuts down and rejoins the cluster
nodes to the coordinator of the bigger group.

class MembershipService…

  personal void handleMerge(MergeMessage mergeMessage) { + " Merging with " + mergeMessage.getMergeToAddress());
      //be part of the cluster once more by the opposite cluster's coordinator
      taskScheduler.execute(()-> {
          be part of(mergeMessage.getMergeToAddress());

Within the instance above, byzantium and cyrene shutdown and
rejoin athens to kind a full cluster once more.

Comparability with Chief and Followers

It is helpful to match this sample with that of
Chief and Followers. The leader-follower
setup, as utilized by patterns like Constant Core,
doesn’t operate until the chief is chosen
by operating an election. This ensures that the
Quorum of cluster nodes have
an settlement about who the chief is. Within the worst case
state of affairs, if an settlement is not reached, the system will
be unavailable to course of any requests.
In different phrases, it prefers consistency over availability.

The emergent chief, then again will at all times
have some cluster node appearing as a pacesetter for processing
consumer requests. On this case, availability is most well-liked
over consistency.

About the author


Leave a Comment