# US 2012/0250692 A1 · Method and apparatus for temporal-based flow distribution across multiple packet processors

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

- Number: US 2012/0250692 A1
- Document ID: US20120250692A1
- Status: Published application
- Kind: A1
- Application number: 13/077,577
- Filed: 2011-03-31
- Published: 2012-10-04
- Earliest claimed: 2011-03-31
- Assignees: Avaya Inc.
- Inventors: Hamid Assarpour
- Web page: https://patentgrep.com/patent/US20120250692A1

## CPC

- H04L 47/39: {Credit based}
- G06F 16/9014: {hash tables}
- H04L 47/10: Flow control; Congestion control
- H04L 47/6215: {Individual queue per QOS, rate or priority}
- H04L 47/70: Admission control; Resource allocation
- H04L 49/90: Buffering arrangements
- G06F 5/06: for changing the speed of data flow, i.e. speed regularising {or timing, e.g. delay lines, FIFO buffers; over- or underrun control therefor (G06F7/78 takes precedence)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method, apparatus and computer program product for temporal-based flow distribution across multiple packet processors is presented. A packet is received and a hash identifier (ID) is computed for the packet. The hash ID is used to index into a State Table and to retrieve a corresponding record. When a time credit field of the record is zero then the time credit field is set to a to a new value; a Packet Processing Engine (PE) whose First-In-First-Out buffer (FIFO) has the lowest fill level is selected; and a PE number field in the state table record is updated with the selected PE number. When the time credit field of the record is non-zero then the packet is sent to a PE based on the value stored in the record; and the time credit field in the record is decremented if the time credit field is greater than zero.

## Claims

### Claim 1

A computer-implemented method in which a computer system performs operations comprising:
receiving a packet;
computing a hash identifier (ID) for said packet;
using said hash ID to index into a State Table and retrieving a corresponding record; and
when a time credit field of said record is zero then:
setting said time credit field to a new value;
selecting a Packet Processing Engine (PE) whose First-In-First-Out buffer (FIFO) has the lowest fill level; and
updating a PE number field in the state table record with selected PE number.

### Claim 2 (depends on 1)

The method of claim 1 wherein when a time credit field of said record is non-zero then:
sending the packet to a PE based on the value stored in said record; and
decrementing said time credit field in the record only if said time credit field is greater than zero.

### Claim 3 (depends on 1)

The method of claim 1 wherein said hash ID for said packet is computed based on fields within said packet.

### Claim 4 (depends on 1)

The method of claim 1 wherein said setting said time credit field to a new value comprises setting said time credit field to a maximum value.

### Claim 5 (depends on 1)

The method of claim 1 an average m-tuple flow bandwidth is at least an order of magnitude less than a high speed link bandwidth.

### Claim 6 (depends on 1)

The method of claim 1 wherein average inter-packet arrival time within an m-tuple flow is larger than the packet processing latency.

### Claim 7 (depends on 1)

The method of claim 1 wherein an input rate to each FIFO is ‘r’ (input port rate).

### Claim 8 (depends on 7)

The method of claim 7 wherein the sustained output rate is r/n where n is the number of PEs.

### Claim 9

A non-transitory computer readable storage medium having computer readable code thereon for temporal-based flow distribution across multiple packet processors, the medium including instructions in which a computer system performs operations comprising:
receiving a packet;
computing a hash identifier (ID) for said packet;
using said hash ID to index into a State Table and retrieving a corresponding record; and
when a time credit field of said record is zero then:
setting said time credit field to a new value;
selecting a Packet Processing Engine (PE) whose First-In-First-Out buffer (FIFO) has the lowest fill level; and
updating a PE number field in the state table record with selected PE number.

### Claim 10 (depends on 9)

The method of claim 9 wherein when a time credit field of said record is non-zero then:
sending the packet to a PE based on the value stored in said record; and
decrementing said time credit field in the record only if said time credit field is greater than zero.

### Claim 11 (depends on 9)

The method of claim 9 wherein said hash ID for said packet is computed based on fields within said packet.

### Claim 12 (depends on 9)

The method of claim 9 wherein said setting said time credit field to a new value comprises setting said time credit field to a maximum value.

### Claim 13 (depends on 9)

The method of claim 9 an average m-tuple flow bandwidth is at least an order of magnitude less than a high speed link bandwidth.

### Claim 14 (depends on 9)

The method of claim 9 wherein average inter-packet arrival time within an m-tuple flow is larger than the packet processing latency.

### Claim 15 (depends on 9)

The method of claim 9 wherein an input rate to each FIFO is ‘r’ (input port rate).

### Claim 16 (depends on 15)

The method of claim 15 wherein the sustained output rate is r/n where n is the number of PEs.

### Claim 17

A computer system comprising a flow distributor and a plurality of Packet Processing Engines (PEs), each of said flow distributor and said PEs comprising:
a memory;
a processor;
a communications interface;
an interconnection mechanism coupling the memory, the processor and the communications interface; and
wherein the memory is encoded with an application providing for temporal-based flow distribution across multiple packet processors, that when performed, provides a process for processing information, the process causing the computer system to perform the operations of:
receiving a packet;
computing a hash identifier (ID) for said packet;
using said hash ID to index into a State Table and retrieving a corresponding record; and
when a time credit field of said record is zero then:
setting said time credit field to a new value;
selecting a Packet Processing Engine (PE) whose First-In-First-Out buffer (FIFO) has the lowest fill level; and
updating a PE number field in the state table record with selected PE number.

### Claim 18 (depends on 17)

The computer system of claim 17 wherein when a time credit field of said record is non-zero then:
sending the packet to a PE based on the value stored in said record; and
decrementing said time credit field in the record only if said time credit field is greater than zero.

### Claim 19 (depends on 17)

The computer system of claim 17 wherein an average m-tuple flow bandwidth is at least an order of magnitude less than a high speed link bandwidth.

### Claim 20 (depends on 17)

The computer system of claim 17 wherein average inter-packet arrival time within an m-tuple flow is larger than the packet processing latency.
