Method and apparatus for distributed configuration management

• US 9,436,748 B2
• Filed: 06/23/2011
• Issued: 09/06/2016
• Est. Priority Date: 06/23/2011
• Status: Active Grant

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: SimpliVity Corporation (Hewlett-Packard Enterprise Company)
• Inventors: King, James E. III, Stack, Michael T., Beaverson, Arthur J., Bagby, Steven
• Primary Examiner(s): Keehn, Richard G
• Application Number:
  US13/167,365
• Publication Number:
  US 20120331029A1
• Time in Patent Office: 1,902 Days
• Field of Search: 709/243, 709/201, 707/631, 707/629
• US Class Current: 1/1
• CPC Class Codes: G06F 16/128 Details of file system snapshots on the file-level, e.g. snapshot creation, administration, deletion use of snapshots for error detection or correction G06F11/14, G06F11/16
• CPC Class Codes: G06F 16/1834 implemented based on peer-to-peer networks, e.g. gnutella p2p communication protocols H04L67/104
• CPC Class Codes: G06F 16/2329 using versioning
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: G06F 16/278 Data partitioning, e.g. horizontal or vertical partitioning
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes

Abstract

Method and apparatus for replicating data structures over a network in which each data structure is assigned an owner node among a plurality of networked peer nodes. Preferably that owner can be ascertained through information in the data structure. When an update to the data structure is desired by a non-owner, a request to modify the data structure is sent out on the network and when received by the owner, the owner performs the modification. The owner node can then notify the other nodes regarding the update. The method, implemented through a single-writer, multiple-reader paradigm, insures availability, partition tolerance and eventual consistency; it avoids the high overhead costs and single point of failure drawbacks of the prior art centralized management and locking protocols. Administrators can connect to any peer node in the network to manage, monitor and request modifications to a data structure.

Claims

1. A computer-implemented method comprising:

utilizing a single replication method for replicating, on a network of peer nodes, each of the following data structures;

an updated data structure;

a request data structure;

a response data structure;

wherein the single replication method is implemented by a replication manager at each peer node operable to achieve eventual consistency among the data structures maintained across the peer nodes, including among peer nodes that are not directly connected on the network, and wherein the method is operable both during a partition that divides the network into multiple network partitions, and after the partition ends, without a change of ownership of the data structures;

wherein the single replication method comprises;

designating, for each data structure, a single exclusive peer node as an owner node of the data structure, wherein only the designated owner node is permitted to update the data structure;

when any one of the peer nodes desires to update one of the data structures, a one peer node desiring to update the one data structure determines whether it is the owner node of the one data structure and;

if the one peer node determines it is the owner node of the one data structure, the one peer node updates the one data structure and requests that the updated data structure be replicated by propagation to all of the other peer nodes on the network by the replication managers;

if the one peer node determines it is not the owner node of the one data structure, the one peer node generates a request data structure, the request data structure being owned by the one peer node and being similarly replicated by propagation to all of the other peer nodes on the network by the replication managers, wherein the request data structure comprises a request to update the one data structure;

the owner node, upon receiving the request, executes the request by updating the one data structure and generating a response data structure, the response data structure being owned by the owner node and being similarly replicated by propagation to all of the other peer nodes on the network by the replication managers, wherein the response data structure includes the updated one data structure.

2. The computer-implemented method of claim 1, wherein the single replication method includes:

when the response data structure is received by a non-owner node, the receiving node determines whether it has already received the response data structure and if so, drops the response data structure, and if not, it processes the response data structure.

3. The computer-implemented method of claim 2, wherein the response data structure includes an identifier for the updated one data structure.

4. The computer-implemented method of claim 1, wherein the request data structure includes a tag uniquely identifying the one data structure.

5. The computer-implemented method of claim 1, wherein the network is a network in which not all peer nodes are directly connected.

6. The computer-implemented method of claim 1, wherein the one data structure includes an identifier of the owner node.

7. The computer-implemented method of claim 1, wherein the one data structure contains an identifier which is globally unique across all of the peer nodes.

8. The computer-implemented method of claim 1, wherein the one data structure is stored in a database.

9. The computer-implemented method of claim 1, wherein the single replication method implements a relational database.

10. The computer-implemented method of claim 1, wherein the one data structure is a row in a database table.

11. The computer-implemented method of claim 1, wherein the one data structure describes a network interface, a file system, or a file system snapshot.

12. In a computing environment, an apparatus on each of a plurality of peer nodes in a network comprising:

a replication manager operable to participate in replicating a data structure across the peer nodes;

an update manager operable to update a data structure on a peer node; and

a configuration manager operable to determine whether a peer node is an owner node of a data structure,

wherein the replication manager, update manager and configuration manager include program instructions stored on memory and operable to be executed on a processor to perform a method comprising;

utilizing a single replication method among the peer nodes for replicating each of the following data structures;

an updated data structure;

a request data structure;

a response data structure;

wherein the single replication method is implemented by a replication manager at each peer node operable to achieve eventual consistency among the data structures maintained across the peer nodes, including among peer nodes that are not directly connected on the network, and wherein the method is operable both during a partition that divides the network into multiple network partitions, and after the partition ends, without a change of ownership of the data structures;

wherein the single replication method comprises;

designating, for each data structure, a single exclusive peer node as an owner node of the data structure, wherein only the designated owner node is permitted to update the data structure;

when any one of the peer nodes desires to update one of the data structures, a one peer node desiring to update the one data structure determines whether it is the owner node of the one data structure and;

if the one peer node determines it is the owner node of the one data structure, the one peer node updates the one data structure and requests that the updated data structure be replicated by propagation to all of the other peer nodes on the network by the replication managers;

if the one peer node determines it is not the owner node of the one data structure, the one peer node generates a request data structure, the request data structure being owned by the one peer node and being similarly replicated by propagation to all of the other peer nodes on the network by the replication managers, wherein the request data structure comprises a request to update the one data structure;

the owner node, upon receiving the request, executes the request by updating the one data structure and generating a response data structure, the response data structure being owned by the owner node and being similarly replicated by propagation to all of the other peer nodes on the network by the replication managers, wherein the response data structure includes the updated one data structure.

13. The apparatus of claim 12, wherein the configuration manager is operable to:

when the response data structure is received by a non-owner node, the receiving node determines whether it has already received the response data structure and if so, drops the response data structure, and if not, it processes the response data structure.

14. The apparatus of claim 12, wherein the network is a network in which not all peer nodes are directly connected.

15. The apparatus of claim 12, wherein the one data structure includes an identifier of the owner node.

16. The apparatus of claim 12, wherein the one data structure contains an identifier which is globally unique across all of the peer nodes.

17. The apparatus of claim 12, wherein the one data structure is stored in a database.

18. The apparatus of claim 12, wherein the program instructions are operable to implement a relational database.

19. The apparatus of claim 12, wherein the one data structure is a row in a database table.

20. The apparatus of claim 12, wherein the one data structure describes a network interface, a file system, or a file system snapshot.