# US 2012/0254655 A1 · Byzantine fault tolerant dynamic quorum using a trusted platform module

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

- Number: US 2012/0254655 A1
- Document ID: US20120254655A1
- Status: Published application
- Kind: A1
- Application number: 13/434,045
- Filed: 2012-03-29
- Published: 2012-10-04
- Earliest claimed: 2008-07-21
- Assignees: International Business Machines Corporation
- Inventors: Henry E. BUTTERWORTH
- Web page: https://patentgrep.com/patent/US20120254655A1

## CPC

- G06F 11/1658: {Data re-synchronization of a redundant component, or initial sync of replacement, additional or spare unit}
- G06F 11/1425: {by reconfiguration of node membership}
- G06F 21/55: Detecting local intrusion or implementing counter-measures
- G06F 11/202: {where processing functionality is redundant (redundant communication control functionality G06F11/2005, redundant storage control functionality G06F11/2089)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method implemented in a computer infrastructure having computer executable code tangibly embodied on a computer readable medium. The computer executable code is operable to dynamically adjust quorum requirements for a voting set V of a server cluster, including a plurality of servers, to ensure that a response of the server cluster to a client request remains Byzantine fault tolerant when at least one of: a failed server of the server cluster is replaced with at least one new server, such that a total set S of servers that have ever been members of the server cluster is increased, and an existing server is removed from the voting set V.

## Claims

### Claim 1

A method implemented in a computer infrastructure having computer executable code tangibly embodied on a computer readable medium being operable to:
dynamically adjust quorum requirements for a voting set V of a server cluster, comprising a plurality of servers, to ensure that a response of the server cluster to a client request remains Byzantine fault tolerant when at least one of:
a failed server of the server cluster is replaced with at least one new server, such that a total set S of servers that have ever been members of the server cluster is increased; and
an existing server is removed from the voting set V.

### Claim 2 (depends on 1)

The method of claim 1, wherein each server comprises a trusted platform module (TPM), the method further comprising the trusted platform module at least one of: maintaining the voting set V; manipulating the voting set V; and servicing requests for the voting set V.

### Claim 3 (depends on 2)

The method of claim 2, wherein the TPM comprises a tamper-proof computing device that must execute properly or stop executing.

### Claim 4 (depends on 2)

The method of claim 2, wherein the TPM comprises a common endorsement key (CEK), a unique endorsement key (UEK) and an interface, the method further comprising:
the TPM verifying messages are received from another server of the server cluster using the CEK; and
the TPM verifying messages are received from a particular server of the server cluster using the UEK.

### Claim 5 (depends on 2)

The method of claim 2, wherein all manipulations of the voting set V are performed within each server's TPM.

### Claim 6 (depends on 2)

The method of claim 2, wherein the manipulating the voting set V comprises at least one of adding a new server to the server cluster and removing an existing server from the server cluster.

### Claim 7 (depends on 6)

The method of claim 6, wherein the adding the new server comprises:
the new server's TPM checking a validity of a current voting set;
the new server synchronizing with the server cluster;
the server cluster determining a future voting set;
the server cluster making a signed committed decision, which is signed by a quorum of the current voting set, to add the new server to the server cluster; and
incrementing the voting set version number.

### Claim 8 (depends on 1)

The method of claim 1, wherein the dynamically adjusting the quorum requirements for the voting set comprises a quorum of the current voting set making a signed committed decision to adjust the quorum requirements by using Byzantine fault tolerant distributed consensus protocol.

### Claim 9 (depends on 2)

The method of claim 2, wherein the servicing requests for the voting set V comprises:
permitting a client to identify servers purporting to be members of the server cluster;
allowing the client to request each identified server return a signed copy of each identified server's most recent voting set and voting set version numbering in order to determine a server having the highest voting set version number from the returned signed copies; and
the server having the highest voting set version number receiving a request for service from the client.

### Claim 10 (depends on 9)

The method of claim 9, wherein the request includes a nonce, and the nonce comprises a number used only once to identify the request.

### Claim 11 (depends on 1)

The method of claim 1, wherein the quorum requirements is a minimum number of servers or a subset of the server cluster necessary to conduct operations for the entire server cluster.

### Claim 12 (depends on 1)

The method of claim 1, wherein a service provider at least one of creates, maintains, deploys and supports the computer infrastructure that performs the steps of claim 1.

### Claim 13 (depends on 1)

The method of claim 1, wherein steps of claim 1 are provided by a service provider on a subscription, advertising, and/or fee basis.

### Claim 14

A system, comprising
a server cluster comprising a plurality of servers, wherein each server includes a trusted platform module (TPM) operable to at least one of:
maintain a voting set V;
manipulate the voting set V; and
service requests for the voting set V.

### Claim 15 (depends on 14)

The system of claim 14, wherein:
the voting set V is dynamic; and
the TPM is further operable to dynamically adjust quorum requirements for the voting set V of the server cluster to ensure that a response of the server cluster to a client request remains Byzantine fault tolerant.

### Claim 16 (depends on 14)

The system of claim 14, wherein the TPM is further operable to dynamically adjust quorum requirements for the voting set V of the server cluster to ensure that a response of the server cluster to a client request remains Byzantine fault tolerant when at least one of:
a failed server of the server cluster is replaced with at least one new server, such that a set S of servers that have ever been members of the server cluster is increased; and
an existing server is removed from the voting set V.

### Claim 17 (depends on 14)

The system of claim 14, wherein the TPM comprises a tamper-proof computing device that must execute properly or stop executing.

### Claim 18 (depends on 14)

The system of claim 14, wherein the TPM is operable to:
utilize a common endorsement key (CEK) to verify messages are received from another server of the server cluster; and
utilize a unique endorsement key (UEK) to verify messages are received from a particular server.

### Claim 19

A computer program product comprising a computer usable storage medium having readable program code embodied in the storage medium, the computer program product includes at least one component operable to:
dynamically adjust quorum requirements for a voting set V of a server cluster, comprising a plurality of servers, to ensure that a response of the server cluster to a client request remains Byzantine fault tolerant when at least one of:
a failed server of the server cluster is replaced with at least one new server, such that a total set S of servers that have ever been members of the server cluster is increased; and
an existing server is removed from the voting set V.

### Claim 20 (depends on 19)

The computer program product of claim 19, wherein the computer program product is operable to at least one of:
maintain the voting set V;
manipulate the voting set V; and
service requests for the voting set V.
