Error recovery to enable error-free message transfer between nodes of a computer network

Patent metadata

Field	Value
Publication number	US-9244759-B2
Application number	US-201414148348-A
Country	US
Kind code	B2
Filing date	Jan 6, 2014
Priority date	Feb 25, 2002
Publication date	Jan 26, 2016
Grant date	Jan 26, 2016

Abstract

An error-recovery method to enable error-free message transfer between nodes of a computer network. A first node of the network sends a packet to a second node of the network over a link between the nodes, and the first node keeps a copy of the packet on a sending end of the link until the first node receives acknowledgment from the second node that the packet was received without error. The second node tests the packet to determine if the packet is error free. If the packet is not error free, the second node sets a flag to mark the packet as corrupt. The second node returns acknowledgement to the first node specifying whether the packet was received with or without error. When the packet is received with error, the link is returned to a known state and the packet is sent again to the second node.

First claim

What is claimed is:

1. An error-recovery method to enable error-free message transfer between nodes of a computer network, the method comprising the steps of:
a first node of the network sending a packet to a second node of the network over a link between the first and second nodes, said packet including a header, a trailer, and control information, the trailer including means to test the packet to determine if the packet is corrupt, and a flag to indicate whether or not the packet is corrupt;
the first node keeping a copy of the packet on a sending end of the link until the first node receives an acknowledgment from the second node that the packet was received by the second node without error;
the second node testing the packet to determine if the packet is error free; and
if the second node determines that the packet is not error free, then the second node setting a flag in the trailer of the packet to mark the packet as corrupt;
the second node returning an acknowledgement to the first node which specifies whether the packet was received with or without error; and
when the packet is received with an error, returning the link to a known state and again sending the packet to the second node.

2. A method according to claim 1 , comprising the further steps of:
the second node, upon receipt of the packet, checking the packet to determine if it is corrupt; and
if the packet is corrupt, the second node setting said flag in the trailer to indicate that the packet is corrupt or discarding the packet.

3. A method according to claim 1 , wherein the header of the packet includes control information to communicate information between the first and second nodes about internal states of the first and second nodes.

4. A method according to claim 3 , wherein the control information includes an acknowledgement to specify whether a packet transmitted previously was received correctly or not.

5. A method according to claim 4 , comprising the further step of the second node using said acknowledgement to request retransmission of the packet when the packet is determined to be corrupt.

6. The method according to claim 1 , further comprising:
the second mode performing an operation using said packet and sending a result of the operation in a further packet to a third node; and
when the second node determines that the packet has an error, the second node sending a flag to the third node indicating that the further packet has an error.

7. An error recovery method to enable error-free message transfer between nodes of a computer network, the method comprising the steps of:
a first node of the network sending a packet to a second node of the network, said packet including a header a trailer, and control information, the trailer including means to test the packet to determine if the packet is corrupt, and a flag to indicate whether or not the packet is corrupt;
the first node keeping a copy of the packet until the first node receives an acknowledgment from the second node that the packet was received by the second node without error;
the second node testing the packet to determine if the packet is error free; and
if the second node determines that the packet is not error free, then the second node setting a flag in the trailer of the packet to mark the packet as corrupt;
the second node returning an acknowledgement to the first node which specifies whether the packet was received with or without error,
wherein the nodes of the network are connected together by links, and a multitude of packet types are transmitted between the nodes of the network, said multitude of packet types including:
data packets for transmitting data and control information between the nodes;
empty packets to pass control information back from one of the nodes to another of the nodes when data packets are not available to said one of the nodes; and
sync packets to maintain logic level transitions on each of the links when said each of the links is idle, and to pass control information back from one of the nodes to another of the nodes when data packets are not available to said one of the nodes.

Assignees

• IBM

Inventors

• Blumrich Matthias A
• Coteus Paul W
• Chen Dong
• Gara Alan
• Giampapa Mark E
• Heidelberger Philip
• Hoenicke Dirk
• Takken Todd
• Steinmacher-Burow Burkhard
• Vranas Pavlos M

Classifications

• H04L1/1607

  Details of the supervisory signal · CPC title

• G06F11/08 Primary

  Error detection or correction by redundancy in data representation, e.g. by using checking codes · CPC title

• G06F9/46

  Multiprogramming arrangements · CPC title

• G06F11/1423

  by reconfiguration of paths · CPC title

• H03M13/09 Primary

  Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit · CPC title