Patents by Inventor Linden Minnick

Linden Minnick 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).

  • Publication number: 20030236911
    Abstract: Computer network apparatus may include a packet-receiving module to receive a packet into an element of a storage array while a low resource state exists, an array truncation module to truncate the array at the element when the array is full or when no more packets are available to be received, and an array indication module to indicate the array after the array truncation module truncates the array. In one embodiment, a system may include a receiving node containing the apparatus. A method may include receiving a packet into an element of an array while a low resource state exists, truncating the array at the element after the array is full or no more packets are available to be received, and indicating the array.
    Type: Application
    Filed: June 25, 2002
    Publication date: December 25, 2003
    Applicant: Intel Corporation
    Inventors: Patrick L. Connor, Linden Minnick, Lucas M. Jenison
  • Publication number: 20030135757
    Abstract: A system for improved decryption performance includes a computer in electronic communication with an encrypted network. A controller performs a decryption operation on an encrypted packet received from the network, and the computer asserts an interrupt prior to the system completing transfer of the decrypted packet back to host memory to reduce the additional latency a packet suffers during Secondary Use. An additional interrupt may be asserted after the Secondary Use operation is complete, to ensure that the Secondary Use packet is processed. A method for improving decryption performance similarly includes asserting an interrupt prior to the complete transfer of a decrypted packet from a controller back to host memory during Secondary Use. The method may further include asserting an additional interrupt after the Secondary Use operation is complete, to ensure that the Secondary Use packet is processed.
    Type: Application
    Filed: January 17, 2002
    Publication date: July 17, 2003
    Inventors: Patrick L. Connor, Linden Minnick
  • Publication number: 20030110281
    Abstract: Numerous embodiments of a method and apparatus for processing latency sensitive electronic data with interrupt moderation are disclosed.
    Type: Application
    Filed: December 6, 2001
    Publication date: June 12, 2003
    Inventors: Linden Minnick, Patrick L. Connor
  • Publication number: 20030093578
    Abstract: The present disclosure describes a method comprising issuing a plurality of commands to a controller, wherein the commands are issued in a first order, and wherein the completion status of commands is written to the memory in a second order, and wherein the second order may be different from the first order. Also described is an apparatus comprising a controller adapted to accept a plurality of commands, wherein the commands are issued in a first order, and completion status of commands is written to the memory in a second order, and wherein the second order may be different from the first order.
    Type: Application
    Filed: November 15, 2001
    Publication date: May 15, 2003
    Inventors: Linden Minnick, Roy Callum, Patrick L. Connor
  • Publication number: 20030070010
    Abstract: Numerous embodiments of a method and apparatus for avoiding an out of resource condition are disclosed.
    Type: Application
    Filed: October 5, 2001
    Publication date: April 10, 2003
    Inventors: William B. Campbell, Linden Minnick
  • Publication number: 20030061495
    Abstract: Methods and apparatuses for managing tables of security associations (SA) are described. A device driver operating in an environment, for example, NDIS, where a unique handle is selected for each transmit SA and the SPI for each receive SA is selected with a random algorithm, divides transmit SAs from receive SAs in separate tables. An SA lookup table having a whole binary number of entries that is the lowest binary number greater than five times the number of SAs supported by the device driver contains information to match an SA to a data packet, and locate the SA in memory. The lookup table is searched using a bit-wise AND hash function.
    Type: Application
    Filed: September 26, 2001
    Publication date: March 27, 2003
    Inventor: Linden Minnick
  • Publication number: 20030058878
    Abstract: A method, apparatus, and article of manufacture for retaining packet order in multiprocessor systems utilizing multiple transmit queues while minimizing spinlocks are disclosed herein. Embodiments of the present invention define multiple transmit queues for a given priority level of packets to allow parallel processing and queuing of packets having equal priority in different transmit queues. Queuing packets of equal priority in different transmit queues minimizes processor time spent attempting to acquire queue-specific resources associated with one particular transmit queue. In addition, embodiments of the present invention provide an assignment mechanism to maximize utilization of the multiple transmit queues by queuing packets corresponding to each transmit request in a next available transmit queue defined for a given priority level. Coordination between hardware and software allows the order of the queued packets to be maintained in the transmission process.
    Type: Application
    Filed: May 9, 2002
    Publication date: March 27, 2003
    Inventors: Linden Minnick, Patrick L. Connor
  • Publication number: 20030058876
    Abstract: Methods, apparatus, and articles of manufacture for retaining packet order in multiprocessor systems utilizing multiple transmit queues are disclosed herein. Embodiments of the present invention define multiple transmit queues for a given priority level of packets to enable the multiprocessor system to process and queue packets of equal priority in different transmit queues. Queuing packets of equal priority in different transmit queues minimizes processor time spent attempting to acquire queue-specific resources associated with one particular transmit queue. In addition, embodiments of the present invention provide an assignment mechanism to ensure that packets corresponding to a common flow are queued in the same transmit queue in order to eliminate, to the extent possible, out-or-order packets, which many times results in lost packets and a reduction in realized network throughput.
    Type: Application
    Filed: September 25, 2001
    Publication date: March 27, 2003
    Inventors: Patrick L. Connor, Linden Minnick
  • Publication number: 20030046585
    Abstract: A Security Association (SA) lookup table is maintained at a network interface. The SA data is stored in a memory external to the network interface, for example, in the memory of a host electronic system in which the network interface provides network access. The lookup table stores sufficient information for the network interface, or another system component, to access the SA data. When a cryptography operation is to be performed, the SA data is retrieved from the external memory and delivered to the processor performing the cryptographic operations. In one embodiment, destination Internet Protocol (IP) address and the IPSec protocol are checked after the SA data is retrieved from the external memory. In one embodiment, the lookup table entries contain only an offset value from a base address value to locate the SA data.
    Type: Application
    Filed: September 6, 2001
    Publication date: March 6, 2003
    Inventor: Linden Minnick
  • Publication number: 20030005279
    Abstract: Methods and apparatuses for synchronizing the exchange of cryptography information between kernel drivers. A high level application in an electronic system passes a pointer to a base driver. The pointer is a unique identifier for cryptography information, such as a Security Association (SA), that the base driver uses to populate a cryptography information table for performing cryptography operations on secure traffic data packets. If the network interface device and/or its associated driver are reset, the pointer is used to repopulate the cryptography information table with specific cryptography information needed to perform cryptography operations on the data packets.
    Type: Application
    Filed: June 29, 2001
    Publication date: January 2, 2003
    Inventors: Moshe Valenci, Linden Minnick
  • Publication number: 20030005283
    Abstract: A method and apparatus for intelligently determining which traffic streams to offload efficiently. A metric value is associated with a Security Association (SA) for each network traffic stream coupled to an electronic system. The metric is used to determine which of multiple methods to perform cryptography operations should be used to handle which streams. The metric is modified based on network traffic, and increased when the SA is cached. The metric of all SAs is periodically decreased. In one embodiment, a network interface driver determines which SAs should be cached on a network interface card and handled using Inline Receive, and which SAs should not be cached and handled using Secondary Use. Cached SAs are replaced by non-cached SAs only if the metric value of a non-cached SA is greater than the metric value of a cached SA by at least a predetermined amount representing the cost of cache replacement.
    Type: Application
    Filed: June 29, 2001
    Publication date: January 2, 2003
    Inventors: Avraham Mualem, Linden Minnick
  • Publication number: 20020166070
    Abstract: Embodiments of a method and apparatus to reduce errors of security association are described.
    Type: Application
    Filed: May 4, 2001
    Publication date: November 7, 2002
    Inventors: Avraham Mualem, Linden Minnick
  • Publication number: 20020144004
    Abstract: A driver having an interrupt service routine including an interrupt handler and at least two deferred procedure calls. Each of the at least two deferred procedure calls is associated with a particular interrupt event or type of interrupt event. If multiple interrupt events occur, the interrupt events may be concurrently processed on separate deferred procedure calls, resulting in a substantially reduced interrupt handling latency.
    Type: Application
    Filed: March 29, 2001
    Publication date: October 3, 2002
    Inventors: Daniel R. Gaur, Patrick L. Connor, Lucas M. Jenison, Patrick J. Luhmann, Linden Minnick
  • Publication number: 20020138655
    Abstract: The number of memory copies in a network may be reduced by monitoring the state of the controller resources. If the controller resources run low while processing an array of data packets, the current data packet is marked and all subsequent data packets are flagged. When the array is fully processed, the controller resources are checked again. If the resources are still low, the flagged data packets are copied to buffers. However, if the controller resources are no longer low, the network controller removes all the flags and the data packets may be copied directly into the host memory at a later time.
    Type: Application
    Filed: March 21, 2001
    Publication date: September 26, 2002
    Inventors: Lucas M. Jenison, Linden Minnick
  • Publication number: 20020083150
    Abstract: Accessing information from memory includes allocating space in host memory to a buffer and copying the contents of a memory of a network interface controller into the buffer. The buffer is accessed in response to a request for information in the network interface controller memory. The contents of the memory are updated into the buffer if the contents of the memory are modified.
    Type: Application
    Filed: December 27, 2000
    Publication date: June 27, 2002
    Inventor: Linden Minnick