CN114584454B - Processing method and device of server information, electronic equipment and storage medium - Google Patents
Processing method and device of server information, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114584454B CN114584454B CN202210155993.4A CN202210155993A CN114584454B CN 114584454 B CN114584454 B CN 114584454B CN 202210155993 A CN202210155993 A CN 202210155993A CN 114584454 B CN114584454 B CN 114584454B
- Authority
- CN
- China
- Prior art keywords
- node
- bmc
- target
- information
- server
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000003672 processing method Methods 0.000 title abstract description 5
- 238000000034 method Methods 0.000 claims abstract description 54
- 238000012545 processing Methods 0.000 claims abstract description 37
- 230000010365 information processing Effects 0.000 claims abstract description 4
- 238000004891 communication Methods 0.000 claims description 19
- 238000004458 analytical method Methods 0.000 claims description 8
- 238000004590 computer program Methods 0.000 claims description 8
- 238000012544 monitoring process Methods 0.000 claims description 6
- 230000002159 abnormal effect Effects 0.000 claims description 4
- 238000012423 maintenance Methods 0.000 abstract description 8
- 229920000106 Liquid crystal polymer Polymers 0.000 description 18
- 230000008569 process Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000007726 management method Methods 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 230000006870 function Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000000802 evaporation-induced self-assembly Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000009474 immediate action Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0631—Management of faults, events, alarms or notifications using root cause analysis; using analysis of correlation between notifications, alarms or events based on decision criteria, e.g. hierarchy, tree or time analysis
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0677—Localisation of faults
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/54—Organization of routing tables
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer And Data Communications (AREA)
Abstract
The application discloses a server information processing method, a device, electronic equipment and a storage medium. The method comprises the following steps: the method comprises the steps that a target server is monitored to obtain target server information corresponding to the target server; acquiring fault information in a target server from the information of the target server; inquiring a routing table stored by a target BMC node, and acquiring a plurality of BMC nodes in a distributed network where the target BMC node is located from the routing table; and sending the target server information and the fault information to a plurality of BMC nodes in the distributed network, so that the BMC nodes store the target server information and execute corresponding fault processing operation according to the fault information. According to the application, the corresponding server is monitored through the BMC node, the server information is recorded, and the server information is shared into the distributed network where the BMC node is located, so that other BMC nodes in the distributed network execute corresponding fault processing operation, the requirement of the server system on manual maintenance is reduced, and the operation and maintenance efficiency and reliability of the server are improved.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and apparatus for processing server information, an electronic device, and a storage medium.
Background
With the development of computer systems, the internet is applied in mass in various industries, and the number of servers used is increasing, so how to build a server management system to manage the servers more efficiently becomes a serious concern for various enterprises, especially for internet enterprises using a large number of servers.
The conventional server management system has a central node on which a set of server management software is built, and the software interacts with the BMC on each server to obtain server information and control the server. The operation and maintenance personnel of the Internet company maintain huge server information through a server management system.
Disclosure of Invention
In order to solve the technical problems or at least partially solve the technical problems, the application provides a processing method, a processing device, electronic equipment and a storage medium of server information.
According to an aspect of an embodiment of the present application, there is provided a method for processing server information, applied to a BMC node, where the BMC node is deployed on a server, the method including:
the method comprises the steps that a target server is monitored to obtain target server information corresponding to the target server, wherein the target server is a server associated with a target BMC node;
acquiring fault information in the target server from the target server information;
inquiring a routing table stored by the target BMC node, and acquiring a plurality of BMC nodes in a distributed network where the target BMC node is located from the routing table;
and sending the target server information and the fault information to a plurality of BMC nodes in the distributed network, so that the BMC nodes store the target server information and execute corresponding fault processing operation according to the fault information.
Further, the method further comprises:
acquiring a routing table creation request, and determining a guiding BMC node in the distributed network which is requested to be added by the target BMC node based on the routing table creation request;
sending a first query request to the guide BMC node, wherein the first query request is used for acquiring node information of each BMC node in the distributed network from the guide BMC node;
receiving a plurality of pieces of first node information fed back by the guide BMC node based on the first query request;
and establishing the routing table based on the first node information.
Further, before sending the query request to the boot BMC node, the method further includes:
acquiring a target node identifier corresponding to the target BMC node;
and sending the target node identification to the guide BMC node, so that the guide BMC node updates a routing table stored in the guide BMC node based on the target node identification, and sends the target node identification to each BMC node in the distributed network.
Further, the establishing the routing table based on the first node information includes:
acquiring node identifiers corresponding to all BMC nodes from the first node information;
calculating the logic distance between the target BMC node and each BMC node based on the target node identifier and each node identifier;
and establishing the routing table based on the logical distance and the node identification.
Further, the calculating the logical distance between the target BMC node and each BMC node based on the target node identifier and each node identifier includes:
calculating the longest public prefix between the target BMC node and each BMC node based on the target node identifier and each node identifier;
and determining the logic distance between the target BMC node and each BMC node according to the longest common prefix, wherein the longest common prefix is in inverse proportion to the logic distance.
Further, after establishing the routing table based on the first node information, the method further comprises:
determining stored BMC nodes in the routing table;
sending a second query request to the stored BMC node, wherein the second query request is used for acquiring node information of each BMC node in the distributed network from the stored BMC node;
receiving second node information fed back by the stored BMC node based on the second query request;
and updating the routing table based on the second node information until the routing table stores node information of all BMC nodes in the distributed network.
Further, the method further comprises:
server information from any BMC node in the distributed network is received;
storing the server information, and analyzing the server information to obtain an analysis result;
and executing an exception handling operation under the condition that the analysis result is used for indicating that the server information is abnormal.
According to still another aspect of the embodiment of the present application, there is also provided a processing apparatus for server information, including:
the monitoring module is used for monitoring a target server to obtain server information corresponding to the target server, wherein the target server is a server associated with a target BMC node;
the acquisition module is used for acquiring fault information in the target server from the server information;
the query module is used for querying the routing table stored by the target BMC node and acquiring a plurality of BMC nodes in the distributed network where the target BMC node is located from the routing table;
and the sending module is used for sending the server information and the fault information to a plurality of BMC nodes in the distributed network so that the BMC nodes store the server information and execute corresponding fault processing operation according to the fault information.
According to another aspect of the embodiments of the present application, there is also provided a storage medium including a stored program that performs the above steps when running.
According to another aspect of the embodiment of the present application, there is also provided an electronic device including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete communication with each other through the communication bus; wherein: a memory for storing a computer program; and a processor for executing the steps of the method by running a program stored on the memory.
Embodiments of the present application also provide a computer program product comprising instructions which, when run on a computer, cause the computer to perform the steps of the above method.
Compared with the prior art, the technical scheme provided by the embodiment of the application has the following advantages: according to the method provided by the embodiment of the application, the corresponding server is monitored through the BMC node, the server information is recorded, and the server information is shared into the distributed network where the BMC node is located, so that other BMC nodes in the distributed network execute corresponding fault processing operation, the requirement of a server system on manual maintenance is reduced, and the operation and maintenance efficiency and reliability of the server are improved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application.
In order to more clearly illustrate the embodiments of the application or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, and it will be obvious to a person skilled in the art that other drawings can be obtained from these drawings without inventive effort.
Fig. 1 is a flowchart of a method for processing server information according to an embodiment of the present application;
FIG. 2 is a flowchart of a method for processing server information according to another embodiment of the present application;
fig. 3 is a schematic structural diagram of a distributed network according to an embodiment of the present application;
FIG. 4 is a flowchart of a method for processing server information according to another embodiment of the present application;
fig. 5 is a block diagram of a server information processing apparatus according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present application more apparent, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments, illustrative embodiments of the present application and descriptions thereof are used to explain the present application and do not constitute undue limitations of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
It should be noted that in this document, relational terms such as "first" and "second" and the like are used solely to distinguish one entity or action from another similar entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The embodiment of the application provides a processing method and device of server information, electronic equipment and a storage medium. The method provided by the embodiment of the application can be applied to any needed electronic equipment, for example, the electronic equipment can be a server, a terminal and the like, is not particularly limited, and is convenient to describe and is called as the electronic equipment for short hereinafter.
According to an aspect of the embodiments of the present application, a method embodiment of a method for processing server information is provided, and fig. 1 is a flowchart of a method for processing server information provided by an embodiment of the present application, as shown in fig. 1, where the method includes:
and S11, monitoring a target server to obtain target server information corresponding to the target server, wherein the target server is a server associated with a target BMC node.
The method provided by the embodiment of the application is applied to the BMC (Baseboard Management Controller ) node which is deployed on the server. Specifically, the BMC node disposed on each server is configured to monitor server information of the server where the BMC node is located, and receive server information sent from other BMC nodes in the distributed network.
In the embodiment of the application, the target server can monitor and record the overall operation condition of the target server, for example: network operation data, memory operation data, CPU operation data, hard disk operation data, and the like. And taking the recorded operation data as server information of the server where the operation data are located.
Step S12, obtaining fault information in the target server from the target server information.
In the embodiment of the application, the network operation data, the memory operation data, the CPU operation data, the hard disk operation data and other data in the target server information are respectively compared with the corresponding preset operation data ranges (the preset operation data ranges are the data ranges corresponding to various indexes of the server in the normal operation state) by analyzing the target server information, so that whether the target server has faults or not is determined.
In the embodiment of the application, if the operation data of a certain index in the target server information does not fall into the corresponding preset operation data range, determining the fault information of the target server as the fault information of the index.
Step S13, inquiring a routing table stored by the target BMC node, and acquiring a plurality of BMC nodes in the distributed network where the target BMC node is located from the routing table.
In the embodiment of the application, the routing table stored by the target BMC node stores a plurality of BMC nodes in the distributed network where the target BMC node is located and the logic distance between the target BMC node and each BMC node in the distributed network.
As an example, the target BMC node is a P node, and the BMC node stored in the routing table includes: i node, T node, K node. And the logical distances between the P node and the I node, T node, K node, respectively, expressed by the longest common prefix between the node identities (Longest Common Prefix, abbreviated LCP), LCP:2{I, LCP:1{ T, K }.
And S14, sending the target server information and the fault information to a plurality of BMC nodes in the distributed network, so that the BMC nodes store the target server information and execute corresponding fault processing operation according to the fault information.
In the embodiment of the application, the target BMC node inquires other BMC nodes in the distributed network where the target BMC node is located from the routing table, and sends the target server information and the fault information to the other BMC nodes so that the other BMC nodes store the target server information and execute corresponding fault processing operation according to the fault information, specifically, the fault processing operation can be to judge whether a processing strategy for solving the fault information exists or not, and if so, the processing strategy is fed back to the target BMC node.
In addition, after receiving the fault information, other BMC nodes in the distributed network can also check the server where the BMC nodes are located according to the fault information or send alarm information to a preset terminal and the like.
According to the method provided by the embodiment of the application, the corresponding server is monitored through the BMC node, the server information is recorded, and the server information is shared into the distributed network where the BMC node is located, so that other BMC nodes in the distributed network execute corresponding fault processing operation, the requirement of a server system on manual maintenance is reduced, and the operation and maintenance efficiency and reliability of the server are improved.
In the embodiment of the present application, fig. 2 is a flowchart of a method for processing server information provided in the embodiment of the present application, where, as shown in fig. 2, the method further includes:
step S21, a routing table creation request is obtained, and a guiding BMC node in the distributed network which is requested to be added by the target BMC node is determined based on the routing table creation request.
In the embodiment of the application, the routing table creation request can be initiated by a user directly through a server, wherein the routing table creation request carries a boot BMC node in a distributed network which is requested to be added by a target BMC node.
In the embodiment of the application, after obtaining the routing table creation request, the method further comprises the following steps A1-A2:
and A1, acquiring a target node identifier corresponding to a target BMC node.
And step A2, a target node identifier is sent to the guide BMC node, so that the guide BMC node updates a routing table stored in the guide BMC node based on the target node identifier, and the target node identifier is sent to each BMC node in the distributed network.
In the embodiment of the application, the target node identifier of the target BMC node is 160bit binary data ID which is used as a unique identifier in a distributed network. Meanwhile, the target BMC node sends the target node identification to the guide BMC node so that the guide BMC node updates the routing table stored by the guide BMC node, and meanwhile, the target node identification is forwarded to each BMC node in the distributed network so that each BMC node synchronously updates the routing table.
Step S22, a first query request is sent to the guide BMC node, wherein the first query request is used for acquiring node information of each BMC node in the distributed network from the guide BMC node.
In step S23, a plurality of first node information that guides the BMC node to feed back based on the first query request is received.
In the embodiment of the application, the target BMC node sends a first query request to the guide BMC node, and after receiving the first query request, the guide BMC node feeds back the first node information of each BMC node stored by the guide BMC node to the target BMC node based on the first query request.
Step S24, a routing table is established based on the first node information.
In the embodiment of the present application, step S24, a routing table is established based on the first node information, comprising the following steps B1-B3:
and B1, acquiring node identifiers corresponding to all BMC nodes from the first node information.
And B2, calculating the logic distance between the target BMC node and each BMC node based on the target node identification and each node identification.
In the embodiment of the present application, step B2, calculating a logical distance between a target BMC node and each BMC node based on the target node identifier and each node identifier, includes:
and calculating the longest public prefix between the target BMC node and each BMC node based on the target node identifier and each node identifier, and determining the logic distance between the target BMC node and each BMC node according to the longest public prefix, wherein the longest public prefix and the logic distance are in an inverse proportion relation.
And step B3, establishing a routing table based on the logical distance and the node identification.
As an example, in a Kademlia network formed by BMC nodes in a local area network, each BMC may be assigned a unique ID, which is a 160bit binary number that can uniquely identify a BMC node. The logical distance between two BMC nodes is expressed in terms of the longest common prefix (Longest Common Prefix, abbreviated LCP) of the two BMC IDs. The longer the longest common prefix between two BMCs, the closer the logical distance of the two BMCs can be considered.
As in fig. 3, the LCP of A, B is 2. As in fig. 3, from the point of view of the node H, the remaining nodes can be divided into 3 distances according to LCP. Namely LCP:2{E, LCP:1{ F, G }, LCP:0{ A, B, C, D }
The BMC as an H node will therefore maintain a routing table
Table 1 routing table
In the embodiment of the application, the node information of all the BMC nodes in the distributed network may not be the node information of the BMC nodes stored in the boot BMC node. Thus after establishing the routing table based on the first node information, the method further comprises the steps C1-C4 of:
and C1, determining a stored BMC node in the routing table.
And step C2, sending a second query request to the stored BMC nodes, wherein the second query request is used for acquiring node information of each BMC node in the distributed network from the stored BMC nodes.
And step C3, receiving second node information fed back by the stored BMC node based on the second query request.
And step C4, updating a routing table based on the second node information until the routing table stores node information of all BMC nodes in the distributed network.
As an example, BMC node H first proceeds to build its own routing table, now adding the bootstrap node to the routing table, assuming the bootstrap node is C. The BMC node H needs a 160bit binary data ID as its unique identification in the Kademlia distributed network of BMC nodes. The BMC node H sends a query request to the BMC node C, querying the BMC node H, i.e. itself. After receiving the query request of the BMC node H, the BMC node C finds out a plurality of largest nodes of the LCP and the BMC node H according to the processing steps of the general query request and returns the largest nodes to the BMC node H. When BMC node H receives the BMC nodes returned by BMC node C, the BMC nodes are added into the own routing table. The BMC node H continues to send query requests for querying the BMC node in the own routing table, and adds the returned BMC node into the own routing table until a sufficiently detailed routing table is established.
In the embodiment of the application, if the target BMC node a wants to search for the BMC node B in the network, but the BMC node a does not have the routing information directly reaching the BMC node B at this time, the BMC node a needs to acquire the contact information of the BMC node B from other BMC nodes in the distributed network. The method comprises the following specific steps:
in step 1, the target BMC node a calculates its longest common prefix LCP (a, B) with the BMC node B.
And 2, the target BMC node A finds a group of LCP (LCP) from the stored routing table, sends a request for inquiring the BMC node B to the nodes in the group, and can send an inquiry request to the BMC nodes in the adjacent group if the number of the BMC nodes in the group is too small.
And step 3, if the BMC node receiving the query request comprises a BMC node B, the BMC node B directly sends response information to the target BMC node. If the BMC node receiving the query request does not include the BMC node B, the LCP of the BMC node B and the self are queried from the routing table, and a plurality of nodes are selected from the corresponding LCP groups to respond to the BMC node A.
As one example: for each BMC node receiving the query request, if the BMC node is the BMC node B, the response is the BMC node B. Otherwise, the LCP of the BMC node B and itself are calculated, and several nodes are selected from the corresponding LCP group to respond to the BMC node A.
And 4, after receiving the return of each BMC node, the BMC node A stops the searching process if the BMC node B is already searched. Otherwise, the searching is continued according to the nodes with the largest LCP of the BMC node A and the BMC node B, and the process is repeated until the BMC node B or the nodes with the largest LCP of the BMC node B are found.
And 5, repeating the step 4 to find the BMC node B or find several nodes with the longest common prefix with the BMC node B.
In the embodiment of the present application, fig. 4 is a flowchart of a method for processing server information provided in the embodiment of the present application, where, as shown in fig. 4, the method further includes:
step S31, server information from any BMC node in the distributed network is received.
And step S32, storing the server information, and analyzing the server information to obtain an analysis result.
In step S33, in the case where the analysis result is used to indicate that the server information is abnormal, an abnormality processing operation is performed.
In the embodiment of the application, when one BMC node is separated from a distributed network formed by BMC nodes, the BMC node does not need to send any data to other BMC nodes in the network. All BMC nodes in the network must periodically publish their own stored routing table data to several nodes with their largest LCPs, and such a node failure message will quickly propagate throughout the distributed network.
According to the embodiment of the application, the distributed network is constructed, each BMC can know the information of other BMC nodes through the network structure and communicate with each other, and an autonomous maintenance system is built.
When the nodes of the BMC form a network according to the method, the nodes can communicate with each other, and the current server information stored in each BMC is broadcasted to other BMC nodes in the network, so that each BMC stores a plurality of server information and monitors a plurality of servers, unlike the traditional BMC which only stores the server information of the BMC. When an exception occurs in one server, even in the BMC on one server. The rest of the BMCs in the network may take immediate action, such as: the log is saved and the server user is notified, or the server is restarted directly, etc. The original functions of the server management software can be replaced.
Fig. 5 is a block diagram of a server information processing apparatus according to an embodiment of the present application, where the apparatus may be implemented as part or all of an electronic device by software, hardware, or a combination of both. As shown in fig. 5, the apparatus includes:
the monitoring module 51 is configured to monitor a target server to obtain server information corresponding to the target server, where the target server is a server associated with a target BMC node;
an obtaining module 52, configured to obtain, from the server information, information that a failure exists in the target server;
the query module 53 is configured to query a routing table stored in the target BMC node, and obtain, from the routing table, a plurality of BMC nodes in a distributed network where the target BMC node is located;
the sending module 54 is configured to send server information and fault information to a plurality of BMC nodes in the distributed network, so that the BMC nodes store the server information and perform corresponding fault handling operations according to the fault information.
In an embodiment of the present application, the processing device for server information further includes: the creating module is used for acquiring a routing table creating request and determining a guiding BMC node in the distributed network which is requested to be added by the target BMC node based on the routing table creating request; sending a first query request to the guide BMC node, wherein the first query request is used for acquiring node information of each BMC node in the distributed network from the guide BMC node; receiving a plurality of pieces of first node information which guide the BMC node to feed back based on the first query request; a routing table is established based on the first node information.
In the embodiment of the application, the sending module of the processing device is further used for obtaining the target node identifier corresponding to the target BMC node; and sending the target node identification to the guide BMC node so that the guide BMC node updates the routing table stored in the guide BMC node based on the target node identification, and sending the target node identification to each BMC node in the distributed network.
In the embodiment of the application, a creating module is used for acquiring node identifiers corresponding to each BMC node from the first node information; calculating the logic distance between the target BMC node and each BMC node based on the target node identifier and each node identifier; a routing table is established based on the logical distance and the node identification.
In the embodiment of the application, a creation module is used for calculating the longest public prefix between the target BMC node and each BMC node based on the target node identifier and each node identifier; and determining the logic distance between the target BMC node and each BMC node according to the longest common prefix, wherein the longest common prefix is in inverse proportion to the logic distance.
In the embodiment of the application, the processing device further comprises an updating module, which is used for determining the stored BMC node in the routing table; sending a second query request to the stored BMC nodes, wherein the second query request is used for acquiring node information of each BMC node in the distributed network from the stored BMC nodes; receiving second node information fed back by the stored BMC node based on a second query request; and updating the routing table based on the second node information until the routing table stores node information of all BMC nodes in the distributed network.
In the embodiment of the application, the processing device further comprises an execution module, which is used for receiving the server information from any BMC node in the distributed network; storing the server information, and analyzing the server information to obtain an analysis result; and executing an exception handling operation in the case that the analysis result is used for indicating that the server information is abnormal.
The embodiment of the application also provides an electronic device, as shown in fig. 6, the electronic device may include: the device comprises a processor 1501, a communication interface 1502, a memory 1503 and a communication bus 1504, wherein the processor 1501, the communication interface 1502 and the memory 1503 are in communication with each other through the communication bus 1504.
A memory 1503 for storing a computer program;
the processor 1501, when executing the computer program stored in the memory 1503, implements the steps of the above embodiments.
The communication bus mentioned by the above terminal may be a peripheral component interconnect standard (Peripheral Component Interconnect, abbreviated as PCI) bus or an extended industry standard architecture (Extended Industry Standard Architecture, abbreviated as EISA) bus, etc. The communication bus may be classified as an address bus, a data bus, a control bus, or the like. For ease of illustration, the figures are shown with only one bold line, but not with only one bus or one type of bus.
The communication interface is used for communication between the terminal and other devices.
The memory may include random access memory (Random Access Memory, RAM) or non-volatile memory (non-volatile memory), such as at least one disk memory. Optionally, the memory may also be at least one memory device located remotely from the aforementioned processor.
The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU for short), a network processor (Network Processor, NP for short), etc.; but also digital signal processors (Digital Signal Processing, DSP for short), application specific integrated circuits (Application Specific Integrated Circuit, ASIC for short), field-programmable gate arrays (Field-Programmable Gate Array, FPGA for short) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.
In yet another embodiment of the present application, there is also provided a computer-readable storage medium having instructions stored therein, which when run on a computer, cause the computer to perform the method for processing server information according to any one of the above embodiments.
In a further embodiment of the present application, a computer program product comprising instructions, which when run on a computer, causes the computer to perform the method for processing server information according to any of the above embodiments is also provided.
In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, produces a flow or function in accordance with embodiments of the present application, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by a wired (e.g., coaxial cable, fiber optic, digital subscriber line), or wireless (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains an integration of one or more available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid State Disk), etc.
The foregoing description is only of the preferred embodiments of the present application and is not intended to limit the scope of the present application. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application are included in the protection scope of the present application.
The foregoing is only a specific embodiment of the application to enable those skilled in the art to understand or practice the application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (9)
1. The method for processing server information is applied to a BMC node, and the BMC node is deployed on a server, and is characterized by comprising the following steps:
the method comprises the steps that a target server is monitored to obtain target server information corresponding to the target server, wherein the target server is a server associated with a target BMC node;
acquiring fault information in the target server from the target server information;
inquiring a routing table stored by the target BMC node, and acquiring a plurality of BMC nodes in a distributed network where the target BMC node is located from the routing table;
the target server information and the fault information are sent to a plurality of BMC nodes in the distributed network, so that the BMC nodes store the target server information and execute corresponding fault processing operation according to the fault information;
the method further comprises the steps of:
acquiring a routing table creation request, and determining a guiding BMC node in the distributed network which is requested to be added by the target BMC node based on the routing table creation request;
sending a first query request to the guide BMC node, wherein the first query request is used for acquiring node information of each BMC node in the distributed network from the guide BMC node;
receiving a plurality of pieces of first node information fed back by the guide BMC node based on the first query request, wherein the first node information comprises node identifiers corresponding to all BMC nodes;
and establishing the routing table based on the first node information, wherein the routing table comprises the node identification and the logic distance between the target BMC node and the BMC node corresponding to the node identification.
2. The method of claim 1, wherein prior to sending a query request to the bootstrapping BMC node, the method further comprises:
acquiring a target node identifier corresponding to the target BMC node;
and sending the target node identification to the guide BMC node, so that the guide BMC node updates a routing table stored in the guide BMC node based on the target node identification, and sends the target node identification to each BMC node in the distributed network.
3. The method of claim 2, wherein the establishing the routing table based on the first node information comprises:
acquiring node identifiers corresponding to all BMC nodes from the first node information;
calculating the logic distance between the target BMC node and each BMC node based on the target node identifier and each node identifier;
and establishing the routing table based on the logical distance and the node identification.
4. The method of claim 3, wherein the calculating the logical distance between the target BMC node and each BMC node based on the target node identification and each node identification comprises:
calculating the longest public prefix between the target BMC node and each BMC node based on the target node identifier and each node identifier;
and determining the logic distance between the target BMC node and each BMC node according to the longest common prefix, wherein the longest common prefix is in inverse proportion to the logic distance.
5. The method of claim 1, wherein after establishing the routing table based on the first node information, the method further comprises:
determining stored BMC nodes in the routing table;
sending a second query request to the stored BMC node, wherein the second query request is used for acquiring node information of each BMC node in the distributed network from the stored BMC node;
receiving second node information fed back by the stored BMC node based on the second query request;
and updating the routing table based on the second node information until the routing table stores node information of all BMC nodes in the distributed network.
6. The method according to claim 1, wherein the method further comprises:
server information from any BMC node in the distributed network is received;
storing the server information, and analyzing the server information to obtain an analysis result;
and executing an exception handling operation under the condition that the analysis result is used for indicating that the server information is abnormal.
7. A processing apparatus for server information, comprising:
the monitoring module is used for monitoring a target server to obtain server information corresponding to the target server, wherein the target server is a server associated with a target BMC node;
the acquisition module is used for acquiring fault information in the target server from the server information;
the query module is used for querying the routing table stored by the target BMC node and acquiring a plurality of BMC nodes in the distributed network where the target BMC node is located from the routing table;
the sending module is used for sending the server information and the fault information to a plurality of BMC nodes in the distributed network so that the BMC nodes store the server information and execute corresponding fault processing operation according to the fault information;
the server information processing device further includes: the creating module is used for acquiring a routing table creating request and determining a guiding BMC node in the distributed network which is requested to be added by the target BMC node based on the routing table creating request; sending a first query request to the guide BMC node, wherein the first query request is used for acquiring node information of each BMC node in the distributed network from the guide BMC node; receiving a plurality of pieces of first node information which guide the BMC node to feed back based on a first query request, wherein the first node information comprises node identifiers corresponding to all BMC nodes; and establishing a routing table based on the first node information, wherein the routing table comprises the node identification and the logic distance between the target BMC node and the BMC node corresponding to the node identification.
8. A storage medium comprising a stored program, wherein the program when run performs the method of any one of the preceding claims 1 to 6.
9. The electronic equipment is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus; wherein:
a memory for storing a computer program;
a processor for performing the method of any of claims 1-6 by running a program stored on a memory.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210155993.4A CN114584454B (en) | 2022-02-21 | 2022-02-21 | Processing method and device of server information, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210155993.4A CN114584454B (en) | 2022-02-21 | 2022-02-21 | Processing method and device of server information, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114584454A CN114584454A (en) | 2022-06-03 |
| CN114584454B true CN114584454B (en) | 2023-08-11 |
Family
ID=81770903
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210155993.4A Active CN114584454B (en) | 2022-02-21 | 2022-02-21 | Processing method and device of server information, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114584454B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116170346A (en) * | 2022-12-27 | 2023-05-26 | 天翼云科技有限公司 | Monitoring method and device and electronic equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108289041A (en) * | 2018-01-25 | 2018-07-17 | 郑州云海信息技术有限公司 | A kind of processing method and relevant apparatus of server info |
| CN110535692A (en) * | 2019-08-12 | 2019-12-03 | 华为技术有限公司 | Fault handling method, device, computer equipment, storage medium and storage system |
| CN112463448A (en) * | 2020-11-27 | 2021-03-09 | 苏州浪潮智能科技有限公司 | Distributed cluster database synchronization method, device, equipment and storage medium |
-
2022
- 2022-02-21 CN CN202210155993.4A patent/CN114584454B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108289041A (en) * | 2018-01-25 | 2018-07-17 | 郑州云海信息技术有限公司 | A kind of processing method and relevant apparatus of server info |
| CN110535692A (en) * | 2019-08-12 | 2019-12-03 | 华为技术有限公司 | Fault handling method, device, computer equipment, storage medium and storage system |
| CN112463448A (en) * | 2020-11-27 | 2021-03-09 | 苏州浪潮智能科技有限公司 | Distributed cluster database synchronization method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114584454A (en) | 2022-06-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2020173080A1 (en) | Method and apparatus for querying call chain information | |
| CN107748790B (en) | Online service system, data loading method, device and equipment | |
| US20090287800A1 (en) | Method, device and system for managing network devices | |
| CN114584454B (en) | Processing method and device of server information, electronic equipment and storage medium | |
| CN112764956B (en) | Database exception handling system, database exception handling method and device | |
| CN111367691B (en) | Data feedback method and device, electronic equipment and storable medium | |
| CN115080272A (en) | Business data processing method, electronic device and storage medium | |
| CN114244694A (en) | Intelligent management method, system and equipment for network port and readable storage medium | |
| CN113315852B (en) | Domain name resolution method, device and system | |
| CN116662022B (en) | Distributed message processing method, system, device, communication equipment and storage medium | |
| CN111614701B (en) | Distributed cluster and container state switching method and device | |
| CN117290557A (en) | Data loading method, related device, equipment and readable storage medium | |
| CN114338794B (en) | Service message pushing method and device, electronic equipment and storage medium | |
| CN115037653B (en) | Service flow monitoring method, device, electronic equipment and storage medium | |
| CN110955460A (en) | Service process starting method and device, electronic equipment and storage medium | |
| CN110798492B (en) | Data storage method and device and data processing system | |
| CN113055213A (en) | Alarm information management method, alarm information management system and server | |
| CN114356211B (en) | Storage space processing method and device, electronic equipment and storage medium | |
| JP4228772B2 (en) | Network monitoring method and network monitoring apparatus | |
| CN114090293A (en) | Service providing method and electronic equipment | |
| CN111064609A (en) | Master-slave switching method and device of message system, electronic equipment and storage medium | |
| CN113542319A (en) | Service providing entity change notification method, device and system used in Dubbo framework | |
| CN112506740B (en) | Cloud alarm method, electronic equipment, storage medium and cloud alarm device | |
| CN114745421B (en) | Method, device, server and storage medium for recording fission path data | |
| CN115914394B (en) | Task information acquisition method and device, electronic equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |