Base station access service optimization method and system

Abstract

The application provides a base station access service optimization method and system, the method comprising: obtaining the path connection relationship between a node machine room and each access base station according to the baseband processing unit information corresponding to the node machine room and the radio frequency remote unit attribution information in a transmission network; judging the link distance between the node machine room and each access base station in the path connection relationship according to a preset connection link distance threshold, and determining an over-length physical link access base station from the multiple access base stations according to the judgment result; and based on a clustering algorithm, optimizing the path between the over-length physical link access base station and the node machine room according to the optical cable segment endpoint resource information corresponding to the over-length physical link access base station, to obtain a target optimization path. The application improves the link optimization work efficiency and accuracy.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of communication technology, in particular to a base station access service optimization method and system. BACKGROUND

[0002] With the rapid progress of communication technology, the basic service volume and rate provided by operators are also rapidly growing, in order to meet user demand, various new services are emerging.

[0003] The transmission network as infrastructure also becomes more and more huge and complex, especially the local transmission network, as the most complex and huge part of the transmission network, there are different degrees of security problems and hidden dangers. At the same time, with the large number of new base stations enabled, if the access service is not standardized and not adjusted in time, it is also easy to cause major network security hidden dangers.

[0004] However, in the existing service access specification identification and optimization process, it is still mainly through manual intervention to identify the non-standard situation of base station access, when facing a series of complex and urgent base station access services, it is difficult to accurately and efficiently identify and optimize the problems existing in the base station access service, which affects the user experience and the service quality of the operator.

[0005] Therefore, there is an urgent need for a base station access service optimization method and system to solve the above problems. SUMMARY

[0006] In view of the problems existing in the prior art, the present application provides a base station access service optimization method and system.

[0007] The present application provides a base station access service optimization method, comprising:

[0008] According to the baseband processing unit information and the radio remote unit attribution information corresponding to the node machine room in the transmission network, the path connection relationship between the node machine room and each access base station is obtained;

[0009] According to the preset connection link distance threshold, the link distance between the node machine room and each access base station in the path connection relationship is judged, and according to the judgment result, the super long physical link access base station is determined from a plurality of access base stations;

[0010] Based on the clustering algorithm, according to the optical cable segment endpoint resource information corresponding to the super long physical link access base station, the path between the super long physical link access base station and the node machine room is optimized to obtain the target optimization path, so as to newly build an optical cable segment between the super long physical link access base station and the node machine room according to the target optimization path.

[0011] According to the application, a base station access service optimization method is provided, the method comprises the following steps:

[0012] According to the baseband processing unit information corresponding to the node machine room in the transmission network and the radio remote unit attribution information, the connection relationship between the node machine room and each access base station is obtained, which comprises the following steps:

[0013] According to the baseband processing unit information corresponding to the node machine room in the transmission network and the radio remote unit attribution information, the connection relationship between the node machine room and each access base station is obtained, which comprises the following steps:

[0014] According to the baseband processing unit information corresponding to the node machine room in the transmission network and the radio remote unit attribution information, the connection relationship between the node machine room and each access base station is obtained, which comprises the following steps:

[0015] According to the baseband processing unit information corresponding to the node machine room in the transmission network and the radio remote unit attribution information, the connection relationship between the node machine room and each access base station is obtained, which comprises the following steps:

[0016] According to the application, a base station access service optimization method is provided, the method further comprises the following steps:

[0017] According to the baseband processing unit information corresponding to the node machine room in the transmission network and the radio remote unit attribution information, the connection relationship between the node machine room and each access base station is obtained, which comprises the following steps:

[0018] If it is determined that there is a target base station according to the connection relationship and the preset base station attribution relationship, the optimization node machine room information corresponding to the target base station is determined according to the preset base station attribution relationship, so that the node machine room to which the target base station belongs is changed according to the optimization node machine room information, wherein the target base station is an access base station whose connection relationship and preset base station attribution relationship are inconsistent, and the optimization node machine room information is obtained based on the preset base station attribution relationship.

[0019] According to the application, a base station access service optimization method is provided, before the step of determining the access base station with an overlong physical link from the plurality of access base stations according to the link distance between the node machine room and each access base station in the connection relationship and the judgment result, the method further comprises the following steps:

[0020] According to the baseband processing unit information and the base station attribution information, the optical path information between the node machine room and the access base station is obtained.

[0021] According to the optical path information, the optical cable segment length information between the node machine room and the access base station is obtained from the optical cable segment information list based on a hash algorithm.

[0022] According to the optical cable segment length information, the link distance between the node machine room and the access base station is obtained;

[0023] The link distance between the node machine room and each access base station in the access connection relationship is judged according to a preset connection link distance threshold, and a super-long physical link access base station is determined from the plurality of access base stations according to the judgment result, comprising:

[0024] When it is determined that the node machine room and the access base station are double-route access, a first preset connection link distance threshold and a second preset connection link distance threshold are obtained, wherein the first preset connection link distance threshold is the preset connection link distance threshold corresponding to the route marked as a long link in the double route; the second preset connection link distance threshold is the preset connection link distance threshold corresponding to the route marked as a short link in the double route;

[0025] When the link distance corresponding to the route marked as a long link is greater than the first preset connection link distance threshold, or when the link distance corresponding to the route marked as a short link is greater than the second preset connection link distance threshold, the access base station corresponding to the connection of the node machine room is determined as the super-long physical link access base station.

[0026] According to the base station access service optimization method provided by the application, the path between the super-long physical link access base station and the node machine room is optimized according to the optical cable segment endpoint resource information corresponding to the super-long physical link access base station based on the clustering algorithm, and the target optimization path is obtained, comprising:

[0027] According to the plurality of optical cable segment endpoints within the preset distance range of the super-long physical link access base station, the optical cable segment endpoint resource information is obtained, wherein the optical cable segment endpoint resource information at least includes optical cable segment endpoint latitude and longitude information;

[0028] Based on the clustering algorithm, the optical cable segment between the super-long physical link access base station and the node machine room is clustered according to the optical cable segment endpoint resource information, and the shortest optical cable segment path between the super-long physical link access base station and the node machine room is constructed according to the corresponding optical cable segment in the clustering result, so as to obtain the target optimization path according to the shortest optical cable segment path.

[0029] According to the base station access service optimization method provided by the application, after the optical cable segment endpoint resource information is obtained according to the plurality of optical cable segment endpoints within the preset distance range of the super-long physical link access base station, the method further comprises:

[0030] Encode the longitude and latitude information of the optical cable segment end points corresponding to the optical cable segment end points to obtain end point encoding information;

[0031] According to the end point encoding information, determine the length between each optical cable segment end point, and based on a recursive center point position screening algorithm and a preset maximum distance threshold, screen the optical cable segments in the optical cable segment end point resource information to obtain screened optical cable segment end point resource information, so as to cluster the optical cable segments between the super-long physical link access base station and the node machine room according to the screened optical cable segment end point resource information.

[0032] The application further provides a base station access service optimization system, comprising:

[0033] A path connection relationship acquisition module is configured to acquire the path connection relationship between the node machine room and each access base station according to the baseband processing unit information and the radio remote unit attribution information of the node machine room in the transmission network.

[0034] A super-long physical link access base station determination module is configured to determine the link distance between the node machine room and each access base station in the path connection relationship according to a preset connection link distance threshold, and determine a super-long physical link access base station from a plurality of access base stations according to the determination result.

[0035] A transmission service path optimization module is configured to optimize the path between the super-long physical link access base station and the node machine room according to the optical cable segment end point resource information corresponding to the super-long physical link access base station based on a clustering algorithm, to obtain a target optimization path, and to newly build an optical cable segment between the super-long physical link access base station and the node machine room according to the target optimization path.

[0036] The application further provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the base station access service optimization method of any of the above when executing the program.

[0037] The application further provides a non-transitory computer readable storage medium having a computer program stored thereon, wherein the computer program is executable by a processor to implement the base station access service optimization method of any of the above.

[0038] The application further provides a computer program product comprising a computer program, wherein the computer program is executable by a processor to implement the base station access service optimization method of any of the above.

[0039] The base station access service optimization method and system provided by the application can realize automatic optimization of transmission network routing, reduce investment in construction resources such as optical cables and pipelines, and improve the efficiency and accuracy of link optimization. BRIEF DESCRIPTION OF DRAWINGS

[0040] In order to more clearly illustrate the technical solutions in the application or prior art, the drawings needed in the embodiments or prior art description will be briefly introduced below. Obviously, the drawings in the following description are some embodiments of the application, and other drawings can be obtained by those skilled in the art without creative labor.

[0041] Figure 1 The flowchart of the base station access service optimization method provided by the application is shown in the figure.

[0042] Figure 2 The structure diagram of the base station access service optimization system provided by the application is shown in the figure.

[0043] Figure 3 The structure diagram of the electronic device provided by the application is shown in the figure. DETAILED DESCRIPTION

[0044] In order to make the purpose, technical scheme and advantages of the application more clear, the technical scheme in the application will be described clearly and completely below in combination with the drawings in the application. Obviously, the described embodiments are part of the embodiments of the application, not all the embodiments. Based on the embodiments in the application, all other embodiments obtained by those skilled in the art without creative labor belong to the protection scope of the application.

[0045] As the infrastructure supporting the entire communication system, the scale of the transmission network is expanding, and the structure is becoming more and more complex. Especially the local transmission network, as the core and cornerstone in the network architecture, carries huge data traffic and service types, and also faces more severe security challenges and potential risks. With the large-scale deployment of new base stations, how to ensure that the access service of these new nodes meets the specifications and can adapt to network changes in a timely manner has become the key to ensuring the overall network security and stable operation.

[0046] However, the existing identification mechanism and optimization strategy for non-standard access services of base stations are still insufficient. The present application proposes to use recursive center point position screening and unsupervised learning algorithm to process the path optimization problem of cross-grid access base stations and super-long physical link access base stations in the machine room of the transmission network. In the present application, based on point-line-surface resource data and empirical threshold, the recursive center point position screening algorithm is used to preliminarily clean the bottom layer data of the large optical cable section and the bearing section, reduce the data set required by the algorithm model, and greatly reduce the data amount of the data to be calculated, thereby improving the calculation efficiency. Further, the unsupervised learning algorithm is introduced to perform shortest path iteration calculation on the paths of the cross-grid access base stations and the super-long physical link access base stations in the machine room, and to select the optimal planning scheme with the minimum investment and the shortest path, so as to realize the automatic optimization of the transmission network routing, reduce the investment of optical cable, pipeline and other construction resources, and improve the link optimization work efficiency.

[0047] Figure 1 The flowchart of the base station access service optimization method provided by the present application is shown in Figure 1 The present application provides a base station access service optimization method, which comprises the following steps:

[0048] In step 101, the connection relationship between the node machine room and each access base station is obtained according to the baseband processing unit information and the radio remote unit attribution information corresponding to the node machine room in the transmission network.

[0049] In the communication network, the transmission network plays a crucial role, responsible for efficiently and securely transmitting various types of data and information from one node to another. In this process, the node machine room, as a core component of the transmission network, carries out functions such as data processing, forwarding and storage; the access base station is the connection point between user equipment and the core network, responsible for signal reception and transmission and data transmission. The baseband processing unit (BBU) and the radio remote unit (RRU) are two indispensable components of the base station system, and their cooperative work ensures the effective transmission of wireless signals.

[0050] In the present application, first, the relevant information of the BBU installed in each node machine room is collected, including the model, serial number, IP address and port configuration of the BBU. At the same time, the attribution information of each RRU needs to be obtained, i.e. which BBU they are connected to, which can be realized through physical connection (such as optical fiber connection) or logical connection (such as connection established through a specific protocol) between RRU and BBU.

[0051] After the above information is collected, the information is mapped to the topology of the transmission network, and it is further inferred how the connections constitute the path from the node room to each access base station (i.e. to the location of the RRU), so that through the above mapping process, the path connection relationship between the node room and each access base station can be determined. It should be noted that in the present application, one node room can be connected to multiple BBUs, and each BBU can be connected to multiple RRUs, which can be distributed in different geographical locations to form multiple access base stations.

[0052] In step 102, the link distance between the node room and each access base station in the path connection relationship is judged according to a preset connection link distance threshold, and according to the judgment result, an overlong physical link access base station is determined from the multiple access base stations.

[0053] In the present application, the link distance is the physical or logical distance of data transmission between the node room and the access base station. The preset connection link distance threshold is a value set in advance, which is used to judge whether the link distance is too long to affect the quality or efficiency of data transmission.

[0054] In the present application, first, the link distance information between the node room and each access base station needs to be collected, which can be achieved in various ways, such as based on positioning data. Then, the collected link distance is compared with the preset connection link distance threshold. In the present application, this preset connection link distance threshold can be set according to network design, transmission technology and business demand and other factors.

[0055] Further, if the link distance between a certain access base station and the node room exceeds the preset threshold, then this link is determined to be an overlong physical link. After the link distance between all access base stations and the node room has been judged, those access base stations whose link distance exceeds the threshold are screened out, and then an overlong physical link access base station list is obtained.

[0056] In step 103, based on a clustering algorithm, the path between the overlong physical link access base station and the node room is optimized according to the optical cable segment endpoint resource information corresponding to the overlong physical link access base station, to obtain a target optimization path, so that a new optical cable segment is built between the overlong physical link access base station and the node room according to the target optimization path.

[0057] In the present application, the optical cable segment endpoint resource information corresponding to the overlong physical link access base station is analyzed by a clustering algorithm, which includes the geographical location and length of the optical cable segment. Through clustering, these endpoint resources can be grouped according to certain similarity criteria (such as proximity in geographical location, etc.).

[0058] The cable segment endpoint resource refers to the start and end points of the cable connection in the network, i.e. the access point and the exit point of the cable, which is crucial for determining the direction, length and capacity of the cable. In the present application, the specific information of these endpoint resources needs to be analyzed, including their relative positions, the capacity utilization of the existing cable, possible routing obstacles, etc., in order to provide the basis for subsequent path optimization.

[0059] Further, using the results obtained by the clustering algorithm, it can be identified which endpoint resources are geographically close, thus possibly forming a more optimal communication path. Then, using an optimization algorithm (e.g. taking into account various factors such as network topology, cost estimation, performance requirements, etc.), an optimal path from the access base station of the super-long physical link to the node room can be calculated and determined, which will be as short as possible, low in cost, sufficient in capacity, and avoid potential routing obstacles.

[0060] In the present application, one or more candidate optimal paths can be derived, which will be selected as the target optimal path. In selecting the target optimal path, various factors such as path length, cost, construction difficulty, impact on the existing network, etc. can be considered and comprehensively evaluated. When the target optimal path is determined, the planning of the new cable segment can be carried out according to this path.

[0061] In an embodiment, in the process of identifying the non-standard link distance service, the cross-grid access base stations existing in the transmission network can also be identified to obtain the situation of non-standard access base stations in the current transmission network, i.e. to determine whether the base stations accessing the node room are consistent with the expectations. In this embodiment, based on the data relationship between the management pipeline and the site, BBU, and RUU / AUU (active antenna unit), the correct connection relationship and detailed data of the non-standard access service can be output, and then the correct attribution relationship and the shortest path of access of the cross-grid access base station and the super-long physical link access base station in the room can be re-planned. In order to solve the problem of non-standard access in a timely manner, the list of non-standard access services in the province is analyzed and output, and the service optimization adjustment scheme is automatically and quickly formulated. It should be noted that in this embodiment, after determining that a certain base station is a non-standard access base station, the node room corresponding to the base station needs to be re-planned, i.e. the node room currently accessed by the base station is changed to the node room corresponding to the preset attribution relationship of the base station, and on this basis, the path between the base station and the new node room is re-planned, wherein the path planning process is the same as the path optimization process of the super-long physical link access base station, and for details, reference can be made to the path optimization process of the super-long physical link access base station.

[0062] Specifically, in step 1, first, the BBU information under the node room in the transmission network and the base station information to which the RRU device belongs (including the BBU information corresponding to the connection of the RRU and the base station information where the RRU is located) are counted.

[0063] In step 2, according to the connection relationship between the BBU and the RRU, the base station list of the base station and the node room existing the passage can be obtained, so that the passage connection relationship between the node room and each access base station is obtained.

[0064] In step 3, the room grid area frame (i.e. the preset room grid area information, which can be obtained by the related information of the early transmission network construction planning) and the base station latitude and longitude information in the existing network are obtained, and the point-plane attribution relationship is judged by using the polygon vertex method, the connection relationship between the base station in the construction planning period and the node room is analyzed, and the preset base station attribution relationship corresponding to the access base station is obtained.

[0065] In step 4, it is judged whether the passage connection relationship between the node room and each access base station counted in step 2 is consistent with the face area to which the base station belonging to the preset base station attribution relationship is connected, if not, the room cross-grid access base station list is output.

[0066] In step 5, the physical distance of the connection link of the node room and the base station having the connection relationship is obtained, if it exceeds the limited threshold, it is judged as a super-long physical link access base station.

[0067] In step 6, the transmission services determined to exist in the above steps are optimized, including but not limited to the room cross-grid access base station, the super-long physical link access base station and other non-standard service access, and finally the optimal service access scheme is automatically generated.

[0068] The base station access service optimization method provided by the application can realize the automatic optimization of the transmission network routing, reduce the investment of optical cable, pipeline and other construction resources, and improve the link optimization work efficiency and accuracy.

[0069] On the basis of the above embodiment, the passage connection relationship between the node room and each access base station is obtained according to the baseband processing unit information corresponding to the node room and the radio remote unit attribution information in the transmission network, and the passage connection relationship between the node room and each access base station is obtained.

[0070] The baseband processing unit information is obtained based on the currently installed baseband processing unit in the node room, wherein the baseband processing unit information at least includes the hanging connection information between the baseband processing unit and the radio remote unit.

[0071] obtaining base station belonging information between the access base station and the radio frequency remote unit;

[0072] determining radio frequency remote unit belonging information corresponding to the node machine room according to the base station belonging information and the hanging connection information;

[0073] obtaining the access connection relationship according to an access base station where a target radio frequency remote unit in the radio frequency remote unit belonging information is located.

[0074] In the application, by counting the relationship between the node machine room and the BBU in the station table, the belonging relationship between the BBU and the hanging RRU device, and the relationship between the RRU and the belonging station, the number of all RRU corresponding to the BBU hanging under the same node machine room and the belonging station are determined, and finally the logical relationship between the node machine room and all the hanging stations (base stations) thereof is obtained, and the access connection relationship therebetween is obtained.

[0075] Specifically, in the application, the information of the currently installed BBU in the node machine room needs to be recognized and obtained, which includes but is not limited to the model, serial number and configuration state of the BBU, etc. According to the hanging connection information between the BBU and the RRU, it can be known which RRU is connected to each BBU, and the specific configuration (such as port number, connection state, etc.) of the connection.

[0076] Further, the belonging relationship between the access base station and the RRU is obtained, and it is determined which RRU is allocated to which access base station for management. After obtaining the hanging connection information between the BBU and the RRU and the belonging information between the access base station and the RRU, the exact belonging of each RRU can be determined by comprehensively considering these information, including determining whether each RRU directly belongs to a certain access base station or indirectly belongs to a certain access base station through a specific BBU.

[0077] Finally, according to the access base station where the target RRU in the RRU belonging information is located, the access connection relationship related to these RRU can be further obtained, including the complete link from the BBU to the RRU, and the access connection relationship between the node machine room and the access base station is obtained.

[0078] On the basis of the above-mentioned embodiments, the method further comprises:

[0079] determining a preset base station belonging relationship corresponding to each of the access base stations based on base station longitude and latitude information in preset machine room grid area information;

[0080] If it is determined that there is a target base station according to the path connection relationship and the preset base station belonging relationship, the corresponding optimized node machine room information of the target base station is determined according to the preset base station belonging relationship, and the node machine room to which the target base station belongs is changed according to the optimized node machine room information, wherein the target base station is an access base station whose path connection relationship and preset base station belonging relationship are inconsistent, and the optimized node machine room information is obtained based on the preset base station belonging relationship.

[0081] In the present application, the frame information of the whole network machine room grid and the longitude and latitude data of the whole website are first acquired, and then the polygon vertex method is used to determine the base stations under each node machine room, so as to determine the machine room grid to which these base stations belong, and analyze whether the underhanging base station and the node machine room to which it belongs are in the same machine room grid. According to the transmission network topology requirement, the node machine room and the physical site under it should belong to the same machine room grid, but in actual business, due to the limitation of planning means, pipeline resources and geographical environment, many base stations are incorrectly connected, and the business is not standardized, which does not meet the network topology requirement. Therefore, the connection relationship of the existing business is determined, and a list of cross-grid access base stations is output.

[0082] Specifically, in the function of the machine room cross-grid access base station, the longitude and latitude information of the node machine room and the base station site is first acquired, and then the frame information of the machine room grid surface is acquired, and the polygon vertex method is used to determine the preset machine room grid to which the node machine room and the base station site belong, that is, to analyze the preset base station belonging relationship between the node machine room and the base station. On this basis, according to the path connection relationship obtained in the above embodiment, it is determined whether it belongs to the same machine room grid, and if it belongs to the same machine room grid, no optimization measures are taken; if the node machine room and the base station site belong to different machine room grids, the node machine room in the same machine room grid is obtained as the correct uplink site based on the base station site (that is, determined according to the preset machine room grid surface area information), and a cross-grid access base station list is output, which is composed of related information of multiple target base stations.

[0083] On the basis of the above embodiment, before the link distance between the node machine room and each access base station in the path connection relationship is determined according to the preset connection link distance threshold, and the ultra-long physical link access base station is determined from the multiple access base stations according to the determination result, the method further comprises:

[0084] According to the baseband processing unit information and the base station belonging information, the optical path information between the node machine room and the access base station is acquired.

[0085] Based on the hash algorithm, the optical cable segment length information between the node machine room and the access base station is acquired from the optical cable segment information list according to the optical path information.

[0086] According to the optical cable segment length information, the link distance between the node machine room and the access base station is obtained;

[0087] The link distance between the node machine room and each access base station in the access connection relationship is judged according to a preset connection link distance threshold, and an overlong physical link access base station is determined from the plurality of access base stations according to a judgment result, and the method comprises the steps of:

[0088] When it is determined that the node machine room and the access base station are double-route access, a first preset connection link distance threshold and a second preset connection link distance threshold are obtained, wherein the first preset connection link distance threshold is a preset connection link distance threshold corresponding to a route marked as a long link in the double route; and the second preset connection link distance threshold is a preset connection link distance threshold corresponding to a route marked as a short link in the double route;

[0089] When the link distance corresponding to the route marked as the long link is greater than the first preset connection link distance threshold, or when the link distance corresponding to the route marked as the short link is greater than the second preset connection link distance threshold, the access base station connected to the node machine room is determined as the overlong physical link access base station.

[0090] In the present application, in the calculation of the front-end access distance of the wireless base station, the access base stations in the machine room cross-grid access base station list obtained in the above embodiment are described, and the optical path information between the BBU and the RRU is found. In an embodiment, if there is no direct associated optical path between the BBU and the RRU, the optical path can be associated with the optical splitter by converting the optical splitter data, and the optical path information between the base station site and the node machine room is obtained.

[0091] In an embodiment, the base station frequency band can also be distinguished, such as a 700M station, which only calculates a single path; and a 2.6G base station, which needs to calculate the double route from the station to the node machine room and perform calculation.

[0092] Further, according to the optical path data associated in the above embodiment, the optical cable segment can be associated and the length information of the optical cable segment is obtained, and then the optical path access distance between the node machine room and the hanging base station is calculated, and according to the type of the station and the length of the access distance, it is determined whether it belongs to the overlong physical link access.

[0093] Specifically, two thresholds of long distance and short distance are set for the paths of the dual routing respectively, and if the calculated distance exceeds the set threshold, the path is determined as a long distance or a short distance out-of-limit access. In the present application, the calculation process of the link distance in the above embodiment can improve the calculation efficiency through hash connection, quickly match the connection conditions through the construction of a hash table, and thus improve the performance and efficiency of the connection query. The specific process of hash connection is as follows:

[0094] First, the connection columns (columns of connection conditions) in the two tables of the connection operation (such as the optical path information list and the optical cable segment information list) are subjected to hash operation through a hash function, and are mapped to the buckets of the hash table;

[0095] Then, the connection columns of one of the tables are stored in the corresponding buckets according to the hash values, and a hash table is constructed;

[0096] Next, the connection columns of the second table are traversed, and for each record, the hash value is calculated through the hash function, and then the matching record is found in the hash table.

[0097] Finally, the matching records are combined to form the result of the connection.

[0098] On the basis of the above embodiment, the optical cable segment path between the super-long physical link access base station and the node machine room is optimized based on the clustering algorithm according to the optical cable segment endpoint resource information corresponding to the super-long physical link access base station, and a target optimized path is obtained, comprising:

[0099] According to the existing multiple optical cable segment endpoints within a preset distance range of the super-long physical link access base station, the optical cable segment endpoint resource information is obtained, wherein the optical cable segment endpoint resource information at least includes the longitude and latitude information of the optical cable segment endpoint;

[0100] Based on the clustering algorithm, the optical cable segments between the super-long physical link access base station and the node machine room are clustered according to the optical cable segment endpoint resource information, and the shortest optical cable segment path between the super-long physical link access base station and the node machine room is constructed according to the corresponding optical cable segments in the clustering result, so as to obtain the target optimized path according to the shortest optical cable segment path.

[0101] In the present application, the shortest path planning between the node room and the base station is realized by an unsupervised learning algorithm. The existing manual path planning method needs to rely on professional personnel for manual calculation, which is time-consuming and laborious, and is prone to errors. In contrast, the present application uses an unsupervised learning algorithm to perform data clustering and dimensionality reduction in super-long physical link access optimization, reducing the computational complexity and extracting the main feature information. The present application can automatically learn and discover the patterns and structures in the data from a large amount of data without human intervention, help optimize link access, and ultimately find the best path.

[0102] Specifically, the routing of the base station site and the correct node machine room connected thereto is planned, wherein the principle of new laying or reusing of optical cable between two points is: if no pipeline resource data can be fitted around the newly built site or the point to be planned, and the shortest path of the reused planning cannot be obtained, then new optical cable is laid, and a new scheme is given. The specific path optimization process is as follows:

[0103] First, taking SE as an example, all optical cable segment endpoints within a certain distance from endpoint S are obtained, if A, B, C exist, then the distances of line segment SA, line segment SB, and line segment SC and the current nodes A, B, and C are recorded respectively, and the distance characteristics are calculated according to the latitude and longitude. In the present application, the latitude and longitude can be converted into distance characteristics using a geographic distance formula (such as the Haversine formula).

[0104] Further, a clustering algorithm is selected to discover the patterns and structures in the data. In the present application, if the data dimension is high, a dimensionality reduction algorithm can be used to reduce the dimension and extract the main features. For the dimensionality reduction algorithm, the features of the bearer segment or the optical cable segment are used as input, and the selected dimensionality reduction algorithm is used for training and dimensionality reduction. For the clustering algorithm, the features of the bearer segment or the optical cable segment are used as input, and the selected clustering algorithm is used for training and clustering.

[0105] Further, the results of the clustering algorithm are analyzed. In the present application, according to the output of the clustering algorithm, the bearer segments or optical cable segments with shorter distances to the endpoint are classified into the same category, and then the path optimization is performed according to the category information, for example, endpoint A is regarded as a new starting point, the length of line segment SA and the straight-line distance between endpoint A and endpoint M are added, and then these distances are arranged in ascending order, and the paths with the smallest distances are selected. According to the clustering results or the similarity in the feature space, the appropriate path is selected to optimize the access of the super-long physical link.

[0106] On the basis of the above embodiment, after obtaining the optical cable segment endpoint resource information within a predetermined distance range of the base station accessed by the super-long physical link, the method further comprises:

[0107] Encode the longitude and latitude information of the cable segment end points corresponding to the cable segment end points to obtain end point encoding information;

[0108] According to the end point encoding information, determine the length between each cable segment end point, and based on the recursive center point position screening algorithm and the preset maximum distance threshold, screen the cable segment in the cable segment end point resource information to obtain screened cable segment end point resource information, so as to cluster the cable segment between the super-long physical link access base station and the node machine room according to the screened cable segment end point resource information.

[0109] In the present application, for the access base station of the super-long physical link, based on the original uplink relationship, taking the node machine room and the base station site as the opposite end, and taking the network as the underlying data, based on the unsupervised learning algorithm, the path exceeding the limit is re-planned, and the optical cable laying route meeting the distance upper limit threshold is output. For the case that the old optical cable path cannot meet the distance limit, a new bearing path is output.

[0110] In the present application, before the unsupervised learning algorithm is performed, the input data can be preprocessed by the recursive center point position screening algorithm, and the specific process is as follows:

[0111] First, read the underlying data of the cable segment and the bearing segment, encode the longitude and latitude of the end points according to Base32, then obtain the encoding of the surrounding grid center points, and store them in the grid encoding set S, on this basis, set a reasonable distance maxDistance (i.e. the preset maximum distance threshold), in an embodiment, the threshold is 500m. If the length of the cable segment AB exceeds maxDistance, take the center point C of AB, and recursively execute the above process for AC and BC until all the grid sets meeting the length of the line segment are obtained. The above algorithm is screened for the planned two points and the cable segment table, and then the grid id is matched to obtain the minimum quantization cable segment set contained between the two points that need to be optimized, thereby realizing the function of reducing the data set required for operation.

[0112] The base station access service optimization system provided by the present application is described below, and the base station access service optimization system described below can be correspondingly referred to the base station access service optimization method described above.

[0113] Figure 2 The structure diagram of the base station access service optimization system provided by the present application is shown in the figure Figure 2As shown, the application provides a base station access service optimization system, comprising a path connection relationship acquisition module 201, an ultra-long physical link access base station determination module 202 and a transmission service path optimization module 203, wherein the path connection relationship acquisition module 201 is used to acquire the path connection relationship between the node machine room and each access base station according to the baseband processing unit information corresponding to the node machine room and the radio remote unit attribution information in the transmission network; the ultra-long physical link access base station determination module 202 is used to judge the link distance between the node machine room and each access base station in the path connection relationship according to a preset connection link distance threshold, and determine an ultra-long physical link access base station from a plurality of access base stations according to the judgment result; the transmission service path optimization module 203 is used to optimize the path between the ultra-long physical link access base station and the node machine room based on a clustering algorithm according to the optical cable segment endpoint resource information corresponding to the ultra-long physical link access base station, obtain a target optimization path, and newly build an optical cable segment between the ultra-long physical link access base station and the node machine room according to the target optimization path.

[0114] The base station access service optimization system provided by the application can identify non-standard base station access services, perform shortest path iterative calculation on the paths of the access base stations with problems, select the optimal planning scheme with the minimum investment and the shortest path, realize automatic optimization of the transmission network routing, reduce the investment of cable, pipeline and other construction resources, and improve the link optimization work efficiency and accuracy.

[0115] The system provided by the application is used to execute the above-mentioned method embodiments, and the specific process and detailed content can be referred to the above-mentioned embodiments, which will not be described here.

[0116] Figure 3 The structural schematic diagram of the electronic equipment provided by the application is as follows, Figure 3As shown, the electronic device can include a processor 301, a communications interface 302, a memory 303, and a communications bus 304, wherein the processor 301, the communications interface 302, and the memory 303 complete mutual communication through the communications bus 304. The processor 301 can invoke a logical instruction in the memory 303 to execute a base station access service optimization method, which includes: obtaining a path connection relationship between a node machine room and each access base station according to baseband processing unit information corresponding to the node machine room and radio remote unit attribution information in a transmission network; judging a link distance between the node machine room and each access base station in the path connection relationship according to a preset connection link distance threshold, and determining an ultra-long physical link access base station from the multiple access base stations according to a judgment result; based on a clustering algorithm, optimizing a path between the ultra-long physical link access base station and the node machine room according to optical cable segment endpoint resource information corresponding to the ultra-long physical link access base station, to obtain a target optimization path, so as to newly build an optical cable segment between the ultra-long physical link access base station and the node machine room according to the target optimization path.

[0117] In addition, the logical instruction in the memory 303 described above can be implemented in the form of a software function unit and sold or used as an independent product, which can be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application essentially or the part that contributes to the prior art or part of the technical solutions can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a plurality of instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in various embodiments of the present application. The foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk or an optical disk, and various program code storage media.

[0118] In another aspect, the present application also provides a computer program product, which comprises a computer program stored on a non-transitory computer-readable storage medium, and the computer program comprises program instructions, when the program instructions are executed by a computer, the computer can execute the base station access service optimization method provided by the above-mentioned methods, and the method comprises the following steps: acquiring the path connection relationship between a node machine room and each access base station in a transmission network according to baseband processing unit information corresponding to the node machine room and radio remote unit attribution information; judging the link distance between the node machine room and each access base station in the path connection relationship according to a preset connection link distance threshold, and determining an ultra-long physical link access base station from a plurality of access base stations according to the judgment result; optimizing the path between the ultra-long physical link access base station and the node machine room according to optical cable segment endpoint resource information corresponding to the ultra-long physical link access base station based on a clustering algorithm, obtaining a target optimization path, and newly building an optical cable segment between the ultra-long physical link access base station and the node machine room according to the target optimization path.

[0119] In another aspect, the present application also provides a non-transitory computer-readable storage medium, which stores a computer program, and the computer program is executed by a processor to implement the base station access service optimization method provided by the above-mentioned embodiments, and the method comprises the following steps: acquiring the path connection relationship between a node machine room and each access base station in a transmission network according to baseband processing unit information corresponding to the node machine room and radio remote unit attribution information; judging the link distance between the node machine room and each access base station in the path connection relationship according to a preset connection link distance threshold, and determining an ultra-long physical link access base station from a plurality of access base stations according to the judgment result; optimizing the path between the ultra-long physical link access base station and the node machine room according to optical cable segment endpoint resource information corresponding to the ultra-long physical link access base station based on a clustering algorithm, obtaining a target optimization path, and newly building an optical cable segment between the ultra-long physical link access base station and the node machine room according to the target optimization path.

[0120] The device embodiments described above are only schematic, wherein the units shown as separate components can or can not be physically separate, and the components shown as units can or can not be physical units, that is, they can be located in one place, or can be distributed on a plurality of network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the present embodiment scheme. Those skilled in the art can understand and implement it without creative labor.

[0121] Those skilled in the art can clearly understand the technical solutions of the various embodiments from the above description of the embodiments, and the various embodiments can be implemented by means of software with the necessary general hardware platforms, and of course, can also be implemented by hardware. Based on such understanding, the above technical solutions, essentially or in other words, the part of the prior art that makes a contribution, can be embodied in the form of a software product, which can be stored in a computer readable storage medium, such as a ROM / RAM, a magnetic disk, an optical disk, and the like, and includes a number of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0122] Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, rather than limit them; although the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: it can still modify the technical solutions recorded in the foregoing embodiments, or make equivalent replacement for some technical features therein; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. A method for optimizing access traffic of a base station, characterized by, The method comprises: According to the baseband processing unit information corresponding to the node machine room in the transmission network and the radio remote unit attribution information, the access between the node machine room and each access base station is obtained. According to the preset connection link distance threshold, the link distance between the node machine room and each access base station in the access connection relationship is judged, and according to the judgment result, the super long physical link access base station is determined from a plurality of access base stations. Based on the clustering algorithm, according to the optical cable segment endpoint resource information corresponding to the super long physical link access base station, the path between the super long physical link access base station and the node machine room is optimized to obtain the target optimization path, so that the optical cable segment between the super long physical link access base station and the node machine room is newly built according to the target optimization path.

2. The base station access traffic optimization method of claim 1, wherein, According to the baseband processing unit information corresponding to the node machine room in the transmission network and the radio remote unit attribution information, the access between the node machine room and each access base station is obtained. Based on the currently installed baseband processing unit in the node machine room, the baseband processing unit information is obtained, wherein the baseband processing unit information at least includes the hanging connection information between the baseband processing unit and the radio remote unit. The base station attribution information between the access base station and the radio remote unit is obtained. According to the base station attribution information and the hanging connection information, the radio remote unit attribution information corresponding to the node machine room is determined. According to the access base station where the target radio remote unit in the radio remote unit attribution information is located, the access connection relationship is obtained.

3. The base station access traffic optimization method of claim 1, wherein, The method further comprises: Based on the base station latitude and longitude information in the preset machine room grid area information, the preset base station attribution relationship corresponding to each access base station is determined. If it is known that there is a target base station according to the access connection relationship and the preset base station attribution relationship, the optimization node machine room information corresponding to the target base station is determined according to the preset base station attribution relationship, so that the node machine room to which the target base station belongs is changed according to the optimization node machine room information, wherein the target base station is an access base station inconsistent with the access connection relationship and the preset base station attribution relationship, and the optimization node machine room information is obtained based on the preset base station attribution relationship.

4. The base station access traffic optimization method of claim 2, wherein, Before the method further comprises: According to the baseband processing unit information and the base station attribution information, the optical path information between the node machine room and the access base station is obtained. Based on the hash algorithm, according to the optical path information, the optical cable segment length information between the node machine room and the access base station is obtained from the optical cable segment information list. According to the optical cable segment length information, the link distance between the node machine room and the access base station is obtained. The method comprises the following steps: When the link distance corresponding to the long link marked route is greater than the first preset connection link distance threshold, or when the link distance corresponding to the short link marked route is greater than the second preset connection link distance threshold, the access base station connected with the node machine room is determined as the super-long physical link access base station. The method comprises the following steps:

5. The base station access traffic optimization method of claim 4, wherein, The method comprises the following steps: After the step of obtaining the optical cable segment endpoint resource information according to the existing multiple optical cable segment endpoints of the super-long physical link access base station within a preset distance range, the method further comprises the following steps: The method comprises the following steps:

6. The base station access traffic optimization method of claim 5, wherein, The method comprises the following steps: The method comprises the following steps: The method comprises the following steps:

7. A base station access traffic optimization system, characterized by The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following The super-long physical link access base station determination module is configured to determine the link distance between the node machine room and each of the access base stations in the connection relationship according to a preset connection link distance threshold, and determine a super-long physical link access base station from the plurality of access base stations according to a determination result. The transmission service path optimization module is configured to optimize the path between the super-long physical link access base station and the node machine room based on a clustering algorithm and according to the optical cable segment endpoint resource information corresponding to the super-long physical link access base station, to obtain a target optimized path, and to newly build an optical cable segment between the super-long physical link access base station and the node machine room according to the target optimized path.

8. An electronic device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, The processor executes the computer program to implement the base station access service optimization method of any one of claims 1 to 6. 9.A non-transitory computer-readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by the processor to implement the base station access service optimization method of any one of claims 1 to 6.

10. A computer program product comprising a computer program, characterized in that, The computer program is executed by the processor to implement the base station access service optimization method of any one of claims 1 to 6.

Images