# US 2020/0396282 A1 · Selection of leader nodes in distributed data services

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2020/0396282 A1
- Document ID: US20200396282A1
- Status: Published application
- Kind: A1
- Application number: 16/946,757
- Filed: 2020-07-06
- Published: 2020-12-17
- Earliest claimed: 2018-05-01
- Assignees: YugaByte Inc
- Applicants: YugaByte Inc
- Inventors: Bogdan-Alexandru Matican; Rahul Desirazu; Karthik Ranganathan; Kannan Muthukkaruppan; Bharat Chandra Baddepudi; Ramkumar Vaidyanathan Sri; Choudhury Sidharth
- Web page: https://patentgrep.com/patent/US20200396282A1

## CPC

- H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/065: {Replication mechanisms}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 9/5077: {Logical partitioning of resources; Management or configuration of virtualized resources (specific details on emulation or internal functioning of virtual machines G06F9/455)}
- G06F 16/27: Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
- H04L 41/0806: for initial configuration or provisioning, e.g. plug-and-play
- H04L 41/0893: Assignment of logical groups to network elements
- H04L 41/22: comprising specially adapted graphical user interfaces [GUI]
- H04L 41/5009: Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
- H04L 41/5019: Ensuring fulfilment of SLA
- H04L 61/4511: using domain name system [DNS]
- H04L 67/10: in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46)
- H04L 67/1008: based on parameters of servers, e.g. available memory or workload (monitoring of computer activity G06F11/30)
- H04L 67/101: based on network conditions
- H04L 67/1012: based on compliance of requirements or conditions with available server resources
- H04L 67/1051: {Group master selection mechanisms}
- H04L 67/34: {involving the movement of software or configuration parameters (network booting or remote initial program loading [RIPL] G06F9/4416)}
- H04L 67/52: specially adapted for the location of the user terminal
- H04L 67/60: Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources (admission control or resource allocation H04L47/70)
- H04L 67/62: Establishing a time schedule for servicing the requests
- H04L 41/5096: {wherein the managed service relates to distributed or central networked applications}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

An aspect of the present disclosure facilitates selection of leader nodes in distributed data services. In one embodiment, a distributed data service is provided operative based on multiple nodes. Upon receiving from a user a selection of a set of nodes that are preferred as leader nodes, a node contained in the set of nodes is set as a leader node in the distributed data service in view of the selection by the user. Accordingly, a user is provided control over the selection of leader nodes in the distributed data service.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A method comprising:
providing a distributed data service operative based on a plurality of nodes;
receiving from a user a selection of a set of nodes of said plurality of nodes that are preferred as leader nodes, each of said set of nodes being identified by a corresponding unique identifier of a set of identifiers; and
performing determination of a leader node, wherein said determination comprises setting a first node of said set of nodes as a leader node in said distributed data service in view of said selection by said user,
wherein said performing is performed after said selection being received from said user, whereby said set of nodes are identified in said distributed data service prior to said performing in view of said corresponding unique identifiers.

### Claim 22 (depends on 21)

The method of claim 21, wherein said plurality of nodes is grouped into a plurality of clusters of nodes, wherein said determination comprises:
electing, by a consensus algorithm, a corresponding leader node for each cluster of said plurality of clusters of nodes, wherein said electing elects another node for a first cluster of nodes, wherein said setting is performed if said another node is not contained in said set of nodes received from said user.

### Claim 23 (depends on 22)

The method of claim 22, wherein said setting comprises execution of said consensus algorithm iteratively until one of said set of nodes is elected as the leader node in view of receiving of said selection.

### Claim 24 (depends on 23)

The method of claim 23, wherein said consensus algorithm is Raft consensus algorithm.

### Claim 25 (depends on 24)

The method of claim 24, wherein said distributed data service is a distributed database.

### Claim 26 (depends on 21)

The method of claim 21, wherein said selection comprises indicating unique identifiers of individual ones of specific nodes of said plurality of nodes to specify said set of nodes.

### Claim 27 (depends on 21)

The method of claim 21, wherein each unique identifier is a corresponding Internet Protocol (IP) address of a respective node of the plurality of nodes.

### Claim 28

A non-transitory machine readable storage medium storing one or more sequences of instructions, wherein execution of said one or more instructions by one or more processors contained in a system causes said system to perform the actions of:
providing a distributed data service operative based on a plurality of nodes;
receiving from a user a selection of a set of nodes of said plurality of nodes that are preferred as leader nodes, each of said set of nodes being identified by a corresponding unique identifier of a set of identifiers; and
performing determination of a leader node, wherein said determination comprises setting a first node of said set of nodes as a leader node in said distributed data service in view of said selection by said user,
wherein said performing is performed after said selection being received from said user, whereby said set of nodes are identified in said distributed data service prior to said performing in view of said corresponding unique identifiers.

### Claim 29 (depends on 28)

The non-transitory machine readable storage medium of claim 28, wherein said plurality of nodes is grouped into a plurality of clusters of nodes, wherein said determination comprises:
electing, by a consensus algorithm, a corresponding leader node for each cluster of said plurality of clusters of nodes, wherein said electing elects another node for a first cluster of nodes, wherein said setting is performed if said another node is not contained in said set of nodes received from said user.

### Claim 30 (depends on 29)

The non-transitory machine readable storage medium of claim 29, wherein said setting comprises execution of said consensus algorithm iteratively until one of said set of nodes is elected as the leader node in view of receiving of said selection.

### Claim 31 (depends on 30)

The non-transitory machine readable storage medium of claim 30, wherein said consensus algorithm is Raft consensus algorithm.

### Claim 32 (depends on 31)

The non-transitory machine readable storage medium of claim 31, wherein said distributed data service is a distributed database.

### Claim 33 (depends on 28)

The non-transitory machine readable storage medium of claim 28, wherein said selection comprises indicating unique identifiers of individual ones of specific nodes of said plurality of nodes to specify said set of nodes.

### Claim 34 (depends on 28)

The non-transitory machine readable storage medium of claim 28, wherein each unique identifier is a corresponding Internet Protocol (IP) address of a respective node of the plurality of nodes.

### Claim 35

A digital processing system comprising:
one or more processors; and
a random access memory (RAM) to store instructions, wherein said one or more processors retrieve said instructions and execute said instructions, wherein execution of said instructions causes said digital processing system to perform the actions of:
providing a distributed data service operative based on a plurality of nodes;
receiving from a user a selection of a set of nodes of said plurality of nodes that are preferred as leader nodes, each of said set of nodes being identified by a corresponding unique identifier of a set of identifiers; and
performing determination of a leader node, wherein said determination comprises setting a first node of said set of nodes as a leader node in said distributed data service in view of said selection by said user,
wherein said performing is performed after said selection being received from said user, whereby said set of nodes are identified in said distributed data service prior to said performing in view of said corresponding unique identifiers.

### Claim 36 (depends on 35)

The digital processing system of claim 35, wherein said plurality of nodes is grouped into a plurality of clusters of nodes, wherein said determination comprises:
electing, by a consensus algorithm, a corresponding leader node for each cluster of said plurality of clusters of nodes, wherein said electing elects another node for a first cluster of nodes, wherein said setting is performed if said another node is not contained in said set of nodes received from said user.

### Claim 37 (depends on 36)

The digital processing system of claim 36, wherein said setting comprises execution of said consensus algorithm iteratively until one of said set of nodes is elected as the leader node in view of receiving of said selection.

### Claim 38 (depends on 37)

The digital processing system of claim 37, wherein said consensus algorithm is Raft consensus algorithm, wherein said distributed data service is a distributed database.

### Claim 39 (depends on 35)

The method of claim 35, wherein said selection comprises indicating unique identifiers of individual ones of specific nodes of said plurality of nodes to specify said set of nodes.

### Claim 40 (depends on 35)

The method of claim 35, wherein each unique identifier is a corresponding Internet Protocol (IP) address of a respective node of the plurality of nodes.
