Corsa Technology Inc.

Ciena Corporation

Jonathan Sewter

Stacey Sheldon

Peter Bengough

Michael John Wingrove

Gustav Larsson

Abhishek Chaudhary

Carolyn Raab

Feng Ling

Stuart Reid

Yuri Kolomiyets

A key is descriptive of a data packet, and a fingerprint hash function is applied to such a key to generate a fixed length fingerprint of the key. An index value is determined based on a portion of the fingerprint. A hash table could be populated by storing in a memory, at a memory location associated with the index value: a remainder of the fingerprint other than the portion of the fingerprint that was used to determine the index value, to indicate that data packets consistent with the key are to be handled in accordance with packet handling metadata. During packet processing, if a memory location associated with an index value stores a remainder of the fingerprint other than the portion of the fingerprint that was used to determine the index value, a data packet is handled according to packet handling metadata associated with the fingerprint.

Packet classification using fingerprint hash table

A packet sub-engine coupled to a packet buffer determines which of multiple look up tables (LUTs) is to be searched for a matching entry that matches a received data packet. Each LUT corresponds to a different type of packet handling action and includes multiple entries, each with a match field and a corresponding collection of one or more actions for handling packets that match the match field. The packet sub-engine searches the determined LUT for a matching entry, processes the received data packet according to the action(s) in the matching entry, and determines whether a further LUT is to be searched for a further matching entry. The processed data packet is provided as an output if no further LUT is to be searched, or otherwise the packet sub-engine searches the further LUT and further processes the processed packet according to the action(s) in the further matching entry.

Single stage look up table based match action processor for data packets

The present disclosure relates to handling of packet flows between a pair of network security zones in a communications network. A packet that is sent from one of the network security zones toward the other of the network security zones is directed to a packet processing service chain, based on a packet handling classification of a packet flow of which the packet is a part. The service chain has multiple identical service chain instances to perform a service on packets, and the packet is directed to one of the service chain instances within the service chain. A packet that is processed by any of the service chain instances is transmitted to the other network security zone.

Methods and systems for network security universal control point

Look up table based match action processor for data packets

An IP address of a received data packet is determined. An IP address map that stores set membership values indicative of whether an IP address is a member of a set of IP addresses, for every possible IP address within an IP address space of the IP address, is accessed to determine set membership for the IP address of the data packet. A further action to be performed on the packet is determined based on the set membership that is determined for the IP address of the data packet. Embodiments could be applied to source IP address filtering, destination IP address filtering, or both. Blacklist and whitelist embodiments, and associated further actions that could be applied to packets in such embodiments, are contemplated.

Internet protocol address filtering methods and apparatus

A system includes a plurality of modules, a backplane communicatively coupled to the plurality of modules, a plurality of links defined between the plurality of modules over the backplane, and a link management system configured to dynamically manage parameters associated with each of the plurality of links. A link management method includes, for a system, defining a codebook for each module, device, and interconnect in the system, the codebook includes data describing physical link topologies and configuration parameters associated therewith, for initializing a link in the system, obtaining appropriate codebooks for each segment in the link, calculating an overall link loss for the link based on data in the appropriate codebooks, and obtaining configuration parameters for the link based on the overall link loss.

Growing community of inventors

Kanata, Canada

Jonathan Sewter