# US 2009/0271685 A1 · Method for Processing Packets, an Apparatus for Transmitting Packets, and an Apparatus for Receiving Packets

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

- Number: US 2009/0271685 A1
- Document ID: US20090271685A1
- Status: Published application
- Kind: A1
- Application number: 12/300,965
- Filed: 2007-05-10
- Published: 2009-10-29
- Earliest claimed: 2006-10-24
- Assignees: H3C Technologies Co., Ltd.
- Inventors: Yutian Li; Gang Zhao
- Web page: https://patentgrep.com/patent/US20090271685A1

## CPC

- H04L 1/0061: {Error detection codes}
- H03M 13/03: Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H04L 1/0072: {Error control for data other than payload data, e.g. control data}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

The present invention discloses a packet processing method, comprising: A. the transmitter acquiring the redundancy information based on the payload of at least one transmitted packet and transmitting the redundancy information to the receiver; B. the receiver restoring the payload of the abnormal packet according to the redundancy information relating to the abnormal packet. The present invention also discloses the packet transmitting apparatuses and packet receiving apparatuses. By performing error correction and restoration for abnormal packets, the present invention improves packet transmission reliability and thus the quality of transmitted media streams.

## Claims

### Claim at position 1

1-21. (canceled)

### Claim 22

A method, in a packet transmitter, for assembling and transmitting a series of packets to a packet receiver, wherein each packet in the series contains p data blocks and a redundancy block, wherein the packet transmitter is communicatively coupled to a network, and, for a given packet in the series, the method comprising:
assembling a first set of p data blocks to form an intermediate representation of the given packet;
calculating a given redundancy block from a second set of p data blocks, wherein exactly one of the p data blocks in the second set is from each of an immediately previous p packets in the series, wherein the given redundancy block is of a given length, and wherein the given length is based on a remaining free length in the intermediate representation of the given packet;
combining the intermediate representation of the given packet with the given redundancy block to form the given packet; and
transmitting the given packet to the packet receiver via the network.

### Claim 23 (depends on 22)

The method of claim 22, wherein the remaining free length is based on a length of the intermediate representation of the given packet subtracted from a maximum transmission unit (MTU) length associated with the given packet.

### Claim 24 (depends on 22)

The method of claim 22, wherein each data block of the second set of p data blocks appears at a different offset in its respective immediately previous packet in the series.

### Claim 25 (depends on 22)

The method of claim 22, wherein the given redundancy block is calculated by performing an XOR function over the second set of p data blocks.

### Claim 26 (depends on 22)

The method of claim 22, further comprising:
backing up payloads of the immediately previous p packets, and wherein the given redundancy block is calculated based on the backed up payloads.

### Claim 27 (depends on 22)

The method of claim 22, wherein combining the intermediate representation of the given packet with the given redundancy block further comprises placing a check identification code in the given packet before the given redundancy block.

### Claim 28 (depends on 22)

The method of claim 22, wherein an arrangement of the first set of p data blocks represents an extent of transport stream (TS) packets.

### Claim 29 (depends on 28)

The method of claim 28, further comprising:
receiving the extent of TS packets;
arranging the extent of TS packets in order of reception by the packet transmitter; and
determining the first set of p data blocks based on the arranged extent of TS packets.

### Claim 30

A packet transmitter, communicatively coupled to a network and arranged to transmit a series of packets to a packet receiver, the packet transmitter comprising:
a packet segmenting module for segmenting a first packet into a first set of p data blocks;
a redundancy information acquiring module for calculating a given redundancy block from a second set of p data blocks, wherein exactly one of the p data blocks in the second set is from each of an immediately previous p packets in the series, wherein the given redundancy block is of a given length, and wherein the given length is based on a remaining free length in the first packet;
a packet encapsulating module for combining the first set of p data blocks with the given redundancy block to form second packet; and
a transmitting module for transmitting the second packet to the packet receiver via the network.

### Claim 31 (depends on 30)

The packet transmitter of claim 30, wherein the remaining free length is based on a total length of the first set of p data blocks subtracted from a maximum transmission unit (MTU) length associated with the first packet.

### Claim 32 (depends on 30)

The packet transmitter of claim 30, wherein each data block of the second set of p data blocks appears at a different offset in its respective immediate previous packet in the series.

### Claim 33 (depends on 30)

The packet transmitter of claim 30, wherein the given redundancy block is calculated by performing an XOR function over the second set of p data blocks.

### Claim 34 (depends on 30)

The packet transmitter of claim 30, further comprising:
the redundancy information acquiring module also backing up payloads of the immediately previous p packets, and wherein calculating the given redundancy block comprises calculating the given redundancy block based on the backed up payloads.

### Claim 35 (depends on 30)

The packet transmitter of claim 30, wherein combining the first set of p data blocks with the given redundancy block further comprises placing a check identification code before in the second packet before the given redundancy block.

### Claim 36 (depends on 30)

The packet transmitter of claim 30, wherein an arrangement of the first set of p data blocks represents an extent of transport stream (TS) packets.

### Claim 37 (depends on 36)

The packet transmitter of claim 36, wherein the packet segmenting module is also for (i) receiving the extent of TS packets, (ii) arranging the extent of TS packets in order of reception by the packet transmitter to form the first packet, and (iii) determining the p data blocks from the arranged extent of TS packets in the first packet and the remaining free length in the first packet

### Claim 38

A method, in a packet receiver, for reconstructing a lost packet from a series of packets, wherein each packet in the series contains a redundancy block calculated from a first set of p data blocks, wherein exactly one data block of the first set is from each of an immediately previous p packets in the series, wherein the lost packet contains an extent of transport stream (TS) packets, the method comprising:
calculating a second set of p data blocks based on at least (i) p redundancy blocks contained in an immediately following p packets in the series, (ii) data blocks contained in the immediately following p packets in the series, and (iii) data blocks contained in an immediately preceding p-I packets in the series;
assembling the lost packet from the second set of p data blocks; and
extracting the extent of TS packets from the lost packet.

### Claim 39 (depends on 38)

The method of claim 38, wherein each redundancy block contains a check identification code, the method further comprising:
determining original sequence information of each packet in the series from check identification codes contained in the respective packet's redundancy block.

### Claim 40 (depends on 38)

The method of claim 38, wherein calculating the second set of p data blocks comprises performing an XOR function to determine each of the second set of p data blocks.

### Claim 41 (depends on 38)

The method of claim 38, wherein each of the second set of p data blocks are of a data block length.

### Claim 42 (depends on 41)

The method of claim 41, wherein the data block length is based on a length of the extent of TS packets in the lost packet subtracted from a maximum transmission unit (MTU) length associated with the lost packet.
