Patents by Inventor John David Huber

John David Huber has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11218574
    Abstract: 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.
    Type: Grant
    Filed: June 7, 2019
    Date of Patent: January 4, 2022
    Assignee: Fungible, Inc.
    Inventors: Hariharan Lakshminarayanan Thantry, Rohit Sunkam Ramanujam, John David Huber, Deepak Goel, Vikas Minglani
  • Publication number: 20210297343
    Abstract: 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.
    Type: Application
    Filed: June 10, 2021
    Publication date: September 23, 2021
    Inventors: Srihari Raju Vegesna, Narendra Jayawant Gathoo, Pradeep Sindhu, Jean-Marc Frailong, Gopesh Goyal, Suresh Vemula, John David Huber, Chetan Ambalal Shah
  • Publication number: 20210297350
    Abstract: 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.
    Type: Application
    Filed: June 9, 2021
    Publication date: September 23, 2021
    Inventors: Srihari Raju Vegesna, Narendra Jayawant Gathoo, Pradeep Sindhu, Jean-Marc Frailong, Gopesh Goyal, Suresh Vemula, John David Huber
  • Publication number: 20210297351
    Abstract: 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.
    Type: Application
    Filed: June 10, 2021
    Publication date: September 23, 2021
    Inventors: Srihari Raju Vegesna, Narendra Jayawant Gathoo, Pradeep Sindhu, Jean-Marc Frailong, Gopesh Goyal, Suresh Vemula, John David Huber
  • Publication number: 20210218665
    Abstract: 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.
    Type: Application
    Filed: March 29, 2021
    Publication date: July 15, 2021
    Inventors: Deepak Goel, Pradeep Sindhu, Ayaskant Pani, Srihari Raju Vegesna, Narendra Jayawant Gathoo, John David Huber, Rohit Sunkam Ramanujam, Saurin Patel
  • Patent number: 11038993
    Abstract: 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.
    Type: Grant
    Filed: March 13, 2019
    Date of Patent: June 15, 2021
    Assignee: FUNGIBLE, INC.
    Inventors: Deepak Goel, Jean-Marc Frailong, Srihari Raju Vegesna, Stimit Kishor Oak, Rohit Sunkam Ramanujam, John David Huber, Hariharan Lakshminarayanan Thantry, Vikas Minglani, Saurin Patel, Sureshkumar Nedunchezhian
  • Patent number: 10965586
    Abstract: 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.
    Type: Grant
    Filed: September 28, 2018
    Date of Patent: March 30, 2021
    Assignee: Fungible, Inc.
    Inventors: Deepak Goel, Pradeep Sindhu, Ayaskant Pani, Srihari Raju Vegesna, Narendra Jayawant Gathoo, John David Huber, Rohit Sunkam Ramanujam, Saurin Patel
  • Patent number: 10958770
    Abstract: 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.
    Type: Grant
    Filed: October 15, 2018
    Date of Patent: March 23, 2021
    Assignee: Fungible, Inc.
    Inventors: Hariharan Lakshminarayanan Thantry, Srihari Raju Vegesna, Stimit Kishor Oak, Vikas Minglani, Rohit Sunkam Ramanujam, John David Huber, Deepak Goel
  • Publication number: 20200120191
    Abstract: 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.
    Type: Application
    Filed: October 15, 2018
    Publication date: April 16, 2020
    Inventors: Hariharan Lakshminarayanan Thantry, Srihari Raju Vegesna, Stimit Kishor Oak, Vikas Minglani, Rohit Sunkam Ramanujam, John David Huber, Deepak Goel
  • Publication number: 20190379770
    Abstract: 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.
    Type: Application
    Filed: June 7, 2019
    Publication date: December 12, 2019
    Inventors: Hariharan Lakshminarayanan Thantry, Rohit Sunkam Ramanujam, John David Huber, Deepak Goel, Vikas Minglani
  • Publication number: 20190289102
    Abstract: 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.
    Type: Application
    Filed: March 13, 2019
    Publication date: September 19, 2019
    Inventors: Deepak Goel, Jean-Marc Frailong, Srihari Raju Vegesna, Stimit Kishor Oak, Rohit Sunkam Ramanujam, John David Huber, Hariharan Lakshminarayanan Thantry, Vikas Minglani, Saurin Patel, Sureshkumar Nedunchezhian
  • Patent number: 10333806
    Abstract: 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.
    Type: Grant
    Filed: November 13, 2015
    Date of Patent: June 25, 2019
    Assignee: CISCO TECHNOLOGY, INC.
    Inventors: Cecilia Martin, John David Huber, Mei Wang, Jonathan Chang, Flavio Bonomi, Sumeet Singh
  • Publication number: 20190104057
    Abstract: 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.
    Type: Application
    Filed: September 28, 2018
    Publication date: April 4, 2019
    Inventors: Deepak Goel, Pradeep Sindhu, Ayaskant Pani, Srihari Raju Vegesna, Narendra Jayawant Gathoo, John David Huber, Rohit Sunkam Ramanujam, Saurin Patel
  • Publication number: 20160072685
    Abstract: 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.
    Type: Application
    Filed: November 13, 2015
    Publication date: March 10, 2016
    Inventors: Cecilia MARTIN, John David HUBER, Mei WANG, Jonathan CHANG, Flavio BONOMI, Sumeet SINGH
  • Patent number: 8185745
    Abstract: 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).
    Type: Grant
    Filed: November 30, 2010
    Date of Patent: May 22, 2012
    Assignee: Cisco Technology, Inc.
    Inventors: Sumeet Singh, John David Huber, Flavio Giovanni Bonomi
  • Publication number: 20110118262
    Abstract: Disclosed are compounds of formula (I) and compositions of the present invention which are inhibitors of the sodium proton exchanger isoform-1 (NHE-I). Also disclosed are methods of using and making the same.
    Type: Application
    Filed: June 24, 2009
    Publication date: May 19, 2011
    Applicant: BOEHRINGER INGELHEIM INTERNATIONAL GMBH
    Inventors: Joerg Martin Bentzien, Stephen James Boyer, Jennifer Burke, Anne Bettina Eldrup, Xin Guo, John David Huber, Thomas Martin Kirrane, Fariba Soleymanzadeh, Alan David Swinamer
  • Patent number: 7783688
    Abstract: A method and apparatus speeding up an incremental hash function is described. The method may comprise receiving a data string including a plurality of N data samples and, as each data sample is received, multiplying the data samples to obtain data sample multiplication results and multiplying a current hash value by a constant to obtain a hash multiplication result. Thereafter, the data sample multiplication results are added to the hash multiplication result to obtain new current hash values and a hash value of the data string is defined as the new hash value. In an embodiment, a moving window of length wl may be defined and data samples that were received wl to wl+N bytes previously may be multiplied with the constant raised to the power of w to wl+Nl to obtain n subtraction results.
    Type: Grant
    Filed: November 9, 2005
    Date of Patent: August 24, 2010
    Assignee: Cisco Technology, Inc.
    Inventor: John David Huber
  • Patent number: 7602780
    Abstract: A method and apparatus is described for identifying content in a packet. The method may obtain data sample from the packet where the data sample is in a predetermined window at an initial offset point in the packet. For each offset point, a first stage of processing on the data sample may be performed to identify if the data sample corresponds to potentially relevant reference string. A more focused second stage of processing may then be carried out on the data sample to identify if the data sample corresponds to potentially relevant reference string. Thereafter, an even more focused third stage of processing may be carried out on the data sample to obtain a third stage result. If the data sample passes all three stages of processing, a predefined action is identified which is associated with a reference string corresponding to the data sample.
    Type: Grant
    Filed: November 9, 2005
    Date of Patent: October 13, 2009
    Assignee: Cisco Technology, Inc.
    Inventors: Sushil Kumar Singh, George Varghese, John David Huber, Sumeet Singh
  • Patent number: 7352694
    Abstract: A system and method are provided for tolerating data line faults in a packet communications switch fabric. The method comprises: accepting information packets including a plurality of cells, at a plurality of ingress port card ports, the plurality of information packets addressing a plurality of egress port card ports; selectively connecting port card ports to port card backplane data links; selectively connecting port card backplane data links and crossbars; sensing a connection fault in a backplane data link; in response to sensing the fault, reselecting connections between the port card ports and the port card backplane data links; in response to reselecting connections between the port card ports and the port card backplane data links, serially transferring packets through the port cards; serially transferring packets through the crossbars to the egress port cards; and, suspending use of the faulty connection.
    Type: Grant
    Filed: February 24, 2003
    Date of Patent: April 1, 2008
    Assignee: Applied Micro Circuits Corporation
    Inventors: Philip Michael Clovis, Eli James Aubrey Fernald, John David Huber, Kirk Alvin Miller, Sushil Kumar Singh, Prayag Bhanubhai Patel, Kenneth Yi Yun, George Beshara Bendak
  • Patent number: 7298739
    Abstract: A system and method are provided for communicating control information in a switch fabric. The method comprises: on a switch card, establishing a plurality of crossbars controlled by an arbiter; initiating a control message; and, distributing the control message on a switch card token bus connecting the crossbars and arbiter elements. Distributing the control message on a switch card token bus connecting the crossbar and arbiter elements includes daisy-chain connecting the elements with a cyclical bus. In some aspects of the method, establishing a plurality of crossbars controlled by an arbiter includes identifying each element with a unique address. Then, initiating a control message includes initiating a control message with an attached address. Distributing the control message on a switch card token bus includes the substeps of: daisy-chain passing the control message between elements; and, terminating the message at an element having an address matching the address attached to the control message.
    Type: Grant
    Filed: March 3, 2003
    Date of Patent: November 20, 2007
    Assignee: Applied Micro Circuits Corporation
    Inventors: Kirk Alvin Miller, Philip Michael Clovis, John David Huber, Kenneth Yi Yun, Peter John Holzer, John Calvin Leung