Using a shared data store for peer discovery

• US 9,712,340 B2
• Filed: 02/28/2011
• Issued: 07/18/2017
• Est. Priority Date: 02/28/2011
• Status: Active Grant

• Current Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Original Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Inventors: Surtani, Manik, Ban, Bela
• Primary Examiner(s): SALAD, ABDULLAHI ELMI
• Application Number:
  US13/037,256
• Publication Number:
  US 20120221636A1
• Time in Patent Office: 2,332 Days
• Field of Search: 709201, 709227-228, 709204-205
• CPC Class Codes: G06F 16/22 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 16/9566 URL specific, e.g. using aliases, detecting broken or misspelled links
• CPC Class Codes: H04L 12/18 for broadcast or conference , e.g. multicast
• CPC Class Codes: H04L 12/6418 Hybrid transport
• CPC Class Codes: H04L 67/1046 Joining mechanisms
• CPC Class Codes: H04L 67/1061 using node-based peer discovery mechanisms static access to replicated servers H04L67/1006; service discovery H04L67/51
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 67/146 Markers for unambiguous identification of a particular session, e.g. session cookie or URL-encoding

Abstract

After acquiring a network address, a computing device accesses a shared data store and writes the network address to the shared data store. The computing device additionally reads a plurality of network addresses from the shared data store, wherein the plurality of network addresses are for a plurality of nodes that are members of a peer-to-peer system. The computing device then joins the peer-to-peer system based on communicating with the plurality of nodes using the plurality of network addresses.

Claims

1. A method comprising:

identifying, by a processing device of a new node, an address of a shared data store comprising information on a current membership in a peer-to-peer system, wherein the shared data store is shared by a plurality of nodes that are current members of the peer-to-peer system, wherein the shared data store is a container in a storage cloud, and wherein the new node is preconfigured with the container network address;

determining that the shared data store can be accessed;

writing, by the new node, a network address of the new node to the shared data store;

reading, by the new node, a plurality of network addresses from the shared data store, wherein the plurality of network addresses are for the plurality of nodes that are current members of the peer-to-peer system;

generating a membership data structure comprising the plurality of network addresses for the plurality of nodes;

joining, by the new node, the peer-to-peer system, wherein the joining comprises notifying the plurality of nodes in view of the membership data structure to provide the network address of the new node to the plurality of nodes; and

adding the network address of the new node to the membership data structure in response to the new node joining the peer-to-peer system.

2. The method of claim 1, further comprising:

periodically querying the shared data store to determine whether any new network addresses for additional new nodes have been added to the shared data store; and

updating the membership data structure in response to the shared data store comprising the new network addresses for the additional new nodes.

3. The method of claim 1, further comprising:

querying at least one node of the plurality of nodes for an additional membership data structure maintained by the at least one node; and

updating the membership data structure in view of the additional membership data structure.

4. The method of claim 1, further comprising:

receiving a writing error message indicating that the writing was unsuccessful;

multicasting the network address for the new node on the network in response to receiving the writing error message; and

receiving the plurality of network addresses from the plurality of nodes in response to multicasting the network address for the new node.

5. The method of claim 1, further comprising:

providing credentials for access to the shared data store; and

obtaining access to the shared data store in response to providing the credentials.

6. A non-transitory computer readable medium comprising instructions that, when executed by a processing device, cause the processing device to:

identify, by the processing device of a new node, an address of a shared data store comprising information on a current membership in a peer-to-peer system, wherein the shared data store is shared by a plurality of nodes that are current members of the peer-to-peer system, wherein the shared data store is a directory in a network storage device, and wherein the new node is preconfigured with the directory network address;

determine that the shared data store can be accessed;

write, by the new node, a network address of the new node to the shared data store;

read, by the new node, a plurality of network addresses from the shared data store, wherein the plurality of network addresses are for the plurality of nodes that are current members of the peer-to-peer system;

generate a membership data structure comprising the plurality of network addresses for the plurality of nodes;

join, by the new node, the peer-to-peer system, wherein to join comprises notifying the plurality of nodes in view of the membership data structure to provide the network address of the new node to the plurality of nodes; and

add the network address of the new node to the membership data structure in response to the new node joining the peer-to-peer system.

7. The non-transitory computer readable medium of claim 6, wherein the processing device is further to:

periodically query the shared data store to determine whether any new network addresses for additional new nodes have been added to the shared data store; and

update the membership data structure in response to the shared data store comprising the new network addresses for the additional new nodes.

8. The non-transitory computer readable medium of claim 6, wherein the processing device is further to:

query at least one node of the plurality of nodes for an additional membership data structure maintained by the at least one node; and

update the membership data structure in view of the additional membership data structure.

9. The non-transitory computer readable medium of claim 6, wherein the processing device is further to:

receive a writing error message indicating the writing was unsuccessful;

multicast the network address for the new node on the network in response to receiving the writing error message; and

receive the plurality of network addresses from the plurality of nodes in response to the multicast of the network address for the new node.

10. The non-transitory computer readable medium of claim 6, wherein the processing device is further to:

provide credentials for access to the shared data store; and

obtain access to the shared data store in response to providing the credentials.

11. A computing device for a new node comprising:

a memory; and

a processing device operatively coupled to the memory to;

identify an address of a shared data store comprising information on a current membership in a peer-to-peer system, wherein the shared data store is shared by a plurality of nodes that are current members of the peer-to-peer system, wherein the shared data store is a container in a storage cloud, and wherein the new node is preconfigured with the container network address;

determine that the shared data store can be accessed;

write a network address of the new node to the shared data store;

read a plurality of network addresses from the shared data store, wherein the plurality of network addresses are for the plurality of nodes that are current members of the peer-to-peer system;

generate a membership data structure comprising the plurality of network addresses for the plurality of nodes;

join the peer-to-peer system, wherein to join comprises notifying the plurality of nodes in view of the membership data structure to provide the network address of the new node to the plurality of nodes; and

add the network address of the new node to the membership data structure in response to the new node joining the peer-to-peer system.

12. The computing device of claim 11, wherein the processing device is further to:

periodically query the shared data store to determine whether any new network addresses for additional new nodes have been added to the shared data store; and

update the membership data structure in response to the shared data store comprising the new network addresses for the additional new nodes.

13. The computing device of claim 11, wherein the processing device is further to:

query at least one node of the plurality of nodes for an additional membership data structure maintained by the at least one node; and

update the membership data structure in view of the additional membership data structure.

14. The computing device of claim 11, wherein the processing device is further to:

receive a writing error message indicating that the writing was unsuccessful;

multicast the network address for the new node on the network in response to receiving the writing error message; and

receive the plurality of network addresses from the plurality of nodes in response to the multicast of the network address for the new node.