Network deployment construction method and device, computer equipment and storage medium

CN119071797APending Publication Date: 2024-12-03INSPUR SUZHOU INTELLIGENT TECH CO LTD
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411144094.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-20
Publication Date
2024-12-03

Smart Images

  • Figure CN119071797A_ABST
    Figure CN119071797A_ABST
Patent Text Reader

Abstract

The invention relates to the field of network communication, and discloses a network deployment construction method and device, computer equipment and a storage medium, and the method comprises the steps: obtaining the position information of a plurality of macro base stations, and generating an initial topological graph according to the position information; in the initial topological graph, obtaining the number of micro base stations contained in each macro base station, and initializing weight values associated with the macro base stations according to the number of the micro base stations to obtain a weighted topological graph; in the weighted topological graph, generating a deployment point position set by calculating a comprehensive value corresponding to the macro base station; and generating a deployment topological graph according to the deployment point position set, and reconstructing the deployment topological graph based on a preset planning strategy to obtain a target network architecture. According to the invention, the problems of unrealistic deployment of the edge server in the base station, high cost and the like are solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of network communications, and in particular to a method, device, computer equipment and storage medium for constructing network deployment. Background Art

[0002] With the rapid development of technologies such as the Internet of Things, artificial intelligence, and big data, edge computing has emerged. It processes and calculates close to the data source, which can reduce data transmission delays and ensure data security and privacy. Edge servers are deployed at the edge of the network, such as base stations and cloud edge devices. They can efficiently process data, run applications, and provide services. They can improve processing and response speeds, reduce network delays, and support more edge computing and smart devices. Base stations are often the main deployment location and can provide computing, storage, and network functions. When deploying, consider the network architecture and topology to ensure effective communication and coordination with the central data center and other edge servers. Edge servers are often deployed at macro base stations, but it is unrealistic and costly to deploy every macro base station. The deployment location needs to be reasonably designed, and building a high-density network will also have high construction costs. Summary of the invention

[0003] In view of this, the embodiments of the present invention provide a method, apparatus, computer device and storage medium for constructing a network deployment to solve the problem that it is unrealistic and costly to deploy edge servers at base stations.

[0004] In a first aspect, an embodiment of the present invention provides a method for constructing a network deployment, the method comprising:

[0005] Acquire location information of multiple macro base stations, and generate an initial topology map according to the location information;

[0006] In the initial topology map, the number of micro base stations contained in each of the macro base stations is obtained, and the weight value associated with the macro base station is initialized according to the number of micro base stations to obtain a weighted topology map;

[0007] In the weighted topology map, a deployment point set is generated by calculating a comprehensive value corresponding to the macro base station;

[0008] A deployment topology map is generated according to the deployment point set, and the deployment topology map is reconstructed based on a preset planning strategy to obtain a target network architecture.

[0009] The present invention provides a method for constructing a network deployment, which has the following advantages:

[0010] The initial topology map is generated according to the location information of the macro base station, which provides a basis for subsequent calculation and analysis. By analyzing the initial topology map, the structure and layout of the network can be understood, providing a basis for optimizing deployment. The weight value associated with the macro base station is initialized according to the number of micro base stations to obtain a weighted topology map. The size of the weight value reflects the importance and influence of the macro base station. By setting the weight value reasonably, the efficiency and effect of the deployment can be improved. The deployment point set is generated by calculating the comprehensive value corresponding to the macro base station. The calculation of the comprehensive value takes into account a variety of factors, such as the number of micro base stations, network load, signal strength, etc. By calculating the comprehensive value, the optimal deployment point can be determined to improve the performance and reliability of the network. Finally, the deployment topology map is generated according to the deployment point set, and the deployment topology map is reconstructed based on the preset planning strategy to obtain the target network architecture. In the above process, by processing and calculating close to the data source, the data transmission delay can be reduced and the processing and response speed can be improved. The edge server is deployed at the edge of the network, such as base stations, cloud edge devices, etc., which can reduce network delay and improve data transmission efficiency. In addition, the edge server can efficiently process data, run applications and provide services, supporting the access and use of more edge computing and smart devices. By properly designing the deployment location and building a high-density network, the reliability and stability of the network can be improved, and network failures and interruptions can be reduced. At the same time, the construction cost can be reduced, and the cost-effectiveness and return on investment of the network can be improved.

[0011] In an optional implementation manner of the present application, in the weighted topology map, generating a deployment point set by calculating a comprehensive value corresponding to the macro base station includes:

[0012] Randomly selecting a macro base station in the weighted topology map as a selected node to add to a preset first node set;

[0013] Acquire the remaining macro base stations except the selected macro base station in the weighted topology graph, and add the remaining macro base stations as unselected nodes to the preset second node set;

[0014] Calculating the distance between the selected nodes and the unselected nodes to obtain a distance matrix;

[0015] Obtaining weight values ​​corresponding to the unselected nodes;

[0016] Calculating the comprehensive value of the unselected nodes based on the distance matrix and the weight value corresponding to each of the unselected nodes;

[0017] The unselected node with the largest comprehensive value is used as a selected node, and the selected node is added to the first node set;

[0018] The distance matrix is ​​updated, and the iterative optimization process is cyclically performed until the number of nodes in the first node set reaches a preset number, and the first node set with the preset number of nodes is used as the deployment point set.

[0019] Specifically, a macro base station is randomly selected as a selected node and added to the first node set to start the iterative optimization process. The remaining macro base stations except the selected macro base station in the weighted topology map are obtained, and they are added to the second node set as unselected nodes, so as to obtain all unselected nodes. The distance between the selected node and the unselected node is calculated to obtain a distance matrix. The weight value corresponding to the unselected node is obtained, and the comprehensive value of the unselected node is calculated based on the distance matrix and the weight value corresponding to each unselected node, so as to obtain a comprehensive evaluation of the unselected node. The unselected node with the highest comprehensive evaluation is continuously selected as the selected node, and it is added to the first node set until the number of nodes in the first node set reaches a preset number, and the final deployment point set is obtained. This method can select nodes with higher weight values ​​and distance advantages to improve the network coverage. By selecting nodes with higher weight values ​​and distance advantages, the number of nodes required for network construction can be reduced, and the cost of network construction can be reduced. The performance of the network can also be improved, such as improving the reliability of the network, reducing network latency, and improving the scalability of the network, so as to facilitate the subsequent expansion and upgrading of the network.

[0020] In an optional implementation manner of the present application, calculating the distance between the selected node and the unselected node to obtain a distance matrix includes:

[0021] Traversing unselected nodes in the second node set;

[0022] detecting whether there is a direct path between the selected node and the unselected node;

[0023] If a direct path exists, the length of the direct path is calculated, and the length is used as the distance between the selected node and the unselected node;

[0024] Or, if no direct path exists, indirect paths between the selected node and the unselected node are identified, and the path length of each indirect path is calculated, and the maximum value of the path lengths is selected as the distance between the selected node and the unselected node.

[0025] Specifically, traversing the unselected nodes in the second node set can ensure that the calculated distance is accurate. By detecting whether there is a direct path between the selected node and the unselected node, the distance between the selected node and the unselected node can be quickly calculated, thereby improving the calculation efficiency. If there is a direct path, the length value of the direct path is calculated, and the length value is used as the distance between the selected node and the unselected node. If there is no direct path, the indirect path between the selected node and the unselected node is identified, and the path length of each indirect path is calculated, and the maximum value of the path length is selected as the distance between the selected node and the unselected node. The above method can not only improve the calculation efficiency, but also ensure that the calculated distance is accurate and complete.

[0026] In an optional implementation manner of the present application, the reconstructing the deployment topology map based on a preset planning strategy to obtain a target network architecture includes:

[0027] Defining a plurality of initial servers and connection relationships between the initial servers based on the deployment topology diagram;

[0028] Generating a corresponding adjacency matrix according to the initial server and the connection relationship;

[0029] Screening the initial server based on the adjacency matrix to obtain multiple candidate servers;

[0030] The candidate server is moved into the candidate set, and the adjacency matrix is ​​updated. The screening and updating process is performed cyclically until the convergence condition is met, and the adjacency matrix is ​​used as the target network architecture.

[0031] Specifically, based on the deployment topology diagram, multiple initial servers and the connection relationship between the initial servers are defined to obtain the initial network architecture. By generating the corresponding adjacency matrix based on the initial servers and the connection relationship, the network architecture can be converted into a matrix form, which is convenient for subsequent calculations and processing. The initial servers are screened based on the adjacency matrix to obtain multiple candidate servers, and unnecessary servers and connections can be removed, thereby improving network performance and reducing network costs. The candidate servers are moved into the candidate set, and the adjacency matrix is ​​updated. The screening and updating process is cyclically executed until the convergence conditions are met. The adjacency matrix is ​​used as the target network architecture, and a better network architecture can be obtained, thereby improving network performance, reducing network costs, improving network reliability, and improving network flexibility.

[0032] In an optional implementation manner of the present application, the initial server is screened based on the adjacency matrix to obtain multiple candidate servers, including:

[0033] Calculating the number of adjacent nodes of each of the initial servers according to the adjacency matrix;

[0034] Sort the initial servers in descending order according to the number of adjacent nodes to obtain a first server list;

[0035] The initial server at the first position in the first server list is used as the first candidate server.

[0036] Specifically, by calculating the number of adjacent nodes of each initial server, the importance of each initial server in the network can be obtained. The initial servers are sorted in descending order according to the number of adjacent nodes to obtain a server list sorted by importance. The initial server at the top of the first server list is used as the first candidate server to obtain a candidate server with a higher degree of importance. Taking the candidate server with a higher degree of importance as part of the target network architecture can improve the performance of the network, reduce the cost of the network, improve the scalability of the network, and improve the reliability of the network.

[0037] In an optional implementation manner of the present application, the initial server is screened based on the adjacency matrix to obtain multiple candidate servers, including:

[0038] Calculating an evaluation parameter of each of the initial servers according to the adjacency matrix;

[0039] Sort the initial servers in ascending order according to the evaluation parameter to obtain a second server list;

[0040] The initial server at the first position in the second server list is used as the second candidate server.

[0041] Specifically, by calculating the evaluation parameters of each initial server, the importance of each initial server in the network can be obtained. The initial servers are sorted in ascending order according to the evaluation parameters to obtain a server list sorted by importance. By using the initial server at the first position in the second server list as the second candidate server, a candidate server with a higher degree of importance is obtained. By using the candidate server with a higher degree of importance as part of the target network architecture, the performance of the network can be improved, the cost of the network can be reduced, the scalability of the network can be improved, and the reliability of the network can be improved.

[0042] In an optional implementation manner of the present application, calculating the evaluation parameter of each of the initial servers according to the adjacency matrix includes:

[0043] Calculating a connection cost for each of the initial servers based on the adjacency matrix;

[0044] Calculating the network density of each of the initial servers based on the adjacency matrix;

[0045] According to preset weights, the connection cost and the network density are weighted and summed to obtain the evaluation parameters of the initial server.

[0046] Specifically, by calculating the connection cost of each initial server, the communication cost of each initial server in the network is obtained. The network density of each initial server is calculated to obtain the connection density of each initial server in the network. The connection cost and the network density are weighted and summed to obtain the comprehensive evaluation parameters of each initial server. Selecting servers with lower comprehensive evaluation parameters as candidate servers can improve the performance and reliability of the network, reduce the construction and maintenance costs of the network, improve the economic benefits of the network, and facilitate the expansion and upgrade of the network.

[0047] In a second aspect, an embodiment of the present invention provides a device for constructing network deployment, the device comprising:

[0048] An acquisition module is used to acquire location information of multiple macro base stations and generate an initial topology map according to the location information; in the initial topology map, the number of micro base stations contained in each macro base station is acquired, and the weight value associated with the macro base station is initialized according to the number of micro base stations to obtain a weighted topology map;

[0049] A processing module, configured to generate a deployment point set by calculating a comprehensive value corresponding to the macro base station in the weighted topology map; and generate a deployment topology map according to the deployment point set;

[0050] The reconstruction module is used to reconstruct the deployment topology diagram based on a preset planning strategy to obtain a target network architecture.

[0051] In a third aspect, an embodiment of the present invention provides a computer device, comprising: a memory and a processor, the memory and the processor are communicatively connected to each other, computer instructions are stored in the memory, and the processor executes the network deployment construction method of the first aspect or any corresponding implementation method thereof by executing the computer instructions.

[0052] In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium having computer instructions stored thereon, the computer instructions being used to enable a computer to execute the method for constructing a network deployment according to the first aspect or any corresponding embodiment thereof.

[0053] In a fifth aspect, the present invention provides a computer program product, including computer instructions, which are used to enable a computer to execute the method for individually powering on and off a target component of a server according to the first aspect or any corresponding embodiment thereof.

[0054] The present invention provides a method for constructing a network deployment, which has the following advantages:

[0055] The initial topology map is generated according to the location information of the macro base station, which provides a basis for subsequent calculation and analysis. By analyzing the initial topology map, the structure and layout of the network can be understood, providing a basis for optimizing deployment. The weight value associated with the macro base station is initialized according to the number of micro base stations to obtain a weighted topology map. The size of the weight value reflects the importance and influence of the macro base station. By setting the weight value reasonably, the efficiency and effect of the deployment can be improved. The deployment point set is generated by calculating the comprehensive value corresponding to the macro base station. The calculation of the comprehensive value takes into account a variety of factors, such as the number of micro base stations, network load, signal strength, etc. By calculating the comprehensive value, the optimal deployment point can be determined to improve the performance and reliability of the network. Finally, the deployment topology map is generated according to the deployment point set, and the deployment topology map is reconstructed based on the preset planning strategy to obtain the target network architecture. In the above process, by processing and calculating close to the data source, the data transmission delay can be reduced and the processing and response speed can be improved. The edge server is deployed at the edge of the network, such as base stations, cloud edge devices, etc., which can reduce network delay and improve data transmission efficiency. In addition, the edge server can efficiently process data, run applications and provide services, supporting the access and use of more edge computing and smart devices. By properly designing the deployment location and building a high-density network, the reliability and stability of the network can be improved, and network failures and interruptions can be reduced. At the same time, the construction cost can be reduced, and the cost-effectiveness and return on investment of the network can be improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0057] Figure 1 is a flowchart of a method for constructing network deployment according to some embodiments of the present invention;

[0058] Figure 2 is a flow chart of another method for constructing network deployment according to some embodiments of the present invention;

[0059] Figure 3 is a structural block diagram of a device for constructing network deployment according to an embodiment of the present invention;

[0060] Figure 4 It is a schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0061] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0062] According to an embodiment of the present invention, a method, apparatus, computer device and storage medium for constructing a network deployment are provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0063] In this embodiment, a method for constructing a network deployment is provided. Figure 1 is a flow chart of a method for constructing a network deployment according to an embodiment of the present invention. Figure 1 As shown, the process includes the following steps:

[0064] Step S11, obtaining location information of multiple macro base stations, and generating an initial topology map according to the location information.

[0065] In the embodiment of the present application, first, it is necessary to obtain the specific location information of all macro base stations, where the location information may include longitude and latitude or specific coordinates. Secondly, according to the location information and a preset scale, the relative positions of the macro base stations are drawn on a map or a dedicated network planning tool, thereby generating an initial topology map, which reflects the geographical distribution and relative position relationship between the macro base stations.

[0066] The method provided in the embodiment of the present application generates an initial topology map based on the location information of the macro base station, which provides a basis for subsequent calculation and analysis. By analyzing the initial topology map, the structure and layout of the network can be understood, providing a basis for optimizing deployment.

[0067] Step S12, in the initial topology map, obtain the number of micro base stations contained in each macro base station, and initialize the weight value associated with the macro base station according to the number of micro base stations to obtain a weighted topology map.

[0068] In the embodiment of the present application, first, the number of micro base stations contained in each macro base station is obtained, and this number reflects the load situation under the macro base station. Secondly, the weight value of the macro base station is initialized according to the number of micro base stations. The size of the weight value reflects the importance and influence of the macro base station. By setting the weight value reasonably, the efficiency and effect of the deployment can be improved. Through this process, a weighted topology diagram can be obtained, which not only represents the connection relationship between macro base stations, but also reflects the relative importance and load situation of each macro base station through the weight value.

[0069] As an example, assume that there is a topology network containing N macro base stations, and each macro base station contains W micro base stations. i , where i ranges from [1, N], indicating the number of micro base stations contained in the i-th macro base station. The calculation formula for the associated weight value of each macro base station is:

[0070]

[0071] Through the above steps, the network weight can be initialized according to the request volume, so as to better reflect the load conditions between each node in the network.

[0072] Step S13: In the weighted topology map, a deployment point set is generated by calculating the comprehensive value corresponding to the macro base station.

[0073] In the embodiment of the present application, the process is an iterative optimization process, which aims to determine the final set of deployment points. First, a macro base station is randomly selected as the starting point, and then the distance between the base station and all other base stations is calculated, taking into account direct and indirect paths. Next, the comprehensive value of each unselected base station is calculated based on the distance and weight value, and the base station with the largest comprehensive value is selected to join the selected set. This process is executed repeatedly until the preset number of deployment points is reached, and finally a set of deployment points is obtained.

[0074] The method provided in the embodiment of the present application can determine the optimal deployment point by calculating the comprehensive value, thereby improving the performance and reliability of the network.

[0075] In the embodiments of the present application, Figure 2 As shown, step S13 includes the following steps A1-A7:

[0076] Step A1: randomly select a macro base station in the weighted topology map as a selected node and add it to a preset first node set.

[0077] In an embodiment of the present application, a macro base station is randomly selected as a selected node in the weighted topology map and added to the preset first node set. This step is the beginning of the iterative optimization process, which aims to initialize the selected node set and prepare for the subsequent calculation of the comprehensive value of the unselected nodes and the selection of the optimal deployment point. By randomly selecting a macro base station as the starting point, the diversity of deployment points can be ensured and the local optimal solution caused by improper selection of the starting point can be avoided. For example, assuming that the first node set is S, which is initially an empty set, that is, S={}, select macro base station A as the initial node, and add node A to the first node set, that is, S={A}.

[0078] Step A2: obtaining the remaining macro base stations except the selected macro base station in the weighted topology graph, and adding the remaining macro base stations as unselected nodes to the preset second node set.

[0079] In an embodiment of the present application, the remaining macro base stations other than the selected macro base stations are obtained in the weighted topology map, and these remaining macro base stations are added to the preset second node set as unselected nodes. This step is part of the iterative optimization process, which aims to initialize the unselected node set and prepare for the subsequent calculation of the comprehensive value of the unselected nodes and the selection of the optimal deployment point. By adding all unselected macro base stations to the second node set, it can be ensured that in the subsequent iteration process, each macro base station has the opportunity to be selected as the optimal deployment point.

[0080] Step A3, calculating the distance between the selected nodes and the unselected nodes, and constructing a distance matrix based on the distance between each selected node and the unselected nodes.

[0081] In the embodiment of the present application, all unselected nodes are traversed, and the path between each unselected node and the selected node is detected. If there is a direct path, the path length is directly calculated and recorded; if there is no direct path, the indirect path is identified and the length of all indirect paths is calculated, and the maximum value is taken as the distance. Finally, the calculation result constitutes a distance matrix reflecting the distance between the selected node and all unselected nodes.

[0082] Specifically, first, prepare the set of selected nodes and the set of unselected nodes. Then, create an empty distance matrix to record distance information. Next, start traversing the set of unselected nodes: for each unselected node, check the path between it and the selected node in turn. If a direct path can be found, calculate the length of this direct path and record this length in the corresponding position in the distance matrix. If there is no direct path, find all possible indirect paths. Calculate the length of each indirect path and find the maximum value. This maximum value will be regarded as the effective distance between the unselected node and the corresponding selected node, and will also be accurately recorded in the corresponding position of the distance matrix. Repeat the above processing of unselected nodes until the set of unselected nodes is empty. The final distance matrix fully reflects the distance between the selected node and all unselected nodes.

[0083] As an example, suppose there are five nodes in a topology: A, B, C, D, E, and the weight of each node is W. A =1.0,W B =0.8,W C =0.6,W D =0.9,W E =1.5, and the distance matrix is ​​used to represent the graph structure O as:

[0084]

[0085] Thus, a distance matrix O is constructed based on the distances between each selected node and the unselected nodes.

[0086] In the embodiment of the present application, calculating the distance between the selected node and the unselected node includes the following steps A31-A33:

[0087] Step A31, traverse the unselected nodes in the second node set.

[0088] In the embodiment of the present application, the purpose of traversing all unselected nodes is to detect whether there is a direct path between them and the selected nodes, and to calculate the distance accordingly to construct a complete distance matrix. This matrix reflects the distance relationship between the selected node and all unselected nodes, and is the basis for calculating the comprehensive value of the unselected nodes and determining the optimal deployment point.

[0089] Step A32, detecting whether there is a direct path between the selected node and the unselected node.

[0090] It should be noted that a direct path refers to a path that can connect two nodes directly without passing through other nodes. During the detection process, all node pairs are traversed to check whether there is such a direct connection between them. If so, this connection is recorded and the length of this direct path is calculated in the subsequent steps. If not, consider whether there is an indirect path that can connect the two nodes.

[0091] Step A33: If a direct path exists, the length of the direct path is calculated, and the length is used as the distance between the selected node and the unselected node.

[0092] In an embodiment of the present application, if there is a direct path between the selected node and the unselected node (that is, the two nodes are directly connected in the topology graph), the length value of this direct path is calculated, and this length value is used as the distance between the selected node and the unselected node. This distance value will be used for subsequent calculation of the comprehensive value of the unselected node to determine which unselected node should be added to the selected node set.

[0093] Step A34, if there is no direct path, identify the indirect path between the selected node and the unselected node, calculate the path length of each indirect path, and select the maximum value of the path length as the distance between the selected node and the unselected node.

[0094] In the embodiment of the present application, when there is no direct path between the selected node and the unselected node, an indirect path between the two nodes is identified, and the path length of each indirect path is calculated. Then, the maximum value is selected from these path lengths as the distance between the selected node and the unselected node.

[0095] As an example, if there is no direct edge connection between nodes A and E, a value greater than the length of all possible paths is used to represent this infinite distance. Similarly, the distance matrix can be calculated as follows:

[1234] .

[0096] Step A4, obtaining weight values ​​corresponding to unselected nodes.

[0097] In the embodiment of the present application, after the distance matrix between the selected nodes and the unselected nodes has been obtained, in order to calculate the comprehensive value of the unselected nodes, it is necessary to obtain the weight values ​​of each of the unselected nodes. These weight values ​​are initialized based on the number of micro base stations contained in each macro base station, reflecting the importance and load of the macro base station in the network.

[0098] Step A5, calculating the comprehensive value of the unselected nodes based on the distance matrix and the weight value corresponding to each unselected node.

[0099] As an example, the comprehensive value of each unselected node is calculated according to the principle of shortest average distance. This principle takes into account the distance between nodes, that is, the node with the shortest average distance to all selected nodes is selected. The calculation formula of the comprehensive value is as follows:

[0100]

[0101] Among them, K i is the comprehensive value of each unselected node; ω i is the initial weight of node i; d(i,j) is the distance between node i and node j; |S| is the number of selected nodes.

[0102] Therefore, according to the formula, we can calculate:

[0103] For Node B:

[0104]

[0105] For Node C:

[0106]

[0107] For node D:

[0108]

[0109] For node E:

[0110]

[0111] After calculating the comprehensive values ​​of all unselected nodes, the node E with the highest comprehensive value can be selected as the next node to be selected.

[0112] Step A6: The unselected node with the largest comprehensive value is taken as the selected node, and the selected node is added to the first node set.

[0113] In the embodiment of the present application, after calculating the comprehensive values ​​of all unselected nodes, the best node is selected in each iteration and added to the selected node set, so as to finally obtain the optimal deployment point set. The comprehensive value takes into account the weight of the node and the average distance between the node and the selected node, so selecting the node with the largest comprehensive value can achieve the optimal balance between the weight and distance of the final deployment point set.

[0114] Step A7, updating the distance matrix, looping through the iterative optimization process until the number of nodes in the first node set reaches a preset number, and taking the first node set with the preset number of nodes as the deployment point set.

[0115] In an embodiment of the present application, when a new node is selected and added to the first node set, the distance matrix needs to be updated to reflect this change, that is, for each pair of unselected nodes, the impact of the newly selected node on the distance between them needs to be considered.

[0116] As an example, for each pair of nodes (i, j), if the distance d(i, j) from node i to node j has been calculated (not the initial infinite value), then update d(i, j) to:

[0117] d'(i,j)=min(d(i,j),d(i,k)+d(k,j))

[0118] Here, k is the newly selected node.

[0119] If the distance d(i,j) from node i to node j is the initial value (infinity), indicating that there is no direct path between them, then update d(i,j) to:

[0120] d'(i,j)=d(i,k)+d(k,j)

[0121] Here, k is the newly selected node.

[0122] At this point, we try to establish a path between them through the newly selected nodes, and use node E to perform an update. The specific formula is as follows:

[0123] d'(i,j)=min(d(i,j),d(i,k)+d(k,j))

[0124] Check each pair of nodes (i, j) and try to find a shorter path through node E. The specific calculation process is as follows:

[0125] d(A,E)=min(d(A,E),d(A,E)+d(E,E))=min(4,4+0)=4

[0126] d(B,E)=min(d(B,E),d(B,E)+d(E,E))=min(3,3+0)=3

[0127] d(C,E)=min(d(C,E),d(C,E)+d(C,E))=min(2,2+0)=2

[0128] d(D,E)=min(d(D,E),d(D,E)+d(D,E))=min(1,1+0)=1

[0129] Then, for each other pair of nodes, recalculate the path distance through node E:

[0130] d(A,B)=min(d(A,B),d(A,E)+d(E,B))=min(1,4+3)=1

[0131] d(A,C)=min(d(A,C),d(A,E)+d(E,C))=min(2,4+2)=2

[0132] d(A,D)=min(d(A,D),d(A,E)+d(E,D))=min(3,4+1)=3

[0133] d(B,C)=min(d(B,C),d(B,E)+d(E,C))=min(1,3+2)=1

[0134] d(B,D)=min(d(B,D),d(B,E)+d(E,D))=min(2,3+1)=2

[0135] d(C,D)=min(d(C,D),d(C,E)+d(E,D))=min(1,2+1)=1

[0136] The above iterative optimization process is repeatedly performed, and when the number of nodes in the first node set reaches a preset number, the iterative optimization process ends. At this time, the nodes in the first node set are the optimal deployment points, and they constitute the deployment point set.

[0137] Step S14, generating a deployment topology map according to the deployment point set, and reconstructing the deployment topology map based on a preset planning strategy to obtain a target network architecture.

[0138] In an embodiment of the present application, a topology diagram showing the optimal deployment point layout and connection method is constructed using the set of deployment points generated in the previous steps. Subsequently, the topology diagram is reconstructed based on a preset planning strategy (such as compromise planning). In this process, multiple initial servers are defined as nodes, and the connection relationship between them is determined, and then an adjacency matrix representing the server connection status is generated. By calculating the number of adjacent nodes and evaluation parameters (including connection cost and network density) of each server, the server with the largest number of adjacent nodes and the lowest evaluation parameters is selected as a candidate server. The screening and updating process is repeated until the convergence conditions are met, and the optimized network architecture is finally obtained. This architecture is designed to improve network performance or reduce operating costs.

[0139] The edge server provided in the embodiment of the present application is deployed at the edge of the network, such as a base station, a cloud edge device, etc., which can reduce network delays and improve data transmission efficiency. Moreover, the edge server can efficiently process data, run applications, and provide services, supporting the access and use of more edge computing and smart devices.

[0140] In the embodiment of the present application, the deployment topology diagram is reconstructed based on the preset planning strategy to obtain the target network architecture, including the following steps B1-B3:

[0141] Step B1, defining multiple initial servers and connection relationships between the initial servers based on the deployment topology diagram.

[0142] In the embodiment of the present application, multiple initial servers are determined according to the deployment topology diagram, and these servers will serve as the starting point for network reconstruction. Then, the connection relationship between these initial servers is defined, that is, which servers are directly connected and which servers need to be transferred through other servers. In this way, basic data and connection relationships are provided for subsequent network reconstruction.

[0143] Step B2: Generate a corresponding adjacency matrix based on the initial server and connection relationship.

[0144] In the embodiment of the present application, an adjacency matrix is ​​generated according to the direct connection relationship between the initial servers. In this matrix, rows and columns represent different servers respectively, and the elements in the matrix indicate whether there is a direct connection between the corresponding servers.

[0145] As an example, suppose there are five initial servers S1, S2, S3, S4, S5, and the connection relationship between them can be represented by a 5x5 adjacency matrix A as shown below:

[0146]

[0147] In this matrix, if there is a direct connection between server S1 and server S2, the element in the first row and second column of the matrix is ​​1; if there is no direct connection, the element is 0.

[0148] Step B3, screening the initial servers based on the adjacency matrix to obtain multiple candidate servers.

[0149] In the embodiment of the present application, step B3 includes the following steps B31-B33:

[0150] Step B31, calculating the number of adjacent nodes of each initial server according to the adjacency matrix.

[0151] Specifically, by looking at the elements of each row (or column, because the adjacency matrix is ​​symmetrical) in the adjacency matrix, we can calculate how many directly connected servers each server has. For example, in the adjacency matrix, if the sum of the elements of a row is 3, it means that the server has 3 adjacent servers, as shown below:

[0152] Neighbors(S i )={Sj |A ij =1}

[0153] Therefore, according to the adjacency matrix A, the number of adjacent nodes of each server can be calculated as: N1=2, N2=2, N3=3, N4=2, N5=1.

[0154] Step B32: sort the initial servers in descending order according to the number of adjacent nodes to obtain a first server list.

[0155] In the embodiment of the present application, the number of adjacent nodes of each initial server is calculated, that is, the number of other servers directly connected to each server. Then, the initial servers are sorted in descending order according to the number, that is, the server with the most adjacent nodes will be placed at the front of the list. In this way, a server list arranged in descending order according to the number of adjacent nodes can be obtained, that is, the first server list.

[0156] Step B33: Use the initial server at the first position in the first server list as the first candidate server.

[0157] As an example, assuming that the number of adjacent nodes of each server is calculated based on the adjacency matrix A as: N1=2, N2=2, N3=3, N4=2, N5=1, it can be determined that server S3 has the most adjacent servers (3), so the initial server S3 can be used as the first candidate server.

[0158] In the embodiment of the present application, step B3 includes the following steps B34-B36:

[0159] Step B34, calculating the evaluation parameters of each initial server according to the adjacency matrix.

[0160] In the embodiment of the present application, based on the adjacency matrix, the connection cost (transmission cost or time weighted sum) and network density (number of adjacent nodes and connection status) of each initial server to all its adjacent servers are calculated. Then, according to the preset weights, the connection cost and network density are weighted and summed to obtain the evaluation parameters of each server for subsequent selection of candidate servers.

[0161] In an embodiment of the present application, step B34 includes: calculating the connection cost of each initial server based on the adjacency matrix; calculating the network density of each initial server based on the adjacency matrix; and according to preset weights, weighted summing the connection cost and the network density to obtain evaluation parameters of the initial server.

[0162] As an example, suppose P i is the candidate server S i The evaluation parameters are as follows:

[0163] P i =α·C i +β·D i

[0164] Among them, C i It is server S i The connection cost, D i It is server S i is the network density, α, β are weights used to adjust the importance of these two factors.

[0165] Specifically, the connection cost C i Defined as server S i The transmission cost or time-weighted sum to all its neighboring servers is as follows:

[0166]

[0167] Among them, w ij From the server S i To its neighboring server S j The connection weight of .

[0168] Specifically, the network density D i Indicates server S i The connectivity among its neighboring servers can also be regarded as its concentration in the network topology, which is measured by the number of neighboring nodes and the connection between neighboring servers. The calculation formula is:

[0169]

[0170] Among them, E i It is server S i The number of edges between adjacent servers, N i is the candidate server S i The number of adjacent nodes.

[0171] Therefore, the calculation formula for the evaluation parameters of each server can be obtained as follows:

[0172]

[0173] Assume that the weights α and β are 0.5. For the remaining servers, the evaluation parameters are calculated as follows:

[0174] P1=0.5×2+0.5×1=1.5

[0175] P2=0.5×2+0.5×1=1.5

[0176] P3=0.5×3+0.5×1=1.5

[0177] P4=0.5×2+0.5×1=1.5

[0178] Thus, the specific evaluation parameter value of each candidate server can be obtained, and then the candidate servers can be sorted and selected according to these evaluation parameter values.

[0179] Step B35, sorting the initial servers in ascending order according to the evaluation parameters to obtain a second server list.

[0180] In the embodiment of the present application, the evaluation parameter of each initial server is first calculated based on the adjacency matrix. The parameter is obtained by weighted summation of connection cost and network density, and is used to measure the comprehensive performance of the server. Subsequently, all servers are sorted in ascending order according to the value of the evaluation parameter to select the server with the lowest evaluation parameter (i.e., the best performance or the highest cost-effectiveness) as the candidate server. After the sorting is completed, the server at the top of the list will be selected as the second candidate server for subsequent network reconstruction.

[0181] Step B36: Use the initial server at the first position in the second server list as the second candidate server.

[0182] In the embodiment of the present application, the first initial server in the second server list is used as the second candidate server for subsequent network reconstruction. This selection process ensures that the selected server is optimal in terms of performance and cost-effectiveness, thereby providing a good foundation for subsequent network reconstruction.

[0183] Step B4, move the candidate server into the candidate set, update the adjacency matrix, and repeat the screening and updating process until the convergence condition is met, and use the adjacency matrix as the target network architecture.

[0184] As an example, assume that a new candidate server S5 is moved into the candidate set, and a new connection (1, 5) is added to the network. The adjacency matrix is ​​updated according to these new connections. The updated adjacency matrix A' is as follows:

[0185]

[0186] According to the updated adjacency matrix A', the number of adjacent nodes of each server can be recalculated as: N1 = 3, N2 = 2, N3 = 3, N4 = 2, N5 = 2. Check whether the convergence conditions are met, such as whether the size of the candidate set reaches the preset target size, or whether the maximum number of iterations has been reached.

[0187] Specifically, assuming that the goal is to make the size of the candidate set reach 2, after selecting the first candidate server, the screening and updating process will continue to select the second candidate server. After multiple iterations and optimizations, a set of candidate servers that meet the conditions is finally obtained. The adjacency matrix after the last iteration represents the final optimized target network architecture.

[0188] In this embodiment, a network deployment construction device is also provided, which is used to implement the above-mentioned embodiments and preferred implementation modes, and the descriptions that have been made will not be repeated. As used below, the term "module" can implement a combination of software and / or hardware of a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

[0189] This embodiment provides a network deployment construction device, such as Figure 3 As shown, it includes: an acquisition module 31, a processing module 32, and a reconstruction module 33;

[0190] The acquisition module 31 is used to acquire the location information of multiple macro base stations and generate an initial topology map according to the location information; in the initial topology map, the number of micro base stations contained in each macro base station is acquired, and the weight value associated with the macro base station is initialized according to the number of micro base stations to obtain a weighted topology map;

[0191] The processing module 32 is used to generate a deployment point set by calculating the comprehensive value corresponding to the macro base station in the weighted topology map; and generate a deployment topology map according to the deployment point set;

[0192] The reconstruction module 33 is used to reconstruct the deployment topology map based on a preset planning strategy to obtain a target network architecture.

[0193] In an optional example, the processing module 32 is specifically configured to:

[0194] Randomly selecting a macro base station in the weighted topology map as a selected node to add to a preset first node set;

[0195] Acquire the remaining macro base stations except the selected macro base station in the weighted topology graph, and add the remaining macro base stations as unselected nodes to the preset second node set;

[0196] Calculating the distance between the selected nodes and the unselected nodes to obtain a distance matrix;

[0197] Obtaining weight values ​​corresponding to the unselected nodes;

[0198] Calculating the comprehensive value of the unselected nodes based on the distance matrix and the weight value corresponding to each of the unselected nodes;

[0199] The unselected node with the largest comprehensive value is used as a selected node, and the selected node is added to the first node set;

[0200] The distance matrix is ​​updated, and the iterative optimization process is cyclically performed until the number of nodes in the first node set reaches a preset number, and the first node set with the preset number of nodes is used as the deployment point set.

[0201] In an optional example, the processing module 32 is specifically configured to:

[0202] Traversing unselected nodes in the second node set;

[0203] detecting whether there is a direct path between the selected node and the unselected node;

[0204] If a direct path exists, the length of the direct path is calculated, and the length is used as the distance between the selected node and the unselected node;

[0205] Or, if no direct path exists, indirect paths between the selected node and the unselected node are identified, and the path length of each indirect path is calculated, and the maximum value of the path lengths is selected as the distance between the selected node and the unselected node.

[0206] In an optional example, the reconstruction module 33 is specifically used to:

[0207] Defining a plurality of initial servers and connection relationships between the initial servers based on the deployment topology diagram;

[0208] Generating a corresponding adjacency matrix according to the initial server and the connection relationship;

[0209] Screening the initial server based on the adjacency matrix to obtain multiple candidate servers;

[0210] The candidate server is moved into the candidate set, and the adjacency matrix is ​​updated. The screening and updating process is performed cyclically until the convergence condition is met, and the adjacency matrix is ​​used as the target network architecture.

[0211] In an optional example, the reconstruction module 33 is specifically used to:

[0212] Calculating the number of adjacent nodes of each of the initial servers according to the adjacency matrix;

[0213] Sort the initial servers in descending order according to the number of adjacent nodes to obtain a first server list;

[0214] The initial server at the first position in the first server list is used as the first candidate server.

[0215] In an optional example, the reconstruction module 33 is specifically used to:

[0216] Calculating an evaluation parameter of each of the initial servers according to the adjacency matrix;

[0217] Sort the initial servers in ascending order according to the evaluation parameter to obtain a second server list;

[0218] The initial server at the first position in the second server list is used as the second candidate server.

[0219] In an optional example, the reconstruction module 33 is specifically used to:

[0220] Calculating a connection cost for each of the initial servers based on the adjacency matrix;

[0221] Calculating the network density of each of the initial servers based on the adjacency matrix;

[0222] According to preset weights, the connection cost and the network density are weighted and summed to obtain the evaluation parameters of the initial server.

[0223] See also Figure 4 , Figure 4 is a schematic diagram of the structure of a computer device provided by an optional embodiment of the present invention, such as Figure 4 As shown, the computer device includes: one or more processors 10, a memory 20, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. Various components are connected to each other using different buses for communication, and can be installed on a common mainboard or installed in other ways as needed. The processor can process the instructions executed in the computer device, including instructions stored in or on the memory to display the graphical information of the GUI on an external input / output device (such as, a display device coupled to the interface). In some optional embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Similarly, multiple computer devices can be connected, and each device provides some necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system).

[0224] The processor 10 may be a central processing unit, a network processor or a combination thereof. The processor 10 may further include a hardware chip. The hardware chip may be a dedicated integrated circuit, a programmable logic device or a combination thereof. The programmable logic device may be a complex programmable logic device, a field programmable gate array, a general purpose array logic or any combination thereof.

[0225] The memory 20 stores instructions executable by at least one processor 10, so that the at least one processor 10 executes the method shown in the above embodiment.

[0226] The memory 20 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created by the use of a computer device based on the presentation of a small program landing page, etc. In addition, the memory 20 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some optional embodiments, the memory 20 may optionally include a memory remotely arranged relative to the processor 10, and these remote memories may be connected to the computer device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0227] The memory 20 may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a flash memory, a hard disk or a solid state drive; the memory 20 may also include a combination of the above types of memory.

[0228] The computer device further comprises a communication interface 30 for the computer device to communicate with other devices or a communication network.

[0229] The embodiment of the present invention also provides a computer-readable storage medium. The method according to the embodiment of the present invention can be implemented in hardware, firmware, or can be implemented as a computer code that can be recorded in a storage medium, or can be implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and will be stored in a local storage medium through a network download, so that the method described herein can be stored in such software processing on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only storage memory, a random access memory, a flash memory, a hard disk or a solid-state hard disk, etc.; further, the storage medium can also include a combination of the above types of memories. It can be understood that a computer, a processor, a microprocessor controller, or programmable hardware includes a storage component that can store or receive software or computer code. When the software or computer code is accessed and executed by a computer, a processor, or hardware, the method shown in the above embodiment is implemented.

[0230] Although the embodiments of the present invention have been described in conjunction with the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present invention, and such modifications and variations are all within the scope defined by the appended claims.

Claims

1. A method for constructing network deployment, characterized in that: The method comprises: Acquire location information of multiple macro base stations, and generate an initial topology map according to the location information; In the initial topology map, the number of micro base stations included in each of the macro base stations is obtained, and the weight value associated with the macro base station is initialized according to the number of micro base stations to obtain a weighted topology map; In the weighted topology map, a deployment point set is generated by calculating a comprehensive value corresponding to the macro base station; A deployment topology map is generated according to the deployment point set, and the deployment topology map is reconstructed based on a preset planning strategy to obtain a target network architecture.

2. The method according to claim 1, characterized in that The step of generating a deployment point set by calculating a comprehensive value corresponding to the macro base station in the weighted topology map includes: Randomly selecting a macro base station in the weighted topology map as a selected node to add to a preset first node set; Acquire the remaining macro base stations except the selected macro base station in the weighted topology graph, and add the remaining macro base stations as unselected nodes to the preset second node set; Calculating the distance between the selected nodes and the unselected nodes, and constructing a distance matrix based on the distance between each of the selected nodes and the unselected nodes; Obtaining weight values ​​corresponding to the unselected nodes; Calculating the comprehensive value of the unselected nodes based on the distance matrix and the weight value corresponding to each of the unselected nodes; The unselected node with the largest comprehensive value is used as a selected node, and the selected node is added to the first node set; The distance matrix is ​​updated, and the iterative optimization process is cyclically executed until the number of nodes in the first node set reaches a preset number, and the first node set whose number of nodes reaches the preset number is used as the deployment point set.

3. The method according to claim 2, characterized in that The calculating the distance between the selected node and the unselected node comprises: Traversing unselected nodes in the second node set; detecting whether there is a direct path between the selected node and the unselected node; If a direct path exists, the length of the direct path is calculated, and the length is used as the distance between the selected node and the unselected node; Or, if no direct path exists, indirect paths between the selected node and the unselected node are identified, and the path length of each indirect path is calculated, and the maximum value of the path lengths is selected as the distance between the selected node and the unselected node.

4. The method according to claim 1, characterized in that: The reconstructing the deployment topology map based on the preset planning strategy to obtain the target network architecture includes: Defining a plurality of initial servers and connection relationships between the initial servers based on the deployment topology diagram; Generating a corresponding adjacency matrix according to the initial server and the connection relationship; Screening the initial server based on the adjacency matrix to obtain multiple candidate servers; The candidate server is moved into the candidate set, and the adjacency matrix is ​​updated. The screening and updating process is executed repeatedly until the convergence condition is met, and the adjacency matrix is ​​used as the target network architecture.

5. The method according to claim 4, characterized in that The initial server is screened based on the adjacency matrix to obtain a plurality of candidate servers, including: Calculating the number of adjacent nodes of each of the initial servers according to the adjacency matrix; Sort the initial servers in descending order according to the number of adjacent nodes to obtain a first server list; The initial server at the first position in the first server list is used as the first candidate server.

6. The method according to claim 4, characterized in that The initial server is screened based on the adjacency matrix to obtain a plurality of candidate servers, including: Calculating an evaluation parameter of each of the initial servers according to the adjacency matrix; Sort the initial servers in ascending order according to the evaluation parameter to obtain a second server list; The initial server at the first position in the second server list is used as the second candidate server.

7. The method according to claim 6, characterized in that The step of calculating the evaluation parameter of each initial server according to the adjacency matrix includes: Calculating a connection cost for each of the initial servers based on the adjacency matrix; Calculating the network density of each of the initial servers based on the adjacency matrix; According to preset weights, the connection cost and the network density are weighted and summed to obtain the evaluation parameters of the initial server.

8. A device for constructing network deployment, characterized in that: The device comprises: An acquisition module is used to acquire location information of multiple macro base stations and generate an initial topology map according to the location information; in the initial topology map, the number of micro base stations contained in each macro base station is acquired, and the weight value associated with the macro base station is initialized according to the number of micro base stations to obtain a weighted topology map; A processing module, configured to generate a deployment point set by calculating a comprehensive value corresponding to the macro base station in the weighted topology map; and generate a deployment topology map according to the deployment point set; The reconstruction module is used to reconstruct the deployment topology diagram based on a preset planning strategy to obtain a target network architecture.

9. A computer device, characterized in that: include: A memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the method according to any one of claims 1 to 7 by executing the computer instructions.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a computer to execute the method according to any one of claims 1 to 7.

Citation Information

Cited By

  • Server scheduling method based on Rail-Optimized topology in large model, equipment medium and product

    CN119966829A