Site Selection Planning Of ToB Machine Room Based On Improved Backtracking Algorithm

With the rapid development of the domestic economy,the business scale of small and medium-sized enterprises continues to grow,and the demand for the network is also increasing..Therefore,operators urgently need to provide high-quality and low-cost private lines for various government and enterprise customers to enhance the competitiveness of private line products in value areas such as commercial buildings.When the investment amount is limited,operators need to accurately construct the basic equipment room of the high-quality To B network to ensure that the limited investment is used where it is most needed,and to improve the efficiency of network access capabilities.Based on the analysis of the principles and objectives of the operator’s transmission equipment room location,this paper summarizes a number of influencing factors that affect the site selection of the equipment room.On the planning problem of determining the location of the computer room,a reduced-order backtracking algorithm is applied to obtain the optimal location of the To B computer room.It has been piloted in the case of the comprehensive access area of Nanjing Xingang Development Zone,reducing the average access distance of terminal sites,the density of optical handover points in the target comprehensive area,and shortening the opening distance of dual-line services.There are three main research contents in this thesis:First,it introduces the basic requirements of various node computer rooms of the local transmission network,and puts forward some general location principles and methods for engineering construction and computer room facilities under the condition of meeting the requirements of business development.In this paper,the site selection planning of To B computer room is mainly based on these site selection requirements and principles.The second is to introduce four common improvement measures for cluster analysis methods,and compare the time complexity and the ease of being affected by noise through a list.The traditional K-means algorithm is deeply analyzed and studied.By pointing out the problem that the classical K-means algorithm randomly selects k center points easily leads to unsatisfactory final results and improves it: from the original random selection of k center points to the initial selection of planned center points,the method is found through calculation and analysis.Effectively improve the computing performance.Finally,another backtracking algorithm used in planning and site selection is introduced,and the algorithm is improved by combining the Pearson correlation coefficient.Through the analysis of mathematical properties,it can be seen that the improved algorithm can accurately and batch calculate the site selection result of the To B computer room.The third is to select the network layout planning of the To B computer room in the comprehensive service access area of Nanjing Xingang Development Zone for example verification.Through the reduced-order backtracking algorithm and the improved Pearson correlation coefficient,the data of the computer room and To B merchants are calculated,and the geographical information of the region and the information of the existing computer room are entered,and the geographic location of the new site is obtained through the calculation,so as to realize the site selection of the transmission equipment room in this area.optimization.After adding 2 new access computer room sites,the optimization effect of the computer room in the Xingang comprehensive service access area has been significantly improved.The average access distance of end sites,the density of optical handover points in the target all reduce.