Cisco Technology, Inc.

Infineon Technologies Ag

Pensando Systems Inc.

Alessandro Fulli

Chih-Tsung Huang

Putu Harry Subagio

Thomas James Edsall

Mingzhe Li

Christopher A Wildman

Wei-Jen Huang

Yichou Lin

Michael Brian Galles

Raymond Kloth

Michael Staber

Peter Pessl

Robert Hoffman

Christian Schranz

Sameer Kittur Subrahmanya

Raymond J Kloth

Methods and systems for memory resource allocation are disclosed. In an embodiment, a method for memory resource allocation involves reading a pool-specific configuration record from an array of memory mapped pool-specific configuration records according to a memory resource allocation request that is held in an address register of a memory mapped register interface, performing a memory resource allocation operation to service the memory resource allocation request, wherein performing the memory resource allocation operation involves interacting with a resource list according to a pointer in the pool-specific configuration record, advancing the pointer after the interaction, and updating the pointer in the pool-specific configuration record with the advanced pointer.

Methods and systems for hardware-based memory resource allocation

A network device receives a packet that includes a plurality of header fields. The packet is parsed to sequentially obtain the plurality of header fields. One or more header fields not yet available at the network device are predicted based on one or more header fields that are available at the network device. A network processing decision is generated for the packet based on the predicted one or more header fields and the one or more header fields that are available at the network device.

Low latency networking device using header prediction

A network device receives a packet that includes a plurality of sets of fields. Sets of fields of the packet are parsed and the field sets are evaluated as soon as they are available to determine whether a processing decision can be made on the packet. Additional field sets may be parsed from the packet and obtained in parallel with determining whether a processing decision can be made, but once it is determined that a processing decision can be made, the evaluating of field sets is terminated such that any further field sets of the packet are ignored for purposes of making a processing decision for the packet.

Scalable low latency multi-protocol networking device

A packet is received at an ingress port of a network device. Based on forwarding information in the packet, an adjacency point is generated using a forwarding information database. If the packet is a routed packet, the adjacency pointer is used as an index to an entry in a media access control (MAC) table that identifies an egress port for the packet. If the packet is not a routed packet, a search is performed in the MAC table to locate an entry in the MAC table that identifies an egress port for the packet.

Indexed access to a forwarding table in a network device

Presented herein are techniques to achieve ultra low latency determination of processing decisions for packets in a network device. A packet is received at a port of a network device. A processing decision is determined in a first processing decision path based on content of the packet and one or more network policies. A processing decision is determined in a second processing decision path, in parallel with the first processing path, by accessing a table storing processing decisions. The second processing decision path can output a processing decision faster than the first processing decision path for packets that match one or more particular packet flow parameters contained in the table. A processing decision determined by the second processing decision path, if one can be made, is used, and otherwise a processing decision determined by the first processing decision path is used.

Ultra low latency multi-protocol network device

A packet is received at an ingress port of a networking device and a forwarding result that identifies an egress port for the packet is generated. In parallel with the generation of the forwarding result, a network address translation (NAT) result that identifies one or more NAT rules for possible application to the packet is generated. The forwarding result and the NAT result are then used to generate a routing decision result.

Parallel processing for low latency network address translation

A method in an example embodiment includes creating a first search key from variable data of a message received in a network environment, creating a second search key from constant data of the message, identifying a first database entry in a first database based on the first search key, and identifying a second database entry in a second database based on the second search key. The method can also include performing an action associated with the first database entry when a correlation is identified between the first and second database entries. In specific embodiments, the variable data are modified and the constant data are not modified. The first search key can be created prior or subsequent to forwarding the message. In further embodiments, the correlation is identified when an offset of the first database entry is the same as an offset of the second database entry.

System and method for improving hardware utilization for a bidirectional access controls list in a low latency high-throughput network

Methods and devices are provided for the efficient allocation and deletion of virtual output queues. According to some implementations, incoming packets are classified according to a queue in which the packet (or classification information for the packet) will be stored, e.g., according to a 'Q' value. For example, a Q value may be a Q number defined as {Egress port number&#x2225;Priority number&#x2225;Ingress port number}. Only a single physical queue is allocated for each classification. When a physical queue is empty, the physical queue is preferably de-allocated and added to a 'free list' of available physical queues. Accordingly, the total number of allocated physical queues preferably does not exceed the total number of classified packets. Because the input buffering requirements of Fiber Channel (&#x201c;FC&#x201d;) and other protocols place limitations on the number of incoming packets, the dynamic allocation methods of the present invention result in a sparse allocation of physical queues.

Scalable approach to large scale queuing through dynamic resource allocation

A device and method are disclosed, whereby the normally complicated and difficult frequency determination is achieved by simply arranged and executed measures, namely by means of larger, smaller and/or equal comparisons and a counting of certain events. The invention further relates to arrangements whereby the noise signal level, or the influence thereof on the verification to be carried out is reduced.

Growing community of inventors

San Jose, CA, United States of America

Alessandro Fulli