# US 2009/0276480 A1 · Message send version management in network

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

- Number: US 2009/0276480 A1
- Document ID: US20090276480A1
- Status: Published application
- Kind: A1
- Application number: 12/112,737
- Filed: 2008-04-30
- Published: 2009-11-05
- Earliest claimed: 2008-04-30
- Assignees: International Business Machines Corporation
- Inventors: Gary ANNA; Joseph Whitney DAIN
- Web page: https://patentgrep.com/patent/US20090276480A1

## CPC

- H04L 69/08: Protocols for interworking; Protocol conversion
- H04L 69/085: specially adapted for interworking of IP-based networks with other networks
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

An apparatus, method, and computer program product for message send version management in a distributed computing environment including a plurality of nodes is provided. A message is sent from a first node of the plurality of nodes to at least one additional node of the plurality of nodes. At least one translation vector is constructed to translate between multiple message versions is constructed. The at least one translation vector is send from the first node to the at least one additional node. In one embodiment, the at least one translation vector is attached to the message to generate a packet.

## Claims

### Claim 1

A method for message version management in a distributed computing environment including a plurality of nodes, a message sent from a first node of the plurality of nodes to at least one additional node of the plurality of nodes, comprising:
constructing at least one translation vector to translate between multiple message versions; and
sending the at least one translation vector from the first node to the at least one additional node.

### Claim 2 (depends on 1)

The method of claim 1, wherein sending the at least one translation vector from the first node to the at least one additional node includes attaching the at least one translation vector to the message to generate a packet.

### Claim 3 (depends on 2)

The method of claim 2, wherein attaching the at least one translation vector to the message to generate a packet is performed for one of (1) sending the message for a first time from the first node to the at least one additional node, and (2) sending the message each time from the first node to the at least one additional node.

### Claim 4 (depends on 1)

The method of claim 1, wherein constructing a translation vector to translate between multiple message versions includes:
examining a translation table, and
modifying the message according to the translation table to be compatible across multiple message versions.

### Claim 5 (depends on 4)

The method of claim 4, wherein modifying the message according to the translation table includes truncating, adding, deleting, moving, or concatenating at least a portion of the message.

### Claim 6 (depends on 1)

The method of claim 1, further including:
examining a translation table to be compatible across multiple message versions, and
examining a field to designate at least one target node.

### Claim 7 (depends on 2)

The method of claim 2, further including sending the packet, including the message and the at least one translation vector, to the at least one additional node.

### Claim 8 (depends on 1)

The method of claim 1, further including attaching a header to at least one of the message or the translation vector to identify the message or the translation vector.

### Claim 9 (depends on 1)

The method of claim 1, further including, subsequent to sending the translation vector, updating a field in the table to reflect sending the at least one translation vector.

### Claim 10

An administrator device for message version management in a distributed computing environment including a plurality of nodes, a message sent from a first node of the plurality of nodes to at least one additional node of the plurality of nodes, comprising:
a message module operable on a sending application in communication with the plurality of nodes, wherein the message module is adapted for:
constructing at least one translation vector to translate between multiple message versions, and
sending the at least one translation vector from the first node to the at least one additional node.

### Claim 11 (depends on 11)

The device of claim 11, wherein the message module is further adapted for attaching the at least one translation vector to the message to generate a packet.

### Claim 12 (depends on 11)

The device of claim 11, wherein the message module is further adapted for attaching the at least one translation vector to the message to generate a packet for one of (1) sending the message for a first time from the first node to the at least one additional node, and (2) sending the message each time from the first node to the at least one additional node.

### Claim 13 (depends on 10)

The device of claim 10, wherein the message module is further adapted for:
examining a translation table, and
modifying the message according to the translation table to be compatible across multiple message versions.

### Claim 14 (depends on 13)

The device of claim 13, wherein the message module is further adapted for truncating, adding, deleting, moving, or concatenating at least a portion of the message to modify the message.

### Claim 15 (depends on 11)

The device of claim 11, wherein the message module is further adapted for sending the packet, including the message and the at least one translation vector, to the at least one additional node.

### Claim 16 (depends on 10)

The device of claim 10, wherein the at least one translation vector is adapted for either of:
(a) translation from a higher message version to a lower message version, and
(b) translation from a lower message version to a higher message version.

### Claim 17

A computer program product for message version management in a distributed computing environment including a plurality of nodes, a message sent from a first node of the plurality of nodes to at least one additional node of the plurality of nodes, the computer program product comprising a computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:
a first executable portion for constructing at least one translation vector to translate between multiple message versions; and
a second executable portion for sending the at least one translation vector from the first node to the at least one additional node.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein the second executable portion for sending the at least one translation vector from the first node to the at least one additional node includes a third executable portion for attaching the at least one translation vector to the message to generate a packet, wherein the attaching is performed for one of (1) a first time the message is sent from the first node to the at least one additional node, and (2) each time the message is sent from the first node to the at least one additional node.

### Claim 19 (depends on 17)

The computer program product of claim 17, wherein the first executable portion for constructing a translation vector to translate between multiple message versions includes a third executable portion for:
examining a translation table, and
modifying the message according to the translation table to be compatible across multiple message versions.

### Claim 20 (depends on 18)

The computer program product of claim 18, further including a fourth executable portion for sending the packet, including the message and the at least one translation vector, to the at least one additional node.
