Gerald B Schmidt

US Patent:

20210329104, Oct 21, 2021

Filed:

May 26, 2021

Appl. No.:

17/330782

Inventors:

- Singapore, SG
Tsahi Daniel - Palo Alto CA, US
Gerald Schmidt - San Jose CA, US

International Classification:

H04L 29/06
H04L 12/935

Abstract:

Embodiments of the apparatus for modifying packet headers relate to a use of bit vectors to allow expansion and collapse of protocol headers within packets for enabling flexible modification. A rewrite engine expands each protocol header into a generic format and applies various commands to modify the generalized protocol header. The rewrite engine maintains a bit vector for the generalized protocol header with each bit in the bit vector representing a byte of the generalized protocol header. A bit marked as 0 in the bit vector corresponds to an invalid byte, while a bit marked as 1 in the bit vector corresponds to a valid byte. The rewrite engine uses the bit vector to remove all the invalid bytes after all commands have been operated on the generalized protocol header to thereby form a new protocol header.

US Patent:

20170244816, Aug 24, 2017

Filed:

Mar 13, 2017

Appl. No.:

15/457970

Inventors:

- San Jose CA, US
Tsahi Daniel - Palo Alto CA, US
Gerald Schmidt - San Jose CA, US

International Classification:

H04L 29/06
H04L 12/935

Abstract:

Embodiments of the apparatus for modifying packet headers relate to a use of bit vectors to allow expansion and collapse of protocol headers within packets for enabling flexible modification. A rewrite engine expands each protocol header into a generic format and applies various commands to modify the generalized protocol header. The rewrite engine maintains a bit vector for the generalized protocol header with each bit in the bit vector representing a byte of the generalized protocol header. A bit marked as 0 in the bit vector corresponds to an invalid byte, while a bit marked as 1 in the bit vector corresponds to a valid byte. The rewrite engine uses the bit vector to remove all the invalid bytes after all commands have been operated on the generalized protocol header to thereby form a new protocol header.

US Patent:

20170187623, Jun 29, 2017

Filed:

Mar 13, 2017

Appl. No.:

15/457959

Inventors:

- San Jose CA, US
Tsahi Daniel - Palo Alto CA, US
Gerald Schmidt - San Jose CA, US

International Classification:

H04L 12/741
H04L 29/06

Abstract:

Embodiments of the apparatus of identifying internal destinations of network packets relate to a network chip that allows flexibility in handling packets. The handling of packets can be a function of what the packet contents are or where the packets are from. The handling of packets can also be a function of both what the packet contents are and where the packets are from. In some embodiments, where the packets are from refers to unique port numbers of chip ports that the packets arrived at. The packets can be distributed for processing within the network chip.

US Patent:

20160246882, Aug 25, 2016

Filed:

Feb 20, 2015

Appl. No.:

14/628058

Inventors:

- San Jose CA, US
Tsahi DANIEL - Palo Alto CA, US
Gerald SCHMIDT - San Jose CA, US

International Classification:

G06F 17/30

Abstract:

The invention describes a network lookup engine for generating parallel network lookup requests for input packets, where each packet header is parsed and represented by a programmable parser in a format, namely a token, which is understandable by the engine. Each token can require multiple lookups in parallel in order to speed up the packet processing time. The sizes of lookup keys varies depending on the content of the input token and the protocols programmed for the engine. The engine generates a super key per token, representing all parallel lookup keys wherein the content of each key can be extracted from the super key through an associated profile identification. The network lookup engine is protocol-independent which means the conditions and rules for generating super keys are full programmable so that the engine can be reprogrammed to perform a wide variety of network features and protocols in a software-defined networking (SDN) system.

US Patent:

20150372860, Dec 24, 2015

Filed:

Jun 19, 2014

Appl. No.:

14/309773

Inventors:

- San Jose CA, US
Tsahi Daniel - Palo Alto CA, US
Gerald Schmidt - San Jose CA, US

International Classification:

H04L 12/24
H04L 29/06

Abstract:

Embodiments of the apparatus for reducing latency in a flexible parser relate to an implementation that optimizes each parser engine within the parser. A packet enters the parser. Each of the parser engines processes the packet if processing is required. Otherwise, the parser engine simply forwards the packet through without processing the packet, thereby reducing latency. Each parser engine includes a memory. The memory stores bypass data and status information that indicates whether parsing for this packet is completed and, thus, no further processing is required by subsequent parser engines. Each parser engine also includes a counter, which is incremented whenever a packet enters the parser engine and is decremented whenever a packet exists the parser engine. A packet bypasses the parser engine based on the counter of the parser engine and the status information of that packet.

US Patent:

20150373156, Dec 24, 2015

Filed:

Jun 19, 2014

Appl. No.:

14/309633

Inventors:

- San Jose CA, US
Tsahi Daniel - Palo Alto CA, US
Gerald Schmidt - San Jose CA, US
Saurin Patel - San Jose CA, US

International Classification:

H04L 29/06

Abstract:

Embodiments of the apparatus for modifying packet headers relate to a packet generalization scheme that maintains information across protocol layers of packets. The packet generalization scheme uses a protocol table that includes layer information for all possible protocol layer combinations. The protocol layer combinations in the protocol table are manually configured through software. Each protocol layer combination in the protocol table is uniquely identified by a PktID. A rewrite engine of a network device receives the PktID for a packet and uses that unique identifier as key to the protocol table to access information for each protocol layer of the packet that the rewrite engine requires during modification of the packet. The packet generalization scheme eliminates the need for a parser engine of the network device to pass parsed data to the rewrite engine, which is resource intensive.

US Patent:

20150373159, Dec 24, 2015

Filed:

Jun 19, 2014

Appl. No.:

14/309650

Inventors:

- San Jose CA, US
Tsahi Daniel - Palo Alto CA, US
Gerald Schmidt - San Jose CA, US
Saurin Patel - San Jose CA, US

International Classification:

H04L 29/06
H04L 12/743

Abstract:

Embodiments of the apparatus for modifying packet headers relate to programmable modifications of packets by applying commands to generalized protocol headers. Each protocol header of incoming packets is represented in a generic format specific to that protocol to enable modifications to packet headers. Missing fields from a protocol header are detected, and the protocol header is expanded to a maximum size such that the protocol header contains all possible fields of that protocol, including the missing fields. Each of the fields has the same offset irrespective of which variation of the protocol the protocol header corresponds to. Modification uses a set of commands that is applied to expanded protocol headers. All of the commands are thus generic as these commands are independent of incoming headers (e.g., size and protocol).

US Patent:

20150373160, Dec 24, 2015

Filed:

Jun 19, 2014

Appl. No.:

14/309659

Inventors:

- San Jose CA, US
Tsahi Daniel - Palo Alto CA, US
Gerald Schmidt - San Jose CA, US

International Classification:

H04L 29/06

Abstract:

Embodiments of the apparatus for modifying packet headers relate to a use of bit vectors to allow expansion and collapse of protocol headers within packets for enabling flexible modification. A rewrite engine expands each protocol header into a generic format and applies various commands to modify the generalized protocol header. The rewrite engine maintains a bit vector for the generalized protocol header with each bit in the bit vector representing a byte of the generalized protocol header. A bit marked as 0 in the bit vector corresponds to an invalid byte, while a bit marked as 1 in the bit vector corresponds to a valid byte. The rewrite engine uses the bit vector to remove all the invalid bytes after all commands have been operated on the generalized protocol header to thereby form a new protocol header.