Patents by Inventor Kevin G. Plotz

Kevin G. Plotz 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: 8176385
    Abstract: The present invention discloses an apparatus and method for performing cyclic redundancy check (CRC) on partial protocol data units (PDUs). The disclosed apparatus is designed to off-load the CRC calculation for transmit or receive from a host computer. According to the disclosed method, when generating CRC for partial PDUs, for each such PDUs a decision is made to determine whether a CRC action is required, i.e., if CRC should be calculated, checked or placed in the outgoing byte stream. When partial CRC calculation is performed the intermediate value is saved into memory and later is used for calculating the CRC for a consecutive partial PDU. In accordance with a preferred embodiment of the invention, the need to re-calculate the CRC in a case of a re-transmit request is eliminated.
    Type: Grant
    Filed: May 21, 2009
    Date of Patent: May 8, 2012
    Assignee: Brocade Communications Systems, Inc.
    Inventors: Oran Uzrad-Nali, Kevin G. Plotz, Phil L Leichty
  • Publication number: 20100077284
    Abstract: The present invention discloses an apparatus and method for performing cyclic redundancy check (CRC) on partial protocol data units (PDUs). The disclosed apparatus is designed to off-load the CRC calculation for transmit or receive from a host computer. According to the disclosed method, when generating CRC for partial PDUs, for each such PDUs a decision is made to determine whether a CRC action is required, i.e., if CRC should be calculated, checked or placed in the outgoing byte stream. When partial CRC calculation is performed the intermediate value is saved into memory and later is used for calculating the CRC for a consecutive partial PDU. In accordance with a preferred embodiment of the invention, the need to re-calculate the CRC in a case of a re-transmit request is eliminated.
    Type: Application
    Filed: May 21, 2009
    Publication date: March 25, 2010
    Applicant: BROCADE COMMUNICATIONS SYSTEMS, INC.
    Inventors: ORAN UZRAD-NALI, KEVIN G. PLOTZ, PHIL L. LEICHTY
  • Patent number: 7668841
    Abstract: A method for accelerating storage access in a network. The method comprises receiving a data record having a plurality of data segments. The data segments are stored in a local memory of a network controller (NC). A virtual write buffer (VWB) entry is assigned for the incoming data record in the NC local memory. The data segments of said data record are reassemble using the VWB. The data record is sent from the network controller directly to an I/O controller of a storage device.
    Type: Grant
    Filed: March 10, 2004
    Date of Patent: February 23, 2010
    Assignee: Brocade Communication Systems, Inc.
    Inventors: Oran Uzrad-Nali, John H. Shaffer, Kevin G. Plotz
  • Patent number: 7577896
    Abstract: The present invention discloses an apparatus and method for performing cyclic redundancy check (CRC) on partial protocol data units (PDUs). The disclosed apparatus is designed to off-load the CRC calculation for transmit or receive from a host computer. According to the disclosed method, when generating CRC for partial PDUs, for each such PDUs a decision is made to determine whether a CRC action is required, i.e., if CRC should be calculated, checked or placed in the outgoing byte stream. When partial CRC calculation is performed the intermediate value is saved into memory and later is used for calculating the CRC for a consecutive partial PDU. In accordance with a preferred embodiment of the invention, the need to re-calculate the CRC in a case of a re-transmit request is eliminated.
    Type: Grant
    Filed: October 26, 2005
    Date of Patent: August 18, 2009
    Assignee: Brocade Communications Systems, Inc.
    Inventors: Oran Uzrad-Nali, Kevin G. Plotz, Phil L. Leichty
  • Publication number: 20040268017
    Abstract: A method for accelerating storage access in a network. The method comprises receiving a data record having a plurality of data segments. The data segments are stored in a local memory of a network controller (NC). A virtual write buffer (VWB) entry is assigned for the incoming data record in the NC local memory. The data segments of said data record are reassemble using the VWB. The data record is sent from the network controller directly to an I/O controller of a storage device.
    Type: Application
    Filed: March 10, 2004
    Publication date: December 30, 2004
    Applicant: SILVERBACK SYSTEMS, INC.
    Inventors: Oran Uzrad-Nali, John H. Shaffer, Kevin G. Plotz
  • Patent number: 5652749
    Abstract: Method and apparatus are provided for segmenting a multiple program multimedia digital data stream for transmission over a distribution communications network. Each program multimedia digital data stream includes sequential transport system (TS) packets with program clock references (PCRs) at a set time interval and a program identification (PID) associated with the PCRs. The multiple program multimedia digital data stream is received. The TS packets are decoded to identify the program clock references (PCRs). A selected number N of TS packets are identified. The multimedia digital data stream into frames responsive to both the identified number N of TS packets and the identified PCRs. A program identification (PID) associated with one of the PCRs is selected for timing the transmission of segmented multiple program multimedia digital data stream.
    Type: Grant
    Filed: July 25, 1996
    Date of Patent: July 29, 1997
    Assignee: International Business Machines Corporation
    Inventors: David William Davenport, Gary Scott Delp, Jeffrey James Lynch, Kevin G. Plotz, Philip Lynn Leichty
  • Patent number: 5555387
    Abstract: A method and apparatus for implementing virtual memory having multiple selected page sizes are provided. A virtual address includes a map index and a frame offset. A selector mechanism receives the virtual address frame offset and generates an offset and index. A frame map table indexes the virtual address map index and the selector generated index and generates a base address. The frame map table generated base address and the selector generated offset are combined to provide a physical address.
    Type: Grant
    Filed: June 6, 1995
    Date of Patent: September 10, 1996
    Assignee: International Business Machines Corporation
    Inventors: Mark W. Branstad, Jonathan W. Byrn, Gary S. Delp, Philip L. Leichty, Kevin G. Plotz, Fadi-Christian E. Safi, Albert A. Slane
  • Patent number: 5537408
    Abstract: Method and apparatus are provided for transmitting a stream of multimedia digital data over a distribution communications network. A multimedia stream server segments the multimedia digital data stream into data blocks on a first boundary and a second boundary. The first boundary is a set number of transport system data packets and the second boundary is a transport system data packet including a timestamp. A scheduler schedules the segmented data blocks for transmission. The multimedia stream server decodes the segmented data blocks to locate the timestamps and matches the transmission of the located timestamp data block with a time value indicated by the timestamp. The set number of transport system data packets can be determined at connection setup and is not a predetermined value for all sessions. At the receiver, batch processing of received multimedia data can be provided.
    Type: Grant
    Filed: June 5, 1995
    Date of Patent: July 16, 1996
    Assignee: International Business Machines Corporation
    Inventors: Mark W. Branstad, Jonathan W. Byrn, Gary S. Delp, Phillip L. Leichty, Jeffrey J. Lynch, Kevin G. Plotz, Lee A. Sendelbach, Albert A. Slane
  • Patent number: 5533021
    Abstract: Method and apparatus are provided for transmitting a stream of multimedia digital data over a distribution communications network. A multimedia stream server segments the multimedia digital data stream into data blocks on a first boundary and a second boundary. The first boundary is a set number of transport system data packets and the second boundary is a transport system data packet including a timestamp. A scheduler schedules the segmented data blocks for transmission. The multimedia stream server decodes the segmented data blocks to locate the timestamps and matches the transmission of the located timestamp data block with a time value indicated by the timestamp. The set number of transport system data packets can be determined at connection setup and is not a predetermined value for all sessions. At the receiver, batch processing of received multimedia data can be provided.
    Type: Grant
    Filed: February 3, 1995
    Date of Patent: July 2, 1996
    Assignee: International Business Machines Corporation
    Inventors: Mark W. Branstad, Jonathan W. Byrn, Gary S. Delp, Philip L. Leichty, Jeffrey J. Lynch, Kevin G. Plotz, Lee A. Sendelbach, Albert A. Slane
  • Patent number: 5533020
    Abstract: A method and apparatus for scheduling the transmission of a number of data streams over a common communications link, where each of the data streams conforms to a corresponding set of flow control parameters. Each of the data streams to be transmitted on the communications link is stored in a corresponding queue. The status of each queue is maintained, and a target transmission time is calculated for each queue. Signals are then generated for each queue at a time at least after the target transmission time, and these signals are used to indicate to a corresponding queue that is can transmit a cell on the link. Upon reception of a corresponding signal, a queue then transmits at least one cell onto the communications link.
    Type: Grant
    Filed: October 31, 1994
    Date of Patent: July 2, 1996
    Assignee: International Business Machines Corporation
    Inventors: Jonathan W. Byrn, Gary S. Delp, Philip L. Leichty, Baiju V. Patel, Kevin G. Plotz, Frank A. Schaffa, Marc H. Willebeek-LeMair