Using a shared data store for peer discovery
First Claim
Patent Images
1. A method, comprising:
- identifying, by a processing device of a new node, an address of a shared data store storing 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 for storing data in a storage cloud;
sending, by the new node, a first message comprising an address of the new node to the shared data store;
requesting, by the new node, at least one membership data structure from the shared data store;
receiving, by the new node, a second message comprising the at least one membership data structure;
generating, by the new node, a new membership data structure comprising the address of the new node and the plurality of addresses of the plurality of nodes identified in the at least one membership data structure;
sending, by the new node, a third message comprising the new membership data structure to the shared data store; and
joining, by the new node, the peer-to-peer system, wherein the joining comprises using the new membership data structure to identify nodes of the plurality of nodes to receive a plurality of messages from the new node.
1 Assignment
0 Petitions
Accused Products
Abstract
An example method includes: identifying, by 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 for storing data in a storage cloud; sending, by the new node, a first message comprising an address of the new node to the shared data store; requesting, by the new node, at least one membership data structure from the shared data store; receiving, by the new node, a second message comprising the at least one membership data structure; generating, by the new node, a new membership data structure comprising the address of the new node and the plurality of addresses for the plurality of nodes identified in the at least one membership data structure; sending, by the new node, a third message comprising the new membership data structure to the shared data store; and joining, by the new node, the peer-to-peer system, wherein the joining comprises using the new membership data structure to identify nodes of the plurality of nodes to receive a plurality of messages from the new node.
-
Citations
20 Claims
-
1. A method, comprising:
-
identifying, by a processing device of a new node, an address of a shared data store storing 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 for storing data in a storage cloud; sending, by the new node, a first message comprising an address of the new node to the shared data store; requesting, by the new node, at least one membership data structure from the shared data store; receiving, by the new node, a second message comprising the at least one membership data structure; generating, by the new node, a new membership data structure comprising the address of the new node and the plurality of addresses of the plurality of nodes identified in the at least one membership data structure; sending, by the new node, a third message comprising the new membership data structure to the shared data store; and joining, by the new node, the peer-to-peer system, wherein the joining comprises using the new membership data structure to identify nodes of the plurality of nodes to receive a plurality of messages from the new node. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A non-transitory computer readable medium comprising instructions that, when executed by a processing device of a new node, cause the processing device to:
identify, by the new node, an address of a shared data store storing 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 for storing data in a storage cloud; send, by the new node, a first message comprising an address of the new node to the shared data store; request, by the new node, at least one membership data structure from the shared data store; receive, by the new node, a second message comprising the at least one membership data structure; generate, by the new node, a new membership data structure comprising the address of the new node and the plurality of addresses of the plurality of nodes identified in the at least one membership data structure; send, by the new node, a third message comprising the new membership data structure to the shared data store; and join, by the new node, the peer-to-peer system, wherein the joining comprises using the new membership data structure to identify nodes of the plurality of nodes to receive a plurality of messages from the new node. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
15. A computing device for a new node comprising:
-
a memory; and a processing device operatively coupled to the memory to; identify, by the new node, an address of a shared data store storing 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 for storing data in a storage cloud; send, by the new node, a first message comprising an address of the new node to the shared data store; request, by the new node, at least one membership data structure from the shared data store; receive, by the new node, a second message comprising the at least one membership data structure; generate, by the new node, a new membership data structure comprising the address of the new node and the plurality of addresses of the plurality of nodes identified in the at least one membership data structure; send, by the new node, a third message comprising the new membership data structure to the shared data store; and join, by the new node, the peer-to-peer system, wherein the joining comprises using the new membership data structure to identify nodes of the plurality of nodes to receive a plurality of messages from the new node. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification
-
- Resources
Litigation Campaign Assessment
Thank you for your request. You will receive a custom alert email when the Litigation Campaign Assessment is available.
×
-
Current AssigneeRed Hat, Inc. (International Business Machines Corporation)
-
Original AssigneeRed Hat, Inc. (International Business Machines Corporation)
-
InventorsSurtani, Manik, Ban, Bela
-
Primary Examiner(s)Salad, Abdullahi E
-
Application NumberUS15/634,551Publication NumberTime in Patent Office574 DaysField of SearchUS Class CurrentCPC Class CodesG06F 16/22 Indexing; Data structures t...G06F 16/9566 URL specific, e.g. using al...H04L 12/18 for broadcast or conference...H04L 12/6418 Hybrid transportH04L 67/1046 Joining mechanismsH04L 67/1061 using node-based peer disco...H04L 67/1097 for distributed storage of ...H04L 67/146 Markers for unambiguous ide...
