Cisco Technology, Inc.

Fungible, Inc.

Microsoft Technology Licensing, LLC

Applied Micro Circuits Corporation

Other

John David Huber

Srihari Raju Vegesna

Pradeep S Sindhu

Sumeet Singh

Deepak Goel

Narendra Jayawant Gathoo

Flavio Giovanni Bonomi

Rohit Sunkam Ramanujam

Jean-Marc Frailong

Saurin Patel

Kenneth Yun

Kirk Alvin Miller

Jonathan Chang

Ayaskant Pani

George Bendak

Sushil Kumar Singh

Gopesh Goyal

Hariharan Lakshminarayanan Thantry

Vikas Minglani

Suresh Vemula

Chetan Ambalal Shah

Cecilia Martin

Mei Wang

Philip Michael Clovis

Stimit Kishor Oak

Peter John Holzer

Prayag Bhanubhai Patel

George Varghese

Guglielmo Marco Morandin

Michael Hellmer

Kevin Warren James

Michael Sluyski

David Thomas Dougherty

John Calvin Leung

Sureshkumar Nedunchezhian

Eli James Aubrey Fernald

Jennifer DiLorenzo

Guglielmo Morandin

Sushil Singh

A fabric control protocol (FCP) is a data transmission protocol that enables spraying of individual packets for a given packet flow across a data center from an ingress interface of the source data processing unit (DPU) across a plurality of parallel data paths of a logical tunnel in the network fabric to the egress interface of the destination DPU. The FCP has congestion control mechanisms used to determine a degree of congestion at the egress interface of the destination DPU and to modify a send window size at the source DPU based on the degree of congestion. Reliable FCP (rFCP) extensions provide reliability enhancements and improved failure resilience within the data center. The rFCP extensions provide an unsolicited mode for low latency operation with enhanced reliability mechanisms. The rFCP extensions provide failure resilience mechanisms to identify and avoid failed paths among multiple parallel data paths within the logical tunnel.

Reliable fabric control protocol extensions for data center networks with failure resilience

Fabric control protocol with congestion control for data center networks

Reliable fabric control protocol extensions for data center networks with unsolicited packet spraying over multiple alternate data paths

Techniques for detecting path failures and reducing packet loss as a result of such failures are described for use within a data center or other environment. For example, a source and/or destination access node may create and/or maintain information about health and/or connectivity for a plurality of ports or paths between the source and destination device and core switches. The source access node may spray packets over a number of paths between the source access node and the destination access node. The source access node may use the information about connectivity for the paths between the source or destination access nodes and the core switches to limit the paths over which packets are sprayed. The source access node may spray packets over paths between the source access node and the destination access node that are identified as healthy, while avoiding paths that have been identified as failed.

Resilient network communication using selective multipath packet flow spraying

This disclosure describes techniques that include representing, traversing, and processing directed graphs using one or more content-addressable memory devices. In one example, this disclosure describes a method that includes presenting query data to one or more ternary content-addressable memory (TCAM) devices, wherein the query data includes state data and key data; receiving, from the TCAM devices, information about a matching address identified by the TCAM devices; accessing, based on the information about the matching address, information in one or more storage devices; performing, based on the information in the one or more storage devices, at least one operation on data included within the one or more storage devices to generate processed data; outputting the processed data; determining, based on the information in the one or more storage devices, new state data and a new key value; and presenting new query data to the TCAM devices.

Directed graph traversal using content-addressable memory

Aspects of this disclosure describes techniques for parsing network packets, processing network packets, and modifying network packets before forwarding the modified network packets over a network. The present disclosure describes a system that, in some examples, parses network packets, generates data describing or specifying attributes of the network packet, identifies operations to be performed when processing a network packet, performs the identified operations, generates data describing or specifying how to modify and/or forward the network packet, modifies the network packet, and outputs the modified packet to another device or system, such as a switch.

Flexible processing of network packets

This disclosure describes techniques that include storing, during parsing of a data unit or a network packet, information (i.e., 'summary information') that identifies how the network packet has been process and/or other aspects of the parsing process. In one example, this disclosure describes a method that includes parsing a packet header from a data unit, wherein parsing the packet header includes storing in result vector storage each of a plurality of data items derived from the packet header, the result vector storage having a result vector format defining fields within the result vector storage for storing each of the plurality of data items; storing in template storage, for each of the plurality of data items, summary information about the plurality of data items stored in the result vector storage; and processing, by the packet-processing integrated circuit and based on the summary information and the plurality of data items, the network packet.

Realization of a programmable forwarding pipeline through packet header summaries in a data processing unit

A device includes a multistage filter and an elephant trap. The multistage filter has hash functions and an array. The multistage filter is operable to receive a packet associated with a candidate heavy network user and send the packet to the hash functions. The hash functions generate hash function output values corresponding to indices in the array. The elephant trap is connected to the multistage filter. The elephant trap includes a buffer and probabilistic sampling logic. The probabilistic sampling logic is operable to attempt to add information associated with the packet to the buffer a particular percentage of the time based in part on the result of the multistage filter lookup. The buffer is operable to hold information associated with the packet, counter information, and timestamp information.

Detection of heavy users of network resources

In one implementation, a network device is configured to implement an intra switch transport protocol. The intra switch transport protocol is configured to determine a window size according to a predetermined bandwidth and a round trip time between a plurality of ingress ports and an egress port. The network device is configured to sending at least one data packet from an ingress port to an egress port without first receiving any acknowledgement from the egress port. The network device continues to send packets and increment a counter accordingly until the counter reaches the window size. The network device ceases transmission of subsequent data packets and/or queues subsequent data packets based on the counter exceeding the window size.

Intra switch transport protocol

The baby formula preparation device includes a powder hopper and a distributor operably associated with the powder hopper for dispensing powdered baby formula into a baby bottle. The device also includes a water dispensing system having a water storage tank and a water heater that dispenses heated water into the baby bottle. A load cell measures the weight of the bottle and a controller coupled to the load cell regulates the quantity by weight of heated water and powdered baby formula dispensed into the baby bottle.

Baby formula preparation device

A scalable method and apparatus that detects frequent and dispersed invariants is disclosed. More particularly, the application discloses a system that can simultaneously track frequency rates and dispersion criteria of unknown invariants. In other words, the application discloses an invariant detection system implemented in hardware (and/or software) that allows detection of invariants (e.g., byte sequences) that are highly prevalent (e.g., repeating with a high frequency) and dispersed (e.g., originating from many sources and destined to many destinations).

Detection of frequent and dispersed invariants

Growing community of inventors

San Diego, CA, United States of America

John David Huber