# US 2006/0080678 A1 · Task distribution method for protecting servers and tasks in a distributed system

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

- Number: US 2006/0080678 A1
- Document ID: US20060080678A1
- Status: Published application
- Kind: A1
- Application number: 10/935,331
- Filed: 2004-09-07
- Published: 2006-04-13
- Earliest claimed: 2004-09-07
- Inventors: Mark Bailey; Kevin Kwiat
- Web page: https://patentgrep.com/patent/US20060080678A1

## CPC

- G06F 21/53: by executing in a restricted environment, e.g. sandbox or secure virtual machine
- G06F 9/466: {Transaction processing}
- G06F 9/485: {Task life-cycle, e.g. stopping, restarting, resuming execution (G06F9/4881 takes precedence)}
- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F 11/1484: {involving virtual machines}
- G06F 21/55: Detecting local intrusion or implementing counter-measures
- H04L 63/1441: {Countermeasures against malicious traffic (countermeasures against attacks on cryptographic mechanisms H04L9/002)}
- G06F 11/18: using passive fault-masking of the redundant circuits {(error detection by comparing the output of redundant processing systems with continued operation after detection of the error G06F11/165)}
- G06F 11/20: using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
- G06F 2209/5017: Task decomposition
- G06F 2209/509: Offload
- G06F 2221/2115: Third party
- G06F 2221/2139: Recurrent verification
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Method for securing tasks and servers in a distributed system from outside attack. Tasks are protected from modification and faulty execution using a combination of redundancy and distribution of data. A stripe virtual machine process control the execution of remote tasks at each server. Stripes are executed redundantly on multiple servers and concurrently on each server. A poller determines the majority machine state among the servers. Attacks are annulled by voting down the attacked server's state and restoring it to the majority state.

## Claims

### Claim 1

Method for protecting servers and tasks in a distributed system, comprising the steps: of:
controlling the execution of remote tasks at each server by a stripe virtual machine process wherein said stripe virtual machine process further comprises the steps of
executing stripes within a stripe execution environment; and
managing stripe states.

### Claim 2 (depends on 1)

Method of claim 1, wherein said step of executing stripes within a stripe execution environment further comprises the steps of
starting said servers;
stopping said servers;
resuming execution of said tasks; and
translating between application code and machine code.

### Claim 3 (depends on 1)

Method of claim 1, wherein said step of managing stripe states further comprises the steps of
enabling said server to capture the current memory state of a stopped task;
transmitting said captured task to other servers through a network adapter; and
receiving task state updates from other servers.

### Claim 4 (depends on 2, 3)

Method of claims 2 and 3, further comprising the steps of
executing stripes redundantly on multiple servers; and
executing stripes concurrently on each server.

### Claim 5 (depends on 4)

Method of claim 4, wherein said step of executing stripes redundantly on multiple servers comprises the steps of
transmitting each task from client to each server;
loading each task onto each server;
executing stripe in each server;
capturing the virtual machine state in each server;
transmitting said virtual machine state from each server to poller;
comparing and tallying results in poller;
determining whether said task is COMPLETED, wherein
IF said task is COMPLETED, then transmitting final result from poller to client,
OTHERWISE, if it is determined that said task is NOT
COMPLETED, then
transmitting majority state from said poller to said servers;
loading new majority virtual machine state into said servers;
and
returning to said step of executing stripe in each server.

### Claim 6 (depends on 4)

Method of claim 4 wherein said step of executing stripes concurrently on each server comprises the steps of
loading a task onto a server;
determining whether stripe is COMPLETED, wherein
IF said stripe is COMPLETED, then
capturing virtual machine state;
transmitting said virtual machine state to poller;
determining whether said task is COMPLETED, wherein
IF said task is COMPLETED, then stopping said step of executing stripes concurrently;
OTHERWISE, if it is determined that said task is NOT COMPLETED, then
loading new majority virtual machine state;
determining whether a new stripe is to be executed,
wherein
F it is determining that a new stripe is to be executed, then
returning to said step of loading a task onto a server;
OTHERWISE, returning to said step of loading new majority virtual machine state;
OTHERWISE, if it is determined that said stripe is NOT COMPLETED, then
fetching and executing instruction;
loading next server; and
returning to said step of determining whether stripe is COMPLETED.

### Claim 7

Method for annulling an intermediary attack in a distributed system, comprising the steps of
forwarding the virtual machine state of each of a plurality of servers to a poller;
determining a majority state among said plurality of servers;
identifying an incorrect modified task in one of said servers, said task having been modified as a result of said intermediary attack;
loading the majority state into all servers prior to the execution of the first stripe;
restoring to the correct majority state, the state of said server which contains said incorrect modified task; and
repeating said steps of forwarding, determining, identifying, loading and restoring for each round of stripe execution.

### Claim 8

Method for annulling the affect of a compromised server on a task in a distributed system, comprising the steps of
comparing the stripe state of each of a plurality of servers in a poller;
determining a majority state among said plurality of servers; and
voting down said compromised server's state by said majority state.

### Claim 9 (depends on 1)

Method of claims 1 though 8, further comprising the steps of
imposing an upper bound on said stripe size as measured in the number of server machine instructions contained therein;
refreshing said virtual machine state of each of said plurality of servers between said stripe executions so as to erase any minority state prior to a successive stripe execution; and
rejecting all server tasks in which stripe size thereof exceeds said upper bound.

### Claim 10 (depends on 9)

Method of claim 9 wherein decreasing said upper bound on said stripe size as measured in the number of server machine instructions contained therein increases the level of protection afforded to said distributed system.

### Claim 11

Apparatus for protecting servers and tasks in a distributed system, comprising:
means for controlling the execution of remote tasks at each server by a stripe virtual machine process wherein said stripe virtual machine process further comprises
means for executing stripes within a stripe execution environment; and
means for managing stripe states.

### Claim 12 (depends on 11)

Apparatus of claim 11, wherein said means for executing stripes within a stripe execution environment further comprises
means for starting said servers;
means for stopping said servers;
means for resuming execution of said tasks; and
means for translating between application code and machine code.

### Claim 13 (depends on 11)

Apparatus of claim 11, wherein said means for managing stripe states further comprises
means for enabling said server to capture the current memory state of a stopped task;
means for transmitting said captured task to other servers through a network adapter; and
means for receiving task state updates from other servers.

### Claim 14 (depends on 12, 13)

Apparatus of claims 12 and 13, further comprising
means for executing stripes redundantly on multiple servers; and
means for executing stripes concurrently on each server.

### Claim 15 (depends on 14)

Apparatus of claim 14, wherein said means for executing stripes redundantly on multiple servers comprises
means for transmitting each task from client to each server;
means for loading each task onto each server;
means for executing stripe in each server;
means for capturing the virtual machine state in each server;
means for transmitting said virtual machine state from each server to poller;
means for comparing and tallying results in poller;
means for determining whether said task is COMPLETED, wherein
IF said task is COMPLETED, then further comprising means for transmitting final result from poller to client,
OTHERWISE, if it is determined that said task is NOT
COMPLETED, then further comprising
means for transmitting majority state from said poller to said servers;
means for loading new majority virtual machine state into said servers; and
means for returning to said step of executing stripe in each server.

### Claim 16 (depends on 14)

Apparatus of claim 14 wherein said means for executing stripes concurrently on each server comprises
means for loading a task onto a server;
means for determining whether stripe is COMPLETED, wherein
IF said stripe is COMPLETED, then further comprising
means for capturing virtual machine state;
means for transmitting said virtual machine state to poller;
means for determining whether said task is COMPLETED, wherein
IF said task is COMPLETED, then further comprising
means for stopping said step of executing stripes concurrently;
OTHERWISE, if it is determined that said task is NOT
COMPLETED, then further comprising
means for loading new majority virtual machine state;
means for determining whether a new stripe is to be executed, wherein
IF it is determined that a stripe is to be executed, then further comprising
means for returning to said step of loading a task onto a server;
OTHERWISE, means for returning to said step of loading new majority virtual machine state;
OTHERWISE, if it is determined that said stripe is NOT COMPLETED, then further comprising
means for fetching and executing instruction;
means for loading next server; and
means for returning to said step of determining whether stripe is COMPLETED.

### Claim 17

Apparatus for annulling an intermediary attack in a distributed system, comprising
means for forwarding the virtual machine state of each of a plurality of servers to a poller;
means for determining a majority state among said plurality of servers;
means for identifying an incorrect modified task in one of said servers, said task having been modified as a result of said intermediary attack;
means for loading the majority state into all servers prior to the execution of the first stripe;
means for restoring to the correct majority state, the state of said server which contains said incorrect modified task; and
means for repeating said forwarding, determining, identifying, loading and restoring for each round of stripe execution.

### Claim 18

Apparatus for annulling the affect of a compromised server on a task in a distributed system, comprising
means for comparing the stripe state of each of a plurality of servers in a poller;
means for determining a majority state among said plurality of servers; and
means for voting down said compromised server's state by said majority state.

### Claim 19 (depends on 11)

Apparatus of claims 11 though 18, further comprising
means for imposing an upper bound on said stripe size as measured in the number of server machine instructions contained therein;
means for refreshing said virtual machine state of each of said plurality of servers between said stripe executions so as to erase any minority state prior to a successive stripe execution; and
means for rejecting all server tasks in which stripe size thereof exceeds said upper bound.

### Claim 20 (depends on 19)

Apparatus of claim 19 wherein decreasing said upper bound on said stripe size as measured in the number of server machine instructions contained therein increases the level of protection afforded to said distributed system.

### Claim 21 (depends on 11, 12, 13, 14, 15, 16, 17, 18, 19, 20)

An apparatus as claims 11 through 20 being capable of carrying out computer implement-able instructions.
