CN112953759B - Node optimal resource coverage analysis adjustment method and device and computer equipment - Google Patents
Node optimal resource coverage analysis adjustment method and device and computer equipment Download PDFInfo
- Publication number
- CN112953759B CN112953759B CN202110107600.8A CN202110107600A CN112953759B CN 112953759 B CN112953759 B CN 112953759B CN 202110107600 A CN202110107600 A CN 202110107600A CN 112953759 B CN112953759 B CN 112953759B
- Authority
- CN
- China
- Prior art keywords
- node
- bipartite graph
- area
- edge
- generating
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
- H04L41/0826—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability for reduction of network costs
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Complex Calculations (AREA)
Abstract
The application relates to a node optimal resource coverage analysis adjustment method, a device and computer equipment, wherein the method comprises the steps of constructing a CDN access bipartite graph based on a MISS back source access log of the CDN; calculating and generating a maximum matching bipartite graph through a preset first feasible algorithm based on the constructed CDN access bipartite graph; calculating and generating a minimum coverage node through a preset second feasible algorithm based on the maximum matching bipartite graph generated through calculation; generating an initial node analysis adjustment strategy; and performing preliminary adjustment on the parent layer node based on the generated initial node analysis adjustment strategy, generating a final node adjustment execution decision, and performing final adjustment on the parent layer node based on the final node adjustment execution decision. The method and the device realize the coverage deployment matching of monitoring and adjusting CDN node resources so as to realize the adjustment and coverage of node optimal resources, reduce the purchase cost of CDN resources, increase the effect of access hit rate and further improve the access quality of users.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method and an apparatus for analyzing and adjusting node optimal resource coverage, and a computer device.
Background
The functional entities included in the CDN network comprise content caching equipment, a content exchanger, a content router, a CDN content management system and the like, wherein the content caching is a CDN network node, is positioned at a user access point and is content providing equipment for an end user, static Web content can be cached, and the edge propagation and storage of the content are realized so as to facilitate the nearby access of the user. The content router is responsible for scheduling the user's requests to the appropriate devices. Content routing is generally achieved through a load balancing system, load distribution of each content caching site is dynamically balanced, an optimal access site is selected for a user's request, and meanwhile usability of a website is improved. The content router may route based on a variety of factors, including proximity of the site to the user, availability of content, network load, equipment conditions, and the like. The load balancing system is the core of the whole CDN. The accuracy and efficiency of load balancing directly determines the efficiency and performance of the overall CDN.
CDN business has entered the operating age of refinement and datamation, have higher requirements on cost and quality, hierarchical deployment has increased the resource deployment of father layer node, actually is the investment of incremental cost, if the node selection is unreasonable, will bring about the great increase of redundant node, can also have the situation that the matching coverage is not optimized, load imbalance, etc., how to adjust and optimize the resource coverage, make the matching of resources resume to the optimal state on the premise of considering the requirement of business, cost and quality, etc., need to consider which nodes are to be reserved, which nodes are to be deleted, if only single rough judgement through cost, quality, etc. is easy to cause the access influence to business. If the judgment of a plurality of factors is carried out, the calculated amount is larger, the influence of the association between the variables is complex, and if a strategy, an algorithm and a platform mechanism are not available, people can not easily finish the accurate judgment of the influence of the plurality of factors, and the resource coverage is difficult to maintain in an optimal range for a long time.
Obviously, the current CDN node resource adjustment method has the problems of high purchase cost, low access hit rate and low access quality of CDN resources caused by unbalanced resource allocation.
Disclosure of Invention
Based on the foregoing, it is necessary to provide a method, a device and a computer device for adjusting node optimal resource coverage analysis, which can realize adjustment and coverage of node optimal resources, reduce purchase cost of CDN resources, increase access hit rate, and further improve access quality of users.
The technical scheme of the application is as follows:
a method for adjusting node optimal resource coverage analysis, the method comprising:
step S100: constructing a CDN access bipartite graph based on MISS back source access logs of the CDNs;
step S200: calculating and generating a maximum matching bipartite graph through a preset first feasible algorithm based on the constructed CDN access bipartite graph; the maximum matching bipartite graph comprises bipartite graph maximum matching information;
step S300: calculating and generating a minimum coverage node through a preset second feasible algorithm based on the maximum matching bipartite graph generated through calculation;
step S400: performing data analysis on the bipartite graph maximum matching information of the maximum matching bipartite graph and the minimum coverage node, and generating an initial node analysis adjustment strategy;
step S500: and performing preliminary adjustment on the parent layer node based on the generated initial node analysis adjustment strategy, generating a final node adjustment execution decision, and performing final adjustment on the parent layer node based on the final node adjustment execution decision.
Specifically, step S100: constructing a CDN access bipartite graph based on MISS back source access log of the CDN: the method specifically comprises the following steps:
step S110: a MISS back source access log access node ordered pair based on CDN, wherein the node ordered pair comprises an edge node IP and a father layer node IP;
step S120: respectively carrying out region aggregation on the edge node IP and the father layer node IP, and generating an edge region node set and a father layer region node set, wherein the edge region node set is generated after region aggregation of the edge node IP, and the father layer region node set is generated after region aggregation of the father layer node IP;
step S130: and constructing the CDN access bipartite graph by taking the edge area node set as a departure set and the father layer area node set as a matching target set.
Specifically, the bipartite graph maximum matching information comprises a vertex MG set and a matching edge MV set, wherein the vertex MG set comprises a first number of vertexes, and the matching edge MV set comprises a second number of matching edges;
the minimum coverage node data comprises a minimum coverage node set, wherein the minimum coverage node set comprises a third number of edge area nodes;
step S400: performing data analysis on the bipartite graph maximum matching information of the maximum matching bipartite graph and the minimum coverage node, and generating an initial node analysis adjustment strategy; the method specifically comprises the following steps:
step S410: judging whether the number of the matching edges in the matching edge MV set is smaller than the number of nodes in the father layer area node set;
step S420: if yes, judging whether the edge area nodes in the minimum coverage node set contain the edge area nodes in the edge area node set or not;
step S430: and if yes, generating the initial node analysis adjustment strategy.
Specifically, step S430: if yes, generating the initial node analysis adjustment strategy, which specifically comprises the following steps:
step S431: if yes, judging whether the subset with the element number greater than one in the parent layer area node set matched with the edge area node in the edge area node set is a subset of the vertex MG set or not;
step S432: if yes, generating a first node adjustment strategy.
Specifically, step S430: if yes, generating the initial node analysis adjustment strategy, and specifically further comprising:
step S433: if yes, judging whether nodes contained in the vertex MG set and contained in the minimum coverage node set exist in the parent layer area nodes of the parent layer area node set matched with the edge area nodes in the edge area node set; the node which is contained in the vertex MG set and is contained in the minimum coverage node set and exists in the father layer region nodes of the father layer region node set matched with the edge region nodes in the edge region node set is a target region to-be-adjusted guiding node; the nodes contained in the vertex MG set and the minimum coverage node set are reserved parent layer nodes;
step S434: and if so, generating a second node adjustment strategy, wherein the second node adjustment strategy is used for deleting other father layer area nodes except the reserved father layer node in the father layer area node of the father layer area node set matched with the target area to-be-adjusted guiding node.
Specifically, step S430: if yes, generating the initial node analysis adjustment strategy, and specifically further comprising:
step S435: if yes, judging whether only one parent layer area node in the parent layer area node set matched with the edge area node in the edge area node set is in the vertex MG set;
step S436: and if so, generating a third node adjustment strategy, wherein the initial node analysis adjustment strategy comprises the first node adjustment strategy, the second node adjustment strategy and the third node adjustment strategy.
A node optimal resource coverage analysis adjustment apparatus, the apparatus comprising:
the bipartite graph construction module is used for constructing a CDN access bipartite graph based on MISS return source access logs of the CDN;
the maximum matching bipartite graph generating module is used for generating a maximum matching bipartite graph through calculation of a preset first feasible algorithm based on the constructed CDN access bipartite graph; the maximum matching bipartite graph comprises bipartite graph maximum matching information;
the minimum coverage node generation module is used for calculating and generating a minimum coverage node through a preset second feasible algorithm based on the calculated and generated maximum matching bipartite graph;
the initial node analysis adjustment generation module is used for carrying out data analysis on the bipartite graph maximum matching information of the maximum matching bipartite graph and the minimum coverage node and generating an initial node analysis adjustment strategy;
and the final node adjustment execution module is used for carrying out preliminary adjustment on the father layer node based on the generated initial node analysis adjustment strategy, generating a final node adjustment execution decision and carrying out final adjustment on the father layer node based on the final node adjustment execution decision.
Specifically, the bipartite graph construction module includes:
the system comprises a node ordered pair access module, a node ordered pair access module and a management server, wherein the node ordered pair access module is used for accessing a node ordered pair based on MISS back source access log of a CDN, and the node ordered pair comprises an edge node IP and a father layer node IP;
the area aggregation module is used for respectively carrying out area aggregation on the edge node IP and the father layer node IP and generating an edge area node set and a father layer area node set, wherein the edge node IP generates the edge area node set after area aggregation, and the father layer node IP generates the father layer area node set after area aggregation;
and the set bipartite graph construction module is used for constructing the CDN access bipartite graph by taking the edge area node set as a departure set and the father layer area node set as a matching target set.
Specifically, the initial node analysis adjustment generation module includes:
the first judging module is used for judging whether the number of the matching edges in the matching edge MV set is smaller than the number of the nodes in the father layer area node set;
the second judging module is used for judging whether the edge area nodes in the minimum coverage node set contain the edge area nodes in the edge area node set or not if yes;
and the judging result generating module is used for generating the initial node analysis adjustment strategy if the judgment result is yes.
A computer device comprising a memory and a processor, said memory storing a computer program, said processor implementing the steps of the above described node optimal resource coverage analysis adjustment method when executing said computer program.
A computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of the node optimal resource coverage analysis adjustment method described above.
The application has the following technical effects:
the node optimal resource coverage analysis and adjustment method, the node optimal resource coverage analysis and adjustment device and the computer equipment sequentially construct CDN access bipartite graphs through MISS (management information system) back source access logs based on CDNs; calculating and generating a maximum matching bipartite graph through a preset first feasible algorithm based on the constructed CDN access bipartite graph; the maximum matching bipartite graph comprises bipartite graph maximum matching information; calculating and generating a minimum coverage node through a preset second feasible algorithm based on the maximum matching bipartite graph generated through calculation; performing data analysis on the bipartite graph maximum matching information of the maximum matching bipartite graph and the minimum coverage node, and generating an initial node analysis adjustment strategy; and performing preliminary adjustment on the father layer node based on the generated initial node analysis adjustment strategy, generating a final node adjustment execution decision, and performing final adjustment on the father layer node based on the final node adjustment execution decision, so as to monitor and adjust the coverage deployment matching of CDN node resources, timely and efficiently monitor the matching state of the resources, provide an optimal adjustment strategy, realize adjustment and coverage of the node optimal resources, reduce the purchase cost of CDN resources, increase the effect of access hit rate, and further improve the access quality of users.
Drawings
FIG. 1 is a flow chart of a method for adjusting node optimal resource coverage analysis in one embodiment;
FIG. 2 is a diagram of CDN access bipartite graph in one embodiment;
FIG. 3 is a schematic diagram of CDN access bipartite graph according to another embodiment;
FIG. 4 is a schematic diagram of CDN access bipartite graph according to another embodiment;
FIG. 5 is a schematic diagram of CDN access bipartite graph according to another embodiment;
FIG. 6 is a block diagram of a node optimal resource coverage analysis adjustment device in one embodiment;
fig. 7 is an internal structural diagram of a computer device in one embodiment.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
The node optimal resource coverage analysis and adjustment method provided by the embodiment of the application can be applied to an application environment. The application environment comprises a terminal, and a user triggers the terminal to enable the terminal to construct a CDN access bipartite graph based on MISS back source access logs of the CDN; calculating and generating a maximum matching bipartite graph through a preset first feasible algorithm based on the constructed CDN access bipartite graph; the maximum matching bipartite graph comprises bipartite graph maximum matching information; calculating and generating a minimum coverage node through a preset second feasible algorithm based on the maximum matching bipartite graph generated through calculation; performing data analysis on the bipartite graph maximum matching information of the maximum matching bipartite graph and the minimum coverage node, and generating an initial node analysis adjustment strategy; and performing preliminary adjustment on the parent layer node based on the generated initial node analysis adjustment strategy, generating a final node adjustment execution decision, and performing final adjustment on the parent layer node based on the final node adjustment execution decision.
The terminal may be, but is not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices.
In one embodiment, as shown in fig. 1, there is provided a node optimal resource coverage analysis adjustment method, the method including:
step S100: constructing a CDN access bipartite graph based on MISS back source access logs of the CDNs;
specifically, access information of the edge node and the parent layer node is extracted from the MISS back source access log of the CDN, and bipartite graph modeling is performed on the access relationship between the edge node set and the parent layer node set, that is, the CDN access bipartite graph is constructed, as shown in fig. 2.
Specifically, the CDN access bipartite graph is constructed through a bipartite graph construction module. And the bipartite graph construction modeling periodically operates to periodically model access relations between edge nodes and parent layer nodes, and the operation period is configurable.
The MISS back source access log of the CDN can be derived from the existing CDN log system, and the original access log can be read and then processed.
Before the existing CDN log system is used, the node region ordered pair data is directly input into the bipartite graph construction module by means of the aggregation processing of the edge nodes and the upper nodes and the processing of the node relationship ordered pair, so that the data processing capacity of the bipartite graph construction module is reduced, and the data processing efficiency is improved.
Step S200: calculating and generating a maximum matching bipartite graph through a preset first feasible algorithm based on the constructed CDN access bipartite graph; the maximum matching bipartite graph comprises bipartite graph maximum matching information;
in this step, the first feasible algorithm may be a hungarian algorithm, a maximum flow graph algorithm, or the like.
Step S300: calculating and generating a minimum coverage node through a preset second feasible algorithm based on the maximum matching bipartite graph generated through calculation;
specifically, the second feasible algorithm is selected by a person skilled in the art, and the minimum coverage node is generated by calculation.
Further, an augmented search is performed for each unmatched point, and during the search process, all points encountered will be recorded, i.e. marked, and unmarked points are found in the departure set X, such as region 3 in fig. 1, and marked points are found in the matched set, such as region B and region D in fig. 1.
Step S400: performing data analysis on the bipartite graph maximum matching information of the maximum matching bipartite graph and the minimum coverage node, and generating an initial node analysis adjustment strategy;
specifically, the initial node analysis adjustment strategy is generated to realize adjustment suggestion for analyzing and judging node resource matching, so that the accuracy and efficiency of adjustment are improved, and the adjustment action has actual business and resource data as the basis.
Step S500: and performing preliminary adjustment on the parent layer node based on the generated initial node analysis adjustment strategy, generating a final node adjustment execution decision, and performing final adjustment on the parent layer node based on the final node adjustment execution decision.
Specifically, when the parent layer node is primarily adjusted based on the generated initial node analysis adjustment policy, states and evaluation data of all angles of node resources in the existing system or module such as node quality detection and cost of the CDN may be adopted, so as to generate a final node adjustment execution decision, and finally adjust the parent layer node based on the final node adjustment execution decision.
Specifically, the application constructs CDN access bipartite graph through MISS back source access log based on CDN; calculating and generating a maximum matching bipartite graph through a preset first feasible algorithm based on the constructed CDN access bipartite graph; the maximum matching bipartite graph comprises bipartite graph maximum matching information; calculating and generating a minimum coverage node through a preset second feasible algorithm based on the maximum matching bipartite graph generated through calculation; performing data analysis on the bipartite graph maximum matching information of the maximum matching bipartite graph and the minimum coverage node, and generating an initial node analysis adjustment strategy; and performing preliminary adjustment on the father layer node based on the generated initial node analysis adjustment strategy, generating a final node adjustment execution decision, and performing final adjustment on the father layer node based on the final node adjustment execution decision, so as to monitor and adjust the coverage deployment matching of CDN node resources, timely and efficiently monitor the matching state of the resources, provide an optimal adjustment strategy, realize adjustment and coverage of the node optimal resources, reduce the purchase cost of CDN resources, increase the effect of access hit rate, and further improve the access quality of users.
In one embodiment, as shown in fig. 2, step S100: constructing a CDN access bipartite graph based on MISS back source access log of the CDN: the method specifically comprises the following steps:
step S110: a MISS back source access log access node ordered pair based on CDN, wherein the node ordered pair comprises an edge node IP and a father layer node IP;
specifically, the edge nodes IP are in one-to-one correspondence with the parent layer nodes IP, that is, are matched.
Step S120: respectively carrying out region aggregation on the edge node IP and the father layer node IP, and generating an edge region node set and a father layer region node set, wherein the edge region node set is generated after region aggregation of the edge node IP, and the father layer region node set is generated after region aggregation of the father layer node IP;
specifically, after the edge area node set and the parent layer area node set are generated, the ordered pairs of the edge area nodes in the edge area node set and the parent layer area nodes in the parent layer area nodes are generated, and it can be understood that the edge area nodes in the edge area node set and the parent layer area nodes in the parent layer area nodes are in one-to-one correspondence, namely (edge area nodes and parent layer area nodes).
Step S130: and constructing the CDN access bipartite graph by taking the edge area node set as a departure set and the father layer area node set as a matching target set.
In one embodiment, the bipartite graph maximum matching information includes a vertex MG set and a matching edge MV set, wherein the vertex MG set includes a first number of vertices, and the matching edge MV set includes a second number of matching edges;
specifically, as shown in fig. 2, the vertex MG is set to { region 1, region 3, region 4, region a, region B, region D }, and 6 vertices in total, that is, the first number is 6.
The matching side MV is set to { (region 1, region B), (region 3, region a), (region 4, region D) }, 3 matching sides in total, i.e., the second number is 3.
The minimum coverage node data comprises a minimum coverage node set, wherein the minimum coverage node set comprises a third number of edge area nodes;
specifically, as shown in fig. 2, the minimum set of coverage nodes is minG { region B, region D, region 3}.
Step S400: performing data analysis on the bipartite graph maximum matching information of the maximum matching bipartite graph and the minimum coverage node, and generating an initial node analysis adjustment strategy; the method specifically comprises the following steps:
step S410: judging whether the number of the matching edges in the matching edge MV set is smaller than the number of nodes in the father layer area node set;
specifically, in this step, based on theory: the minimum number of matching edges is the theoretical optimal number of nodes of the parent layer nodes.
Step S420: if yes, judging whether the edge area nodes in the minimum coverage node set contain the edge area nodes in the edge area node set or not;
in this step, if the determination is yes, to determine that the number of matching edges in the matching edge MV set is smaller than the number of nodes in the parent layer region node set, it is indicated that there is redundancy in the parent layer node, that is, the parent layer has feasibility of reducing nodes.
Therefore, it is determined whether the edge region nodes in the minimum coverage node set include edge region nodes in the edge region node set.
Step S430: and if yes, generating the initial node analysis adjustment strategy.
In this step, if the determination is yes, it is determined that the edge area node in the minimum coverage node set is an edge area node including the edge area node set.
Specifically, as shown in fig. 1, the minimum coverage node set is minG { region B, region D, region 3} and includes edge region nodes, e.g., includes region 3.
At this time, it is illustrated that there is a divergence in the matching from the edge area node to the parent layer area node, for example, area 3, that is, it is illustrated that the edge node, for example, area 3, and the parent layer area node corresponding to the matching is adjustable and convergent.
Therefore, the initial node analysis adjustment policy is generated at this time.
In one embodiment, as shown in fig. 2, step S430: if yes, generating the initial node analysis adjustment strategy, which specifically comprises the following steps:
step S431: if yes, judging whether the subset with the element number greater than one in the parent layer area node set matched with the edge area node in the edge area node set is a subset of the vertex MG set or not;
in this step, if the determination is yes, it is determined that the edge area node in the minimum coverage node set is an edge area node including the edge area node set.
At this time, it is required to continue the judgment, that is, to judge whether any subset of the vertex MG sets is a subset of the subsets of the parent layer area node sets with the number of elements greater than one, which are matched with the edge area nodes in the edge area node sets.
Step S432: if yes, generating a first node adjustment strategy.
In this step, if the determination is yes, it is determined that there is a subset of the vertex MG set in a subset having a number of elements greater than one in the parent layer area node set that is matched with an edge area node in the edge area node set.
Specifically, as shown in fig. 1, the edge area node in the edge area node set, such as area 3, is the parent layer area node set that the edge area node matches, such as P3{ area a, area C, area D }, and if there is a subset of the vertex MG set, that is, if there is a subset of the vertex MG set, such as { area 1, area 3, area 4, area a, area B, area D }, from all the subsets of elements greater than one in the parent layer area node set.
Therefore, the first node adjustment policy is generated at this time.
Further, as shown in fig. 3, the first node adjustment policy is to keep the theoretically optimal number of parent layer nodes, and perform convergence adjustment on edge area nodes, such as parent layer area nodes matched with the area 3.
The specific convergence adjustment is as follows: a new node, such as region E, is logically used in place of the old nodes, such as region a and region C, while a new node, such as region E, is logically used as a new logical node.
Of course, the new logical node may actually be a new physical node, or an old physical node, such as region a or region C, may be used.
In one embodiment, as shown in fig. 2, step S430: if yes, generating the initial node analysis adjustment strategy, and specifically further comprising:
step S433: if yes, judging whether nodes contained in the vertex MG set and contained in the minimum coverage node set exist in the parent layer area nodes of the parent layer area node set matched with the edge area nodes in the edge area node set;
the node which is contained in the vertex MG set and is contained in the minimum coverage node set and exists in the father layer region nodes of the father layer region node set matched with the edge region nodes in the edge region node set is a target region to-be-adjusted guiding node; the nodes contained in the vertex MG set and the minimum coverage node set are reserved parent layer nodes;
in this step, if the determination is yes, the determination is that the edge area node in the minimum coverage node set is the edge area node in the edge area node set.
At this time, if the determination is needed, it is determined whether a node included in the vertex MG set and included in the minimum coverage node set exists in the parent layer area nodes of the parent layer area node set that are matched with the edge area nodes in the edge area node set.
Specifically, as shown in fig. 4, it is determined whether the node included in the vertex MG set and the node included in the minimum coverage node set, such as the region D, exists in the parent layer region nodes of the parent layer region node set matched with the edge region node set, such as the region 3 in fig. 3, such as the P3{ region a, the region C, the region D }.
Specifically, the area 3 in fig. 3 is the guiding node to be adjusted of the target area, and the area D in fig. 3 is the reserved parent layer node.
Step S434: and if so, generating a second node adjustment strategy, wherein the second node adjustment strategy is used for deleting other father layer area nodes except the reserved father layer node in the father layer area node of the father layer area node set matched with the target area to-be-adjusted guiding node.
In this step, if the determination is yes, it is determined that the parent layer area node of the parent layer area node set that is the edge area node in the edge area node set matches is a node that is included in the vertex MG set and included in the minimum coverage node set.
Then, the second node adjustment policy is generated.
Further, the second node adjustment policy is used to delete other parent layer area nodes except for the reserved parent layer node in the parent layer area nodes of the parent layer area node set matched by the guiding node to be adjusted in the target area, that is, the second node adjustment policy is used in the parent layer area nodes of the parent layer area node set matched by the area 3 in fig. 3, that is, P3{ area a, area C, area D }, that is, other parent layer area nodes except for the reserved parent layer node in fig. 3, that is, delete other parent layer area nodes except for the area D in fig. 3, that is, delete the area a and the area C in P3{ area a, area C, area D }.
At this time, the area D node in fig. 3 is still reserved, so that connectivity of the parent layer node is not affected, redundancy of the parent layer node is not ensured, and node resource allocation is optimized.
In one embodiment, as shown in fig. 2, step S430: if yes, generating the initial node analysis adjustment strategy, and specifically further comprising:
step S435: if yes, judging whether only one parent layer area node in the parent layer area node set matched with the edge area node in the edge area node set is in the vertex MG set;
in this step, if the determination is yes, the determination is that the edge area node in the minimum coverage node set is the edge area node in the edge area node set.
At this time, the judgment needs to be continued, that is, to judge whether only one parent layer area node in the parent layer area node set matched with the edge area node in the edge area node set is in the vertex MG set.
As shown in fig. 5, the dashed lines in fig. 2-5 are vertices and edges that may be deleted or replaced. Whether only one parent layer region node in the matched parent layer region node set is in the vertex MG set, as in region 3 in fig. 5.
Step S436: and if so, generating a third node adjustment strategy, wherein the initial node analysis adjustment strategy comprises the first node adjustment strategy, the second node adjustment strategy and the third node adjustment strategy.
In this step, if the determination is yes, it is determined that only one parent layer area node in the vertex MG set is in the parent layer area node set that the edge area node in the edge area node set matches.
Specifically, only one parent layer region node in the parent layer region node set matched with the region 3 in fig. 5 is in the vertex MG set, and the third node adjustment policy is generated at this time.
Further, the third node adjustment policy is: performing convergence adjustment on edge nodes, such as parent layer area nodes matched with the area 3 in fig. 5, wherein the specific adjustment is as follows:
logically using new nodes, such as new material nodes, e.g., region E, to replace old nodes, e.g., region a and region C; old physical nodes, such as region a or region C, may also be used as new logical nodes.
In one embodiment, as shown in fig. 6, a node optimal resource coverage analysis adjustment apparatus includes:
the bipartite graph construction module is used for constructing a CDN access bipartite graph based on MISS return source access logs of the CDN;
the maximum matching bipartite graph generating module is used for generating a maximum matching bipartite graph through calculation of a preset first feasible algorithm based on the constructed CDN access bipartite graph; the maximum matching bipartite graph comprises bipartite graph maximum matching information;
the minimum coverage node generation module is used for calculating and generating a minimum coverage node through a preset second feasible algorithm based on the calculated and generated maximum matching bipartite graph;
the initial node analysis adjustment generation module is used for carrying out data analysis on the bipartite graph maximum matching information of the maximum matching bipartite graph and the minimum coverage node and generating an initial node analysis adjustment strategy;
and the final node adjustment execution module is used for carrying out preliminary adjustment on the father layer node based on the generated initial node analysis adjustment strategy, generating a final node adjustment execution decision and carrying out final adjustment on the father layer node based on the final node adjustment execution decision.
In one embodiment, the bipartite graph construction module includes:
the system comprises a node ordered pair access module, a node ordered pair access module and a management server, wherein the node ordered pair access module is used for accessing a node ordered pair based on MISS back source access log of a CDN, and the node ordered pair comprises an edge node IP and a father layer node IP;
the area aggregation module is used for respectively carrying out area aggregation on the edge node IP and the father layer node IP and generating an edge area node set and a father layer area node set, wherein the edge node IP generates the edge area node set after area aggregation, and the father layer node IP generates the father layer area node set after area aggregation;
and the set bipartite graph construction module is used for constructing the CDN access bipartite graph by taking the edge area node set as a departure set and the father layer area node set as a matching target set.
In one embodiment, the initial node analysis adjustment generation module includes:
the first judging module is used for judging whether the number of the matching edges in the matching edge MV set is smaller than the number of the nodes in the father layer area node set;
the second judging module is used for judging whether the edge area nodes in the minimum coverage node set contain the edge area nodes in the edge area node set or not if yes;
and the judging result generating module is used for generating the initial node analysis adjustment strategy if the judgment result is yes.
In one embodiment, the initial node analysis adjustment generation module is further configured to:
if yes, judging whether the subset with the element number greater than one in the parent layer area node set matched with the edge area node in the edge area node set is a subset of the vertex MG set or not;
if yes, generating a first node adjustment strategy.
In one embodiment, the initial node analysis adjustment generation module is further configured to:
if yes, judging whether nodes contained in the vertex MG set and contained in the minimum coverage node set exist in the parent layer area nodes of the parent layer area node set matched with the edge area nodes in the edge area node set; the node which is contained in the vertex MG set and is contained in the minimum coverage node set and exists in the father layer region nodes of the father layer region node set matched with the edge region nodes in the edge region node set is a target region to-be-adjusted guiding node; the nodes contained in the vertex MG set and the minimum coverage node set are reserved parent layer nodes;
and if so, generating a second node adjustment strategy, wherein the second node adjustment strategy is used for deleting other father layer area nodes except the reserved father layer node in the father layer area node of the father layer area node set matched with the target area to-be-adjusted guiding node.
In one embodiment, the initial node analysis adjustment generation module is further configured to:
if yes, judging whether only one parent layer area node in the parent layer area node set matched with the edge area node in the edge area node set is in the vertex MG set;
and if so, generating a third node adjustment strategy, wherein the initial node analysis adjustment strategy comprises the first node adjustment strategy, the second node adjustment strategy and the third node adjustment strategy.
In one embodiment, as shown in fig. 7, a computer device includes a memory and a processor, where the memory stores a computer program, and the processor implements the steps described in the node optimal resource coverage analysis adjustment method when executing the computer program.
A computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of the node optimal resource coverage analysis adjustment method described above.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in embodiments provided herein may include non-volatile and/or volatile memory. The nonvolatile memory can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples illustrate only a few embodiments of the application, which are described in detail and are not to be construed as limiting the scope of the application. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the application, which are all within the scope of the application. Accordingly, the scope of protection of the present application is to be determined by the appended claims.
Claims (6)
1. A method for adjusting node optimal resource coverage analysis, the method comprising:
step S100: the construction of the CDN access bipartite graph based on the MISS back source access log of the CDN specifically comprises the following steps:
step S110: a MISS back source access log access node ordered pair based on CDN, wherein the node ordered pair comprises an edge node IP and a father layer node IP;
step S120: respectively carrying out region aggregation on the edge node IP and the father layer node IP, and generating an edge region node set and a father layer region node set, wherein the edge region node set is generated after region aggregation of the edge node IP, and the father layer region node set is generated after region aggregation of the father layer node IP;
step S130: the edge area node set is used as a departure set, the father layer area node set is used as a matching target set, and the CDN access bipartite graph is constructed;
step S200: calculating and generating a maximum matching bipartite graph through a preset first feasible algorithm based on the constructed CDN access bipartite graph; the maximum matching bipartite graph comprises bipartite graph maximum matching information, wherein the bipartite graph maximum matching information comprises a vertex MG set and a matching edge MV set, the vertex MG set comprises a first number of vertexes, and the matching edge MV set comprises a second number of matching edges;
step S300: calculating and generating a minimum coverage node through a preset second feasible algorithm based on the maximum matching bipartite graph generated by calculation, wherein the minimum coverage node comprises a minimum coverage node set, and the minimum coverage node set comprises a third number of edge area nodes;
step S400: performing data analysis on the bipartite graph maximum matching information of the maximum matching bipartite graph and the minimum coverage node, and generating an initial node analysis adjustment strategy, wherein the method specifically comprises the following steps of:
step S410: judging whether the number of the matching edges in the matching edge MV set is smaller than the number of nodes in the father layer area node set;
step S420: if yes, judging whether the edge area nodes in the minimum coverage node set contain the edge area nodes in the edge area node set or not;
step S430: if yes, generating the initial node analysis adjustment strategy;
step S500: and performing preliminary adjustment on the parent layer node based on the generated initial node analysis adjustment strategy, generating a final node adjustment execution decision, and performing final adjustment on the parent layer node based on the final node adjustment execution decision.
2. The method for adjusting node optimal resource coverage analysis according to claim 1, wherein step S430: if yes, generating the initial node analysis adjustment strategy, which specifically comprises the following steps:
step S431: if yes, judging whether the subset with the element number greater than one in the parent layer area node set matched with the edge area node in the edge area node set is a subset of the vertex MG set or not;
step S432: if yes, generating a first node adjustment strategy.
3. The method for adjusting node optimal resource coverage analysis according to claim 1, wherein step S430: if yes, generating the initial node analysis adjustment strategy, and specifically further comprising:
step S433: if yes, judging whether nodes contained in the vertex MG set and contained in the minimum coverage node set exist in the parent layer area nodes of the parent layer area node set matched with the edge area nodes in the edge area node set; the node which is contained in the vertex MG set and is contained in the minimum coverage node set and exists in the father layer region nodes of the father layer region node set matched with the edge region nodes in the edge region node set is a target region to-be-adjusted guiding node; the nodes contained in the vertex MG set and the minimum coverage node set are reserved parent layer nodes;
step S434: and if so, generating a second node adjustment strategy, wherein the second node adjustment strategy is used for deleting other father layer area nodes except the reserved father layer node in the father layer area node of the father layer area node set matched with the target area to-be-adjusted guiding node.
4. A node optimal resource coverage analysis adjustment apparatus, the apparatus comprising:
the bipartite graph construction module is used for constructing a CDN access bipartite graph based on MISS back source access logs of the CDN, and specifically comprises the following steps:
the system comprises a node ordered pair access module, a node ordered pair access module and a management server, wherein the node ordered pair access module is used for accessing a node ordered pair based on MISS back source access log of a CDN, and the node ordered pair comprises an edge node IP and a father layer node IP;
the area aggregation module is used for respectively carrying out area aggregation on the edge node IP and the father layer node IP and generating an edge area node set and a father layer area node set, wherein the edge node IP generates the edge area node set after area aggregation, and the father layer node IP generates the father layer area node set after area aggregation;
the set bipartite graph construction module is used for constructing the CDN access bipartite graph by taking the edge area node set as a departure set and the father layer area node set as a matching target set;
the maximum matching bipartite graph generating module is used for generating a maximum matching bipartite graph through calculation of a preset first feasible algorithm based on the constructed CDN access bipartite graph; the maximum matching bipartite graph comprises bipartite graph maximum matching information;
the minimum coverage node generation module is used for calculating and generating a minimum coverage node through a preset second feasible algorithm based on the calculated and generated maximum matching bipartite graph;
the initial node analysis adjustment generation module is used for carrying out data analysis on the bipartite graph maximum matching information of the maximum matching bipartite graph and the minimum coverage node and generating an initial node analysis adjustment strategy, and specifically comprises the following steps:
the first judging module is used for judging whether the number of the matching edges in the matching edge MV set is smaller than the number of the nodes in the father layer area node set;
the second judging module is used for judging whether the edge area nodes in the minimum coverage node set contain the edge area nodes in the edge area node set or not if yes;
the judging result generating module is used for generating the initial node analysis adjustment strategy if the judging result is yes;
and the final node adjustment execution module is used for carrying out preliminary adjustment on the father layer node based on the generated initial node analysis adjustment strategy, generating a final node adjustment execution decision and carrying out final adjustment on the father layer node based on the final node adjustment execution decision.
5. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 3 when the computer program is executed.
6. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110107600.8A CN112953759B (en) | 2021-01-27 | 2021-01-27 | Node optimal resource coverage analysis adjustment method and device and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110107600.8A CN112953759B (en) | 2021-01-27 | 2021-01-27 | Node optimal resource coverage analysis adjustment method and device and computer equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112953759A CN112953759A (en) | 2021-06-11 |
| CN112953759B true CN112953759B (en) | 2023-10-03 |
Family
ID=76237399
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110107600.8A Active CN112953759B (en) | 2021-01-27 | 2021-01-27 | Node optimal resource coverage analysis adjustment method and device and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112953759B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2130418A1 (en) * | 1993-09-24 | 1995-03-25 | Stephen C. North | Graphs employing clusters |
| AU2007317684A1 (en) * | 2006-09-06 | 2008-05-15 | Akamai Technologies, Inc. | Hybrid content delivery network (CDN) and peer-to-peer (P2P) network |
| CN104093208A (en) * | 2014-06-24 | 2014-10-08 | 重庆邮电大学 | Time slot channel allocation method based on maximum matching in industrial wireless network |
| CN107483587A (en) * | 2017-08-21 | 2017-12-15 | 清华大学 | A kind of power telecom network cache optimization method of content oriented |
| CN108241530A (en) * | 2016-12-23 | 2018-07-03 | 西北大学 | A kind of streaming computing bipartite graph method for scheduling task based on Storm |
| CN108401233A (en) * | 2018-01-18 | 2018-08-14 | 广东技术师范学院 | One kind dividing matched compound event cognitive method based on most authority two |
| CN110300184A (en) * | 2019-07-10 | 2019-10-01 | 深圳市网心科技有限公司 | Fringe node distribution method, device, dispatch server and storage medium |
| CN110493357A (en) * | 2019-09-16 | 2019-11-22 | 深圳市网心科技有限公司 | A kind of calculation resource disposition method, system, device and computer storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110264482A1 (en) * | 2010-04-22 | 2011-10-27 | Maher Rahmouni | Resource matching |
-
2021
- 2021-01-27 CN CN202110107600.8A patent/CN112953759B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2130418A1 (en) * | 1993-09-24 | 1995-03-25 | Stephen C. North | Graphs employing clusters |
| AU2007317684A1 (en) * | 2006-09-06 | 2008-05-15 | Akamai Technologies, Inc. | Hybrid content delivery network (CDN) and peer-to-peer (P2P) network |
| CN104093208A (en) * | 2014-06-24 | 2014-10-08 | 重庆邮电大学 | Time slot channel allocation method based on maximum matching in industrial wireless network |
| CN108241530A (en) * | 2016-12-23 | 2018-07-03 | 西北大学 | A kind of streaming computing bipartite graph method for scheduling task based on Storm |
| CN107483587A (en) * | 2017-08-21 | 2017-12-15 | 清华大学 | A kind of power telecom network cache optimization method of content oriented |
| CN108401233A (en) * | 2018-01-18 | 2018-08-14 | 广东技术师范学院 | One kind dividing matched compound event cognitive method based on most authority two |
| CN110300184A (en) * | 2019-07-10 | 2019-10-01 | 深圳市网心科技有限公司 | Fringe node distribution method, device, dispatch server and storage medium |
| CN110493357A (en) * | 2019-09-16 | 2019-11-22 | 深圳市网心科技有限公司 | A kind of calculation resource disposition method, system, device and computer storage medium |
Non-Patent Citations (2)
| Title |
|---|
| Optimal VNFs Placement in CDN Slicing Over Multi-Cloud Environment;Ilias Benkacem等;《IEEE》;20180312;全文 * |
| 二分图最优匹配算法的WSN覆盖空洞修复策略;崔丽珍等;《小型微型计算机系统》;20180415(第04期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112953759A (en) | 2021-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20150350324A1 (en) | Method and system for storing distributed graph data | |
| CN108182213A (en) | A kind of data processing optimization device and method based on distributed system | |
| WO2011047474A1 (en) | Systems and methods for social graph data analytics to determine connectivity within a community | |
| CN112579606A (en) | Workflow data processing method and device, computer equipment and storage medium | |
| US20210192524A1 (en) | Feature-Based Recurrent Neural Networks for Fraud Detection | |
| CN110011928A (en) | Flow equalization carrying method, device, computer equipment and storage medium | |
| CN103631894A (en) | Dynamic copy management method based on HDFS | |
| CN112182089B (en) | Report generation method, device and equipment based on data warehouse model | |
| CN112579602A (en) | Multi-version data storage method and device, computer equipment and storage medium | |
| CN113256408A (en) | Risk control method and system based on consumption finance and computer equipment | |
| Arana‐Jiménez | Nondominated solutions in a fully fuzzy linear programming problem | |
| CN111104406A (en) | Hierarchical service data storage method and device, computer equipment and storage medium | |
| CN106021566A (en) | Method, device and system for improving concurrent processing capacity of single database | |
| Waibel et al. | Cost-optimized redundant data storage in the cloud | |
| US20220311773A1 (en) | Method and device for communication between microservices | |
| Bienkowski | Migrating and replicating data in networks | |
| Arnaout | Heuristics for the two‐machine scheduling problem with a single server | |
| CN112953759B (en) | Node optimal resource coverage analysis adjustment method and device and computer equipment | |
| CN113918857A (en) | Three-level cache acceleration method for improving performance of distributed WEB application system | |
| Guo et al. | Blockchain-assisted caching optimization and data storage methods in edge environment | |
| CN107203545B (en) | Data processing method and device | |
| CN109460500B (en) | Hotspot event discovery method and device, computer equipment and storage medium | |
| Jordan et al. | Shortest path network problems with stochastic arc weights | |
| CN112363831A (en) | Wind control processing method and device, computer equipment and storage medium | |
| Vijayakumar et al. | FIR3: A fuzzy inference based reliable replica replacement strategy for cloud Data Centre |
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 |