Ransomware attackers specifically target and attempt to destroy backup systems to increase the probability of payment. Hardening your system is critical. Please ensure you have reviewed your platform security using the Security Hardening Checklist
Cohesity

COHESITY Documentation

Explore our documentation to get started, discover products & new features, access troubleshooting guides, register sources, platforms support.

Products
Data Security Alliance
Visit Cohesity.com
Demos
Support
Blogs
Developers
Partner Portals
Cohesity Community
© 2026 Cohesity, Inc. All Rights Reserved.
Terms of Use|
Privacy Policy|
Legal|
  1. Home
  2. NetBackup™ Flex Scale Administrator's Guide
  3. Resiliency in NetBackup Flex Scale
  4. Handling split-brain scenario in NetBackup Flex Scale
NetBackup™ Flex Scale Administrator's Guide

Handling split-brain scenario in NetBackup Flex Scale

A split-brain occurs when the cluster membership view differs among the cluster nodes, increasing the chance of data corruption. With majority-based I/O fencing, the potential for data corruption is eliminated as it provides a reliable arbitration mechanism which does not require any extra hardware. In a split-brain scenario, arbitration is done based on `majority` number of nodes among the sub-clusters. The node with the lowest node ID in the cluster is called the leader node and it a role in case of a tie.

Deciding cluster majority for majority-based I/O fencing mechanism:

  • If N is defined as the total number of nodes in the cluster, then majority is equal to N/2 + 1.

  • If there are even number of cluster nodes and both the sub-clusters have N/2 number of nodes, the partition with the leader node is treated as majority and that partition survives.

How majority-based I/O fencing works

An algorithm is used to decide the winner sub-cluster in the following way:

  • The node with the lowest node ID in the current cluster membership is designated as the leader node in the fencing race.

  • When a network partition occurs, each racer sub-cluster computes the number of nodes in its partition and compares it with the majority value.

  • If a racer finds that its partition does not have majority, it sends a LOST_RACE message to all the nodes in its partition including itself and all the nodes panic.

  • If the racer finds that it does have majority, it sends a WON_RACE message to all the nodes. Thus, the partition with majority nodes survives.

Feedback

Was this page helpful?
Previous

Erasure coding in NetBackup Flex Scale

Next

High availability of the NetBackup primary service

Feedback

Was this page helpful?