CN115460096B - Network basic resource planning method, device, equipment and computer storage medium - Google Patents

Network basic resource planning method, device, equipment and computer storage medium Download PDF

Info

Publication number
CN115460096B
CN115460096B CN202110559043.3A CN202110559043A CN115460096B CN 115460096 B CN115460096 B CN 115460096B CN 202110559043 A CN202110559043 A CN 202110559043A CN 115460096 B CN115460096 B CN 115460096B
Authority
CN
China
Prior art keywords
machine room
service
target
determining
optical cable
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110559043.3A
Other languages
Chinese (zh)
Other versions
CN115460096A (en
Inventor
李纯雅
赵占军
霍强
杨飞
赵鹏飞
赵鹏辉
瞿少凯
杨春晖
李中秋
翟鹏
李勇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Mobile Communications Group Co Ltd
China Mobile Group Design Institute Co Ltd
Original Assignee
China Mobile Communications Group Co Ltd
China Mobile Group Design Institute Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Mobile Communications Group Co Ltd, China Mobile Group Design Institute Co Ltd filed Critical China Mobile Communications Group Co Ltd
Priority to CN202110559043.3A priority Critical patent/CN115460096B/en
Publication of CN115460096A publication Critical patent/CN115460096A/en
Application granted granted Critical
Publication of CN115460096B publication Critical patent/CN115460096B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design
    • H04L41/145Network analysis or design involving simulating, designing, planning or modelling of a network

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Optical Communication System (AREA)

Abstract

The embodiment of the invention relates to the technical field of communication, and discloses a network basic resource planning method, which comprises the following steps: respectively acquiring service distribution data and geographic environment data of service points; determining the position of the secondary optical traffic according to the service distribution data; determining a primary optical traffic position, an access machine room position, a convergence machine room position and a core machine room position according to service distribution data, a secondary optical traffic position and geographic environment data; generating a target undirected graph according to geographic environment data, a secondary light intersection position, a primary light intersection position, an access machine room position, a convergence machine room position and a core machine room position; determining a target line according to the target undirected graph; and generating a target planning scheme according to the service point, the position of the secondary optical cross, the position of the primary optical cross, the position of the access machine room, the position of the convergence machine room, the position of the core machine room and the target line. The embodiment of the invention realizes the standardization of resource planning and high accuracy, and achieves the effect of optimally matching the planning network resources and the service.

Description

Network basic resource planning method, device, equipment and computer storage medium
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a network basic resource planning method, a device, equipment and a computer readable storage medium.
Background
At present, the transmission network mainly solves the problem of information transmission in the network and is an important component of the communication network. The basic resource of the transmission network consists of points (optical cross, convergence machine room and core machine room) and wires (pipelines, rods and optical cables). The planning of the existing transmission network basic resources is mainly carried out by a designer according to related principles. The inventor finds that different designers in the existing planning mode understand related principles and have deviation, and the principle of non-uniform planning of service distribution and geographic environment data acquisition standards is mainly subjective judgment and cannot be quantified. The result of planning the basic resources of the transmission network is good and uneven, the deviation is larger, and the accuracy is low.
Disclosure of Invention
In view of the above problems, the embodiments of the present invention provide a network base resource planning method, which is used to solve the technical problems in the prior art that the accuracy of planning a transmission network base resource is low, and the planned network resource cannot be optimally matched with a service.
According to an aspect of an embodiment of the present invention, there is provided a network base resource planning method, the method including:
Respectively acquiring service distribution data and geographic environment data of service points;
determining the position of the secondary optical traffic according to the service distribution data;
according to the service distribution data, the position of the secondary light exchange and the geographic environment data, the position of the primary light exchange, the position of the access machine room, the position of the convergence machine room and the position of the core machine room are respectively determined;
generating a target undirected graph according to the geographic environment data, the position of the secondary light intersection, the position of the primary light intersection, the position of an access machine room, the position of the convergence machine room and the position of the core machine room; the nodes of the target undirected graph represent the positions of the secondary light intersection, the primary light intersection, the converging machine room and the converging machine room, and the edges of the target undirected graph represent possible paths among the nodes;
determining a target line according to the target undirected graph;
and generating a target planning scheme according to the service point, the position of the secondary optical cross, the position of the primary optical cross, the position of the access machine room, the position of the convergence machine room, the position of the core machine room and the target line.
In an alternative manner, the service distribution data includes information of a plurality of service points needing to cover the network; the determining the position of the secondary optical communication according to the service distribution data comprises the following steps:
processing the service distribution data into service standard data according to preset planning key indexes; the service standard data comprises a plurality of standard dimension information of the service point;
clustering the service points according to the plurality of standard dimension information to obtain the position of the secondary optical cross; wherein one of the secondary optical exchanges corresponds to a plurality of service points.
In an optional manner, the preset planning key index includes a service point position, a service point weight and a service point type; the plurality of standard dimension information of the service point comprises position information, weight information and type information of the service point;
the clustering the service points according to the plurality of standard dimension information to obtain the position of the secondary optical cross comprises the following steps:
and clustering the service points according to the position information, the weight information and the type information of the service points, and determining the position of the secondary optical cross.
In an alternative, the geographic environment data comprises road distribution data; the determining the position of the primary optical cross and the position of the convergence machine room according to the service distribution data, the position of the secondary optical cross and the geographic environment data respectively comprises the following steps:
Determining the density distribution of the secondary light intersection according to the position of the secondary light intersection;
determining the position of the primary optical communication and the position of the access machine room according to the service distribution data, the density distribution and the road distribution data;
and determining a convergence machine room and a core machine room from the service distribution data, the position of the primary optical communication or the position of the access machine room according to a preset machine room determination algorithm. In an optional manner, the determining a target line according to the target undirected graph includes:
determining the optical cable route of the tree-shaped optical cable according to the target undirected graph;
determining an optical cable route of the annular optical cable according to the target undirected graph;
and determining a target line according to the optical cable route of the tree-shaped optical cable and the optical cable route of the annular optical cable.
In an alternative manner, the determining the cable route of the tree-shaped cable according to the target undirected graph includes: and searching a minimum spanning tree by taking the converging machine room as a root to determine that the route of the minimum spanning tree is the optical cable route of the tree-shaped optical cable.
In an alternative manner, the determining the cable route of the ring cable according to the target undirected graph includes: searching a Hamiltonian loop between the converging machine room as a node and the optical traffic of the down-hanging wireless machine room; the light exchange of the lower hanging wireless machine room comprises a primary light exchange of the lower hanging wireless machine room or a secondary light exchange of the lower hanging wireless machine room; the routing of the hamiltonian loop is determined as the cable routing of the ring cable.
According to another aspect of an embodiment of the present invention, there is provided a network base resource planning apparatus, including:
the acquisition module is used for respectively acquiring service distribution data and geographic environment data of the service points;
the first determining module is used for determining the position of the secondary optical communication according to the service distribution data;
the second determining module is used for determining the position of the primary optical cross, the position of the access machine room, the position of the convergence machine room and the position of the core machine room according to the service distribution data, the position of the secondary optical cross and the geographic environment data;
the first generation module is used for generating a target undirected graph according to the geographic environment data, the position of the secondary light intersection, the position of the primary light intersection, the position of an access machine room, the position of the convergence machine room and the position of the core machine room; the nodes of the target undirected graph represent the positions of the secondary light intersection, the first-level light intersection, the access machine room, the convergence machine room and the core machine room, and the edges of the target undirected graph represent possible paths among the nodes;
the third determining module is used for determining a target line according to the target undirected graph;
And the second generation module is used for generating a target planning scheme according to the service point, the position of the secondary optical cross, the position of the primary optical cross, the position of the access machine room, the position of the convergence machine room, the position of the core machine room and the target line.
According to another aspect of an embodiment of the present invention, there is provided a network base resource planning apparatus including: the device comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete communication with each other through the communication bus;
the memory is configured to store at least one executable instruction that causes the processor to perform the operations of the network infrastructure resource planning method described above.
According to yet another aspect of embodiments of the present invention, there is provided a computer readable storage medium having stored therein at least one executable instruction that, when run on a network base resource planning device, causes the network base resource planning device to perform the operations of the network base resource planning method described above.
According to the embodiment of the invention, the basic resource planning is carried out based on service distribution and geographic environment, the secondary light exchange is determined based on service point data, the primary light exchange is further determined according to a density distribution function, the determined points are abstracted into the target undirected graph based on the geographic environment, and the target line is determined, so that the target planning scheme is finally obtained, the resource planning is standardized, the accuracy is high, and the planned network resources and the service can be optimally matched. Furthermore, by the mode, planning can be automatically operated, and efficiency is improved.
In addition, the collected service distribution data of the service points are converted into standard service data, so that the data standards are unified, and the indexes are easier to quantify.
The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and may be implemented according to the content of the specification, so that the technical means of the embodiments of the present invention can be more clearly understood, and the following specific embodiments of the present invention are given for clarity and understanding.
Drawings
The drawings are only for purposes of illustrating embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to designate like parts throughout the figures. In the drawings:
fig. 1 is a flow chart illustrating a network basic resource planning method according to an embodiment of the present invention;
fig. 2 shows a schematic diagram of a tree structure and a ring structure of a transmission network according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a target undirected graph of a network infrastructure resource planning method according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a network basic resource planning apparatus according to an embodiment of the present invention;
fig. 5 shows a schematic structural diagram of a network basic resource planning device according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present invention are shown in the drawings, it should be understood that the present invention may be embodied in various forms and should not be limited to the embodiments set forth herein.
Fig. 1 shows a flowchart of a network base resource planning method provided by an embodiment of the present invention, which is performed by a network base resource planning device. The network base resource planning device may be a computer device, a terminal device, a system, a server, a device of a distributed architecture, etc. The network basic resource planning method of the embodiment of the invention is used for resource planning of the infrastructure of the transmission network, and the transmission network comprises a convergence machine room, a primary optical communication, a secondary optical communication, service points and transmission lines between the service points, such as pipelines, rods, optical cables and other infrastructures. Each converging machine room is connected with a plurality of primary optical intersections, each primary optical intersection is connected with a plurality of secondary optical intersections, and each secondary optical intersection is connected with a plurality of service points. The convergence machine room is a service convergence point, and the convergence machine room comprises an OLT (optical line terminal) and an optical line terminal. The first-level light exchange is also called as trunk light exchange (trunk optical cable cross connecting box), and the second-level light exchange is also called as wiring light exchange, cell light exchange and building light exchange. As shown in fig. 1, the method comprises the steps of:
Step 110: and respectively acquiring service distribution data and geographic environment data of the service points.
Wherein the service distribution data of the service points comprises information of a plurality of service points needing to cover the network. Before the service point information is acquired, a target planning area is determined, and service distribution data of service points which need to be covered are searched in the target planning area by means of regularization and the like through open API interfaces such as Gordon, drip, hundred degrees and the like and webpage public information. The information of the service point comprises information such as the position of the service point, the service demand, the service point type and the like, and if the service point is a residential district, the longitude and latitude of the district, the number of the living houses of the district, the price of the district, the type of the district and the like are obtained.
In the embodiment of the invention, the geographic environment data of the target planning area is also collected, and the road information and other basic geographic environment data information of the target planning area can be determined through open API interfaces such as Golde, drip, mobye, hundred degrees and the like and the geographic environment data prestored in the database. The road information includes longitude and latitude information, material information and the like of the road.
Step 120: and determining the position of the secondary optical communication according to the service distribution data.
In the embodiment of the invention, after service distribution data of service points are obtained, the service distribution data are subjected to standardized processing, and the service distribution data are processed into service standard data according to preset planning key indexes; the service standard data comprises a plurality of standard dimension information of the service point. The preset planning key indexes comprise indexes such as service point types, service point positions, service point weights and the like. The service point weight may be calculated according to the type of the service point, the number of users of the service point, the room price of the service point, and other information weights. If the weight of the enterprise office building is higher than the weight of the residential district, for the residential district, the type weight of the residential district, the weight of the number of the living units of the residential district and the average price weight of the residential district can be determined according to a preset weight setting rule to calculate the weight of the residential district. The preset planning key index and the preset weight setting rule can be set according to specific scenes, and can also be determined according to historical experience values, and the embodiment of the invention is not particularly limited. Accordingly, the service standard data includes a plurality of standard dimension information of the service point, and the plurality of standard dimension information includes type information, position information, weight information and the like of the service point.
Because one secondary light intersection is directly connected with a plurality of service points in a star-shaped manner, after a plurality of standard dimension information of the service points are determined, clustering can be carried out by adopting a clustering algorithm, and the positions of the secondary light intersections are obtained. Specifically, the density distribution of the service points can be determined by combining the information such as the type information, the position information, the weight information and the like of the service points in a spatial clustering DBSCAN mode, so that the position of the secondary optical cross construction is determined. And aggregating the service points with similar types, similar positions and similar weights to form a cluster, determining the center of the cluster, and determining the center of the cluster as the optimal position of the secondary light intersection.
In addition, the positions of the service points can be clustered through a k-mean clustering algorithm to obtain clusters with similar distances, the type and weight information of the service points are combined to determine a target weight value, and the positions of the secondary light exchanges are determined according to the clusters and the target weight value. For example, if the center of the cluster is the first longitude and latitude, the position of the secondary light intersection is the first longitude and latitude, which is the target weight value. Wherein the representation of the target weight value may be a multidimensional vector. Specifically, the multidimensional vector is determined according to the statistical data of the historical existing network, and the multidimensional vector comprises the dimensions of the number of optical cables, the broken line coefficient, the safety coefficient and the like of different scenes. In the historical network planning of the optical cable quantity, the optical cable quantity planned by the optical cable quantity is used for a certain service type; the broken line coefficient represents the wiring mode under the service type; the security coefficient characterizes the security requirement corresponding to the service type, for example, in the statistical history network planning, the requirements of the optical cable planning of the government building, school, enterprise or rural area and the like on the quantity, the broken line coefficient, the security coefficient and the like are different for different service requirements.
Step 130: and respectively determining the position of the primary optical cross, the position of the access machine room, the position of the convergence machine room and the position of the core machine room according to the service distribution data, the position of the secondary optical cross and the geographic environment data.
Wherein, for a network resource planning of a certain local area, it comprises: primary optical traffic, secondary optical traffic, service points, access machine room, convergence machine room, and core machine room. The convergence machine room plays a role in the network and is responsible for connecting the local service nodes to backbone nodes and converging and guiding the services to corresponding service nodes through physical and logical networks. The network of the local area is connected with the network of other areas through the backbone layer optical cable by the convergence machine room, and finally is connected with the core machine room. The core machine room generally refers to equipment for realizing the work of centralized processing, storage, transmission and extraction, exchange, management and the like of information in one physical space.
After the geographical environment data is acquired, the geographical environment data needs to be standardized, the geographical environment data includes road distribution data, and each piece of road information in the road distribution data is a string of longitude and latitude data. After the geographic environment data is standardized, a first undirected graph G1 (q, e) can be generated according to the position of the secondary light intersection, the position of the service point and the geographic environment data after the standardized processing, wherein q represents a node corresponding to the secondary light intersection, e represents a path possibly existing on the basis of the geographic environment, wherein the secondary light intersection is between a plurality of corresponding service points. In the embodiment of the invention, the geographic environment data also comprises other geographic data of the area to be planned, including river data, mountain data, railway data and the like, so that when the first undirected graph is generated according to the position of the secondary light intersection, the position of the service point and the geographic environment data after the standardized processing, factors of the river data, the mountain data and the railway data in the geographic environment data are also considered, and the path in the undirected graph bypasses the area with mountain, river or railway. Because the primary light intersection or the access machine room is distributed along the road, after the position of the secondary light intersection is determined, the position of the primary light intersection or the position of the access machine room can be determined by combining the position of the secondary light intersection and road distribution data. In one embodiment of the invention, the density distribution of the secondary light intersection can be determined according to the position of the secondary light intersection; determining from traffic distribution data, said density distribution and said road distribution data
The first-level light exchange position or the position accessed into the machine room. And determining the density distribution of the secondary light intersection according to the position of the secondary light intersection, specifically grouping the secondary light intersection by adopting a density distribution function, wherein the secondary light intersections belonging to the same group correspond to the same primary light intersection or are connected into a machine room. First order light intersection set v= { V1, V2, V3 … … }; wherein Vn represents primary optical cross or access to a machine room, and the secondary optical cross belongs to the set v1= { q1, q2, q3 … … }, wherein q n represents secondary optical cross. After the secondary light intersection set is determined, the optimal primary light intersection position or the position of accessing the machine room is determined by combining road distribution data. The secondary light intersection positions can be clustered based on a density distribution function by combining road distribution data to obtain a secondary light intersection set, such as a DENCLUE algorithm or a DBSCAN algorithm. In another embodiment of the invention, the position of the first-level light intersection or the position of the access machine room is determined by combining the k-means with road distribution data.
The convergence machine room is determined from a plurality of primary optical buses or access machine rooms according to service distribution data. For a transmission network, the convergence machine room is connected with a plurality of primary optical cross or access machine rooms through a ring structure or tree structure, as shown in fig. 2. After the primary light exchange or the access machine room is determined, determining the convergence machine room from the primary light exchange or the access machine room according to a preset machine room determination algorithm. The preset machine room determining algorithm can be one or more of a minimum jump method, a k-shell algorithm, an eccentricity algorithm, a betweenness center algorithm, a PageRank algorithm and the like. Specifically, the minimum jump method refers to determining which service points need to arrive at the convergence machine room fastest according to the multidimensional information of the service points, and determining the position of the convergence machine room according to the service point information of the convergence machine room which needs to arrive at the convergence machine room fastest. That is, the service point that needs to reach the convergence fabric room at the fastest speed may be determined by the type information, the weight information, and the like of the service point. The embodiment of the invention is not particularly limited to the service points which need to reach the convergence machine room at the highest speed, and the person skilled in the art can perform corresponding setting according to specific scenes. Specifically, the importance of the first-order optical cross or access machine room can be determined through a k-shell algorithm, an eccentricity ratio algorithm, a bettery center algorithm, a PageRank algorithm and other algorithms, the first-order optical cross or access machine room is ordered according to the importance of the first-order optical cross, and the most important first-order optical cross or access machine room obtained through ordering is determined as a convergence machine room.
The method for calculating the influence of the nodes in the network by the k-shell algorithm is provided. The nodes with all degrees of 1 are found out first and deleted. And then continuing searching for the node with the degree of 1 in the rest nodes, and deleting. Until there is no node with degree 1 in the network, the value of kshell of the node with degree 1 deleted before is assigned to 1, i.e., ks=1. The node with a degree of 2 is then looked up in the same way and ks=2 is assigned. This is followed by a degree of 3 and a degree of 4 … … and assigning ks=3 and ks=4 … …, respectively, until all nodes in the network have k-shell values. The higher the KS value, the greater the influence. The PageRank algorithm is a Google ordering algorithm, and assigns a weight to each target node, wherein the ordering with a large weight is forward, and the ordering with a small weight is backward. The more important it is to determine which primary light cross is referenced. Specifically, the number of references can be determined by the number of paths carried by the primary optical transport and the weight of the service point.
After the converged machine room is determined, the position of the core machine room can be determined according to the service distribution data, the positions of the converged machine rooms in all areas and the geographic environment data. The process of determining the position of the core machine room according to the service distribution data, the position of the convergence machine room in each area and the geographical environment data is consistent with the manner of determining the convergence machine room, and is not repeated here.
Step 140: and generating a target undirected graph according to the geographic environment data, the position of the secondary light intersection, the position of the primary light intersection, the position of the access machine room, the position of the convergence machine room and the position of the core machine room. .
Generating a target undirected graph G= (V, e) according to geographic environment data, the position of the secondary light intersection, the position of the primary light intersection, the position of the access machine room, the position of the convergence machine room and the position of the core machine room, wherein V represents nodes of the target undirected graph, and the nodes of the target undirected graph represent the position of the primary light intersection, the position of the access machine room, the position of the secondary light intersection, the position of the convergence machine room and the position of the core machine room; e represents the side of the target undirected graph, which is a possible path between each node of the primary optical cross, the access machine room, the secondary optical cross and the convergence machine room or a possible path between the convergence machine rooms and between the convergence machine room and the core machine room on the basis of the geographic environment. Fig. 3 shows a schematic diagram of a target undirected graph of a network-based resource planning method according to an embodiment of the present invention. The figure shows the structure of a target undirected graph of the ring cable, where the graph is the structure of the ring cable, and all possible paths are generated in the topology graph when determining the target line. The dashed frame part only shows the schematic diagrams of the converging machine rooms and the core machine rooms of other areas to be planned, and each converging machine room and the corresponding primary optical fiber, the secondary optical fiber of the access machine room, the service nodes and the like form an annular optical cable in the corresponding area.
Step 150: and determining a target line according to the target undirected graph.
In the embodiment of the invention, after the service point, the secondary optical cross, the primary optical cross, the access machine room, the convergence machine room, the core machine room and the corresponding relation are determined, the final target lines among the service point, the secondary optical cross, the primary optical cross, the access machine room, the convergence machine room, the core machine room and the corresponding relation are also required to be determined. In the embodiment of the invention, the connection relation of the primary optical fiber intersection and convergence machine room comprises an annular optical cable and a tree-shaped optical cable. As shown in fig. 2, a tree structure and a ring structure schematic diagram of a transmission network according to an embodiment of the present invention are shown. Wherein, the left graph in fig. 2 is a ring-shaped optical cable, and the right graph is a tree-shaped optical cable. The routing of the annular optical cable comprises IP RAN/OTN/SPN/PTN/SDH optical cable routing; the routing of the tree-like optical cable includes PON network optical cable routing. The route refers to a line between the nodes.
For the annular optical cable, in the embodiment of the invention, the optical cable route of the annular optical cable is determined according to the target undirected graph, and specifically, a Hamiltonian loop between the optical cross of which the converging machine room is a node and the lower hanging wireless machine room is searched; the light exchange of the lower hanging wireless machine room comprises a first-level light exchange of the lower hanging wireless machine room and a second-level light exchange of the lower hanging wireless machine room; the routing of the hamiltonian loop is determined as the cable routing of the ring cable. The cable route is determined to be an IP RAN/OTN/SPN/PTN/SDH cable route. A hamiltonian graph (hamiltonian graph, hamiltonian graph, or a movable graph) is an undirected graph, from a specified starting point to a specified ending point, passing all other nodes en route and only once. Referring to a graph containing Hamiltonian loops, the closed Hamiltonian path is referred to as a Hamiltonian loop (Hamiltonian cycle), and the path containing all vertices in the graph is referred to as a Hamiltonian path (Hamiltonian path). For the ring cable of fig. 3, the routing of the ring cable is determined by the specific algorithm described above, as indicated by the bolded lines in the figure.
And for the tree-shaped optical cable, determining the optical cable route of the annular optical cable according to the target undirected graph. In the embodiment of the invention, the aggregation machine room is taken as a root, and the minimum spanning tree is searched for to determine that the route of the minimum spanning tree is the optical cable route of the tree-shaped optical cable, and the route of the minimum spanning tree is the optical cable route of the PON network. The minimum spanning tree refers to a spanning tree of a connected graph with n nodes, which is a very small connected graph of the original graph and contains all n nodes in the original graph, and has the least edges for keeping the graph connected. The minimum spanning tree may be found using kruskal algorithm or prim algorithm.
Because the services carried by different optical cable routes are different, the annular optical cable and the tree-shaped optical cable can exist for one service point at the same time, and therefore, after the routes of the annular optical cable and the tree-shaped optical cable are determined, the routes can be overlapped to obtain a target line. Because the routes of the annular optical cable and the tree-shaped optical cable are all in a logical connection relationship, the optical cable can be a line in an actual scene, and therefore, the target line can be generated by combining geographic environment data superposition.
Step 160: and generating a target planning scheme according to the service point, the position of the secondary optical cross, the position of the primary optical cross, the position of the access machine room, the position of the convergence machine room, the position of the core machine room and the target line.
The positions of the service points, the second-level optical cross positions, the first-level optical cross positions, the positions of the access rooms, the positions of the convergence rooms, the positions of the core rooms and the target lines among the core rooms are determined through the steps 110-150. Thus, a target planning scheme may be generated based on the locations of the respective nodes and the target routes.
In the embodiment of the invention, when the target planning scheme is generated, the safety factors in the geographic environment data are also required to be considered, and the executable standardized target planning scheme is finally generated.
According to the embodiment of the invention, the basic resource planning is carried out based on service distribution and geographic environment, the secondary light exchange is determined based on service point data, the primary light exchange is further determined according to a density distribution function, the determined points are abstracted into the target undirected graph based on the geographic environment, and the target line is determined, so that the target planning scheme is finally obtained, the resource planning is standardized, the accuracy is high, and the planned network resources and the service can be optimally matched. Furthermore, by the mode, planning can be automatically operated, and efficiency is improved.
In addition, the collected service distribution data of the service points are converted into standard service data, so that the data standards are unified, and the indexes are easier to quantify.
Fig. 4 is a schematic structural diagram of a network basic resource planning apparatus according to an embodiment of the present invention. As shown in fig. 4, the apparatus 200 includes: the acquisition module 210, the second determination module 230, the first generation module 240, the third determination module 250, and the second generation module 260.
An acquiring module 210, configured to acquire service distribution data and geographic environment data of a service point respectively;
a first determining module 220, configured to determine a position of the second optical traffic according to the service distribution data;
the second determining module 230 is configured to determine a first-level optical traffic location, an access computer room location, a convergence computer room location, and a core computer room location according to the service distribution data, the second-level optical traffic location, and the geographic environment data, respectively;
a first generating module 240, configured to generate a target undirected graph according to the geographical environment data, the position of the secondary optical cross, the position of the primary optical cross, the position of the access machine room, the position of the convergence machine room, and the position of the core machine room; the nodes of the target undirected graph represent the positions of the secondary light intersection, the first-level light intersection, the access machine room, the convergence machine room and the core machine room, and the edges of the target undirected graph represent possible paths among the nodes;
A third determining module 250, configured to determine a target line according to the target undirected graph;
the second generating module 260 is configured to generate a target planning scheme according to the service point, the position of the second optical cross, the position of the first optical cross, the position of the access machine room, the position of the convergence machine room, the position of the core machine room, and the target line.
In an alternative manner, the service distribution data includes information of a plurality of service points needing to cover the network; the determining the position of the secondary optical communication according to the service distribution data comprises the following steps:
processing the service distribution data into service standard data according to preset planning key indexes; the service standard data comprises a plurality of standard dimension information of the service point;
clustering the service points according to the plurality of standard dimension information to obtain the position of the secondary optical cross; wherein one of the secondary optical exchanges corresponds to a plurality of service points.
In an optional manner, the preset planning key index includes a service point position, a service point weight and a service point type; the plurality of standard dimension information of the service point comprises position information, weight information and type information of the service point;
The clustering the service points according to the plurality of standard dimension information to obtain the position of the secondary optical cross comprises the following steps:
and clustering the service points according to the position information, the weight information and the type information of the service points, and determining the position of the secondary optical cross.
In an alternative, the geographic environment data comprises road distribution data; the determining the position of the primary optical traffic, the position of the access machine room, the position of the convergence machine room and the position of the core machine room according to the service distribution data, the position of the secondary optical traffic and the geographic environment data respectively comprises:
determining the density distribution of the secondary light intersection according to the position of the secondary light intersection;
determining the position of the primary optical communication and the position of the access machine room according to the service distribution data, the density distribution and the road distribution data;
and determining a converging machine room from the position of the primary optical fiber or the access machine room according to the service distribution data and a preset machine room determining algorithm.
In an optional manner, the determining a target line according to the target undirected graph includes:
determining the optical cable route of the tree-shaped optical cable according to the target undirected graph;
Determining an optical cable route of the annular optical cable according to the target undirected graph;
determining a backbone layer optical cable according to the target undirected graph;
and determining a target line according to the optical cable route of the tree-shaped optical cable, the optical cable route of the annular optical cable and the backbone layer optical cable.
In an alternative manner, the determining the cable route of the tree-shaped cable according to the target undirected graph includes: and searching a minimum spanning tree by taking the converging machine room as a root to determine that the route of the minimum spanning tree is the optical cable route of the tree-shaped optical cable.
In an alternative manner, the determining the cable route of the ring cable according to the target undirected graph includes: searching a Hamiltonian loop between the converging machine room as a node and the optical traffic of the down-hanging wireless machine room; the light exchange of the lower hanging wireless machine room comprises a primary light exchange of the lower hanging wireless machine room or a secondary light exchange of the lower hanging wireless machine room; the routing of the hamiltonian loop is determined as the cable routing of the ring cable.
According to the embodiment of the invention, the basic resource planning is carried out based on service distribution and geographic environment, the secondary light exchange is determined based on service point data, the primary light exchange is further determined according to a density distribution function, the determined points are abstracted into the target undirected graph based on the geographic environment, and the target line is determined, so that the target planning scheme is finally obtained, the resource planning is standardized, the accuracy is high, and the planned network resources and the service can be optimally matched. Furthermore, by the mode, planning can be automatically operated, and efficiency is improved.
In addition, the collected service distribution data of the service points are converted into standard service data, so that the data standards are unified, and the indexes are easier to quantify.
Fig. 5 is a schematic structural diagram of a network basic resource planning device according to an embodiment of the present invention, and the specific embodiment of the present invention does not limit the specific implementation of the network basic resource planning device.
As shown in fig. 5, the network base resource planning apparatus may include: a processor (processor) 302, a communication interface 304, a memory 306, and a communication bus 308.
Wherein: processor 302, communication interface 304, and memory 306 perform communication with each other via communication bus 308. A communication interface 304 for communicating with network elements of other devices, such as clients or other servers. Processor 302 is configured to execute program 310 and may specifically perform the relevant steps described above for the network-based resource planning method embodiment.
In particular, program 310 may include program code comprising computer-executable instructions.
The processor 302 may be a central processing unit CPU, or a specific integrated circuit ASIC (Application Specific Integrated Circuit), or one or more integrated circuits configured to implement embodiments of the present invention. The one or more processors comprised by the network infrastructure resource planning device may be the same type of processor, such as one or more CPUs; but may also be different types of processors such as one or more CPUs and one or more ASICs.
Memory 306 for storing programs 310. Memory 306 may comprise high-speed RAM memory, and may also include non-volatile memory, such as at least one disk memory.
Program 310 may be specifically invoked by processor 302 to cause the network infrastructure resource planning device to:
respectively acquiring service distribution data and geographic environment data of service points;
determining the position of the secondary optical traffic according to the service distribution data;
according to the service distribution data, the position of the secondary light exchange and the geographic environment data, the position of the primary light exchange, the position of the access machine room, the position of the convergence machine room and the position of the core machine room are respectively determined;
generating a target undirected graph according to the geographic environment data, the position of the secondary light intersection, the position of the primary light intersection, the position of an access machine room, the position of the convergence machine room and the position of the core machine room; the nodes of the target undirected graph represent the positions of the secondary light intersection, the first-level light intersection, the access machine room, the convergence machine room and the core machine room, and the edges of the target undirected graph represent possible paths among the nodes;
Determining a target line according to the target undirected graph;
and generating a target planning scheme according to the service point, the position of the secondary optical cross, the position of the primary optical cross, the position of the access machine room, the position of the convergence machine room, the position of the core machine room and the target line.
In an alternative manner, the service distribution data includes information of a plurality of service points needing to cover the network; the determining the position of the secondary optical communication according to the service distribution data comprises the following steps:
processing the service distribution data into service standard data according to preset planning key indexes; the service standard data comprises a plurality of standard dimension information of the service point;
clustering the service points according to the plurality of standard dimension information to obtain the position of the secondary optical cross; wherein one of the secondary optical exchanges corresponds to a plurality of service points.
In an optional manner, the preset planning key index includes a service point position, a service point weight and a service point type; the plurality of standard dimension information of the service point comprises position information, weight information and type information of the service point;
the clustering the service points according to the plurality of standard dimension information to obtain the position of the secondary optical cross comprises the following steps:
And clustering the service points according to the position information, the weight information and the type information of the service points, and determining the position of the secondary optical cross.
In an alternative, the geographic environment data comprises road distribution data; the determining the position of the primary optical traffic, the position of the access machine room, the position of the convergence machine room and the position of the core machine room according to the service distribution data, the position of the secondary optical traffic and the geographic environment data respectively comprises:
determining the density distribution of the secondary light intersection according to the position of the secondary light intersection;
determining the position of the primary optical communication and the position of the access machine room according to the service distribution data, the density distribution and the road distribution data;
and determining a converging machine room from the position of the primary optical fiber or the access machine room according to the service distribution data and a preset machine room determining algorithm.
In an optional manner, the determining a target line according to the target undirected graph includes:
determining the optical cable route of the tree-shaped optical cable according to the target undirected graph;
determining an optical cable route of the annular optical cable according to the target undirected graph;
determining a backbone layer optical cable according to the target undirected graph;
And determining a target line according to the optical cable route of the tree-shaped optical cable, the optical cable route of the annular optical cable and the backbone layer optical cable.
In an alternative manner, the determining the cable route of the tree-shaped cable according to the target undirected graph includes: and searching a minimum spanning tree by taking the converging machine room as a root to determine that the route of the minimum spanning tree is the optical cable route of the tree-shaped optical cable.
In an alternative manner, the determining the cable route of the ring cable according to the target undirected graph includes: searching a Hamiltonian loop between the converging machine room as a node and the optical traffic of the down-hanging wireless machine room; the light exchange of the lower hanging wireless machine room comprises a primary light exchange of the lower hanging wireless machine room or a secondary light exchange of the lower hanging wireless machine room; the routing of the hamiltonian loop is determined as the cable routing of the ring cable.
According to the embodiment of the invention, the basic resource planning is carried out based on service distribution and geographic environment, the secondary light exchange is determined based on service point data, the primary light exchange is further determined according to a density distribution function, the determined points are abstracted into the target undirected graph based on the geographic environment, and the target line is determined, so that the target planning scheme is finally obtained, the resource planning is standardized, the accuracy is high, and the planned network resources and the service can be optimally matched. Furthermore, by the mode, planning can be automatically operated, and efficiency is improved.
In addition, the collected service distribution data of the service points are converted into standard service data, so that the data standards are unified, and the indexes are easier to quantify.
The embodiment of the invention provides a computer readable storage medium, which stores at least one executable instruction, and when the executable instruction runs on network basic resource planning equipment, the network basic resource planning equipment executes the network basic resource planning method in any method embodiment.
The executable instructions may be specifically operable to cause a network infrastructure resource planning device to:
respectively acquiring service distribution data and geographic environment data of service points;
determining the position of the secondary optical traffic according to the service distribution data;
according to the service distribution data, the position of the secondary light exchange and the geographic environment data, the position of the primary light exchange, the position of the access machine room, the position of the convergence machine room and the position of the core machine room are respectively determined;
generating a target undirected graph according to the geographic environment data, the position of the secondary light intersection, the position of the primary light intersection, the position of an access machine room, the position of the convergence machine room and the position of the core machine room; the nodes of the target undirected graph represent the positions of the secondary light intersection, the first-level light intersection, the access machine room, the convergence machine room and the core machine room, and the edges of the target undirected graph represent possible paths among the nodes;
Determining a target line according to the target undirected graph;
and generating a target planning scheme according to the service point, the position of the secondary optical cross, the position of the primary optical cross, the position of the access machine room, the position of the convergence machine room, the position of the core machine room and the target line.
In an alternative manner, the service distribution data includes information of a plurality of service points needing to cover the network; the determining the position of the secondary optical communication according to the service distribution data comprises the following steps:
processing the service distribution data into service standard data according to preset planning key indexes; the service standard data comprises a plurality of standard dimension information of the service point;
clustering the service points according to the plurality of standard dimension information to obtain the position of the secondary optical cross; wherein one of the secondary optical exchanges corresponds to a plurality of service points.
In an optional manner, the preset planning key index includes a service point position, a service point weight and a service point type; the plurality of standard dimension information of the service point comprises position information, weight information and type information of the service point;
the clustering the service points according to the plurality of standard dimension information to obtain the position of the secondary optical cross comprises the following steps:
And clustering the service points according to the position information, the weight information and the type information of the service points, and determining the position of the secondary optical cross.
In an alternative, the geographic environment data comprises road distribution data; the determining the position of the primary optical traffic, the position of the access machine room, the position of the convergence machine room and the position of the core machine room according to the service distribution data, the position of the secondary optical traffic and the geographic environment data respectively comprises:
determining the density distribution of the secondary light intersection according to the position of the secondary light intersection;
determining the position of the primary optical communication and the position of the access machine room according to the service distribution data, the density distribution and the road distribution data;
and determining a converging machine room from the position of the primary optical fiber or the access machine room according to the service distribution data and a preset machine room determining algorithm.
In an optional manner, the determining a target line according to the target undirected graph includes:
determining the optical cable route of the tree-shaped optical cable according to the target undirected graph;
determining an optical cable route of the annular optical cable according to the target undirected graph;
determining a backbone layer optical cable according to the target undirected graph;
And determining a target line according to the optical cable route of the tree-shaped optical cable, the optical cable route of the annular optical cable and the backbone layer optical cable.
In an alternative manner, the determining the cable route of the tree-shaped cable according to the target undirected graph includes: and searching a minimum spanning tree by taking the converging machine room as a root to determine that the route of the minimum spanning tree is the optical cable route of the tree-shaped optical cable.
In an alternative manner, the determining the cable route of the ring cable according to the target undirected graph includes: searching a Hamiltonian loop between the converging machine room as a node and the optical traffic of the down-hanging wireless machine room; the light exchange of the lower hanging wireless machine room comprises a primary light exchange of the lower hanging wireless machine room or a secondary light exchange of the lower hanging wireless machine room; the routing of the hamiltonian loop is determined as the cable routing of the ring cable.
According to the embodiment of the invention, the basic resource planning is carried out based on service distribution and geographic environment, the secondary light exchange is determined based on service point data, the primary light exchange is further determined according to a density distribution function, the determined points are abstracted into the target undirected graph based on the geographic environment, and the target line is determined, so that the target planning scheme is finally obtained, the resource planning is standardized, the accuracy is high, and the planned network resources and the service can be optimally matched. Furthermore, by the mode, planning can be automatically operated, and efficiency is improved.
In addition, the collected service distribution data of the service points are converted into standard service data, so that the data standards are unified, and the indexes are easier to quantify.
The embodiment of the invention provides a network basic resource planning device which is used for executing the network basic resource planning method.
Embodiments of the present invention provide a computer program that is callable by a processor to cause a network infrastructure resource planning device to perform the network infrastructure resource planning method of any of the method embodiments described above.
Embodiments of the present invention provide a computer program product comprising a computer program stored on a computer readable storage medium, the computer program comprising program instructions which, when run on a computer, cause the computer to perform the network infrastructure resource planning method of any of the method embodiments described above.
The algorithms or displays presented herein are not inherently related to any particular computer, virtual system, or other apparatus. Various general-purpose systems may also be used with the teachings herein. The required structure for a construction of such a system is apparent from the description above. In addition, embodiments of the present invention are not directed to any particular programming language. It will be appreciated that the teachings of the present invention described herein may be implemented in a variety of programming languages, and the above description of specific languages is provided for disclosure of enablement and best mode of the present invention.
In the description provided herein, numerous specific details are set forth. However, it is understood that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the above description of exemplary embodiments of the invention, various features of the embodiments of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be construed as reflecting the intention that: i.e., the claimed invention requires more features than are expressly recited in each claim.
Those skilled in the art will appreciate that the modules in the apparatus of the embodiments may be adaptively changed and disposed in one or more apparatuses different from the embodiments. The modules or units or components of the embodiments may be combined into one module or unit or component, and they may be divided into a plurality of sub-modules or sub-units or sub-components. Any combination of all features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or units of any method or apparatus so disclosed, may be used in combination, except insofar as at least some of such features and/or processes or units are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings), may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The use of the words first, second, third, etc. do not denote any order. These words may be interpreted as names. The steps in the above embodiments should not be construed as limiting the order of execution unless specifically stated.

Claims (8)

1. A method for planning a network infrastructure resource, the method comprising:
respectively acquiring service distribution data and geographic environment data of service points; the geographical environment data comprises road distribution data;
Determining the position of the secondary optical communication according to the service distribution data comprises the following steps: processing the service distribution data into service standard data according to preset planning key indexes; the service standard data comprises a plurality of standard dimension information of the service point; clustering the service points according to the plurality of standard dimension information to obtain the position of the secondary optical cross; wherein, one of the two-level optical fiber corresponds to a plurality of service points;
according to the service distribution data, the position of the secondary light exchange and the geographic environment data, the position of the primary light exchange, the position of the access machine room, the position of the convergence machine room and the position of the core machine room are respectively determined, and the method comprises the following steps: determining the density distribution of the secondary light intersection according to the position of the secondary light intersection; determining the position of the primary optical communication and the position of the access machine room according to the service distribution data, the density distribution and the road distribution data; determining a converging machine room from the position of the primary optical fiber or the access machine room according to the service distribution data and a preset machine room determining algorithm;
generating a target undirected graph according to the geographic environment data, the position of the secondary light intersection, the position of the primary light intersection, the position of an access machine room, the position of the convergence machine room and the position of the core machine room; the nodes of the target undirected graph represent the positions of the secondary light intersection, the first-level light intersection, the access machine room, the convergence machine room and the core machine room, and the edges of the target undirected graph represent possible paths among the nodes;
Determining a target line according to the target undirected graph, including: determining the optical cable route of the tree-shaped optical cable according to the target undirected graph; determining an optical cable route of the annular optical cable according to the target undirected graph; determining a backbone layer optical cable according to the target undirected graph; determining a target line according to the optical cable route of the tree-shaped optical cable, the optical cable route of the annular optical cable and the backbone layer optical cable;
and generating a target planning scheme according to the service point, the position of the secondary optical cross, the position of the primary optical cross, the position of the access machine room, the position of the convergence machine room, the position of the core machine room and the target line.
2. The method of claim 1, wherein the preset planning key indicators include service point locations, service point weights, and service point types; the plurality of standard dimension information of the service point comprises position information, weight information and type information of the service point;
the clustering the service points according to the plurality of standard dimension information to obtain the position of the secondary optical cross comprises the following steps:
and clustering the service points according to the position information, the weight information and the type information of the service points, and determining the position of the secondary optical cross.
3. The method according to any one of claims 1-2, wherein said determining a target line from said target undirected graph comprises:
determining the optical cable route of the tree-shaped optical cable according to the target undirected graph;
determining an optical cable route of the annular optical cable according to the target undirected graph;
determining a backbone layer optical cable according to the target undirected graph;
and determining a target line according to the optical cable route of the tree-shaped optical cable, the optical cable route of the annular optical cable and the backbone layer optical cable.
4. A method according to claim 3, wherein said determining the cable routing of the tree cable from the target undirected graph comprises:
and searching a minimum spanning tree by taking the converging machine room as a root to determine that the route of the minimum spanning tree is the optical cable route of the tree-shaped optical cable.
5. A method according to claim 3, wherein said determining the cable routing of the ring cable from the target undirected graph comprises:
searching a Hamiltonian loop between the converging machine room as a node and the optical traffic of the down-hanging wireless machine room; the light exchange of the lower hanging wireless machine room comprises a primary light exchange of the lower hanging wireless machine room or a secondary light exchange of the lower hanging wireless machine room;
The routing of the hamiltonian loop is determined as the cable routing of the ring cable.
6. A network infrastructure resource planning apparatus, the apparatus comprising:
the acquisition module is used for respectively acquiring service distribution data and geographic environment data of the service points; the geographical environment data comprises road distribution data;
the first determining module is configured to determine a position of the second-level optical fiber according to the service distribution data, and includes: processing the service distribution data into service standard data according to preset planning key indexes; the service standard data comprises a plurality of standard dimension information of the service point; clustering the service points according to the plurality of standard dimension information to obtain the position of the secondary optical cross; wherein, one of the two-level optical fiber corresponds to a plurality of service points;
the second determining module is configured to determine, according to the service distribution data, the position of the second optical cross, and the geographical environment data, a position of the first optical cross, a position of the access machine room, a position of the convergence machine room, and a position of the core machine room, respectively, where the second determining module includes: determining the density distribution of the secondary light intersection according to the position of the secondary light intersection; determining the position of the primary optical communication and the position of the access machine room according to the service distribution data, the density distribution and the road distribution data; determining a converging machine room from the position of the primary optical fiber or the access machine room according to the service distribution data and a preset machine room determining algorithm;
The first generation module is used for generating a target undirected graph according to the geographic environment data, the position of the secondary light intersection, the position of the primary light intersection, the position of an access machine room, the position of the convergence machine room and the position of the core machine room; the nodes of the target undirected graph represent the positions of the secondary light intersection, the first-level light intersection, the access machine room, the convergence machine room and the core machine room, and the edges of the target undirected graph represent possible paths among the nodes;
a third determining module, configured to determine a target line according to the target undirected graph, including: determining the optical cable route of the tree-shaped optical cable according to the target undirected graph; determining an optical cable route of the annular optical cable according to the target undirected graph; determining a backbone layer optical cable according to the target undirected graph; determining a target line according to the optical cable route of the tree-shaped optical cable, the optical cable route of the annular optical cable and the backbone layer optical cable;
and the second generation module is used for generating a target planning scheme according to the service point, the position of the secondary optical cross, the position of the primary optical cross, the position of the access machine room, the position of the convergence machine room, the position of the core machine room and the target line.
7. A network infrastructure resource planning apparatus, comprising: the device comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete communication with each other through the communication bus;
the memory is configured to store at least one executable instruction that causes the processor to perform the operations of the network infrastructure resource planning method of any of claims 1-5.
8. A computer readable storage medium, characterized in that at least one executable instruction is stored in the storage medium, which executable instructions, when run on a network base resource planning device, cause the network base resource planning device to perform the operations of the network base resource planning method according to any of claims 1-5.
CN202110559043.3A 2021-05-21 2021-05-21 Network basic resource planning method, device, equipment and computer storage medium Active CN115460096B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110559043.3A CN115460096B (en) 2021-05-21 2021-05-21 Network basic resource planning method, device, equipment and computer storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110559043.3A CN115460096B (en) 2021-05-21 2021-05-21 Network basic resource planning method, device, equipment and computer storage medium

Publications (2)

Publication Number Publication Date
CN115460096A CN115460096A (en) 2022-12-09
CN115460096B true CN115460096B (en) 2023-12-15

Family

ID=84294814

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110559043.3A Active CN115460096B (en) 2021-05-21 2021-05-21 Network basic resource planning method, device, equipment and computer storage medium

Country Status (1)

Country Link
CN (1) CN115460096B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105989443A (en) * 2015-02-15 2016-10-05 杜岸树 Intelligent-mobile-terminal-based communication line inspection system
CN107181682A (en) * 2016-03-11 2017-09-19 中国电信股份有限公司 The method and apparatus of calculating network access capability end to end
CN109547872A (en) * 2017-09-21 2019-03-29 中国移动通信集团设计院有限公司 A kind of network plan method and device
CN111586504A (en) * 2020-04-16 2020-08-25 沈阳市电信规划设计院股份有限公司 Service-based same-route analysis method for communication operator
EP3798574A1 (en) * 2019-09-26 2021-03-31 Tata Consultancy Services Limited Method and system for real-time path planning

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
IN2012DE00287A (en) * 2012-02-02 2015-04-10 Ciena Corp
US20190342641A1 (en) * 2018-05-03 2019-11-07 Cable Television Laboratories, Inc. Communication networks including serving area bridging connections and associated methods
EP3742125A1 (en) * 2019-05-20 2020-11-25 Tata Consultancy Services Limited Method and system for path planning

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105989443A (en) * 2015-02-15 2016-10-05 杜岸树 Intelligent-mobile-terminal-based communication line inspection system
CN107181682A (en) * 2016-03-11 2017-09-19 中国电信股份有限公司 The method and apparatus of calculating network access capability end to end
CN109547872A (en) * 2017-09-21 2019-03-29 中国移动通信集团设计院有限公司 A kind of network plan method and device
EP3798574A1 (en) * 2019-09-26 2021-03-31 Tata Consultancy Services Limited Method and system for real-time path planning
CN111586504A (en) * 2020-04-16 2020-08-25 沈阳市电信规划设计院股份有限公司 Service-based same-route analysis method for communication operator

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
LiDAL:Light Detection and Locatization;Aubida A.Al-Hameed;IEEE Access;全文 *
大规模并行计算机光互联网络研究;刘兴长;中国优秀硕士学位论文数据库;全文 *

Also Published As

Publication number Publication date
CN115460096A (en) 2022-12-09

Similar Documents

Publication Publication Date Title
US10073876B2 (en) Bloom filter index for device discovery
CN107194533B (en) Power distribution network full information model construction method and system
CN109995580A (en) VN mapping method based on GA_PSO hybrid algorithm in 5G network slice
CN108062243A (en) Generation method, task executing method and the device of executive plan
CN110213107A (en) A kind of autoplacement method, device and equipment for network topological diagram
CN106156328A (en) A kind of bank's running log data monitoring method and system
CN105933148A (en) SDN GIS network topology model implementation method
CN105683918A (en) Centralized networking configuration in distributed systems
CN105471647B (en) A kind of power communication network fault positioning method
CN113900810A (en) Distributed graph processing method, system and storage medium
CN110413845A (en) Resource storage method and device based on Internet of Things operating system
WO2024088025A1 (en) Automated 5gc network element management method and apparatus based on multi-dimensional data
CN115460096B (en) Network basic resource planning method, device, equipment and computer storage medium
CN111447099A (en) Power distribution network topology management system
CN113361716B (en) Threat reasoning rule construction method and device
CN112819380B (en) Power grid regulation and control panoramic transparent access method, system, equipment and storage medium
Zhu et al. A hybrid reliable heuristic mapping method based on survivable virtual networks for network virtualization
CN111626639B (en) Power grid equipment state and data management system
Nikbazm et al. Agent-based resource discovery in cloud computing using bloom filters
CN111865640B (en) Network architecture description method, device and medium thereof
CN115374101A (en) Rail transit station level data management system
Mathias et al. Developing of a Smart Fraud Detection System in Advanced Metering Infrastructure Using Deep Learning
US20130268253A1 (en) Graph modeling systems and methods
CN110971450B (en) Information point location ordering method and device for operation and maintenance
CN117609341B (en) Digital twin system of power grid

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant