CN114584454A - Server information processing method and device, electronic equipment and storage medium - Google Patents

Server information processing method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN114584454A
CN114584454A CN202210155993.4A CN202210155993A CN114584454A CN 114584454 A CN114584454 A CN 114584454A CN 202210155993 A CN202210155993 A CN 202210155993A CN 114584454 A CN114584454 A CN 114584454A
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.)
Granted
Application number
CN202210155993.4A
Other languages
Chinese (zh)
Other versions
CN114584454B (en
Inventor
王斯
袁传博
张秀波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Suzhou Inspur Intelligent Technology Co Ltd
Original Assignee
Suzhou Inspur Intelligent Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Suzhou Inspur Intelligent Technology Co Ltd filed Critical Suzhou Inspur Intelligent Technology Co Ltd
Priority to CN202210155993.4A priority Critical patent/CN114584454B/en
Publication of CN114584454A publication Critical patent/CN114584454A/en
Application granted granted Critical
Publication of CN114584454B publication Critical patent/CN114584454B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0631Management 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0677Localisation of faults
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/54Organization of routing tables
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Energy 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 and device, electronic equipment and a storage medium. The method comprises the following steps: monitoring a target server to obtain target server information corresponding to the target server; acquiring fault information existing in a target server from target server information; 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; 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 method and the system, the corresponding server is monitored through the BMC node, the server information is recorded, and the server information is shared to 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.

Description

Server information processing method and device, electronic equipment and storage medium
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for processing server information, an electronic device, and a storage medium.
Background
With the development of computer systems, the internet is applied in various industries in a large amount, the number of servers used is more and more, how to build a server management system to more efficiently manage the servers becomes a problem of important attention of various enterprises, especially internet enterprises using a large number of servers.
The traditional server management system comprises a central node, wherein a set of server management software is set up on the central node, and the software interacts with a BMC (baseboard management controller) on each server so as to acquire server information and control the server. The operation and maintenance personnel of the Internet company maintain huge server information through the 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 server information processing method, a server information processing device, an electronic device and a storage medium.
According to an aspect of the embodiments of the present application, a method for processing server information is provided, where the method is applied to a BMC node, and the BMC node is deployed in a server, and the method includes:
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;
acquiring fault information existing 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 guide BMC node in the distributed network which the target BMC node requests to join based on the routing table creation request;
sending a first query request to the boot BMC node, wherein the first query request is used for acquiring node information of each BMC node in the distributed network from the boot BMC node;
receiving a plurality of first node information fed back by the guide BMC node based on the first query request;
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 identifier 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 sends the target node identifier 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 the BMC nodes from the first node information;
calculating the logical distance between the target BMC node and each BMC node based on the target node identification and each node identification;
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 common prefix between the target BMC node and each BMC node based on the target node identification and each node identification;
and determining the logical distance between the target BMC node and each BMC node according to the longest common prefix, wherein the longest common prefix and the logical distance are in an inverse proportional relation.
Further, after establishing the routing table based on the first node information, the method further includes:
determining a stored BMC node 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 the node information of all BMC nodes in the distributed network.
Further, the method further comprises:
receiving 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 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 embodiments of the present application, there is provided a server information processing apparatus, including:
the system comprises a monitoring module, a target BMC node and a target server, wherein the monitoring module is used for monitoring the target server to obtain server information corresponding to the target server, and the target server is a server associated with the target BMC node;
the acquisition module is used for acquiring fault information existing in the target server from the server information;
the query module is used for querying 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 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 executes the above steps when the program is executed.
According to another aspect of the embodiments of the present application, there is also provided an electronic apparatus, 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; a processor for executing the steps of the method by running the program stored in the memory.
Embodiments of the present application also provide a computer program product containing 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 to 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 present application and together with the description, serve to explain the principles of the application.
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, and it is obvious for those skilled in the art to obtain other drawings without inventive exercise.
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
In order to make the purpose, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be described clearly and completely with reference to the drawings in the embodiments of the present application, it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments, and the illustrative embodiments and descriptions thereof of the present application are used for explaining the present application and do not constitute a limitation to the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It is noted that, in this document, relational terms such as "first" and "second," and the like, may be 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. Also, 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 an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The embodiment of the application provides a server information processing method and device, electronic equipment and a storage medium. The method provided by the embodiment of the invention can be applied to any required electronic equipment, for example, the electronic equipment can be electronic equipment such as a server and a terminal, and the method is not particularly limited herein, and is hereinafter simply referred to as electronic equipment for convenience in description.
According to an aspect of the embodiments of the present application, an 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 the embodiment of the present application, as shown in fig. 1, the method includes:
and step S11, the monitoring target server obtains target server information corresponding to the target server, wherein the target server is a server associated with the target BMC node.
The method provided by the embodiment of the application is applied to a Baseboard Management Controller (BMC) node, and the BMC node is deployed in a server. Specifically, the BMC node deployed on each server is configured to monitor server information of the server where the BMC node is located, and receive server information sent by other BMC nodes in the distributed network.
In this embodiment of the present application, the target server may 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 the server information of the server where the operation data is located.
In step S12, failure information on the target server is acquired from the target server information.
In the embodiment of the application, by analyzing the target server information, data such as network operation data, memory operation data, CPU operation data, and hard disk operation data in the target server information are respectively compared with corresponding preset operation data ranges (the preset operation data ranges are data ranges corresponding to various indexes of the server in a normal operation state), so as to determine whether a fault exists in the target server.
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, the fault information of the target server is determined to be the fault information of the index.
Step S13, querying a routing table stored in the target BMC node, and obtaining a plurality of BMC nodes in the distributed network where the target BMC node is located from the routing table.
In this embodiment of the application, the routing table stored in the target BMC node stores a plurality of BMC nodes in the distributed network where the target BMC node is located, and a logical 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 nodes stored in the routing table include: i node, T node, K node. And the logical distances between the P node and the I node, the T node and the K node are respectively expressed by the Longest Common Prefix (LCP) among node identifications, LCP:2{ I }, LCP:1{ T, K }.
Step 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 handling operations according to the fault information.
In this embodiment of the application, the target BMC node queries 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 operations according to the fault information, specifically, the fault processing operations may be to determine whether a processing policy for solving the fault information exists, and if so, feed the processing policy back to the target BMC node.
In addition, after receiving the fault information, other BMC nodes in the distributed network may also check the server where the node is 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 to 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 this embodiment of the present application, fig. 2 is a flowchart of a method for processing server information provided in this embodiment of the present application, and as shown in fig. 2, the method further includes:
step S21, acquiring the routing table creation request, and determining the boot BMC node in the distributed network that the target BMC node requests to join based on the routing table creation request.
In this embodiment of the present application, the routing table creation request may be directly initiated by a user through a server, where the routing table creation request carries a boot BMC node in the distributed network that the target BMC node requests to join.
In the embodiment of the present application, after obtaining the routing table creation request, the method further includes the following steps a1-a 2:
and A1, acquiring a target node identifier corresponding to the target BMC node.
Step A2, sending the target node identifier to the boot BMC node, so that the boot BMC node updates the routing table stored in the boot BMC node based on the target node identifier, and sends the target node identifier to each BMC node in the distributed network.
In the embodiment of the application, the target node identifier of the target BMC node is a binary data ID of 160 bits, which is used as a unique identifier in the distributed network. And simultaneously, the target BMC node sends the target node identifier to the guide BMC node so that the guide BMC node updates a routing table stored by the guide BMC node, and simultaneously forwards the target node identifier to each BMC node in the distributed network so that each BMC node synchronously updates the routing table.
Step S22, sending a first query request to the boot BMC node, where the first query request is used to obtain node information of each BMC node in the distributed network from the boot BMC node.
Step S23, receiving a plurality of first node information guiding the BMC node to feed back based on the first query request.
In this embodiment of the application, the target BMC node sends the first query request to the boot BMC node, and after receiving the first query request, the boot BMC node feeds back the first node information of each BMC node stored in the boot 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, the step S24, establishing the routing table based on the first node information, includes the following steps B1-B3:
and step B1, acquiring the node identification corresponding to each BMC node from the first node information.
And step B2, calculating the logical distance between the target BMC node and each BMC node based on the target node identification and each node identification.
In this embodiment of the present application, step B2, 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 common prefix between the target BMC node and each BMC node based on the target node identification and each node identification, and determining the logical 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 logical distance.
Step B3, a routing table is established 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 node is assigned a unique ID, where the ID is a binary number of 160 bits and can uniquely identify a BMC node. The logical distance between two BMC nodes is represented by the Longest Common Prefix (LCP) of the two BMC IDs. The longer the longest common prefix between the two BMCs, the closer the logical distance of the two BMCs can be considered.
As in fig. 3, A, B has an LCP of 2. As in fig. 3, from the perspective of 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, being an H node, will therefore maintain a routing table
Figure BDA0003512635230000111
Table 1 routing table
In this embodiment, the node information of the BMC node stored in the boot BMC node may not be the node information of all BMC nodes in the distributed network. Therefore, after establishing the routing table based on the first node information, the method further comprises the following steps C1-C4:
step C1, determine the stored BMC node in the routing table.
And step C2, 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.
Step C3, receiving the second node information fed back by the stored BMC node based on the second query request.
And step C4, updating the routing table based on the second node information until the routing table stores the node information of all BMC nodes in the distributed network.
As an example, BMC node H first sets up its own routing table, now adds the bootstrap node to the routing table, assuming that the bootstrap node is C. The BMC node H needs a binary data ID of 160 bits as its unique identifier in the Kademlia distributed network formed by the BMC nodes. The BMC node H sends a query request to the BMC node C to query the BMC node H, namely the BMC node H itself. After receiving the query request of the BMC node H, the BMC node C finds several nodes with the largest LCP and BMC nodes according to the processing steps of the general query request, and returns the nodes to the BMC node H. And after the BMC node H receives the BMC nodes returned by the BMC node C, the BMC nodes are added into the routing table of the BMC node H. The BMC node H continues to send a query request for querying the BMC node to the BMC node in the routing table of the BMC node H, and adds the returned BMC node to the routing table of the BMC node H until a sufficiently detailed routing table is established.
In this embodiment of the present 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 reach the routing information of the BMC node B, the BMC node a needs to obtain the contact information of the node B from other BMC nodes in the distributed network. The method comprises the following specific steps:
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 LCPs (A, B) from the stored routing table, and sends a request for inquiring the BMC node B to the nodes in the group, if the number of the BMC nodes in the group is too small, the query request can be sent to the BMC nodes in the adjacent group.
And 3, if the BMC node receiving the query request comprises the BMC node B, the BMC node B directly sends response information to the target BMC node at the moment. 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 at the moment, and a plurality of nodes are selected from the corresponding LCP group to be responded to the BMC node A.
As an example: for each BMC node that receives the query request, if it is the BMC node B, then it responds that it is the BMC node B. Otherwise, LCP of the self and BMC node B are calculated, and several nodes are selected from the corresponding LCP group to be echoed to the BMC node A.
And 4, after the BMC node A receives the return of each BMC node, if the BMC node B is found, stopping the searching process. Otherwise, the searching is continued according to the maximum LCP nodes of the BMC node A and the BMC node B, and the process is repeated continuously until the BMC node B or the maximum LCP nodes of the BMC node B are found.
And 5, repeating the step 4 to find the BMC node B or find a plurality of nodes with the longest common prefix with the BMC node B.
In this embodiment of the present application, fig. 4 is a flowchart of a method for processing server information provided in this embodiment of the present application, and as shown in fig. 4, the method further includes:
step S31, receiving server information from any BMC node in the distributed network.
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 indicates 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 the distributed network formed by the 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 distribute their own stored routing table data to several nodes with their largest LCPs, so that a message of a node failure can 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 the BMC nodes communicate with each other, so that an autonomous maintenance system is built.
After the nodes of the BMC form the network according to the method, the nodes can communicate with each other, and the current server information stored in each BMC is broadcast 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 method (each BMC only stores the server information of the BMC). When one server is abnormal, even when the BMC on one server is abnormal. The remaining BMCs in the network can immediately take actions such as: saving the log and informing the server user, or directly restarting the server, and the like. 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 through software, hardware, or a combination of the two. 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 fault information existing in the target server from the server information;
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 the distributed network where the target BMC node is located;
the sending module 54 is configured to send 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 handling operations according to the fault information.
In this embodiment of the present application, the apparatus for processing server information further includes: the system comprises a creation module, a routing table creation module and a control module, wherein the creation module is used for acquiring a routing table creation request and determining a guide BMC node in a distributed network which a target BMC node requests to join based on the routing table creation request; sending a first query request to a 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 first node information for guiding the BMC node to feed back based on the first query request; a routing table is established based on the first node information.
In this embodiment, the sending module of the processing device is further configured to obtain 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 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, the creating module is configured to obtain a node identifier corresponding to each BMC node from the first node information; calculating the logical distance between the target BMC node and each BMC node based on the target node identification and each node identification; and establishing a routing table based on the logical distance and the node identification.
In the embodiment of the application, the creating module is configured to calculate a longest common prefix between the target BMC node and each BMC node based on the target node identifier and each node identifier; and determining the logical 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 logical distance.
In this embodiment of the present application, the processing apparatus further includes an update module, configured to determine a stored BMC node 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 the node information of all BMC nodes in the distributed network.
In this embodiment, the processing apparatus further includes an execution module, configured to receive 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 in the case that the analysis result is used for indicating that the server information is abnormal, executing an abnormal processing operation.
An embodiment of the present application further provides an electronic device, as shown in fig. 6, the electronic device may include: 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 complete communication with each other through the communication bus 1504.
A memory 1503 for storing a computer program;
the processor 1501 is configured to implement the steps of the above embodiments when executing the computer program stored in the memory 1503.
The communication bus mentioned in the above terminal may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
The communication interface is used for communication between the terminal and other equipment.
The Memory may include a Random Access Memory (RAM) or a 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 processor.
The Processor may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the Integrated Circuit may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a discrete Gate or transistor logic device, or a discrete hardware component.
In another embodiment provided by the present application, a computer-readable storage medium is further provided, where instructions are stored in the computer-readable storage medium, and when the instructions are executed on a computer, the instructions cause the computer to execute the server information processing method in any one of the above embodiments.
In another embodiment provided by the present application, there is also provided a computer program product containing instructions, which when run on a computer, causes the computer to execute the method for processing server information described in any of the above embodiments.
In the above embodiments, the implementation may be wholly or partially realized 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, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, 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 wire (e.g., coaxial cable, fiber optic, digital subscriber line) or wirelessly (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk), among others.
The above description is only for the preferred embodiment of the present application, and is not intended to limit the scope of the present application. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application are included in the protection scope of the present application.
The above description is merely exemplary of the present application and is presented to enable those skilled in the art to understand and practice the present 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 (10)

1. A method for processing server information is applied to a BMC node, the BMC node is deployed in a server, and the method is characterized by comprising the following steps:
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;
acquiring fault information existing 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.
2. The method of claim 1, further comprising:
acquiring a routing table creation request, and determining a guide BMC node in the distributed network which the target BMC node requests to join based on the routing table creation request;
sending a first query request to the boot BMC node, wherein the first query request is used for acquiring node information of each BMC node in the distributed network from the boot BMC node;
receiving a plurality of first node information fed back by the guide BMC node based on the first query request;
establishing the routing table based on the first node information.
3. The method of claim 2, wherein prior to sending a query request to the boot BMC node, the method further comprises:
acquiring a target node identifier corresponding to the target BMC node;
and sending the target node identifier 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 sends the target node identifier to each BMC node in the distributed network.
4. The method of claim 3, wherein the building the routing table based on the first node information comprises:
acquiring node identifiers corresponding to the BMC nodes from the first node information;
calculating the logical distance between the target BMC node and each BMC node based on the target node identification and each node identification;
establishing the routing table based on the logical distance and the node identification.
5. The method of claim 4, wherein 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 identification and each node identification;
and determining the logical distance between the target BMC node and each BMC node according to the longest common prefix, wherein the longest common prefix and the logical distance are in an inverse proportional relation.
6. The method of claim 2, wherein after establishing the routing table based on the first node information, the method further comprises:
determining a stored BMC node 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 the node information of all BMC nodes in the distributed network.
7. The method of claim 1, further comprising:
receiving 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 exception handling operation under the condition that the analysis result is used for indicating that the server information is abnormal.
8. An apparatus for processing server information, comprising:
the system comprises a monitoring module, a target BMC node and a target server, wherein the monitoring module is used for monitoring the target server to obtain server information corresponding to the target server, and the target server is a server associated with the target BMC node;
the acquisition module is used for acquiring fault information existing in the target server from the server information;
the query module is used for querying 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 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.
9. A storage medium, characterized in that the storage medium comprises a stored program, wherein the program is operative to perform the method steps of any of the preceding claims 1 to 7.
10. An electronic device is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor and the communication interface are used for realizing mutual communication by the memory through the communication bus; wherein:
a memory for storing a computer program;
a processor for performing the method steps of any of claims 1-7 by executing a program stored on a memory.
CN202210155993.4A 2022-02-21 2022-02-21 Processing method and device of server information, electronic equipment and storage medium Active CN114584454B (en)

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 true CN114584454A (en) 2022-06-03
CN114584454B 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)

Cited By (1)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
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

Patent Citations (3)

* Cited by examiner, † Cited by third party
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

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116170346A (en) * 2022-12-27 2023-05-26 天翼云科技有限公司 Monitoring method and device and electronic equipment

Also Published As

Publication number Publication date
CN114584454B (en) 2023-08-11

Similar Documents

Publication Publication Date Title
CN109165136B (en) Terminal operation data monitoring method, terminal device and medium
CN110071978B (en) Cluster management method and device
CN108696581B (en) Distributed information caching method and device, computer equipment and storage medium
WO2020173080A1 (en) Method and apparatus for querying call chain information
CN109618174B (en) Live broadcast data transmission method, device, system and storage medium
CN112445626B (en) Data processing method and device based on message middleware
CN112217847A (en) Micro service platform, implementation method thereof, electronic device and storage medium
CN114584454A (en) Server information processing method and device, electronic equipment and storage medium
CN111355600A (en) Method and device for determining main node
CN109189403B (en) Operating system OS batch installation method and device and network equipment
CN108509296B (en) Method and system for processing equipment fault
CN113055213B (en) Alarm information management method, alarm information management system and server
CN110798492B (en) Data storage method and device and data processing system
US10904327B2 (en) Method, electronic device and computer program product for searching for node
CN110955460A (en) Service process starting method and device, electronic equipment and storage medium
CN111614701B (en) Distributed cluster and container state switching method and device
CN111917870A (en) Request processing method, system, device, electronic equipment and storage medium
CN109451090B (en) Domain name resolution method and device
CN114338794B (en) Service message pushing method and device, electronic equipment and storage medium
CN113254245A (en) Fault detection method and system for storage cluster
CN112711466B (en) Hanging affair inspection method and device, electronic equipment and storage medium
CN114244694A (en) Intelligent management method, system and equipment for network port and readable storage medium
US8020033B2 (en) Logical entity fault isolation in network systems management
CN111400327B (en) Data synchronization method and device, electronic equipment and storage medium
CN114356211A (en) Storage space processing method and device, electronic equipment and 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