Patents by Inventor Bruce E. Caram

Bruce E. Caram 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: 20190129623
    Abstract: A storage technique includes selectively tagging a set of write requests by applying tags to write requests that are pursuant to copy operations and not applying tags to at least some write requests that are not pursuant to copy operations. For each of the set of write requests, the technique further includes performing a decision operation configured to (i) direct the write request down a first processing path that supports inline deduplication in response to the write request satisfying a set of criteria and (ii) direct the write request down a second processing path that does not support inline deduplication in response to the write request failing to satisfy the set of criteria. The set of criteria include whether the write request has a tag applied, such that the decision operation preferentially directs write requests down the first processing path in response to the write requests being tagged.
    Type: Application
    Filed: October 31, 2017
    Publication date: May 2, 2019
    Inventors: Philippe Armangau, Bruce E. Caram, Yining Si, Christopher A. Seibel
  • Publication number: 20190129970
    Abstract: Embodiments are directed to techniques for performing deduplication. A method includes (a) obtaining a digest of a data block logically-positioned within a filesystem, the digest providing a hash value of data of the data block, (b) searching a Most Wanted Digest Cache (MWDC) within system memory for the digest, (c) locating an entry in the MWDC using the digest, wherein this locating indicates that the data block has the same data as another data block located elsewhere within the filesystem, the other data block having been previously persistently-stored, the entry having been added to the MWDC in response to the other data block having been deduplicated at least a plurality number of times, (d) locating a mapping structure referenced by the entry located from the MWDC, the mapping structure providing metadata about the other data block, and (e) deduplicating the data block and the other data block with reference to the located mapping structure.
    Type: Application
    Filed: October 31, 2017
    Publication date: May 2, 2019
    Inventors: Philippe Armangau, Christopher A. Seibel, Bruce E. Caram, Yubing Wang, John Gillono
  • Patent number: 10268381
    Abstract: A storage technique includes selectively tagging a set of write requests by applying tags to write requests that are pursuant to copy operations and not applying tags to at least some write requests that are not pursuant to copy operations. For each of the set of write requests, the technique further includes performing a decision operation configured to (i) direct the write request down a first processing path that supports inline deduplication in response to the write request satisfying a set of criteria and (ii) direct the write request down a second processing path that does not support inline deduplication in response to the write request failing to satisfy the set of criteria. The set of criteria include whether the write request has a tag applied, such that the decision operation preferentially directs write requests down the first processing path in response to the write requests being tagged.
    Type: Grant
    Filed: October 31, 2017
    Date of Patent: April 23, 2019
    Assignee: EMC IP Holding Company LLC
    Inventors: Philippe Armangau, Bruce E. Caram, Yining Si, Christopher A. Seibel
  • Patent number: 10203880
    Abstract: A technique writes data to a storage array. The technique involves operating storage circuitry in a “FILL HOLE” mode in which the circuitry writes a stream of first data portions within storage portions of used storage stripes of the array. The technique further involves, after operating the circuitry in the “FILL HOLE” mode and in response to a first event, transitioning the circuitry from the “FILL HOLE” mode to a “STRIPE WRITE” mode in which the circuitry writes a stream of second data portions within unused storage stripes of the array. The technique further involves, after operating the circuitry in the “STRIPE WRITE” mode and in response to a second event, transitioning the circuitry from the “STRIPE WRITE” mode back to the “FILL HOLE” mode in which the circuitry writes a stream of third data portions within storage portions of used storage stripes of the array.
    Type: Grant
    Filed: September 29, 2016
    Date of Patent: February 12, 2019
    Assignee: EMC IP Holding Company LLC
    Inventors: Philippe Armangau, Bruce E. Caram, Christopher A. Seibel, Christopher Jones
  • Patent number: 9747222
    Abstract: A technique for controlling acceptance of host application data into a data log in a data storage system includes selectively accepting or refusing newly arriving host data into the data log based on a comparison between an oldest entry in the data log and an age threshold. The age threshold is dynamically updated based on system heuristics. As long as the oldest log entry is younger than the age threshold, the data log continues to accept newly arriving host application data, acknowledging IO requests to host applications as the data specified in those requests is entered into the log. However, when the oldest log entry is older than the age threshold, new log entries are temporarily refused entry into the data log. Instead, newly arriving data are placed in a pending list, where they are kept until the data log is again accepting new log entries.
    Type: Grant
    Filed: March 31, 2016
    Date of Patent: August 29, 2017
    Assignee: EMC IP Holding Company LLC
    Inventors: Philippe Armangau, Bruce E. Caram, Christopher A. Seibel
  • Patent number: 8463901
    Abstract: A packet processing system comprises two packet inspection systems for tracking packet flows between a first network and a second network. A memory is accessible by each of the packet inspection systems for storing flow entries. Each of the flow entries includes a flow key characterizing a packet flow associated with flow entry, a flow identifier. State information is further maintained indicating ownership of the flow identifiers among the two packet inspection systems. Using stateful identifiers ensures that two packet processing systems do not become incoherent and properly indicate the status of free flow identifiers.
    Type: Grant
    Filed: May 28, 2010
    Date of Patent: June 11, 2013
    Inventor: Bruce E. Caram
  • Publication number: 20110296002
    Abstract: A packet processing system comprises two packet inspection systems for tracking packet flows between a first network and a second network. A memory is accessible by each of the packet inspection systems for storing flow entries. Each of the flow entries includes a flow key characterizing a packet flow associated with flow entry, a flow identifier. State information is further maintained indicating ownership of the flow identifiers among the two packet inspection systems. Using stateful identifiers ensures that two packet processing systems do not become incoherent and properly indicate the status of free flow identifiers.
    Type: Application
    Filed: May 28, 2010
    Publication date: December 1, 2011
    Applicant: ARBOR NETWORKS, INC.
    Inventor: Bruce E. Caram
  • Patent number: 7826358
    Abstract: A system and method of providing high speed, prioritized delivery of data packets over broadband communications networks that avoids inducing unwanted latency in data packet transmission. The system employs a hierarchical, real-time, weighted token bucket prioritization scheme that provides for fair sharing of the available network bandwidth. At least one token bucket is employed at each level of the hierarchy to meter data flows providing service applications included in multiple subscribers' service plans. Each token bucket passes, discards, or marks as being eligible for subsequent discarding data packets contained in the data flows using an algorithm that takes into account the priority of the data packets, including strict high, strict medium, and strict low priorities corresponding to strict priority levels that cannot be overridden. The algorithm also takes into account weighted priorities of at least a subset of the low priority data packets.
    Type: Grant
    Filed: December 29, 2006
    Date of Patent: November 2, 2010
    Assignee: Ellacoya Networks, Inc.
    Inventor: Bruce E. Caram
  • Patent number: 7743166
    Abstract: Methods and systems for providing scaleable flow based application control in private and public Internet. A flow table can be used to control the application and subscriber traffic for communication flows in access networks. The flow table entry can provide granular, unidirectional packet transmission of data for all or a subset of all host and application communications originating from or destined to network hosts in the access network. Using a flow table entry for multiple unidirectional packet transmissions of data provides efficient use of flow table entries and allows varying operator control of application communication exchanges between network hosts and applications. By using variable masking techniques, the flow table can be used for varying degrees of control over the packet transmissions in the network.
    Type: Grant
    Filed: September 30, 2003
    Date of Patent: June 22, 2010
    Assignee: Ellacoya Networks, Inc.
    Inventors: Kurt A. Dobbins, Brett A. Miller, Bruce E. Caram
  • Publication number: 20080159135
    Abstract: A system and method of providing high speed, prioritized delivery of data packets over broadband communications networks that avoids inducing unwanted latency in data packet transmission. The system employs a hierarchical, real-time, weighted token bucket prioritization scheme that provides for fair sharing of the available network bandwidth. At least one token bucket is employed at each level of the hierarchy to meter data flows providing service applications included in multiple subscribers' service plans. Each token bucket passes, discards, or marks as being eligible for subsequent discarding data packets contained in the data flows using an algorithm that takes into account the priority of the data packets, including strict high, strict medium, and strict low priorities corresponding to strict priority levels that cannot be overridden. The algorithm also takes into account weighted priorities of at least a subset of the low priority data packets.
    Type: Application
    Filed: December 29, 2006
    Publication date: July 3, 2008
    Inventor: Bruce E. Caram
  • Patent number: 7016956
    Abstract: Tailored application or service may be delivered via a communication device to a number of subscribers in a manner that avoids having to store individual copies of a service profile on the device for each subscriber receiving the application or service. Specifically, a packet is received requesting delivery of the application or service from the subscriber at a communication device. In response, the communication device retrieves a subscriber context, which references policies that describe each of the applications and services available to the subscriber. The application or service requested by the packet is compared with the policies referenced by the subscriber context to identify any matching policies. Subsequently, the requested application or service is delivered to the subscriber via the communication device according to the matching policies as described by a service profile. This service profile is accessible for describing the application or service when requested by other subscribers.
    Type: Grant
    Filed: July 31, 2001
    Date of Patent: March 21, 2006
    Assignee: Ellacoya Networks, Inc.
    Inventors: Kurt A. Dobbins, David J. Ruffen, Brett A. Miller, Bruce E. Caram
  • Publication number: 20020029260
    Abstract: Tailored application or service may be delivered via a communication device to a number of subscribers in a manner that avoids having to store individual copies of a service profile on the device for each subscriber receiving the application or service. Specifically, a packet is received requesting delivery of the application or service from the subscriber at a communication device. In response, the communication device retrieves a subscriber context, which references policies that describe each of the applications and services available to the subscriber. The application or service requested by the packet is compared with the policies referenced by the subscriber context to identify any matching policies. Subsequently, the requested application or service is delivered to the subscriber via the communication device according to the matching policies as described by a service profile. This service profile is accessible for describing the application or service when requested by other subscribers.
    Type: Application
    Filed: July 31, 2001
    Publication date: March 7, 2002
    Inventors: Kurt A. Dobbins, Dave J. Ruffen, Brett A. Miller, Bruce E. Caram
  • Patent number: 5245607
    Abstract: A facility is provided in a data network to prevent a so-called connectionless broadcast message from flooding the network as a result of each network node retransmitting such messages to its neighboring nodes even though a neighboring node may have received them from another neighbor. Specifically, a node x that receives a connectionless broadcast message retransmits the message to a neighboring node y only when node x finds that it is closer to the source of the message than node y is including any other neighbor of node y.
    Type: Grant
    Filed: March 5, 1990
    Date of Patent: September 14, 1993
    Assignee: AT&T Bell Laboratories
    Inventor: Bruce E. Caram
  • Patent number: 5163045
    Abstract: A communications system that is arranged to transport so-called connection oriented messages via respective virtual circuit connections is enhanced so that it also transports so-called connectionless messages via a predefined virtual circuit connection that is common among those data modules which participate in the connectionless message service. In particular, each module which participates in the connectionless message service is assigned, in addition to a primary address that is used in conjunction with associated channels numbers to transport respective connection oriented messages, a common address and a channel number that is used solely for transporting connectionless messages. In this way, the communications system processes connectionless messages as though they were connection oriented messages.
    Type: Grant
    Filed: October 1, 1990
    Date of Patent: November 10, 1992
    Assignee: AT&T Bell Laboratories
    Inventors: Bruce E. Caram, Ronald C. Roposh, Harvey Rubin