Patents by Inventor Brian E. Carpenter

Brian E. Carpenter 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: 20240084056
    Abstract: Elastomeric polyolefin-based ionomers and methods for making same. The ionomers can include a copolymer comprising: C2-C60 ?-olefin monomer units; optional C2-C60 ?-olefin comonomer units different than the monomer units; optional diene units; and about 0.1 wt % to about 20 wt % metal alkenyl units, based on the weight of the copolymer, wherein the metal alkenyl units have the formula —R(A?)—, wherein R is an alkyl group containing 2 to 10 carbon atoms, and A? is an anionic group. The copolymer can further include one or more metal cations derived from the group consisting of alkali metals, alkaline earth metals, group 3-12 metals, group 13-16 metals, and combination(s) thereof. The ionomer has a glass transition temperature of ?60° C. to 5° C., and a weight average (Mw) of 50 to 5,000 kg/mol.
    Type: Application
    Filed: December 8, 2021
    Publication date: March 14, 2024
    Inventors: Tzu-Pin Lin, Carlos R. Lopez-Barron, Avery R. Smith, Brian J. Rohde, Alex E. Carpenter, Matthew W. Holtcamp, Jo Ann M. Canich, John R. Hagadorn
  • Patent number: 8161145
    Abstract: A method for managing attacks in a computer system is disclosed. The computer system is used in sending, receiving, or sending and receiving a plurality of packets, which include a plurality of administrative packets. The method includes determining whether a congestion of the administrative packets exists. Congestion of the administrative packets indicates that a potential attack exists. The method also includes discarding a portion of the plurality of administrative packets if it is declared that the congestion of the administrative packets exists. The portion of the plurality of packets is sufficient to ensure that a remaining portion of the plurality of packets transmitted is not more than a maximum administrative packet bandwidth limit and, if the plurality of administrative packets present a sufficient offered load, not less than a minimum administrative packet bandwidth guarantee.
    Type: Grant
    Filed: February 27, 2003
    Date of Patent: April 17, 2012
    Assignee: International Business Machines Corporation
    Inventors: Brian E. Carpenter, Clark D. Jeffries, Andreas Kind, Michael S. Siegel
  • Patent number: 7349342
    Abstract: Methods and apparatus are provided for metering data packets having a plurality of different packet lengths in a data communications network. A token count TC is incremented at a token increment rate CIR subject to an upper limit CBS on the token count. On arrival of a packet of length L tokens, it is determined if both TC>0 and TC+n?L, where n is a defined number of tokens. If so, the data packet is categorized as in profile and L tokens are subtracted from the token count TC. Otherwise the data packet is categorized out of profile. In some embodiments, n is set to a value in the range 0<n<(Lmax?1) where Lmax is the maximum length of data packets to be metered. In other embodiments, n is varied in the range 0?n?(Lmax?1) in dependence on at least one feedback signal indicating an operational condition in the network. The degree of conformance of the metering system is determined by the parameter n, whereby the conformance level can be tuned to particular multi-length packet environments.
    Type: Grant
    Filed: March 17, 2003
    Date of Patent: March 25, 2008
    Assignee: International Business Machines Corporation
    Inventors: Brian E. Carpenter, Clark D. Jeffries, Andreas Kind
  • Publication number: 20040184404
    Abstract: Methods and apparatus are provided for metering data packets having a plurality of different packet lengths in a data communications network. A token count TC is incremented at a token increment rate CIR subject to an upper limit CBS on the token count. On arrival of a packet of length L tokens, it is determined if both TC>0 and TC+n≧L, where n is a defined number of tokens. If so, the data packet is categorized as in profile and L tokens are subtracted from the token count TC. Otherwise the data packet is categorized out of profile. In some embodiments, n is set to a value in the range 0<n<(Lmax−1) where Lmax is the maximum length of data packets to be metered. In other embodiments, n is varied in the range 0≦n≦(Lmax−1) in dependence on at least one feedback signal indicating an operational condition in the network.
    Type: Application
    Filed: March 17, 2003
    Publication date: September 23, 2004
    Applicant: International Business Machines Corporation
    Inventors: Brian E. Carpenter, Clark D. Jeffries, Andreas Kind
  • Publication number: 20040170123
    Abstract: A method and system for managing attacks in a computer system is disclosed. The computer system is used in sending, receiving, or sending and receiving a plurality of packets, which include a plurality of administrative packets. The method and system include determining whether a congestion of the administrative packets exists. Congestion of the administrative packets indicates that a potential attack exists. The method and system also include discarding a portion of the plurality of administrative packets if it is declared that the congestion of the administrative packets exists. The portion of the plurality of packets is sufficient to ensure that a remaining portion of the plurality of packets transmitted is not more than a maximum administrative packet bandwidth limit and, if the plurality of administrative packets present a sufficient offered load, not less than a minimum administrative packet bandwidth guarantee.
    Type: Application
    Filed: February 27, 2003
    Publication date: September 2, 2004
    Applicant: International Business Machines Corporation
    Inventors: Brian E. Carpenter, Clark D. Jeffries, Andreas Kind, Michael S. Siegel
  • Patent number: 6625773
    Abstract: A multicast communication system for small groups using a protocol to indicate to routers receiving a packet according to the protocol to perform the following process: (1) determining a next hop for each of the destination nodes listed in the packet received; (2) partitioning the destination nodes into groups according to the next hop determined for each destination node in the preceding step; (3) replicating the packet such that there is at least one copy of the packet for each of the next hops; (4) modifying the list of addresses for the destination nodes such that the list of addresses for each of the next hops includes only the addresses for the destination nodes to be routed in that next hop; and (5) transmitting the modified copies of the packet to the next hops found in the previous steps for routing to the addresses included in each packet.
    Type: Grant
    Filed: June 9, 1999
    Date of Patent: September 23, 2003
    Assignee: International Business Machines Corporation
    Inventors: Richard H. Boivie, Brian E. Carpenter, Kiyoshi Maruyama