Method and apparatus for acquiring RPC member information, electronic device and storage medium

Patent metadata

Field	Value
Publication number	US-11228664-B2
Application number	US-202117204078-A
Country	US
Kind code	B2
Filing date	Mar 17, 2021
Priority date	Sep 24, 2020
Publication date	Jan 18, 2022
Grant date	Jan 18, 2022

Abstract

The present disclosure provides a method and an apparatus for acquiring remote-procedure-call (RPC) member information, an electronic device and a storage medium, and relates to the field of micro-services technologies in cloud services. The method includes: pushing, by nodes of a RPC cluster, respective local member lists of the nodes of the RPC cluster to each other, and merging, by each node of the RPC cluster, a received member list with a current local member list while performing deduplication until member lists of the nodes of the RPC cluster are synchronized.

First claim

What is claimed is:

1. A method for acquiring remote-procedure-call (RPC) member information, comprising:
pushing, by nodes of a RPC cluster, respective local member lists of the nodes of the RPC cluster to each other, and
merging, by each node of the RPC cluster, a received member list with a current local member list while performing deduplication, until member lists of the nodes of the RPC cluster are synchronized.

2. The method according to claim 1 , further comprising:
performing, by a first node and a seed node, synchronization on the member lists of the first node and the seed node, in a case that the first node is newly added to the RPC cluster;
sending, by the first node, an alive message to each node in a current local member list of the first node; and
adding, by a node which received the alive message, the first node to a member list of the node.

3. The method according to claim 2 , wherein the performing synchronization on the member lists of the first node and the seed node by the first node and the seed node comprises:
adding, by the first node, the first node and the seed node to the member list of the first node;
pushing, by the seed node and the first node, respective member lists of the seed node and the first node to each other; and
merging, by the first node, the received member list with the current local member list of the first node and performing deduplication.

4. The method according to claim 1 , further comprising:
when identifying that a third node is an abnormal node, sending, by a second node of the RPC cluster, an abnormal message to each node in the current local member list; and
deleting, by nodes that have received the abnormal message, the third node from respective member lists of the nodes that have received the abnormal message, or marking the third node as the abnormal node in the respective member lists of the nodes that have received the abnormal message.

5. The method according to claim 4 , wherein a mode where the second node of the RPC cluster identifies that the third node is the abnormal node comprises:
sending, by the second node, a heartbeat monitoring request message to the third node; and
when the second node has not received a heartbeat monitoring feedback message sent by the third node within a preset time period, identifying, by the second node, the third node as the abnormal node.

6. The method according to claim 1 , wherein the pushing the respective local member lists of the nodes of the RPC cluster to each other by the nodes of the RPC cluster comprises:
pushing, by each node of the RPC cluster, the local member list of each node of the RPC cluster to any node in the current local member list randomly at a preset time interval; and
feeding back, by a node which received the member list, a current local member list of the node to a corresponding push node.

7. The method according to claim 1 , wherein in the process of merging the received member list with the current local member list and performing deduplication by each node of the RPC cluster, in a case that node states of a fourth node are different in different member lists, selecting a node state of a higher priority as a node state of the fourth node in the member lists.

8. The method according to claim 7 , wherein the node states include an alive state and a dead state, and a priority of the dead state is higher than a priority of the alive state.

9. The method according to claim 1 , wherein information of each node in the member lists comprises at least one of the following:
a unique identification of the node;
a network access address of the node;
a current node state of the node; and
description meta information of the node.

10. The method according to claim 9 , wherein the description meta information of the node is represented by a key-value pair, a key in the key-value pair is used to represent an agent cluster to which the node belongs, and a value in the key-value pair is used to represent a RPC role of the node in the agent cluster to which the node belongs, wherein the RPC role comprises an RPC client or an RPC server.

11. An electronic device, comprising:
at least one processor; and
a memory in communication connection with the at least one processor; wherein,
the memory has stored thereon instructions executable by the at least one processor, and the instructions, when executed by the at least one processor, cause the at least one processor to perform a method for acquiring remote-procedure-call (RPC) member information, the method comprises:
pushing, by nodes of a RPC cluster, respective local member lists of the nodes of the RPC cluster to each other; and
merging, by each node of the RPC cluster, a received member list with a current local member list while performing deduplication, until member lists of the nodes of the RPC cluster are synchronized.

12. The electronic device according to claim 11 , wherein the method performed by the at least one processor further comprises:
performing, by a first node and a seed node, synchronization on the member lists of the first node and the seed node, in a case that the first node is newly added to the RPC cluster;
sending, by the first node, an alive message to each node in a current local member list of the first node; and
adding, by a node which received the alive message, the first node to a member list of the node.

13. The electronic device according to claim 12 , wherein in the method performed by the at least one processor, the performing synchronization on the member lists of the first node and the seed node by the first node and the seed node comprises:
adding, by the first node, the first node and the seed node to the member list of the first node;
pushing, by the seed node and the first node, respective member lists of the seed node and the first node to each other; and
merging, by the first node, the received member list with the current local member list of the first node and performing deduplication.

14. The electronic device according to claim 11 , wherein the method performed by the at least one processor further comprises:
when identifying that a third node is an abnormal node, sending, by a second node of the RPC cluster, an abnormal message to each node in the current local member list; and
deleting, by nodes that have received the abnormal message, the third node from respective member lists of the nodes that have received the abnormal message, or marking the third node as the abnormal node in the respective member lists of the nodes that have received the abnormal message.

15. The electronic device according to claim 14 , wherein in the method performed by the at least one processor, a mode where the second node of the RPC cluster identifies that the third node is the abnormal node comprises:
sending, by the second node, a heartbeat monitoring request message to the third node; and
when the second node has not received a heartbeat monitoring feedback message sent by the third node within a preset time period, identifying, by the second node, the third node as the abnormal node.

16. The electronic device according to claim 11 , wherein in the method performed by the at least one processor, the pushing the respective local member lists of the nodes of the RPC cluster to each other by the nodes of the RPC cluster comprises:
pushing, by each node of the RPC cluster, the local member list of each node of the RPC cluster to any node in the current local member list randomly at a preset time interval; and
feeding back, by a node which received the member list, a curre

Assignees

• Beijing Baidu Netcom Sci & Tech Co Ltd

Inventors

• Hao Yu
• Ma Fei

Classifications

• H04L67/133 Primary

  Protocols for remote procedure calls [RPC] · CPC title

• H04L67/51

  Discovery or management thereof, e.g. service location protocol [SLP] or web services · CPC title

• H04L67/55

  Push-based network services · CPC title

• H04L67/10 Primary

  in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46) · CPC title

• G06F9/546

  Message passing systems or structures, e.g. queues · CPC title