Patents by Inventor Benjamin ISHERWOOD

Benjamin ISHERWOOD 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: 9146689
    Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into a plurality of systems each having multiple nodes. A data protection level method comprises setting a numerical value of a system dynamic data protection level for each system of nodes; and in response to user input, setting a value of a data protection level for one or more data objects in a system, the value being a fixed numerical value or a dynamic value. If the one or more data objects have a dynamic value of the data protection level in a system, the one or more data objects inherit the system dynamic data protection level of the system in which the one or more data objects reside. The value of the data protection level represents a number of copies of data of the one or more data objects to be kept where the one or more data objects reside.
    Type: Grant
    Filed: February 25, 2014
    Date of Patent: September 29, 2015
    Assignee: HITACHI DATA SYSTEMS CORPORATION
    Inventors: Richard Rogers, Benjamin Isherwood, Matthew Michael McDonald, Donald P. Pannese, David Pinkney
  • Publication number: 20150012666
    Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into a plurality of systems each having multiple nodes. The systems have one or more replication links each being formed to indicate replication of data from one system to another system in a replicated environment where each system is configured as a sub-domain in a Domain Name System (DNS) infrastructure. A DNS alias synchronization method comprises maintaining updated information, within each system, of all replication links involving that system and of DNS aliases of other systems associated with all replication links involving that system (S602-S607). This enables that system to process network-based requests, on behalf of the other systems, without redirecting the requests from the other systems to that system.
    Type: Application
    Filed: February 27, 2013
    Publication date: January 8, 2015
    Inventors: Donald P. Pannese, Benjamin Isherwood
  • Publication number: 20140330785
    Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into systems each having multiple nodes. A search index is provided in each system for locating objects within the system. A method of managing the search index comprises splitting the search index into shards to be divided among a plurality of regions (704). The regions are larger in number than the nodes in the system. Each region has a master and at least one backup copy of one of the shards. A shard core is a master or backup copy of a shard. The method further comprises distributing the shard cores to the nodes, and providing a region mapping table in each node in the system to map the shard cores to the nodes in which the shard cores are stored (706).
    Type: Application
    Filed: March 29, 2012
    Publication date: November 6, 2014
    Applicant: HITACHI DATA SYSTEMS CORPORATION
    Inventors: Benjamin Isherwood, Jeffrey M. Crump, Yury Kats
  • Publication number: 20140181446
    Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into a plurality of systems each having multiple nodes. A data protection level method comprises setting a numerical value of a system dynamic data protection level for each system of nodes; and in response to user input, setting a value of a data protection level for one or more data objects in a system, the value being a fixed numerical value or a dynamic value. If the one or more data objects have a dynamic value of the data protection level in a system, the one or more data objects inherit the system dynamic data protection level of the system in which the one or more data objects reside. The value of the data protection level represents a number of copies of data of the one or more data objects to be kept where the one or more data objects reside.
    Type: Application
    Filed: February 25, 2014
    Publication date: June 26, 2014
    Applicant: HITACHI DATA SYSTEMS CORPORATION
    Inventors: Richard ROGERS, Benjamin ISHERWOOD, Matthew Michael McDONALD, Donald P. PANNESE, David PINKNEY
  • Patent number: 8700571
    Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into a plurality of systems each having multiple nodes. A data protection level method comprises setting a numerical value of a system dynamic data protection level for each system of nodes; and in response to user input, setting a value of a data protection level for one or more data objects in a system, the value being a fixed numerical value or a dynamic value. If the one or more data objects have a dynamic value of the data protection level in a system, the one or more data objects inherit the system dynamic data protection level of the system in which the one or more data objects reside. The value of the data protection level represents a number of copies of data of the one or more data objects to be kept where the one or more data objects reside.
    Type: Grant
    Filed: September 24, 2010
    Date of Patent: April 15, 2014
    Assignee: Hitachi Data Systems Corporation
    Inventors: Richard Rogers, Benjamin Isherwood, Matthew Michael McDonald, Donald P. Pannese, David Pinkney
  • Patent number: 8621270
    Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into a plurality of systems each having multiple nodes. An object recovery method comprises: receiving, by a first system of the plurality of systems from a client application, a read request for an object, the object having been replicated to/from at least one second system among the plurality of systems; if the object of the read request is available in the first system, returning by the first system the object of the read request to the client application; and if the object of the read request is not available in the first system, performing a read from replica process by the first system to access a replica of the object from a second system among the plurality of systems and using the replica of the object to return the object of the read request to the client application.
    Type: Grant
    Filed: September 24, 2010
    Date of Patent: December 31, 2013
    Assignee: Hitachi Data Systems Corporation
    Inventors: Benjamin Isherwood, Donald P. Pannese, Richard Rogers, Vitaly Zolutusky
  • Publication number: 20120079424
    Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into a plurality of systems each having multiple nodes. A data protection level method comprises setting a numerical value of a system dynamic data protection level for each system of nodes; and in response to user input, setting a value of a data protection level for one or more data objects in a system, the value being a fixed numerical value or a dynamic value. If the one or more data objects have a dynamic value of the data protection level in a system, the one or more data objects inherit the system dynamic data protection level of the system in which the one or more data objects reside. The value of the data protection level represents a number of copies of data of the one or more data objects to be kept where the one or more data objects reside.
    Type: Application
    Filed: September 24, 2010
    Publication date: March 29, 2012
    Applicant: HITACHI DATA SYSTEMS CORPORATION
    Inventors: Richard ROGERS, Benjamin ISHERWOOD, Matthew Michael McDONALD, Donald P. PANNESE, David PINKNEY
  • Publication number: 20120079315
    Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into a plurality of systems each having multiple nodes. An object recovery method comprises: receiving, by a first system of the plurality of systems from a client application, a read request for an object, the object having been replicated to/from at least one second system among the plurality of systems; if the object of the read request is available in the first system, returning by the first system the object of the read request to the client application; and if the object of the read request is not available in the first system, performing a read from replica process by the first system to access a replica of the object from a second system among the plurality of systems and using the replica of the object to return the object of the read request to the client application.
    Type: Application
    Filed: September 24, 2010
    Publication date: March 29, 2012
    Applicant: HITACHI DATA SYSTEMS CORPORATION
    Inventors: Benjamin ISHERWOOD, Donald P. PANNESE, Richard ROGERS, Vitaly ZOLUTUSKY