WO2020098346A1

WO2020098346A1 - Method and apparatus for pushing node information

Info

Publication number: WO2020098346A1
Application number: PCT/CN2019/104310
Authority: WO
Inventors: 桂宇
Original assignee: 京东数字科技控股有限公司
Priority date: 2018-11-16
Filing date: 2019-09-04
Publication date: 2020-05-22
Also published as: CN109218452A; CN109218452B

Abstract

Disclosed in the embodiments of the present application are a method and apparatus for pushing node information. A specific embodiment of the method comprises: receiving scheduling request information of a scheduling node, wherein the scheduling request information comprises scheduling node identity information of the scheduling node; and in response to determining that information matching the scheduling node identity information exists in the current configuration information, sending a predetermined set of candidate scheduled node identity information to the scheduling node. This embodiment helps to ensure system stability and data security.

Description

Method and device for pushing node information

This patent application requires the priority of the Chinese patent application filed on November 16, 2018 with the application number 201811365254.8 and the invention titled "Method and Device for Pushing Node Information". The entire text of this application is incorporated by reference Into this application.

Technical field

The embodiments of the present application relate to the field of computer technology, and in particular to a method and device for pushing node information.

Background technique

In the related art, in the node scheduling application, when the name information of the system and some related parameters of the control nodes in the system are known, the newly added scheduling node or the scheduled node can be connected to the system, and the newly connected The incoming scheduling node or scheduled node can run the corresponding task under the system.

Summary of the invention

The embodiments of the present application propose a method and an apparatus for pushing node information.

In a first aspect, an embodiment of the present application provides a method for pushing node information, the method includes: receiving scheduling request information of a scheduling node, the scheduling request information includes scheduling node identity identification information of the scheduling node; in response to determining the current configuration There is information matching the scheduling node identity information in the information, and the predetermined candidate scheduled node identity information set is sent to the scheduling node.

In a second aspect, an embodiment of the present application provides an apparatus for pushing node information. The apparatus includes: a scheduling receiving unit configured to receive scheduling request information of a scheduling node, and the scheduling request information includes a scheduling node identity of the scheduling node Information; the information sending unit is configured to send a predetermined set of candidate scheduled node identity information to the scheduling node in response to determining that there is information in the current configuration information that matches the scheduling node identity information.

In a third aspect, an embodiment of the present application provides a server, including: one or more processors; a storage device, on which one or more programs are stored, and when one or more programs are executed by one or more processors So that one or more processors implement the method as in any embodiment of the method for pushing node information.

According to a fourth aspect, an embodiment of the present application provides a computer-readable medium having a computer program stored thereon, where the program, when executed by a processor, implements the method of any embodiment as the method for pushing node information.

The method and device for pushing node information provided in the embodiments of the present application use the current configuration information to perform security verification on the scheduling node, and only send the candidate scheduled node identity identification information set to the verified scheduling node to avoid illegal node access Access to help ensure system stability and data security.

BRIEF DESCRIPTION

By reading the detailed description of the non-limiting embodiments made with reference to the following drawings, other features, objects, and advantages of the present application will become more apparent:

FIG. 1 is an exemplary system architecture diagram to which an embodiment of the present application can be applied;

2 is a flowchart of an embodiment of a method for pushing node information according to the present application;

3 is a schematic diagram of an application scenario of a method for pushing node information according to an embodiment of the present application;

4 is a flowchart of another embodiment of a method for pushing node information according to the present application;

5 is a schematic structural diagram of an embodiment of an apparatus for pushing node information according to the present application;

6 is a schematic structural diagram of a computer system suitable for implementing the server of the embodiment of the present application.

detailed description

The present application will be described in further detail below with reference to the drawings and embodiments. It can be understood that the specific embodiments described herein are only used to explain the related invention, but not to limit the invention. It should also be noted that, for ease of description, only the parts related to the invention are shown in the drawings.

It should be noted that the embodiments in the present application and the features in the embodiments can be combined with each other if there is no conflict. The present application will be described in detail below with reference to the drawings and in conjunction with the embodiments.

FIG. 1 shows an exemplary system architecture 100 to which a method for pushing node information or an apparatus for pushing node information according to an embodiment of the present application may be applied.

As shown in FIG. 1, the system architecture 100 may include a control node 101, a

scheduling node

102, 103, a scheduled

node

104, 105, 106, 107, and a

network

108, 109, 110. The

networks

108, 109, and 110 are used as a medium for providing communication links between the control node 101, the

scheduling nodes

102, 103, and the scheduled

nodes

104, 105, 106, and 107. The

networks

108, 109, 110 may include various connection types, such as wired, wireless communication links, or fiber optic cables, and so on.

The

scheduling nodes

102, 103 may interact with the control node 101 and the scheduled

nodes

104, 105, 106, 107 via the

networks

108, 110 to receive information or send information, etc. The

scheduling nodes

102 and 103 may be servers that provide various services, for example, a scheduling server that schedules the scheduled

nodes

104, 105, 106, and 107. The scheduling server may schedule the candidate scheduled node after receiving the set of identification information of the candidate scheduled node sent by the control node 101.

The scheduled

nodes

104, 105, 106, 107 may interact with the control node 101 and the

scheduling nodes

102, 103 through the

networks

109, 110 to receive information or send information, etc. The scheduled

nodes

104, 105, 106, and 107 may be servers that provide various services, for example, scheduled servers that perform scheduling tasks assigned by the

scheduling nodes

102 and 103. The scheduled server may execute the scheduled task after receiving the scheduled task of the

scheduling nodes

102 and 103.

The control node 101 may interact with the

scheduling nodes

102, 103 and the scheduled

nodes

104, 105, 106, 107 via the

networks

108, 109 to receive or send information, etc. The control node 101 may be a server that provides various services, for example, a control server that controls the

scheduling nodes

102, 103 to schedule scheduled

nodes

104, 105, 106, 107. After determining that there is information matching the scheduling node identity information in the current configuration information, the control server may send a predetermined set of candidate scheduled node identity information to the

scheduling nodes

102 and 103.

It should be noted that the method for pushing node information provided by the embodiments of the present application is generally performed by the control node 101, and accordingly, the device for pushing node information is generally provided in the control node 101. It should be noted that the method for pushing node information provided by the embodiments of the present application does not depend on the scheduled

nodes

104, 105, 106, and 107. Therefore, there may be no scheduled

nodes

104, 105, 106, 107.

It should be understood that the numbers of control nodes, scheduled nodes, and scheduling nodes in FIG. 1 are only schematic. According to the implementation needs, there can be any number of control nodes, scheduled nodes and scheduling nodes.

With continued reference to FIG. 2, a flow 200 of an embodiment of a method for pushing node information according to the present application is shown. The method for pushing node information includes the following steps:

Step 201: Receive scheduling request information of a scheduling node. The scheduling request information includes scheduling node identity identification information of the scheduling node.

In this embodiment, the execution body of the method for pushing node information (for example, the control node 101 shown in FIG. 1) may receive the scheduling request information of the scheduling node through a wired connection or a wireless connection. The foregoing scheduling request information may include, but is not limited to, scheduling node identity information of the scheduling node. The scheduling node identity identification information of the scheduling node may be any identification information used to characterize the scheduling node's identity. For example, the scheduling node identity identification information may be a number "1" used to characterize the scheduling node's identity. In this embodiment, the scheduling node may be any node that sends scheduling request information to the execution subject. For example, the above scheduling node may be a central scheduling node (Coordinator) in the Presto cluster.

Optionally, the scheduling node identity information of the scheduling node may include, but is not limited to, node name information of the scheduling node and user name information, Internet protocol IP address information, and port number information stored in association with the node name information.

In step 202, in response to determining that there is information matching the scheduling node identity information in the current configuration information, a predetermined candidate scheduled node identity information set is sent to the scheduling node.

In this embodiment, after receiving the scheduling request information of the scheduling node, the above-mentioned executing body may use the scheduling node identity information included in the scheduling request information to compare with the current configuration information.

Wherein, the above current configuration information may be a set of recorded identity information of each own node in the access system (for example, Presto cluster). The identity identification information of the own node may be any identification information used to characterize the identity of the own node. For example, the identity identification information of the own node may be a number "5" used to characterize the identity of the own node.

Optionally, the identity identification information of the own node may include, but is not limited to: node name information of the own node and user name information stored in association with the node name information, Internet protocol IP address information, and port number information. It should be noted that the above-mentioned own node refers to a node set by an administrator in the system. Own nodes may include: scheduling nodes, control nodes, and scheduled nodes.

In actual applications, when the scheduling node identity information included in the scheduling request information is compared with the current configuration information, a node has an IP address, and an IP address can often correspond to multiple users. Therefore, if the node name information, user name information, and IP address information in one piece of identification information in the current configuration information are respectively the same as the node name information, user name information, and IP address information in the scheduling node identity information, It is considered that there is information matching the scheduling node identity information in the current configuration information. At this time, the predetermined candidate scheduled node identity information set is sent to the scheduling node.

In addition, in this embodiment, the above-mentioned executive agent sends the predetermined candidate scheduled node identity identification information set to the scheduling node, the purpose of which is that the scheduling node can adopt the candidate scheduled node identity in the candidate scheduled node identity identification information set Identify the information, find the candidate scheduled node, and assign the scheduling task to the found candidate scheduled node.

In some optional implementation manners of this embodiment, the current configuration information may include a set of authorization identification information, and the authorization identification information in the set of authorization identification information includes: node name information of an authorized node and a user stored in association with the node name information Name information, IP address information, port number information; among them, authorized nodes include: scheduling node, scheduled node, control node.

In this embodiment, the above-mentioned authorized node is its own node in a normal operating state. Here, the current configuration information stores the authorization identification information set, which can realize that only the candidate scheduled node identity identification information set can be sent to the verified scheduling node in the normal operation state, which can further ensure system stability and data security.

In some optional implementations of this embodiment, the current configuration information further includes a set of unauthorized IP address information; and the above-mentioned execution subject may respond to determine that the unauthorized IP address information set matches the scheduling node identity information Unauthorized IP address information, send the first preset alarm information.

In this embodiment, the unauthorized IP address information may be the IP address information of the own node in an abnormal operation state. Among them, the own node in the abnormal operation state may be the own node in the process of upgrade and maintenance. Here, if a piece of unauthorized IP address information in the unauthorized IP address information set is exactly the same as the IP address information in the dispatch node identity identification information, it is considered that there is a match in the unauthorized IP address information set with the dispatch node identity identification information Unauthorized IP address information.

In this embodiment, a set of unauthorized IP address information is stored in the current configuration information, and an alarm can be issued when the own node in the abnormal operating state is attempted to connect with the control node to notify the management personnel to process in time. Here, you can notify managers in a timely manner by SMS or email. Wherein, the first alarm information may be any information used to characterize that the own node trying to connect with the control node in an abnormal operating state.

In some optional implementations of this embodiment, the execution body may send the preset second alarm information in response to determining that there is no information matching the scheduling node identity information in the current configuration information.

In this embodiment, if there is no information matching the scheduling node identity information in the current configuration information, the scheduling node is considered to be a node other than the system's own node. At this time, the second alarm information can be sent to the management personnel by means of SMS or email. The second alarm information may be any information used to characterize that a node other than the system's own node attempts to connect with the control node.

The method for pushing node information provided by the embodiment of the present application uses the current configuration information to perform security verification on the scheduling node, and only sends the candidate scheduled node identity identification information set to the verified scheduling node to avoid illegal nodes (in The normal operation state's own nodes, nodes other than the system's own nodes, etc.) can ensure system stability and data security.

Continue to refer to FIG. 3, which is a schematic diagram of an application scenario of a method for pushing node information according to an embodiment of the present application. Among them, the system can be a Presto cluster, the control node can be a service discovery node (DiscoveryService) in the Presto cluster, the scheduling node can be a central scheduling node (Coordinator) in the Presto cluster, and the scheduled node can be a working node in the Presto cluster ( Worker). In the application scenario 300 of FIG. 3, first, the central scheduling node 301 sends scheduling request information to the service discovery node 302. The scheduling request information includes the central scheduling node identification information A of the central scheduling node 301. Then, the service discovery node 302 receives the scheduling request information of the central scheduling node 301, and compares the central scheduling node identity identification letter A with the information in the current configuration information one by one. Finally, when it is determined that there is a piece of information in the current configuration information whose part or all of the content is the same as part or all of the identity information A of the central scheduling node, the service discovery node 302 determines that there is a central scheduling node in the current configuration information The information matching the identity information A, and sending the predetermined set of identity information of the candidate working node to the central scheduling node 301.

The method for pushing node information provided by the above embodiments of the present application uses the current configuration information to perform security verification on the scheduling node, and only sends the candidate scheduled node identity identification information set to the verified scheduling node to avoid illegal node access To improve system stability and data security.

With further reference to FIG. 4, it shows a flow 400 of yet another embodiment of a method for pushing node information. The process 400 of the method for pushing node information includes the following steps:

Step 401: Obtain the configuration information stored in the set location; determine the encryption information of the configuration information; in response to determining that the encryption information does not match the historical encryption information, determine the configuration information as the current configuration information and determine the encryption information as the historical encryption information , Where the historical encrypted information is the encrypted information of the current configuration information.

In this embodiment, the execution subject may acquire the configuration information from the set location through a limited connection or a wireless connection according to the set period. Wherein, the above setting location may be a U disk, or a data storage device of the control node, or a cache of an interactive device communicatively connected to the control node. The period set above may be one second or one minute, which is not limited here.

Here, after acquiring the configuration information, the executive body may perform the following steps on the acquired configuration information:

The first step is to determine the encrypted information of the configuration information. In this embodiment, the executive body can determine the encrypted information of the obtained configuration information in various ways. For example, the message digest algorithm (Message-Digest Algorithm) can be used to calculate the MD5 value of the configuration information, and other algorithms can also be used to calculate the configuration. Other encrypted values of information. There is no limit here.

In the second step, in response to determining that the encrypted information does not match the historical encrypted information, the configuration information is determined as the current configuration information, and the encrypted information is determined as the historical encrypted information. In this embodiment, the execution subject may compare the encrypted information of the acquired configuration information with the historical encrypted information that has been stored. Among them, if the encrypted information is the same as the historical encrypted information, it can be considered that the encrypted information and the historical encrypted information match, and no processing is required at this time. If the encrypted information is different from the historical encrypted information, it can be considered that the encrypted information does not match the historical encrypted information, that is, the acquired configuration information is changed from the current configuration information. At this time, the acquired configuration information may be used as the current configuration information. In addition, the encrypted information of the acquired configuration information is stored as historical encrypted information.

Step 402: Receive registration request information of the scheduled node. The registration request information includes identity information of the scheduled node of the scheduled node.

In this embodiment, the executive body may receive the registration request information of the scheduled node through a limited connection or a wireless connection. Wherein, the registration request information may include but is not limited to the scheduled node identity information of the scheduled node. The identity identification information of the scheduled node may be any identification information used to characterize the identity of the scheduled node. For example, the scheduled node identity identification information may be a number "2" used to characterize the scheduled node's identity.

Optionally, the scheduled node identity information of the scheduled node may include, but is not limited to, node name information of the scheduled node and user name information, Internet protocol IP address information, and port number information stored in association with the node name information.

In step 403, in response to determining that there is information matching the identity information of the scheduled node in the current configuration information, the scheduled node is determined to be the registered scheduled node.

In this embodiment, after receiving the registration request information of the scheduled node, the execution subject may use the identity information of the scheduled node included in the registration request information to compare with the current configuration information. If there is a piece of information in the current configuration information, and part or all of its content is the same as the identity identification information of the scheduled node, it can be considered that there is information matching the identity identification information of the scheduled node in the current configuration information. At this time, the execution subject determines the scheduled node as a registered scheduled node, thereby establishing an effective communication connection with the scheduled node.

In step 404, the candidate scheduled node identification information set is determined.

In this embodiment, the identification information set of candidate scheduled nodes may be determined in various ways. For example, the execution subject may select the designated registered scheduled node as the candidate scheduled node, and store the identity identification information of the selected registered scheduled node in the candidate scheduled node identity identification information set, thereby obtaining the candidate scheduled node identity identification Information collection. For another example, the execution subject may also arbitrarily select a set number of registered scheduled nodes as candidate scheduled nodes, and store the identity information of the selected registered scheduled node in the candidate scheduled node identity information set to obtain a candidate The set of identity information of the scheduled node.

In some optional implementations of this embodiment, the above-mentioned execution subject may also obtain the candidate scheduled node identity identification information set by the following steps:

The first step is to receive the status information sent by the registered scheduled node.

In this embodiment, the executive body may receive the status information sent by the registered scheduled node through a wired connection or a wireless connection. The above state information may be any information used to characterize the working state of the registered scheduled node. For example, the status information may be the letter "Y", which is used to indicate that the working status of the registered scheduled node is normal operation. For another example, the status information may be the letter "N", which is used to indicate that the working status of the registered scheduled node is abnormal operation.

In the second step, in response to determining that the state information matches the pre-stored state information, the registered scheduled node is determined as a candidate scheduled node, and the identity information of the registered scheduled node is stored as the candidate scheduled node identity information Candidate scheduled node identity information set.

In this embodiment, if the status information of the registered scheduled node is the same as the pre-stored status information, at this time, the executive body determines the registered scheduled node as a candidate scheduled node, and uses the identity identification information of the registered scheduled node as The candidate scheduled node identity identification information is stored in the candidate scheduled node identity identification information set.

In the third step, in response to determining that the state information does not match the pre-stored state information, the candidate scheduled node identity identification information corresponding to the registered scheduled node in the candidate scheduled node identity identification information set is searched for the found candidate The scheduled node identity information is removed from the candidate scheduled node identity information set.

In this embodiment, if the registered scheduled node is the same as the pre-stored state information, at this time, the execution subject may find whether the candidate scheduled node identity corresponding to the registered scheduled node exists in the candidate scheduled node identity information set If the information is found, the found candidate scheduled node identity information is removed from the candidate scheduled node identity information set. Here, the identity information of the candidate scheduled node corresponding to the registered scheduled node in the abnormal operating state is removed from the candidate scheduled node identity identification information set, the purpose is to ensure that only the identity of the registered scheduled node in the normal operating state Pushing the identification information to the scheduling node can further improve the system stability and data security.

Step 405: Receive scheduling request information of the scheduling node. The scheduling request information includes scheduling node identity identification information of the scheduling node.

Step 406: In response to determining that there is information matching the scheduling node identity information in the current configuration information, send a predetermined set of candidate scheduled node identity information to the scheduling node.

In this embodiment, the specific operations of steps 405-406 are basically the same as the operations of steps 201-202 in the embodiment shown in FIG. 2, which will not be repeated here.

As can be seen from FIG. 4, compared with the embodiment corresponding to FIG. 2, the process 400 of the method for pushing node information in this embodiment embodies the steps of updating the current configuration information and registering the scheduled node And the step of determining the identity information of the candidate scheduled node. Therefore, the solution described in this embodiment can timely adjust the current configuration information and the set of candidate node identification information, which can improve the system operating efficiency, and further improve the system stability and data security.

With further reference to FIG. 5, as an implementation of the method shown in the above figures, this application provides an embodiment of an apparatus for pushing node information, which corresponds to the method embodiment shown in FIG. 2, The device can be specifically applied to various servers.

As shown in FIG. 5, the apparatus 500 for pushing node information in this embodiment includes: a scheduling receiving unit 501 configured to receive scheduling request information of the scheduling node. The scheduling request information includes scheduling node identity identification information of the scheduling node; information The sending unit 502 is configured to send a predetermined set of candidate scheduled node identity information to the scheduling node in response to determining that there is information matching the scheduling node identity information in the current configuration information.

In some optional implementations of this embodiment, the foregoing device may further include an information determination unit (not shown in the figure). Among them, the information determination unit may be configured to acquire the configuration information stored at the set location; determine the encryption information of the configuration information; in response to determining that the encryption information does not match the historical encryption information, determine the configuration information as the current configuration information, and encrypt The information is determined to be historical encrypted information, where the historical encrypted information is encrypted information of the current configuration information.

In some optional implementations of this embodiment, the foregoing device may further include a registration receiving unit and a registration determining unit (not shown in the figure). Wherein, the registration receiving unit may be configured to receive registration request information of the scheduled node, and the registration request information includes scheduled node identity identification information of the scheduled node. The registration determination unit may be configured to determine the scheduled node as the registered scheduled node in response to determining that there is information in the current configuration information that matches the identity information of the scheduled node.

In some optional implementations of this embodiment, the candidate scheduled node identity information set may be determined by the following steps: receiving status information sent by the registered scheduled node; in response to determining that the status information matches the pre-stored status information , The registered scheduled node is determined as a candidate scheduled node, and the identity identification information of the registered scheduled node is stored as the candidate scheduled node identity identification information in the candidate scheduled node identity identification information set; Status information does not match, find the candidate scheduled node identity information corresponding to the registered scheduled node in the set of candidate scheduled node identity information, and search the candidate scheduled node identity information from the candidate scheduled node identity Removed from the identification information set.

In some optional implementations of this embodiment, the current configuration information may include a set of authorized identification information, and the authorized identification information in the set of authorized identification information includes: node name information of the authorized node and the user name stored in association with the node name information Information, Internet protocol IP address information, port number information; where the authorized node includes: scheduling node, scheduled node, control node.

In the apparatus provided in the above embodiment of the present application, the scheduling receiving unit 501 receives scheduling request information of the scheduling node, and the scheduling request information includes scheduling node identity identification information of the scheduling node. Then, in response to determining that there is information matching the scheduling node identity information in the current configuration information, the information sending unit 502 sends the predetermined candidate scheduled node identity information set to the scheduling node. The device of this embodiment uses the current configuration information to perform security verification on the scheduling node, and only sends the candidate scheduled node identity identification information set to the verified scheduling node, which can avoid illegal node access and help ensure system stability and data Safety.

6, which shows a schematic structural diagram of a computer system 600 suitable for implementing the server of the embodiment of the present application. The server shown in FIG. 6 is only an example, and should not bring any limitation to the functions and usage scope of the embodiments of the present application.

As shown in FIG. 6, the computer system 600 includes a central processing unit (CPU) 601 that can be loaded into a random access memory (RAM) 603 from a program stored in a read-only memory (ROM) 602 or from a storage section 608 Instead, perform various appropriate actions and processing. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other through a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

The following components are connected to the I / O interface 605: an input section 606 including a keyboard, a mouse, etc .; an output section 607 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker; a storage section 608 including a hard disk, etc. ; And a communication section 609 including a network interface card such as a LAN card, a modem, etc. The communication section 609 performs communication processing via a network such as the Internet. The driver 610 is also connected to the I / O interface 605 as needed. A removable medium 611, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is installed on the drive 610 as necessary, so that the computer program read out therefrom is installed into the storage section 608 as needed.

In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product that includes a computer program carried on a computer-readable medium, the computer program containing program code for performing the method shown in the flowchart. In such an embodiment, the computer program may be downloaded and installed from the network through the communication section 609, and / or installed from the removable medium 611. When the computer program is executed by the central processing unit (CPU) 601, the above-mentioned functions defined in the method of the present application are executed. It should be noted that the computer-readable medium of the present application may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or any combination of the above. More specific examples of computer readable storage media may include, but are not limited to: electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable removable Programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the foregoing. In this application, the computer-readable storage medium may be any tangible medium that contains or stores a program, and the program may be used by or in combination with an instruction execution system, apparatus, or device. In this application, the computer-readable signal medium may include a data signal that is propagated in a baseband or as part of a carrier wave, in which a computer-readable program code is carried. This propagated data signal can take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. The computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, and the computer-readable medium may send, propagate, or transmit a program for use by or in combination with an instruction execution system, apparatus, or device. . The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the drawings illustrate the possible implementation architecture, functions, and operations of the system, method, and computer program product according to various embodiments of the present application. In this regard, each block in the flowchart or block diagram may represent a module, program segment, or part of code that contains one or more logic functions Executable instructions. It should also be noted that in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks represented in succession may actually be executed in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, and a combination of blocks in the block diagram and / or flowchart, can be implemented with a dedicated hardware-based system that performs the specified function or operation Or, it can be realized by a combination of dedicated hardware and computer instructions.

The units described in the embodiments of the present application may be implemented in software or hardware. The described unit may also be provided in the processor. For example, it may be described as: a processor includes a scheduling receiving unit and an information sending unit. In some cases, the names of these units do not constitute a limitation on the unit itself. For example, the scheduling receiving unit may also be described as "a unit that receives scheduling request information of a scheduling node."

As another aspect, the present application also provides a computer-readable medium, which may be included in the device described in the foregoing embodiments; or may exist alone without being assembled into the device. The computer-readable medium carries one or more programs. When the one or more programs are executed by the device, the device is caused to: receive scheduling request information of the scheduling node, and the scheduling request information includes scheduling node identity identification information of the scheduling node ; In response to determining that there is information matching the scheduling node identity information in the current configuration information, sending a predetermined set of candidate scheduled node identity information to the scheduling node.

The above description is only the preferred embodiment of the present application and the explanation of the applied technical principles. Those skilled in the art should understand that the scope of the invention involved in this application is not limited to the technical solution formed by the specific combination of the above technical features, but should also cover the above technical features or without departing from the above inventive concept Other technical solutions formed by arbitrary combinations of equivalent features. For example, a technical solution formed by replacing the above features with technical features disclosed in this application (but not limited to) but having similar functions.

Claims

A method for pushing node information, including:

Receiving scheduling request information of a scheduling node, the scheduling request information including scheduling node identity identification information of the scheduling node; and

In response to determining that there is information in the current configuration information that matches the identity information of the scheduling node, a predetermined set of identity information of the candidate scheduled node is sent to the scheduling node.
The method of claim 1, wherein before the receiving scheduling request information of the scheduling node, the method further comprises:

Obtain the configuration information stored in the set location;

Determine the encrypted information of the configuration information; and

In response to determining that the encrypted information does not match the historical encrypted information, the configuration information is determined as the current configuration information, and the encrypted information is determined as the historical encryption information, where the historical encrypted information is the encryption of the current configuration information information.
The method of claim 1, wherein before the receiving scheduling request information of the scheduling node, the method further comprises:

Receiving registration request information of the scheduled node, the registration request information including identity information of the scheduled node of the scheduled node; and

In response to determining that there is information in the current configuration information that matches the identity information of the scheduled node, the scheduled node is determined to be the registered scheduled node.
The method according to claim 3, wherein the candidate scheduled node identity identification information set is determined by the following steps:

Receiving status information sent by the registered scheduled node;

In response to determining that the state information matches the pre-stored state information, determining the registered scheduled node as a candidate scheduled node, and using the identification information of the registered scheduled node as the candidate scheduled node identification information Deposit the set of candidate identification information of the scheduled node; and

In response to determining that the status information does not match the pre-stored status information, searching for candidate scheduled node identity identification information corresponding to the registered scheduled node in the candidate scheduled node identity identification information set, and searching for the found candidate The scheduled node identity information is removed from the candidate scheduled node identity information set.
The method according to any one of claims 1 to 4, wherein the current configuration information includes an authorization identification information set, and the authorization identification information in the authorization identification information set includes:

The node name information of the authorized node and the user name information, Internet protocol IP address information, and port number information stored in association with the node name information; wherein, the authorized node includes: a scheduling node, a scheduled node, and a control node.
An apparatus for pushing node information, including:

A scheduling receiving unit configured to receive scheduling request information of the scheduling node, the scheduling request information including scheduling node identity identification information of the scheduling node; and

The information sending unit is configured to, in response to determining that there is information in the current configuration information that matches the identity information of the scheduling node, send a predetermined set of identity information of the candidate scheduled node to the scheduling node.
The device according to claim 6, wherein the device further comprises:

The information determining unit is configured to acquire the configuration information stored at the set location; determine the encryption information of the configuration information; and in response to determining that the encryption information does not match the historical encryption information, determine the configuration information as the current configuration Information, and determining the encrypted information as encrypted information, wherein the historical encrypted information is the encrypted information of the current configuration information.
The device according to claim 6, wherein the device further comprises:

A registration receiving unit configured to receive registration request information of the scheduled node, the registration request information including identity information of the scheduled node of the scheduled node; and

The registration determining unit is configured to determine that the scheduled node is a registered scheduled node in response to determining that there is information in the current configuration information that matches the identity information of the scheduled node.
The apparatus according to claim 8, wherein the candidate scheduled node identity identification information set is determined by the following steps:

Receiving status information sent by the registered scheduled node;

In response to determining that the state information matches the pre-stored state information, determining the registered scheduled node as a candidate scheduled node, and using the identification information of the registered scheduled node as the candidate scheduled node identification information Deposit the set of candidate identification information of the scheduled node; and

In response to determining that the status information does not match the pre-stored status information, searching for candidate scheduled node identity identification information corresponding to the registered scheduled node in the candidate scheduled node identity identification information set, and searching for the found candidate The scheduled node identity information is removed from the candidate scheduled node identity information set.
The apparatus according to claim 6, wherein the current configuration information includes a set of authorization identification information, and the authorization identification information in the set of authorization identification information includes:

The node name information of the authorized node and the user name information, Internet protocol IP address information, and port number information stored in association with the node name information; wherein the authorized node includes: a scheduling node, a scheduled node, and a control node.
A server, including:

One or more processors;

A storage device on which one or more programs are stored,

When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1-5.
A computer readable medium on which a computer program is stored, wherein the program is executed by a processor to implement the method according to any one of claims 1-5.