# US 6,731,644 B1 · Flexible DMA engine for packet header modification

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

- Number: US 6,731,644 B1
- Document ID: US6731644B1
- Status: Granted
- Kind: B1
- Application number: 09/503,988
- Filed: 2000-02-14
- Granted: 2004-05-04
- Earliest claimed: 2000-02-14
- Assignees: Cisco Technology, Inc.
- Inventors: Garry P. Epps; Michael Laor
- Web page: https://patentgrep.com/patent/US6731644B1

## CPC

- H04L 45/00: Routing or path finding of packets in data switching networks (routing or path finding in wireless networks H04W40/00)
- H04L 49/3063: {Pipelined operation}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A pipelined linecard architecture for receiving, modifying, switching, buffering, queuing and dequeuing packets for transmission in a communications network. The linecard has two paths: the receive path, which carries packets into the switch device from the network, and the transmit path, which carries packets from the switch to the network. In the receive path, received packets are processed and switched in an asynchronous, multi-stage pipeline utilizing programmable data structures for fast table lookup and linked list traversal. The pipelined switch operates on several packets in parallel while determining each packet's routing destination. Once that determination is made, each packet is modified to contain new routing information as well as additional header data to help speed it through the switch. Each packet is then buffered and enqueued for transmission over the switching fabric to the linecard attached to the proper destination port. The destination linecard may be the same physical linecard as that receiving the inbound packet or a different physical linecard. The transmit path consists of a buffer/queuing circuit similar to that used in the receive path. Both enqueuing and dequeuing of packets is accomplished using CoS-based decision making apparatus and congestion avoidance and dequeue management hardware. The architecture of the present invention has the advantages of high throughput and the ability to rapidly implement new features and capabilities.

## Claims

### Claim 1

An apparatus for switching packets, said packets having a header portion and a tail portion, comprising:
a plurality of packet header buffers (PHBs);
a plurality of PHB pointers, each said PHB pointer pointing to a corresponding PHB; and
a plurality of pipeline stage circuits connected in a sequence, said plurality of pipeline stage circuits further comprising a circuit having a modification engine that receives said PHB pointer, wherein said PHB pointer determines how said header portion is modified by said modification engine; wherein each said stage circuit begins an operation substantially simultaneously with each other said stage circuit and each said stage circuit passes data to a next stage circuit in said sequence when every said operation performed by all said stage circuits is completed.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein said PHB pointer indicates one of a plurality of predetermined gather profiles.

### Claim 3 (depends on 2)

The apparatus of claim 2, wherein said gather profile is determined at initialization of the apparatus.

### Claim 4 (depends on 2)

The apparatus of claim 2, wherein said gather profile is determined by a prior stage circuit in said sequence.

### Claim 5

A method of switching packets, said packets having a header portion and a tail portion, which comprises:
switching said packets through a pipelined switch having a plurality of packet header buffers (PHBs); a plurality of PHB pointers, each said PHB pointer pointing to a corresponding PHB; and a plurality of pipeline stage circuits connected in a sequence;
said switching further comprising:
receiving said PHB pointer;
determining how said header portion is to be modified; and
modifying said header portion accordingly; wherein each said stage circuit begins an operation substantially simultaneously with each other said stage circuit and each said stage circuit passes data to a next stage circuit in said sequence when every said operation performed by all said stage circuits is completed.

### Claim 6 (depends on 5)

The method of claim 5, wherein said PHB pointer indicates one of a plurality of predetermined gather profiles.

### Claim 7 (depends on 6)

The method of claim 6, wherein said gather profile is determined at initialization of the apparatus.

### Claim 8 (depends on 6)

The method of claim 6, wherein said gather profile is determined by a prior stage circuit in said sequence.

### Claim 9

An apparatus for switching packets, the packets having a header portion and a tail portion, the apparatus comprising:
a plurality of packet header buffers (PHBs);
a plurality of PHB pointers, each of the plurality of PHB pointers pointing to a corresponding PHB; and
a plurality of pipeline stage circuits connected in a sequence, at least one of the plurality of pipeline stage circuits further comprising a direct memory access (DMA) circuit configured to receive at least one of the plurality of PHB pointers, wherein the at least one of the plurality of PHB pointers is used to access a header portion of a packet.

### Claim 10 (depends on 9)

The apparatus of claim 9 wherein each of the plurality of pipeline stage circuits begins an operation substantially simultaneously with each other of the plurality of pipeline stage circuits and another of the at least one of the plurality of pipeline stage circuits passes data to a next stage circuit in the sequence when operations performed by respective ones of the plurality of pipeline stage circuits are completed.

### Claim 11 (depends on 9)

The apparatus of claim 9 wherein at least one of the plurality of PHBs includes information about the order in which data in the at least one of the plurality of PHB should be read out of the at least one of the plurality of PHBs.

### Claim 12 (depends on 11)

The apparatus of claim 11 wherein the information about the order in which data in the at least one of the plurality of PHB should be read out of the at least one of the plurality of PHBs includes at least one of a gather profile, an address of a gather profile, and a pointer to a gather profile.

### Claim 13 (depends on 12)

The apparatus of claim 12, wherein the at least one of a gather profile, an address of a gather profile, and a pointer to a gather profile is determined by another of the plurality of pipeline stage circuits prior in the sequence to the at least one of the plurality of pipeline stage circuits.

### Claim 14 (depends on 9)

The apparatus of claim 9 wherein the plurality of pipeline stage circuits includes a first pipeline stage circuit, a second pipeline stage circuit, and a third pipeline stage circuit, and wherein at least one of the plurality of PHB pointers is passed from the first pipeline stage circuit to the a second pipeline stage circuit and subsequently passed from the second pipeline stage circuit to the third pipeline stage circuit.

### Claim 15 (depends on 9)

The apparatus of claim 9 further comprising a pipeline control circuit, the pipeline control circuit assigning at least one of the plurality of PHB pointers.

### Claim 16 (depends on 9)

The apparatus of claim 9 further comprising a profile memory operable to store a plurality of PHB field addresses.

### Claim 17 (depends on 9)

The apparatus of claim 9 further comprising a multiplexer, the direct memory access (DMA) circuit being further configured to read data from at least one of the plurality of PHBs and write the data to the multiplexer.
