Method and apparatus for distributed configuration management

• US 10,255,340 B2
• Filed: 08/29/2016
• Issued: 04/09/2019
• Est. Priority Date: 06/23/2011
• Status: Active Grant

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Inventors: King, III, James E., Stack, Michael T., Beaverson, Arthur J., Bagby, Steven
• Primary Examiner(s): Keehn, Richard G
• Application Number:
  US15/249,864
• Publication Number:
  US 20160371354A1
• Time in Patent Office: 953 Days
• 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 non-transitory computer-readable medium containing program instructions executable by a processor to perform a method of replicating data structures, the method comprising:

on a network of peer nodes, wherein data structures are replicated to all the peer nodes on the network;

designating a single peer node of the peer nodes as an owner node of a data structure;

permitting only the owner node to modify the data structure;

when one peer node of the peer nodes desires to modify the data structure and determines it is not the owner node, the one peer node initiating a present request to modify the data structure, wherein the present request comprises one of the data structures and the present request is owned by the one peer node, and

the one peer node transmitting the present request to all other peer nodes on the network, the owner node upon receiving the present request determines whether the owner node has processed each prior request that was created before the present request;

when the owner node executes each prior request that was created before the present request, creating a record maintained by the owner node with;

a monotonically increasing transaction number that is owned by the owner node,

a schema revision modified by changes to the data structure, and

the changes that were made to the data structure; and

the owner node executing the present request to modify the data structure and creating a record of the modification associated with the present request.

2. The non-transitory computer-readable medium of claim 1, wherein the method includes:

the owner node initiating a response regarding the modified data structure, wherein the response is one of the data structures and is owned by the owner node, and transmitting the response to all other peer nodes on the network.

3. The non-transitory computer-readable medium of claim 2, wherein the method includes:

when the response is received by a non-owner node, the receiving node determining whether it has already received the response and if so, dropping the response, and if not, processing the response.

4. The non-transitory computer-readable medium of claim 2, wherein the response includes an identifier for the modified data structure.

5. The non-transitory computer-readable medium of claim 2, wherein the data structure, present request and response are replicated by propagation to all nodes on the network.

6. The non-transitory computer-readable medium of claim 1, wherein each of the present request and the prior request includes a tag uniquely identifying each request.

7. The non-transitory computer-readable medium of claim 1, wherein the method includes:

when one peer node of the peer nodes desires to modify the data structure and determines it is the owner node, the one peer node modifying the data structure.

8. The non-transitory computer-readable medium of claim 1, wherein when a partition divides the network into multiple network partitions, the replication on each network partition remains operable.

9. The non-transitory computer-readable medium of claim 8, wherein when the partition ends, the replication across the partition resumes.

10. The non-transitory computer-readable medium of claim 1, wherein the network is a network in which all nodes are not directly connected.

11. The non-transitory computer-readable medium of claim 1, wherein the data structure includes an identifier of the owner node.

12. The non-transitory computer-readable medium of claim 1, wherein the data structure contains an identifier which is globally unique across all of the nodes.

13. The non-transitory computer-readable medium of claim 1, wherein the data structure is stored in a database.

14. The non-transitory computer-readable medium of claim 1, wherein the method implements a relational database.

15. The non-transitory computer-readable medium of claim 1, wherein the data structure is a row in a database table.

16. The non-transitory computer-readable medium of claim 1, wherein the data structure describes a network interface, a file system, or a file system snapshot.

17. A method implemented by a computer network, the method comprising:

obtaining information in a replica of a data structure that is replicated on multiple peer nodes, the information indicating one of the peer nodes as an owner node that has exclusive rights to update the data structure;

determining if a peer node is the owner node via the information;

if the peer node is not the owner node, performing actions comprising;

sending a present request to update the data structure to all directly connected peer nodes to propagate the present request;

determining whether the owner node has processed each prior request that was created before the present request; and

when the owner node executes each prior request that was created before the present request, creating a record maintained by the owner node with;

a monotonically increasing transaction number that is owned by the owner node,

a schema revision modified by changes to the data structure, and

the changes that were made to the data structure; and

the owner node receiving the present request, updating the data structure after receiving the present request;

sending an update regarding the updated data structure to all directly connected peer nodes to propagate the update; and

creating a new record of the modification associated with the present request.

18. The method of claim 17, comprising:

initiating, by the owner node, a response regarding the modified data structure, wherein the response is one of the data structures and is owned by the owner node, and the response is transmitted to all non-owner nodes on the network;

receiving the response by at least one of the non-owner nodes; and

determining, by the by at least one of the non-owner nodes, whether it has already received the response and if so, dropping the response, and if not, processing the response.

19. The method of 17, wherein upon determining that the owner node has not processed each prior request that was created before the present request, send by the owner node to at least one peer node a new request for a modification update to the data structure associated with each prior request.

20. The method of claim 19, wherein the owner node waits to receive each modification update to the data structure associated with each prior request and processes the modification updates in an order in which the prior requests were created.

21. The method of claim 20, wherein the owner node initiates a response regarding the modified data structure after processing each modification update to the data structure associated with each prior request, the response being sent to each peer node.

22. A peer node in a distributed computer system including a plurality of peer nodes, the peer node comprising:

a processor; and

a non-transitory computer readable medium storing computer-readable instructions, wherein the processor is to execute the computer-readable instructions to;

participate in replicating a data structure across the plurality of peer nodes;

update the replica of the data structure on the peer node;

determine whether the peer node is an owner node of the data structure based on information included in the data structure;

if the peer node is not the owner node, transmit, by the peer node, a present request to modify the data structure to all other peer nodes in the network;

if the peer node is the owner node, determine whether the peer node has processed each prior request that was created before the present request; and

when the peer node that is the owner node processes each prior request that was created before the present request, create a record maintained by the owner node with;

a monotonically increasing transaction number that is owned by the peer node,

a schema revision modified by changes to the data structure, and

the changes that were made to the data structure associated with the peer node to log the processing of each prior request, and

process a response to the present request to modify the data structure, wherein the owner node has exclusive rights to update the data structure, and the present request and response are also data structures replicated across the peer nodes; and

create a new record of the modification associated with the present request.

23. The computing environment of claim 22, wherein the owner node transmits the response to the present request to all other peer nodes on the network;

and

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