Patents by Inventor Corey Alan Garrow

Corey Alan Garrow 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: 7760737
    Abstract: A method is described that is operable to reorder and reassemble data packets from network traffic into unfragmented and in-order traffic flows for applications such as deep packet classification and quality of service determination. A queue engine stores incoming data packets in a packet memory that is controlled by a link list controller. A packet assembler extracts information from each data packet, particularly fields from the header information, and uses that information among other things, to determine if the data packet is fragmented or out of order, and to associate the data packet with a session id. If the packet is determined to be out of order, the queue engine includes a reordering unit, which is able to modify links with the link list controller to reorder data packets. A fragment reassembly unit is also included which is capable of taking fragments and reassembling them into complete unfragmented data packets.
    Type: Grant
    Filed: February 23, 2001
    Date of Patent: July 20, 2010
    Assignee: Audiocodes, Inc.
    Inventors: Aswinkumar Vishanji Rana, Corey Alan Garrow
  • Patent number: 7031316
    Abstract: A content processor is described that is able to scan the contents of entire data packets including header and payload information. The content processor includes a queue engine operable to reorder out of order data packets and reassemble fragmented data packets. The queue engine sends the reordered and reassembled data packets to the context engine, which schedules the packets to be scanned. The packets are scanned by the content scanning engine using one or more string memories and one or more leaf string memories. The string memories are used by the content scanning engine to determine if there is a potential match between the data packet being scanned and any of the strings contained in database of known strings. If a potential match is identified, whether or not there is an exact match is determined using the leaf string memories and the leaf string compare engine. The scanning of the data packet results in a conclusion being generated by the content scanning engine.
    Type: Grant
    Filed: March 28, 2002
    Date of Patent: April 18, 2006
    Assignee: Netrake Corporation
    Inventors: Robert Daniel Maher, III, Aswinkumar Vishanji Rana, Milton Andre Lie, Kevin William Brandon, Mark Warden Hervin, Corey Alan Garrow
  • Patent number: 6781992
    Abstract: A queue engine is described that is operable to reorder and reassemble data packets from network traffic into unfragmented and in order traffic flows for applications such as deep packet classification and quality of service determination. The queue engine stores incoming data packets in a packet memory that is controlled by a link list controller. A packet assembler extracts information from each data packet, particularly fields from the header information, and uses that information among other things, to determine if the data packet is fragmented or out of order, and to associate the data packet with a session id. If the packet is determined to be out of order, the queue engine includes a reordering unit which is able to modify links with the link list controller to reorder data packets. A fragment reassembly unit is also included which is capable of taking fragments and reassembling them into complete unfragmented data packets.
    Type: Grant
    Filed: February 23, 2001
    Date of Patent: August 24, 2004
    Assignee: Netrake Corporation
    Inventors: Aswinkumar Vishanji Rana, Corey Alan Garrow
  • Patent number: 6654373
    Abstract: A content aware network device is described that is able to scan the contents of entire data packets including header and payload information. The network device includes a physical interface for converting analog network signal into bit streams and vise versa. The bit stream from the physical interface is sent to a traffic flow scanning processor that may be, but is not necessarily, divided into a header processor and a payload analyzer. The header processor scans the header information from each data packet, which is used to determine routing information and session identification. The payload analyzer scans the data packet's payload and matches the payload against a database of known strings. The payload analyzer is able to scan across packet boundaries and to scan for strings of variable and arbitrary length. Once the payload has been scanned the network device can operate on the data packet based on the results of the payload analyzer.
    Type: Grant
    Filed: June 12, 2000
    Date of Patent: November 25, 2003
    Assignee: Netrake Corporation
    Inventors: Robert Daniel Maher, III, Victor A. Bennett, Aswinkumar Vishanji Rana, Milton Andre Lie, Kevin William Brandon, Mark Warden Hervin, Corey Alan Garrow
  • Publication number: 20020105910
    Abstract: A content processor is described that is able to scan the contents of entire data packets including header and payload information. The content processor includes a queue engine operable to reorder out of order data packets and reassemble fragmented data packets. The queue engine sends the reordered and reassembled data packets to the context engine, which schedules the packets to be scanned. The packets are scanned by the content scanning engine using one or more string memories and one or more leaf string memories. The string memories are used by the content scanning engine to determine if there is a potential match between the data packet being scanned and any of the strings contained in database of known strings. If a potential match is identified, whether or not there is an exact match is determined using the leaf string memories and the leaf string compare engine. The scanning of the data packet results in a conclusion being generated by the content scanning engine.
    Type: Application
    Filed: March 28, 2002
    Publication date: August 8, 2002
    Inventors: Robert Daniel Maher, Aswinkumar Vishanji Rana, Milton Andre Lie, Kevin William Brandon, Mark Warden Hervin, Corey Alan Garrow
  • Publication number: 20020095512
    Abstract: A method is described that is operable to reorder and reassemble data packets from network traffic into unfragmented and in-order traffic flows for applications such as deep packet classification and quality of service determination. A queue engine stores incoming data packets in a packet memory that is controlled by a link list controller. A packet assembler extracts information from each data packet, particularly fields from the header information, and uses that information among other things, to determine if the data packet is fragmented or out of order, and to associate the data packet with a session id. If the packet is determined to be out of order, the queue engine includes a reordering unit, which is able to modify links with the link list controller to reorder data packets. A fragment reassembly unit is also included which is capable of taking fragments and reassembling them into complete unfragmented data packets.
    Type: Application
    Filed: February 23, 2001
    Publication date: July 18, 2002
    Inventors: Aswinkumar Vishanji Rana, Corey Alan Garrow
  • Patent number: 6381242
    Abstract: A content processor is described that is able to scan the contents of entire data packets including header and payload information. The content processor includes a queue engine operable to reorder out of order data packets and reassemble fragmented data packets. The queue engine sends the reordered and reassembled data packets to the context engine, which schedules the packets to be scanned. The packets are scanned by the content scanning engine using one or more string memories and one or more leaf string memories. The string memories are used by the content scanning engine to determine if there is a potential match between the data packet being scanned and any of the strings contained in database of known strings. If a potential match is identified, whether or not there is an exact match is determined using the leaf string memories and the leaf string compare engine. The scanning of the data packet results in a conclusion being generated by the content scanning engine.
    Type: Grant
    Filed: August 29, 2000
    Date of Patent: April 30, 2002
    Assignee: Netrake Corporation
    Inventors: Robert Daniel Maher, III, Aswinkumar Vishanji Rana, Milton Andre Lie, Kevin William Brandon, Mark Warden Hervin, Corey Alan Garrow