# US 2019/0356610 A1 · Segmentation and reassembly of network packets for switched fabric networks

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

- Number: US 2019/0356610 A1
- Document ID: US20190356610A1
- Status: Published application
- Kind: A1
- Application number: 16/525,265
- Filed: 2019-07-29
- Published: 2019-11-21
- Earliest claimed: 2012-09-14
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Keshav G. Kamble; Dar-Ren Leu; Vijoy Pandey
- Web page: https://patentgrep.com/patent/US20190356610A1

## CPC

- H04L 49/901: using storage descriptor, e.g. read or write pointers
- H04L 49/256: {Routing or path finding in ATM switching fabrics}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Reassembly of member cells into a packet comprises receiving an incoming member cell of a packet from a switching fabric wherein each member cell comprises a segment of the packet and a header, generating a reassembly key using selected information from the incoming member cell header wherein the selected information is the same for all member cells of the packet, checking a reassembly table in a content addressable memory to find an entry that includes a logic key matching the reassembly key, and using a content index in the found entry and a sequence number of the incoming member cell within the packet, to determine a location offset in a reassembly buffer area for storing the incoming member cell at said location offset in the reassembly buffer area for the packet for reassembly.

## Claims

### Claim 1

A system for ingress processing, comprising:
at least one processor; and
a non-transitory processor-readable memory device storing instructions that when executed by the at least one processor causes the at least one processor to perform operations including:
receiving a data packet from a source;
creating member cells from the data packet;
adding redundancy check to each of the member cells; and
providing the member cells to a switching fabric for transport to a destination.

### Claim 2 (depends on 1)

The system of claim 1, wherein each member cell comprises a header and a segment of a payload of the data packet.

### Claim 3 (depends on 2)

The system of claim 2, wherein the operations further include:
saving elements of the data packet that are common to all the member cells in a buffer as a common structure.

### Claim 4 (depends on 3)

The system of claim 3, wherein headers of the member cells include the common structure.

### Claim 5 (depends on 2)

The system of claim 2, wherein adding redundancy check to each of the member cells comprises:
adding, to a header of each of the member cells, a corresponding sequence number for the member cell and parity information for error detection and error correction.

### Claim 6 (depends on 1)

The system of claim 1, wherein the source comprises a transmitter device, and the destination comprises a receiver device.

### Claim 7 (depends on 1)

The system of claim 1, wherein creating member cells from the data packet comprises:
segmenting the data packet into the member cells.

### Claim 8 (depends on 1)

The system of claim 1, wherein the operations further include:
maintaining a context table providing a status of each received data packet.

### Claim 9

A system for egress processing, comprising:
at least one processor; and
a non-transitory processor-readable memory device storing instructions that when executed by the at least one processor causes the at least one processor to perform operations including:
receiving member cells from a switching fabric;
checking the member cells for errors; and reassembling the member cells into a reassembled data packet, wherein the reassembled data packet is delivered to a destination.

### Claim 10 (depends on 9)

The system of claim 9, wherein a header of each of the member cells comprises a corresponding sequence number for the member cell and parity information for error detection and error correction.

### Claim 11 (depends on 10)

The system of claim 10, wherein reassembling the member cells into a reassembled data packet comprises:
for a first member cell of the member cells:
constructing a first packet buffer context in a reassembly buffer based on a context of the first member cell;
generating a copy of the first member cell without its header; and
placing the copy of the first member cell in the first packet buffer context.

### Claim 12 (depends on 11)

The system of claim 11, wherein reassembling the member cells into a reassembled data packet further comprises:
for each remaining member cell of the member cells:
determining whether a context of the remaining member cell matches the first packet buffer context; and
in response to determining the context of the remaining member cell matches the first packet buffer context:
generating a copy of the remaining member cell without its header; and
placing the copy of the remaining member cell in sequence in the first packet buffer context based on a corresponding sequence number for the remaining member cell.

### Claim 13 (depends on 12)

The system of claim 12, wherein reassembling the member cells into a reassembled data packet further comprises:
providing content of the first packet buffer context as the reassembled data packet.

### Claim 14 (depends on 12)

The system of claim 12, wherein the operations further include:
maintaining a reassembly table comprising an entry corresponding to the reassembled data packet, wherein the entry comprises a logic key for the reassembled data packet and a content index into the reassembly buffer for storing copies of the member cells.

### Claim 15 (depends on 14)

The system of claim 14, wherein reassembling the member cells into a reassembled data packet further comprises:
for each of the member cells:
generating a reassembly key based on a header of the member cell;
performing a lookup of the reassembly table utilizing the reassembly key, wherein the lookup finds the entry if the logic key of the entry matches the reassembly key; and
in response to finding the entry, utilizing the content index of the entry and a corresponding sequence number for the member cell to determine a location offset in the reassembly buffer for storing a copy of the member cell.

### Claim 16 (depends on 15)

The system of claim 15, wherein algorithm complexity for the lookup is O(1).

### Claim 17 (depends on 9)

The system of claim 9, wherein the destination comprises a receiver device.

### Claim 18 (depends on 9)

The system of claim 9, wherein the operations further include:
correcting the errors in the member cells before the member cells are reassembled into the reassembled data packet.
