MANAGEMENT OF NODE MEMBERSHIP IN A DISTRIBUTED SYSTEM

• US 20140229602A1
• Filed: 02/08/2013
• Published: 08/14/2014
• Est. Priority Date: 02/08/2013
• Status: Abandoned Application

• Current Assignee: Lenovo Enterprise Solutions (Singapore) Pte., Ltd. (Lenovo Group Ltd.)
• Original Assignee: International Business Machines Corporation
• Inventors: Engebretsen, David R., Hermsmeier, David L., Knight, Stephen A., Lange-Pearson, Adam C., Movall, Paul E.
• Application Number:
  US13/762,605
• Publication Number:
  US 20140229602A1
• Time in Patent Office: Days
• US Class Current: 709/224
• CPC Class Codes: H04L 67/1044 Group management mechanisms management of multicast group membership H04L12/185; reconfiguring of node membership in a computing system to eliminate errors G06F11/1425
• CPC Class Codes: H04L 67/1046 Joining mechanisms

Abstract

Systems and methods of managing computing node membership are present. A particular method may include determining that a node group universally unique identifier has not been assigned to a computing node. In response to the determination, the method may include transitioning the computing node into a first state, where the computing node awaits an invitation relating to forming or joining a node group while in the first state and transitioning the computing node into a second state in response to receiving the invitation to form or join the node group, where the computing node awaits an assignment of the node group universally unique identifier while in the second state. The computing node may transition into a third state in response to receiving the node group universally unique identifier, where the computing node is configured to locate a plurality of neighboring nodes while operating in the third state, and the method may determine whether a quorum of nodes including the neighboring nodes is present.

Claims

1. A method of managing computing node membership, the method comprising:

determining that a node group universally unique identifier has not been assigned to a computing node;

in response to the determination, transitioning the computing node into a first state, wherein the computing node awaits an invitation relating to forming or joining a node group while in the first state;

transitioning the computing node into a second state in response to receiving the invitation to form or join the node group, wherein the computing node awaits an assignment of the node group universally unique identifier while in the second state;

transitioning the computing node into a third state in response to receiving the node group universally unique identifier, wherein the computing node is configured to locate a plurality of neighboring nodes while operating in the third state; and

determining whether a quorum of nodes including the neighboring nodes is present.

2. The method of claim 1, further comprising locating the plurality of neighboring nodes using a non-transmission control protocol/internet protocol (non-TCP/IP).

3. The method of claim 2, further comprising transitioning the computing node into a fourth state in response to determining that the quorum is present, wherein while in the fourth state, the computing node communicates with a neighboring node using TCP/IP.

4. The method of claim 1, further comprising using a list of group members to determine whether the quorum is present.

5. The method of claim 4, further comprising maintaining the list of group members at the computing node.

6. The method of claim 1, further comprising locating the plurality of neighboring nodes using the node group universally unique identifier.

7. The method of claim 1, further comprising receiving at least one of the node group universally unique identifier and the invitation to form or join the node group.

8. The method of claim 1, further comprising designating a link coupled to the computing node as being in a fenced state and allowing only a low-level protocol to a neighboring node.

9. The method of claim 1, further comprising booting the computing node prior to determining that the node group universally unique identifier has not been assigned to the computing node.

19. The apparatus of claim 1, wherein a neighboring node of the plurality of neighboring nodes is placed in a service state and is ignored with regard to determining the quorum.

10. An apparatus, comprising:

a memory; and

a processor configured to;

access the memory and to execute program code to determine that a node group universally unique identifier has not been assigned to a computing node;

in response to the determination, to transition into a first state awaiting an invitation relating to forming or joining a node group while in the first state;

transition into a second state in response to receiving the invitation to form or join the node group and to await an assignment of the node group universally unique identifier while in the second state;

transition into a third state in response to receiving the node group universally unique identifier and to locate a plurality of neighboring nodes while operating in the third state; and

determine whether a quorum of nodes including the plurality of neighboring nodes is present.

11. The apparatus of claim 10, wherein a non-transmission control protocol/internet protocol (non-TCP/IP) is used to locate the plurality of neighboring nodes.

12. The apparatus of claim 11, wherein the processor is further configured to transition the computing node into a fourth state in response to determining that the quorum is present, wherein while in the fourth state, the processor initiates communication with a neighboring node using TCP/IP.

13. The apparatus of claim 10, wherein the memory stores a list of group members.

14. The apparatus of claim 13, wherein the processor uses the list of group members to determine whether the quorum is present.

15. The apparatus of claim 10, wherein the processor is further configured to locate the plurality of neighboring nodes using the node group universally unique identifier.

16. The apparatus of claim 10, wherein a network interface of the computing node transitions into a fenced state and only allows a low-level protocol to detect the node group universally unique identifier of a neighboring node of the plurality of neighboring nodes.

17. The apparatus of claim 10, wherein a point to point low level mailbox protocol is used to discover the node group universally unique identifier of the plurality of neighboring nodes.

18. The apparatus of claim wherein the computing node is booted prior to determining that the node group universally unique identifier has not been assigned to the computing node.

20. A program product, comprising:

program code configured to execute program code to determine that a node group universally unique identifier has not been assigned to a computing node;

in response to the determination;

to transition into a first state awaiting an invitation relating to forming or joining a node group while in the first state;

to transition into a second state in response to receiving the invitation to form or join the node group and to await an assignment of the node group universally unique identifier while in the second state;

to transition into a third state in response to receiving the node group universally unique identifier and to locate a plurality of neighboring nodes while operating in the third state, and to determine whether a quorum of nodes including the neighboring nodes is present; and

a computer readable medium bearing the program code.