Patents by Inventor Bernard Karl Gunther

Bernard Karl Gunther 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: 7861291
    Abstract: A method, data processing system, and computer program product are provided for retrieving access rules using a plurality of subtables. An incoming packet that includes fields of data is received from a network. A key is formed from the fields, the key includes a number of subkeys. The subkeys are selected and each of the selected subkeys is used to search a different subtable. If a subtable entry is a pointer, a next level subtable is searched until a failure or data is encountered. If a failure occurs, a default rule is applied. If data is encountered, the key is masked using a stored mask value. The resulting masked key is compared to a stored rule. If they match, the identified rule is applied, otherwise the default rule is applied.
    Type: Grant
    Filed: June 2, 2006
    Date of Patent: December 28, 2010
    Assignee: Freescale Semiconductor, Inc.
    Inventors: David B. Kramer, Chris P. Thron, Bernard Karl Gunther
  • Patent number: 7446681
    Abstract: A method of constructing, from a first array of entries, a second array of entries having a reduced number of entries compared with the first array is disclosed. According to one embodiment, the method comprises partitioning the first array into one or more groups of entries and then categorizing each group with a category categorizing relationships between entries of a respective group, or entries of a respective group and entries of another group. A compression code is then formed that contains a sequence of coded identifiers, each identifier identifying the category of a respective group. Finally, the second array is constructed to include selected entries from the first array. The selected entries depend on the category of each group and are arranged so as to be indexable by processing a first index into the first array and the compression code to derive a second index for retrieving an equivalent entry from the second array without decompressing the second array.
    Type: Grant
    Filed: June 14, 2006
    Date of Patent: November 4, 2008
    Assignee: Freescale Semiconductor, Inc.
    Inventor: Bernard Karl Gunther
  • Publication number: 20070294502
    Abstract: A method of constructing, from a first array of entries, a second array of entries having a reduced number of entries compared with the first array is disclosed. According to one embodiment, the method comprises partitioning the first array into one or more groups of entries and then categorizing each group with a category categorizing relationships between entries of a respective group, or entries of a respective group and entries of another group. A compression code is then formed that contains a sequence of coded identifiers, each identifier identifying the category of a respective group. Finally, the second array is constructed to include selected entries from the first array. The selected entries depend on the category of each group and are arranged so as to be indexable by processing a first index into the first array and the compression code to derive a second index for retrieving an equivalent entry from the second array without decompressing the second array.
    Type: Application
    Filed: June 14, 2006
    Publication date: December 20, 2007
    Inventor: Bernard Karl Gunther
  • Publication number: 20070283144
    Abstract: A method, data processing system, and computer program product are provided for retrieving access rules using a plurality of subtables. An incoming packet that includes fields of data is received from a network. A key is formed from the fields, the key includes a number of subkeys. The subkeys are selected and each of the selected subkeys is used to search a different subtable. If a subtable entry is a pointer, a next level subtable is searched until a failure or data is encountered. If a failure occurs, a default rule is applied. If data is encountered, the key is masked using a stored mask value. The resulting masked key is compared to a stored rule. If they match, the identified rule is applied, otherwise the default rule is applied.
    Type: Application
    Filed: June 2, 2006
    Publication date: December 6, 2007
    Inventors: David B. Kramer, Chris P. Thron, Bernard Karl Gunther