CN112671593B - Server management method and related equipment - Google Patents

Server management method and related equipment Download PDF

Info

Publication number
CN112671593B
CN112671593B CN202110062995.4A CN202110062995A CN112671593B CN 112671593 B CN112671593 B CN 112671593B CN 202110062995 A CN202110062995 A CN 202110062995A CN 112671593 B CN112671593 B CN 112671593B
Authority
CN
China
Prior art keywords
servers
iou
server
connection
degree
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
Application number
CN202110062995.4A
Other languages
Chinese (zh)
Other versions
CN112671593A (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.)
China Travelsky Technology Co Ltd
Original Assignee
China Travelsky 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 China Travelsky Technology Co Ltd filed Critical China Travelsky Technology Co Ltd
Priority to CN202110062995.4A priority Critical patent/CN112671593B/en
Publication of CN112671593A publication Critical patent/CN112671593A/en
Application granted granted Critical
Publication of CN112671593B publication Critical patent/CN112671593B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The embodiment of the application discloses a management method and related equipment of servers, which can acquire corresponding process data and network connection data from a plurality of servers, classify the servers by using the process data, determine the connection relation between the servers by using the network connection data, determine an out-degree set and an in-degree set of the servers according to the connection relation, divide server groups for the servers according to the classification result, the out-degree set and the in-degree set of the servers, and deduce the connection relation between the server groups by using the connection relation between the servers. In the invention, the automatic classification, grouping and combing connection relation of the servers are realized by analyzing and processing the process data and the network connection data in the servers, thereby greatly improving the efficiency.

Description

Server management method and related equipment
Technical Field
The embodiment of the application relates to the technical field of computers, in particular to a management method of a server and related equipment.
Background
With the explosive growth of internet product scale, the corresponding business requirements are more and more, and therefore the number of business servers is rapidly increased, and the increase brings huge working pressure to operation and maintenance departments of large-scale data centers.
The server type is complex, and can be divided into a JBoss server, an Apache server Oracle server, a MySQL server and the like. And the classification and connection relation of each server need to be combed manually, which consumes a lot of time and manpower and has low efficiency.
Disclosure of Invention
The embodiment of the application provides a management method of a server and related equipment, which are used for automatically classifying, grouping and combing connection relations of a plurality of servers.
In order to achieve the above purpose, the invention provides the following specific technical scheme:
in a first aspect, an embodiment of the present application provides a method for managing a server, where the method includes:
acquiring process data and network connection data in a plurality of servers;
classifying the servers according to the process data to obtain a classification result;
determining a first connection relation between the servers according to the network connection data, wherein the first connection relation comprises a connection direction and connection times;
determining an out-degree set and an in-degree set of the server according to the connection direction and the connection times;
grouping the servers according to the classification result, the out-degree set and the in-degree set to obtain different server groups;
and determining a second connection relation among the server groups according to the first connection relation.
In a second aspect, an embodiment of the present application provides a server management system, where the server management system includes:
an acquisition unit configured to acquire process data and network connection data in a plurality of servers;
the classification unit is used for classifying the servers according to the process data to obtain a classification result;
a first determining unit, configured to determine a first connection relationship between the servers according to the network connection data, where the first connection relationship includes a connection direction and a connection frequency;
a second determining unit, configured to determine an out-degree set and an in-degree set of the server according to the connection direction and the connection times;
the grouping unit is used for grouping the servers according to the classification result, the out-degree set and the in-degree set to obtain different server groups;
and the third determining unit is used for determining a second connection relation among the server groups according to the first connection relation.
In a third aspect, an embodiment of the present application provides a computer-readable storage medium, which includes instructions that, when executed on a computer, cause the computer to perform the method according to the first aspect.
In a fourth aspect, the present application provides a computer program product, which when executed on a computer, executes the method of the first aspect.
According to the technical scheme, the management method of the servers and the related equipment can obtain corresponding process data and network connection data from a plurality of servers, classify the servers by using the process data, determine the connection relation between the servers by using the network connection data, determine the out-degree set and the in-degree set of the servers according to the connection relation, divide the servers into server groups according to the classification result, the out-degree set and the in-degree set of the servers, and deduce the connection relation between the server groups by using the connection relation between the servers. In the invention, the automatic classification, grouping and combing connection relation of the servers are realized by analyzing and processing the process data and the network connection data in the servers, thereby greatly improving the efficiency.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and features are not necessarily drawn to scale.
FIG. 1 is a schematic diagram of an embodiment of a method for managing a server in the present application;
FIG. 2 is a schematic diagram of a server management system according to the present application;
fig. 3 is another schematic structural diagram of the server management system in the present application.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein, but rather are provided for a more complete and thorough understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
The term "including" and variations thereof as used herein is intended to be open-ended, i.e., "including but not limited to". The term "based on" is "based, at least in part, on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". Relevant definitions for other terms will be given in the following description.
It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.
The terms "first," "second," and the like in the description and claims of this application and in the foregoing drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It should be understood that the data so used may be interchanged where appropriate, this merely describing the manner in which objects of the same nature are distinguished in the embodiments of the application.
Referring to fig. 1, an embodiment of the present application provides a method for managing a server, which is implemented as follows:
101. acquiring process data and network connection data in a plurality of servers;
in the invention, the process data and the network connection data on the plurality of servers can be acquired through the data acquisition script. Because the number of the servers is large, and the information amount of the process data and the network connection data included in the servers is large, in practical application, the process data and the network connection data in a specified time can be collected regularly in a timing task mode.
102. Classifying the servers according to the process data to obtain a classification result;
the server is various and complex in type, and in the application, the collected process data can be analyzed, and the characteristics of the server are extracted, so that the product types of the server are divided.
Specifically, feature extraction can be performed according to the previous process data of each type of server, and a set of classification logic is designed. For example, the features of each type of server may be made into a decision tree classification model, feature tags extracted from the process data may be matched with the decision tree classification model one by one, hit tags may be recorded, and the servers may be classified, for example, into a JBoss server, an Apache server, an Oracle server, a MySQL server, and the like.
103. Determining a first connection relation between the servers according to the network connection data, wherein the first connection relation comprises a connection direction and connection times;
in the application, the server is divided into a server side server and a client side server, and is used for indicating the connection direction between the servers. Specifically, in the network connection data, if the ip and the port of the server belong to the monitoring port, it may be determined that the server is a server-side server, and if the ip and the port of the server do not belong to the monitoring port, it may be determined that the server is a client-side server.
Furthermore, network connection data often includes a server ip and a public network ip which are connected by the local computer, and the data is meaningless and can be filtered and cleaned.
After the server is divided into a server-side server and a client-side server, the connection times between the server-side server and the client-side server are counted. In practical application, because the information amount of the network connection data is large, the network connection data can be subjected to batch statistics, and the connection times of all batches are subjected to accumulation statistics to obtain the connection times between the server side server and the client side server in the network connection data.
In the present application, the connection direction and the connection frequency between servers are used as the connection relationship between servers. Furthermore, the connection relation between the services can be derived according to the connection relation between the servers. Because of each service, there are often multiple servers. In the application, the connection times of the server set corresponding to each service can be calculated first, and the connection times are averaged according to the number of the servers in the server set, and the average value is used as the weight of the connection relationship between the services.
104. Determining an out-degree set and an in-degree set of the server according to the connection direction and the connection times;
according to the connection direction and the connection times of the server determined in step 103, the out-degree set and the in-degree set of the server can be determined. The out-degree set refers to a set of other servers to which the server is actively connected, and the in-degree set refers to a set of other servers to which the server is actively connected.
In the embodiment of the present application, the execution order of step 102 is not limited. For example, step 102 may be performed before step 103 and step 104, and may also be performed after step 103 and step 104, which is not limited herein.
105. Grouping the servers according to the classification result, the out-degree set and the in-degree set to obtain a server group;
in the present application, the out-degree set and the in-degree set may be utilized to calculate the similarity between the servers, and the servers with the similarity satisfying the threshold are classified into the same server group according to the classification result obtained in step 102.
In the embodiment of the application, each server is compared one by one in a way that the two servers compare the similarity with each other until all the servers are processed. Specifically, two servers are selected, a first server and a second server are used, the out-degree set and the in-degree set of the two servers are substituted into a first formula, and the out-degree intersection ratio and the in-degree intersection ratio between the two servers are calculated. The first formula is:
Figure BDA0002903037830000041
wherein the IOU Go out In order to obtain the output cross-correlation ratio, A Go out For a first out-of-order set of the servers, B Go out For an out-of-measure set of a second one of the servers, the # > is an intersection symbol, and the # > is a union symbol;
Figure BDA0002903037830000042
wherein the IOU Into For the cross-over ratio of the penetration degree, the A Go into For the first one of the servers, the B Into And the n is an intersection symbol and the U is a union symbol.
In general, the out-degree intersection set between two servers is divided by the out-degree union set to obtain the out-degree union ratio between the servers, and the in-degree intersection set between the two servers is divided by the in-degree union set to obtain the in-degree union ratio between the servers. And substituting the calculated output degree intersection ratio and the calculated input degree intersection ratio into a second formula to obtain the similarity between the two servers, wherein the second formula is as follows:
if the IOU is Go out Greater than 0, the IOU Go into Greater than 0,S = IOU Go out +IOU Go into And the S is the similarity;
if the IOU is Go out Greater than 0, the IOU Go into Equal to 0,S =2 IOU Go out And the S is the similarity;
if the IOU is Go out Equal to 0, the IOU Go into Greater than 0,S =2 IOU Into And the S is the similarity;
as shown in the second formula, to avoid the case of unidirectional connection, if one of the out-degree cross-over ratio and the in-degree cross-over ratio is zero, the other is multiplied by 2 when calculating the similarity.
When the calculated similarity is greater than or equal to 1, the similarity of the two servers is considered to reach the threshold value, and generally, the two servers can be divided into the same server group. However, in the embodiment of the present application, the servers belonging to different categories in step 102 will not be divided into the same server group.
In order to make the obtained server group more clear and more intuitive, in practical applications, the server group may be further divided according to the services to which the servers belong, for example, the servers belonging to the same service can be divided into the same server group.
After the server groups are divided, further, in the embodiment of the present application, the grouping may be performed in a maximum clustering manner, that is, as long as the similarity between one server and one of the servers in the existing server group reaches a threshold, the server group may be divided into the server groups. For example, there are four servers, m1, m2, m3, m 4. The similarity between m1 and m2 is 1.1, the similarity between m2 and m3 is 1.2, the similarity between m3 and m4 is 1.3, and finally m1, m2, m3 and m4 are all divided into one group. Because the similarity between m1 and m2 is greater than or equal to 1, m1 and m2 are divided into one group; because m2 and m3 similarity is more than or equal to 1,m3, the similarity can be classified into the group of m1 and m 2; since m3 and m4 are similar to each other by 1 or more, m4 is classified into the group of m1, m2, and m 3.
106. And determining a second connection relation among the server groups according to the first connection relation.
Similar to step 103, in the present application, the connection relationship between the server groups can be derived according to the connection relationship between the servers. In the present application, the number of connections of the server sets included in each server group may be calculated first, and the number of connections may be averaged according to the number of servers in the server sets, and the average may be used as the weight of the connection relationship between the server groups.
In the embodiment of the application, corresponding process data and network connection data can be obtained from a plurality of servers, the servers are classified by the process data, the connection relation between the servers is determined by the network connection data, the server groups are divided according to the output set and the input set of the servers determined in the connection relation, the classification results of the servers, the output set and the input set, and the connection relation between the server groups is deduced by the connection relation between the servers. In the invention, the automatic classification, grouping and combing connection relation of the servers are realized by analyzing and processing the process data and the network connection data in the servers, thereby greatly improving the efficiency.
Furthermore, as the first connection relation between the servers and the second connection relation between the services to which the servers belong are obtained through the analysis of the network connection data and the process data, a plurality of server groups are divided, and the third connection relation between the server groups is deduced. In order to make the data more intuitive and clearer, the architecture diagram of the server can be drawn based on the three dimensions of the first connection relation, the second connection relation and the third connection relation.
Illustratively, the architecture diagram may be divided into four levels: the first layer is used for displaying non-monitoring services related to the services, namely an access service layer; the second layer is used for showing a server and a server group used for data processing in the business, namely a processing layer; the third layer is used for showing servers and server groups used for data storage in the business, namely a data storage exchange layer; and the fourth layer is used for displaying the monitoring service related to the service.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the messages or information.
Referring to fig. 2, a server management system in an embodiment of the present application is described below, where the server management system includes:
an acquisition unit 201 configured to acquire process data and network connection data in a plurality of servers; for a specific implementation manner, please refer to step 101 in the embodiment shown in fig. 1, which is not described herein again.
A classifying unit 202, configured to classify the server according to the process data to obtain a classification result; for a specific implementation manner, please refer to step 102 in the embodiment shown in fig. 1, which is not described herein again.
A first determining unit 203, configured to determine a first connection relationship between the servers according to the network connection data, where the first connection relationship includes a connection direction and a connection frequency; for a specific implementation manner, please refer to step 103 in the embodiment shown in fig. 1, which is not described herein again.
A second determining unit 204, configured to determine an out-degree set and an in-degree set of the server according to the connection direction and the connection times; for a specific implementation manner, please refer to step 104 in the embodiment shown in fig. 1, which is not described herein again.
A grouping unit 205, configured to group the servers according to the classification result, the out-degree set, and the in-degree set, so as to obtain different server groups; please refer to step 105 in the embodiment shown in fig. 1, which is not described herein again.
A third determining unit 206, configured to determine a specific implementation manner of the second connection relationship between the server groups according to the first connection relationship, please refer to step 106 in the embodiment shown in fig. 1, which is not described herein again.
In an optional implementation manner, the grouping unit is specifically configured to:
substituting the out-degree set and the in-degree set into a first formula, and calculating an out-degree intersection ratio and an in-degree intersection ratio between the servers, wherein the first formula is as follows:
Figure BDA0002903037830000061
wherein the IOU Go out In order to obtain the output cross-correlation ratio, A Go out For a first out-of-order set of the servers, B Go out For an out-of-measure set of a second one of the servers, the # > is an intersection symbol, and the # > is a union symbol;
Figure BDA0002903037830000062
wherein the IOU Into For the cross-over ratio of the entry degrees, the Go into For the first one of the servers, the B Go into For an incoming set of the second one of the servers, the ≧ is an intersection symbol, and the ≦ is a union symbol;
substituting the output degree intersection ratio and the input degree intersection ratio into a second formula to calculate the similarity between the servers, wherein the second formula is as follows:
if the IOU is Go out Greater than 0, the IOU Into Greater than 0,S = IOU Go out +IOU Into And the S is the similarity;
if the IOU is Go out Greater than 0, the IOU Into Equal to 0,S =2 IOU Go out And the S is the similarity;
if the IOU is Go out Equal to 0, the IOU Into Greater than 0,S =2 IOU Go into And the S is the similarity;
and dividing the servers which belong to the same classification in the classification result into the same server group, wherein the similarity in the servers is greater than 1.
In an optional implementation manner, the server management system further includes a fourth determining unit 207.
A fourth determining unit 207, configured to determine, according to the first connection relationship, a third connection relationship between the services to which the server belongs.
In an optional embodiment, the server management system further includes a drawing unit 208.
A drawing unit 208, configured to draw the architecture diagram of the server according to the first connection relationship, the second connection relationship, and the third connection relationship.
In this embodiment, the server management system may perform the operations described in any one of the embodiments shown in fig. 1, which is not described herein again.
The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems on a chip (SOCs), complex Programmable Logic Devices (CPLDs), and the like.
The present application also provides a computer-readable storage medium storing one or more computer-executable instructions that, when executed by a processor, cause the processor to perform a method as described above in the possible implementation of the embodiment shown in any one of fig. 1.
It should be noted that the computer readable medium of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may include, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device.
In particular, the processes described above with reference to the flow diagrams may be implemented as computer software programs, according to embodiments of the present disclosure. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a non-transitory computer readable medium, the computer program containing program code for performing the method illustrated in fig. 1.
Example 1 provides, in accordance with one or more embodiments of the present disclosure, a method of managing a server, including:
acquiring process data and network connection data in a plurality of servers;
classifying the servers according to the process data to obtain a classification result;
determining a first connection relation between the servers according to the network connection data, wherein the first connection relation comprises a connection direction and connection times;
determining an out-degree set and an in-degree set of the server according to the connection direction and the connection times;
grouping the servers according to the classification result, the out-degree set and the in-degree set to obtain a server group;
and determining a second connection relation among the server groups according to the first connection relation.
Example 2 provides the method of example 1, the grouping the servers according to the classification results, the out-degree sets, and the in-degree sets including:
substituting the out-degree set and the in-degree set into a first formula, and calculating an out-degree intersection ratio and an in-degree intersection ratio between the servers, wherein the first formula is as follows:
Figure BDA0002903037830000071
wherein the IOU Go out For the out-degree cross-over ratio, the A Go out For a first out-of-order set of the servers, B Go out For an out-of-measure set of a second one of the servers, the # > is an intersection symbol, and the # > is a union symbol;
Figure BDA0002903037830000072
wherein the IOU Into For the cross-over ratio of the penetration degree, the A Go into Is the entry set of the first server, B Go into For the incoming degree set of the second server, n is an intersection symbol, and u is a union symbol;
substituting the out-degree intersection ratio and the in-degree intersection ratio into a second formula to calculate the similarity between the servers, wherein the second formula is as follows:
if the IOU is Go out Greater than 0, the IOU Go into Greater than 0,S = IOU Go out +IOU Go into And the S is the similarity;
if the IOU is Go out Greater than 0, the IOU Go into Equal to 0,S =2 IOU Go out And the S is the similarity;
if the IOU is Go out Equal to 0, the IOU Into Greater than 0,S =2 IOU Go into And the S is the similarity;
and dividing the servers which belong to the same classification in the classification result into the same server group, wherein the similarity in the servers is greater than 1.
Example 3 provides the method of example 1 or example 2, further comprising, in accordance with one or more embodiments of the present disclosure:
and determining a third connection relation between the services of the server according to the first connection relation.
Example 4 provides the method of example 3, further comprising, in accordance with one or more embodiments of the present disclosure:
and drawing an architecture diagram of the server according to the first connection relation, the second connection relation and the third connection relation.
Example 5 provides, in accordance with one or more embodiments of the present disclosure, a server management system, comprising:
an acquisition unit configured to acquire process data and network connection data in a plurality of servers;
the classification unit is used for classifying the servers according to the process data to obtain a classification result;
a first determining unit, configured to determine a first connection relationship between the servers according to the network connection data, where the first connection relationship includes a connection direction and a connection frequency;
a second determining unit, configured to determine an out-degree set and an in-degree set of the server according to the connection direction and the connection times;
the grouping unit is used for grouping the servers according to the classification result, the out-degree set and the in-degree set to obtain different server groups;
and the third determining unit is used for determining a second connection relation among the server groups according to the first connection relation.
Example 6 provides the server management system of example 5, in accordance with one or more embodiments of the present disclosure, the grouping unit to be specifically configured to:
substituting the out-degree set and the in-degree set into a first formula, and calculating an out-degree intersection ratio and an in-degree intersection ratio between the servers, wherein the first formula is as follows:
Figure BDA0002903037830000081
wherein the IOU Go out For the out-degree cross-over ratio, the A Go out For a first out-of-order set of the servers, B Go out For an out-of-measure set of a second one of the servers, the # > is an intersection symbol, and the # > is a union symbol;
Figure BDA0002903037830000082
wherein the IOU Go into For the cross-over ratio of the entry degrees, the Into For the first one of the servers, the B Into For the introspection set of the second server in the servers, n is an intersection symbol, and u is a union symbol;
substituting the output degree intersection ratio and the input degree intersection ratio into a second formula to calculate the similarity between the servers, wherein the second formula is as follows:
if the IOU is Go out Greater than 0, the IOU Into Greater than 0,S = IOU Go out +IOU Into And the S is the similarity;
if the IOU is Go out Greater than 0, the IOU Into Equal to 0,S =2 IOU Go out And the S is the similarity;
if the IOU is Go out Equal to 0, the IOU Into Greater than 0,S =2 IOU Into And the S is the similarity;
and dividing the servers which belong to the same classification in the classification result into the same server group, wherein the similarity in the servers is greater than 1.
Example 7 provides the server management system of example 5 or example 6, in accordance with one or more embodiments of the present disclosure, further comprising:
and the fourth determining unit is used for determining a third connection relation between the services to which the server belongs according to the first connection relation.
Example 8 provides the server management system of example 7, the server management system further comprising, in accordance with one or more embodiments of the present disclosure:
and the drawing unit is used for drawing the architecture diagram of the server according to the first connection relation, the second connection relation and the third connection relation.
Example 9 provides, in accordance with one or more embodiments of the present disclosure, a computer-readable storage medium comprising instructions that, when executed on a computer, cause the computer to perform the method of any one of examples 1 to 4.
Example 10 provides, in accordance with one or more embodiments of the present disclosure, a computer program product containing instructions which, when run on a computer, cause the computer to perform the method of any of examples 1 to 4.
Fig. 3 is a schematic structural diagram of a server management system according to an embodiment of the present disclosure, where the server management system 300 may include one or more Central Processing Units (CPUs) 301 and a memory 305, and the memory 305 stores one or more application programs or data.
Memory 305 may be volatile storage or persistent storage, among other things. The program stored in memory 305 may include one or more modules, each of which may include a sequence of instructions operating on the code modules. Still further, central processor 301 may be configured to communicate with memory 305 to execute a series of instruction operations in memory 305 on server management system 300.
The server management system 300 may also include one or more power supplies 302, one or more wired or wireless network interfaces 303, one or more input-output interfaces 304, and/or one or more operating systems, such as Windows Server, mac OS XTM, unixTM, linuxTM, freeBSDTM, etc.
The server management system 300 or the central processing unit 301 may perform the operations performed by the server management system in the embodiment shown in fig. 1, which are not described herein again.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
While several specific implementation details are included in the above discussion, these should not be construed as limitations on the scope of the disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other embodiments in which any combination of the features described above or their equivalents does not depart from the spirit of the disclosure. For example, the above features and the technical features disclosed in the present disclosure (but not limited to) having similar functions are replaced with each other to form the technical solution.

Claims (7)

1. A method for managing a server, the method comprising:
acquiring process data and network connection data in a plurality of servers;
classifying the servers according to the process data to obtain a classification result;
determining a first connection relation between the servers according to the network connection data, wherein the first connection relation comprises a connection direction and connection times;
determining an out-degree set and an in-degree set of the server according to the connection direction and the connection times;
grouping the servers according to the classification result, the out-degree set and the in-degree set to obtain a server group;
determining a second connection relation among the server groups according to the first connection relation;
wherein the grouping the servers according to the classification result, the out-degree set and the in-degree set comprises:
substituting the out-degree set and the in-degree set into a first formula, and calculating out-degree intersection ratio and in-degree intersection ratio between the servers, wherein the first formula is as follows:
Figure FDA0003998551730000011
wherein the IOU Go out For the out-degree cross-over ratio, the A Go out For a first out-of-order set of the servers, B Go out For an out-degree set of a second one of the servers, the ≧ is an intersection symbol, and the ≦ is a union symbol;
Figure FDA0003998551730000012
wherein the IOU Go into For the cross-over ratio of the penetration degree, the A Into Is the entry set of the first server, B Into The # is an intersection symbol and the #is a union symbol;
substituting the output degree intersection ratio and the input degree intersection ratio into a second formula to calculate the similarity between the servers, wherein the second formula is as follows:
if the IOU is Go out Greater than 0, the IOU Into Greater than 0,S = IOU Go out +IOU Into And the S is the similarity;
if the IOU is Go out Greater than 0, the IOU Into Equal to 0,S =2 IOU Go out And the S is the similarity;
if the IOU is Go out Equal to 0, the IOU Into Greater than 0,S =2 IOU Into And the S is the similarity;
and dividing the servers which belong to the same classification in the classification result into the same server group, wherein the similarity in the servers is greater than 1.
2. The method of claim 1, further comprising:
and determining a third connection relation between the services of the server according to the first connection relation.
3. The method of claim 2, further comprising:
and drawing an architecture diagram of the server according to the first connection relation, the second connection relation and the third connection relation.
4. A server management system, characterized in that the server management system comprises:
an acquisition unit configured to acquire process data and network connection data in a plurality of servers;
the classification unit is used for classifying the servers according to the process data to obtain a classification result;
a first determining unit, configured to determine a first connection relationship between the servers according to the network connection data, where the first connection relationship includes a connection direction and a connection frequency;
a second determining unit, configured to determine an out-degree set and an in-degree set of the server according to the connection direction and the connection times;
the grouping unit is used for grouping the servers according to the classification result, the out-degree set and the in-degree set to obtain different server groups;
a third determining unit, configured to determine a second connection relationship between the server groups according to the first connection relationship;
wherein the grouping unit is specifically configured to:
substituting the out-degree set and the in-degree set into a first formula, and calculating an out-degree intersection ratio and an in-degree intersection ratio between the servers, wherein the first formula is as follows:
Figure FDA0003998551730000021
wherein the IOU Go out In order to obtain the output cross-correlation ratio, A Go out For a first out-of-order set of the servers, B Go out For an out-of-measure set of a second one of the servers, the # > is an intersection symbol, and the # > is a union symbol;
Figure FDA0003998551730000022
wherein the IOU Go into For the cross-over ratio of the entry degrees, the Into For the first one of the servers, the B Into For an incoming set of the second one of the servers, the ≧ is an intersection symbol, and the ≦ is a union symbol;
substituting the out-degree intersection ratio and the in-degree intersection ratio into a second formula to calculate the similarity between the servers, wherein the second formula is as follows:
if the IOU is Go out Greater than 0, the IOU Into Greater than 0,S = IOU Go out +IOU Into And the S is the similarity;
if the IOU is Go out Greater than 0, the IOU Into Equal to 0,S =2 IOU Go out And the S is the similarity;
if the IOU is Go out Equal to 0, the IOU Into Greater than 0,S =2 IOU Into And the S is the similarity;
and dividing the servers which belong to the same classification in the classification result into the same server group, wherein the similarity in the servers is greater than 1.
5. The server management system according to claim 4, wherein the server management system further comprises:
and the fourth determining unit is used for determining a third connection relation between the services to which the server belongs according to the first connection relation.
6. The server management system according to claim 5, wherein the server management system further comprises:
and the drawing unit is used for drawing the architecture diagram of the server according to the first connection relation, the second connection relation and the third connection relation.
7. A computer-readable storage medium comprising instructions that, when executed on a computer, cause the computer to perform the method of any of claims 1 to 3.
CN202110062995.4A 2021-01-18 2021-01-18 Server management method and related equipment Active CN112671593B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110062995.4A CN112671593B (en) 2021-01-18 2021-01-18 Server management method and related equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110062995.4A CN112671593B (en) 2021-01-18 2021-01-18 Server management method and related equipment

Publications (2)

Publication Number Publication Date
CN112671593A CN112671593A (en) 2021-04-16
CN112671593B true CN112671593B (en) 2023-04-07

Family

ID=75415499

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110062995.4A Active CN112671593B (en) 2021-01-18 2021-01-18 Server management method and related equipment

Country Status (1)

Country Link
CN (1) CN112671593B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108427956A (en) * 2017-02-14 2018-08-21 腾讯科技(深圳)有限公司 A kind of clustering objects method and apparatus

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10084645B2 (en) * 2015-11-30 2018-09-25 International Business Machines Corporation Estimating server-change risk by corroborating historic failure rates, predictive analytics, and user projections
US10834182B2 (en) * 2017-03-29 2020-11-10 International Business Machines Corporation Managing idle and active servers in cloud data centers

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108427956A (en) * 2017-02-14 2018-08-21 腾讯科技(深圳)有限公司 A kind of clustering objects method and apparatus

Also Published As

Publication number Publication date
CN112671593A (en) 2021-04-16

Similar Documents

Publication Publication Date Title
CN109587008B (en) Method, device and storage medium for detecting abnormal flow data
CN111352808B (en) Alarm data processing method, device, equipment and storage medium
CN110941978B (en) Face clustering method and device for unidentified personnel and storage medium
WO2021109724A1 (en) Log anomaly detection method and apparatus
CN111064719B (en) Method and device for detecting abnormal downloading behavior of file
CN110807050B (en) Performance analysis method, device, computer equipment and storage medium
CN111400448A (en) Method and device for analyzing incidence relation of objects
EP3009942A1 (en) Social contact message monitoring method and device
CN113282433B (en) Cluster anomaly detection method, device and related equipment
CN114461792A (en) Alarm event correlation method, device, electronic equipment, medium and program product
CN112612832B (en) Node analysis method, device, equipment and storage medium
CN117294497A (en) Network traffic abnormality detection method and device, electronic equipment and storage medium
CN112671593B (en) Server management method and related equipment
CN112532625A (en) Network situation awareness evaluation data updating method and device and readable storage medium
CN115589339B (en) Network attack type identification method, device, equipment and storage medium
CN109597826B (en) Data processing method and device, electronic equipment and computer readable storage medium
CN116668264A (en) Root cause analysis method, device, equipment and storage medium for alarm clustering
CN116739605A (en) Transaction data detection method, device, equipment and storage medium
CN114760190B (en) Service-oriented converged network performance anomaly detection method
CN113259878B (en) Call bill settlement method, system, electronic device and computer readable storage medium
CN113869904A (en) Suspicious data identification method, device, electronic equipment, medium and computer program
CN114385436A (en) Server grouping method and device, electronic equipment and storage medium
CN112750047A (en) Behavior relation information extraction method and device, storage medium and electronic equipment
CN113420170B (en) Multithreading storage method, device, equipment and medium for big data image
CN112560992B (en) Method, device, electronic equipment and storage medium for optimizing picture classification model

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