# US 2008/0304493 A1 · Adaptive dht node relay policies

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

- Number: US 2008/0304493 A1
- Document ID: US20080304493A1
- Status: Published application
- Kind: A1
- Application number: 11/759,186
- Filed: 2007-06-06
- Published: 2008-12-11
- Earliest claimed: 2007-06-06
- Assignees: Sony Computer Entertainment Inc.
- Inventors: James E. MARR; Payton White; Howard Berkey; Attila Vass
- Web page: https://patentgrep.com/patent/US20080304493A1

## CPC

- H04W 40/22: using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

In a distributed hash table overlay network, messages directed to a message ID are relayed one or more nodes that have published interest in that message ID. Messages are distributed, processed, and/or cached in accordance with relay policies, which enable a wide variety of different applications. Nodes to specify relay policies on a per-node, per-message, and/or per-message ID basis. Relay policies can specify any behavior associated with messages, including: message caching, distribution, and processing as well as migration of relay policies when nodes join or leave the network. Intermediate nodes can perform any arbitrary processing of message based on relay policies. Intermediate nodes can offload processing to other nodes, either by forwarding messages to a different message ID or by enlisting the help of nodes subscribed to the message ID. Messages can include one or more subfields specifying commands and/or data to be evaluated by the intermediate node.

## Claims

### Claim 1

A method of processing messages in an overlay network, comprising:
receiving a message from a first node to a second node, the message being directed by a first message ID to the second node;
determining whether the message is a publish message indicating the first node's interest in receiving further messages from the first message ID;
adding the first node to a relay table when the message is determined to be a publish message; and
evaluating at least one relay policy for the first node when the first node is added to the relay table.

### Claim 2 (depends on 1)

A method according to claim 1, further comprising:
associating the first node with a first relay policy specified by the message.

### Claim 3 (depends on 1)

A method according to claim 1, wherein the at least one relay policy is previously associated with the first node.

### Claim 4 (depends on 1)

The method of claim 1, wherein the relay policy applies to messages that are at least one of associated with the message ID, sent by the first node, and received by the first node.

### Claim 5 (depends on 1)

The method of claim 1, wherein the relay policy specifies the distribution of messages directed to the message ID.

### Claim 6 (depends on 1)

The method of claim 1, wherein the relay policy specifies the processing of messages directed to the message ID by the second node or another node.

### Claim 7 (depends on 1)

The method of claim 1, wherein the relay policy specifies the caching of messages directed to the message ID by the second node or another node.

### Claim 8 (depends on 1)

The method of claim 1, wherein the relay policy specifies the migration of at least one of relay policy data and cached data from the second node to another node.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
evaluating a relay policy associated with the message ID to select at least one cached message; and
sending the selected cached message to the first node.

### Claim 10 (depends on 9)

The method of claim 9, wherein the selected message includes the most recently cached message directed to the message ID.

### Claim 11 (depends on 9)

The method of claim 9, wherein the selected message includes two or more cached messages directed to the message ID.

### Claim 12 (depends on 1)

The method of claim 1, further comprising:
forwarding the relay message to the first node in response to the evaluation of the relay policy.

### Claim 13 (depends on 1)

The method of claim 1, further comprising:
evaluating at least one relay policy associated with a received relay message;
processing the relay message according to the relay policy in response to the evaluation; and
forwarding the processed relay message to the first node in response to the evaluation.

### Claim 14 (depends on 13)

The method of claim 13, wherein processing comprises:
translating at least a portion of the relay message from a first language to a second language.

### Claim 15 (depends on 13)

The method of claim 13, wherein processing comprises:
transcoding at least one of audio and video data included in at least a portion of the relay message from a first format to a second format.

### Claim 16 (depends on 13)

The method of claim 13, wherein processing the relay message includes:
evaluating a relay policy associated with the second node.

### Claim 17 (depends on 13)

The method of claim 13, wherein processing the relay message includes:
forwarding the relay message to a second message ID, such that a third node will receive and process the relay message according to the relay policy.

### Claim 18 (depends on 13)

The method of claim 13, wherein processing the relay message includes:
forwarding the relay message to a third node, such that the third node will receive and process the relay message according to the relay policy and forward the processed relay message to the first node.

### Claim 19 (depends on 1)

The method of claim 1, further comprising:
receiving notification of a third node joining the overlay network;
determining if the third node should assume responsibility for the message ID;
in response to the determination that the third node should assume responsibility for the message ID, sending a migration message to the third node, wherein the migration message includes at least one relay policy.

### Claim 20 (depends on 19)

The method of claim 19, wherein the migration message further includes at least one cache message.

### Claim 21 (depends on 13)

The method of claim 13, wherein the relay message includes the relay policy.

### Claim 22 (depends on 13)

The method of claim 13, wherein evaluating the relay policy includes parsing at least one subfield of the relay message.

### Claim 23 (depends on 22)

The method of claim 22, wherein the subfield includes at least one of a command to be executed by the second node and data adapted to specify the processing of the relay message by the second node.

### Claim 24

A computer program product embedded in a computer readable medium for processing messages in an overlay network, comprising:
program code for receiving a message from a first node to a second node, the message being directed by a first message ID to the second node;
program code for determining whether the message is a publish message indicating the first node's interest in receiving further messages from the first message ID;
program code for adding the first node to a relay table when the message is determined to be a publish message; and
program code for evaluating at least one relay policy for the first node when the first node is added to the relay table.

### Claim 25 (depends on 24)

A product according to claim 24, further comprising:
program code for associating the first node with a first relay policy specified by the message.

### Claim 26 (depends on 24)

A product according to claim 24, wherein the at least one relay policy is previously associated with the first node.

### Claim 27

A computerized device for processing messages in an overlay network, the device having a microprocessor, an area of main memory for executing program code under the direction of the microprocessor, and a disk storage device for storing data and program code, the program code including instructions that when executed cause the system to:
receive a message from a first node to a second node, the message being directed by a first message ID to the second node;
determine whether the message is a publish message indicating the first node's interest in receiving further messages from the first message ID;
add the first node to a relay table when the message is determined to be a publish message; and
evaluate at least one relay policy for the first node when the first node is added to the relay table.

### Claim 28 (depends on 27)

A device according to claim 27, wherein the program code further includes instructions that when executed cause the system to:
associate the first node with a first relay policy specified by the message.
