# US 2005/0240677 A1 · Method and apparatus for failure resilient forwarding of data over a computer network

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

- Number: US 2005/0240677 A1
- Document ID: US20050240677A1
- Status: Published application
- Kind: A1
- Application number: 10/830,779
- Filed: 2004-04-23
- Published: 2005-10-27
- Earliest claimed: 2004-04-23
- Assignees: International Business Machines Corporation
- Inventors: Zhen Liu; Sambit Sahu; Jeremy Silber
- Web page: https://patentgrep.com/patent/US20050240677A1

## CPC

- H04L 41/0654: using network fault recovery (ring fault isolation or reconfiguration in loop networks without recovery actions by a network management system H04L12/437)
- H04L 67/568: Storing data temporarily at an intermediate stage, e.g. caching
- H04L 67/5682: Policies or rules for updating, deleting or replacing the stored data
- H04L 69/16: Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
- H04L 69/163: In-band adaptation of TCP data exchange; In-band control procedures
- H04L 69/165: Combined use of TCP and UDP protocols; selection criteria therefor
- H04L 69/40: for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection (management of faults, events, alarms or notifications in data switching networks H04L41/06)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

In one embodiment, the present invention is a method and an apparatus for failure-resilient forwarding of data over a computer network. In one embodiment, a marker is introduced into the data stream, e.g., at the sending node, and allows, in turn, forwarding nodes and/or receivers to efficiently track data stream reception. The marker functions as a checkpoint for the data transport process, and is identified and indexed at each forwarding node and receiver. Each receiver saves the marker prior to delivering data to an application, thereby designating a point in the data stream at which all preceding data is confirmed to have been delivered to the application. Thus, if a forwarding node fails, the receiver may request stream data from an alternate forwarding node by specifying to the alternate forwarding node to provide data starting from the marker.

## Claims

### Claim 1

A method for forwarding a data stream over a network from a sender node to one or more receiver nodes, the method comprising the steps of:
receiving a marked stream having a portion of the data stream and one or more markers;
storing one or more of said markers and at least a subsequent portion of said marked stream in a buffer;
forwarding said marked stream to one or more next recipient nodes; and
responding to a request for stream data stored in the buffer by initiating data transfer at a specified marker, wherein said request is for the delivery of stream data subsequent to the specified marker.

### Claim 2 (depends on 1)

The method of claim 1, wherein said marker is a recognizable bit field having a unique identifier.

### Claim 3 (depends on 1)

The method of claim 1, wherein said marker is injected into said portion of the data stream by the sender node.

### Claim 4 (depends on 1)

The method of claim 1, wherein said marker is injected into the data stream by an intermediate node between the sender node and the one or more receiver nodes.

### Claim 5 (depends on 1)

The method of claim 1, wherein the marked data stream is sent using point-to-point reliable transport protocol.

### Claim 6 (depends on 5)

The method of claim 5, wherein said point reliable transport protocol is TCP/IP protocol.

### Claim 7 (depends on 1)

The method of claim 1, wherein the one or more next recipient nodes are intermediate nodes between the sender node and the one or more receiver nodes, wherein the intermediate nodes are adapted for forwarding the marked data stream to at least the one or more receiver nodes.

### Claim 8 (depends on 1)

The method of claim 1, wherein said step of storing said one or more markers comprises:
recording said marker in the marked data stream as a most recently received marker; and
updating a marker index, wherein the marker index records markers that were previously received.

### Claim 9 (depends on 8)

The method of claim 8, wherein the marker index records, for each marker received, a unique identifier and a position in the buffer.

### Claim 10 (depends on 1)

The method of claim 1, wherein the one or more next recipient nodes are the one or more receiver nodes.

### Claim 11 (depends on 1)

The method of claim 1, further comprising the steps of:
delivering the portion of the data stream to an application.

### Claim 12 (depends on 11)

The method of claim 11, wherein the step of delivering the portion of the data stream comprises delivering a portion of the data stream starting from one of said markers.

### Claim 13 (depends on 11)

The method of claim 11, wherein the step of delivering the portion of the data stream comprises delivering a portion of the data stream starting from a point in the data stream that is after one of said markers.

### Claim 14 (depends on 1)

The method of claim 1, wherein the one or more next recipient nodes are adapted for both forwarding the marked data stream and for receiving the marked data stream for delivery to one or more applications.

### Claim 15 (depends on 14)

The method of claim 14, wherein the one or more next recipient nodes are adapted for performing the forwarding and receiving steps simultaneously.

### Claim 16 (depends on 14)

The method of claim 14, wherein the one or more next recipient nodes are adapted for performing the forwarding and receiving steps in any order.

### Claim 17

A method for resuming interrupted transport of data over a network from a sender node to a receiver node, the method comprising the steps of:
connecting to an intermediate node in the network; and
requesting data from the intermediate node starting from a last marker saved by the receiver node.

### Claim 18 (depends on 17)

The method of claim 17, further comprising the step of:
resetting a receiver queue write pointer to a position immediately following the last saved marker; and
queuing data from the intermediate node to the receiver node.

### Claim 19 (depends on 17)

The method of claim 17, further comprising the step of:
delivering data queued by the receiver when a next marker is received from the intermediate node, wherein the queued data is delivered to an application.

### Claim 20 (depends on 17)

The method of claim 17, wherein the step of requesting data from the intermediate node comprises the steps of:
specifying a unique identifier for the marker; and
looking up the marker in a local buffer of the intermediate node.

### Claim 21 (depends on 20)

The method of claim 20, further comprising the step of:
discarding any data in the local buffer received after the marker.

### Claim 22 (depends on 17)

The method of claim 17, further comprising the step of:
overwriting data following the marker in a local buffer of the receiver node, wherein the data is overwritten with the data being received from the intermediate node.

### Claim 23

A system for forwarding data over a network, comprising:
means for sending stream data;
means for receiving the stream data;
means for designating and tracking reference points in the stream data; and
means for receiving the stream data from an alternate sending means by specifying a point at which the alternate sending means should begin sending the stream data,

### Claim 24

A computer readable medium containing an executable program for forwarding a data stream over a network from a sender node to one or more receiver nodes, where the program performs the steps of:
receiving a marked stream having a portion of the data stream and one or more markers;
storing said one or more markers and said marked stream in a buffer; and
forwarding said marked stream to one or more next recipient nodes; and
responding to a request for stream data stored in the buffer by initiating data transfer at a specified marker, wherein said request is for the delivery of stream data subsequent to the specified marker.

### Claim 25 (depends on 24)

The computer readable medium of claim 24, wherein said marker is a recognizable bit field having a unique identifier.

### Claim 26 (depends on 22)

The computer readable medium of claim 22, wherein the one or more next recipient node are intermediate nodes between the sender node and the one or more receiver nodes, wherein the intermediate nodes are adapted for forwarding the marked data stream to the one or more receiver nodes.

### Claim 27 (depends on 24)

The computer readable medium of claim 24, wherein said step of storing said one or more markers comprises:
recording said marker in the marked data stream as a most recently received marker; and
updating a marker index, wherein the marker index records markers that were previously received.

### Claim 28 (depends on 27)

The computer readable medium of claim 27, wherein the marker index records, for each marker received, a unique identifier and a position in the buffer.

### Claim 29 (depends on 24)

The computer readable medium of claim 24, wherein the one or more next recipient nodes are the one or more receiver nodes.

### Claim 30 (depends on 24)

The method of claim 24, wherein the one or more next recipient nodes are adapted for both forwarding the marked data stream and for receiving the marked data stream for delivery to one or more applications.

### Claim 31 (depends on 30)

The method of claim 30, wherein the one or more next recipient nodes are adapted for performing the forwarding and receiving steps simultaneously.

### Claim 32 (depends on 30)

The method of claim 30 wherein the one or more next recipient nodes are adapted for performing the forwarding and receiving steps in any order.

### Claim 33

A computer readable medium containing an executable program for resuming interrupted transport of data over a network from a sender node to a receiver node, where the program performs the steps of:
connecting to an intermediate node in the network; and
requesting data from the intermediate node starting from a last marker saved by the receiver node.

### Claim 34 (depends on 33)

The computer readable medium of claim 33, further comprising the step of:
resetting a receiver queue write pointer to a position immediately following the last saved marker; and
queuing data from the intermediate node to the receiver.

### Claim 35 (depends on 33)

The computer readable medium of claim 33, further comprising the step of:
delivering data queued by the receiver when a next marker is received from the intermediate node, wherein the queued data is delivered to an application.

### Claim 36 (depends on 33)

The computer readable medium of claim 33, wherein the step of requesting data from the intermediate node comprises:
specifying a unique identifier for the marker; and
looking up the marker in a local buffer of the intermediate node.

### Claim 37

A method for providing content delivery optimization for a network over which a data stream is transported from a sender node to one or more receiver nodes, the method comprising the steps of:
injecting one or more markers into the data stream to create a marked stream comprising a portion of the data stream and said one or more markers;
storing said marked data stream and said marker;
receiving a data request from at least one of the one or more receiver nodes soliciting a portion of the data stream identified by a location of the marker; and
forwarding a portion of the data stream, starting from the location specified by the data request.
