Communication network resource cascading method and device, electronic equipment and storage medium

Abstract

The invention discloses a communication network resource cascading method and device, electronic equipment and a storage medium, and the method comprises the steps: obtaining long-distance line information and local line information, carrying out the correlation matching of the long-distance line information and the local line information, and obtaining the correlation between a long-distance line and a local line; the long-distance line and the local line are connected in series according to the incidence relation, and a first network topology is obtained; grouping and sorting the service paths of the first network topology based on a graph search algorithm to obtain end-to-end routing information; and determining a cross-domain bearing relationship of the first network topology, and associating the cross-domain bearing relationship with the end-to-end routing information to obtain a second network topology. According to the invention, cross-domain and cross-layer serial connection of the communication network resources can be realized, the serial connection efficiency and reliability of the communication network resources are improved, and the method can be widely applied to the technical field of communication network management.

Description

Technical Field

[0001] The present invention relates to the technical field of communication network management, and in particular to a communication network resource serial connection method, device, electronic equipment and storage medium. Background Art

[0002] Communication networks are large in scale and highly complex. How to effectively connect data among many nodes and links is a current challenge and difficulty. In the prior art, the connection of communication network resources has the following problems:

[0003] 1) The connected objects usually manage a large amount of information, including device information, network information, management information, etc. This process will occupy a large amount of system resources, easily causing data redundancy, resulting in jams and slow transmission speeds;

[0004] 2) The resource connection process of the communication network involves data from multiple devices, networks, management and other fields, and the data relationships are complex and difficult to integrate effectively;

[0005] 3) Due to the large amount of data, various anomalies will occur during the concatenation process, making it difficult to effectively manage, classify, and release the anomalies.

[0006] The above problems need to be solved urgently. Summary of the invention

[0007] The purpose of the present invention is to solve one of the technical problems existing in the prior art to at least a certain extent.

[0008] To this end, an object of an embodiment of the present invention is to provide a method for connecting communication network resources in series, which can realize cross-domain and cross-layer connection of communication network resources, thereby improving the efficiency and reliability of the connection of communication network resources.

[0009] Another object of an embodiment of the present invention is to provide a communication network resource serial connection device.

[0010] In order to achieve the above technical objectives, the technical solutions adopted by the embodiments of the present invention include:

[0011] On the one hand, an embodiment of the present invention provides a communication network resource concatenation method, comprising the following steps:

[0012] Acquire long-distance line information and local line information, and perform correlation matching on the long-distance line information and the local line information to obtain a correlation relationship between the long-distance line and the local line;

[0013] Connecting the long-distance line and the local line in series according to the association relationship to obtain a first network topology;

[0014] Grouping and sorting the service paths of the first network topology based on a graph search algorithm to obtain end-to-end routing information;

[0015] Determine a cross-domain bearing relationship of the first network topology, associate the cross-domain bearing relationship with the end-to-end routing information, and obtain a second network topology.

[0016] Further, in an embodiment of the present invention, the associating and matching the long-distance line information and the local line information to obtain the associative relationship between the long-distance line and the local line specifically includes:

[0017] Determine the line names / access numbers of the plurality of long-distance lines according to the long-distance line information, and determine the line names / access numbers of the plurality of local lines according to the local line information;

[0018] The association relationship between the long-distance line and the local line is determined according to the line name / access number.

[0019] Further, in an embodiment of the present invention, the long-distance line and the local line are connected in series according to the association relationship to obtain a first network topology, which specifically includes:

[0020] Determine the sending end station and the receiving end station of the long-distance line, and determine the sending end station and the receiving end station of the local line;

[0021] The first network topology is obtained by connecting the long-distance lines and the local lines that are related to each other in series according to the sending end station and the receiving end station.

[0022] Further, in one embodiment of the present invention, the graph search algorithm is used to perform routing reorganization and group sorting on the service paths of the first network topology to obtain end-to-end routing information, which specifically includes:

[0023] Determine multiple service paths of the first network topology, and obtain initial service data corresponding to the service paths;

[0024] Generate an edge vector according to the initial business data, and construct a graph structure according to the edge vector;

[0025] Dividing the service path into a plurality of service segments, and determining a starting point and an end point of each service segment;

[0026] Perform a bidirectional search on the graph structure according to the starting point and the ending point to obtain the edge vector corresponding to each of the service segments, and then determine the segment routing corresponding to each of the service segments;

[0027] Integrating the segmented routes to obtain an initial reorganized route;

[0028] The initial reorganized routes are grouped, sorted within the group, and de-duplicated to obtain the end-to-end routing information.

[0029] Further, in one embodiment of the present invention, the bidirectional search of the graph structure according to the starting point and the ending point to obtain the edge vector corresponding to each of the service segments, and then determine the segment routing corresponding to each of the service segments, specifically includes:

[0030] Using the starting point as a forward search starting point and the ending point as a reverse search starting point, a depth-first search is performed on the graph structure;

[0031] When a search point of a forward search meets a search point of a reverse search, the edge vector corresponding to the service segment is determined according to the search path of the forward search and the search path of the reverse search;

[0032] The edge vectors are concatenated to obtain the segment routes corresponding to the service segments.

[0033] Further, in one embodiment of the present invention, the initial reorganized routes are grouped, sorted within the group, and deduplicated to obtain the end-to-end routing information, which specifically includes:

[0034] Constructing a relationship tree according to the initial reorganized route, the relationship tree comprising a root node, leaf nodes and intermediate nodes;

[0035] Traversing the relationship tree from the root node until reaching the leaf node, obtaining multiple routing paths and corresponding intra-group nodes;

[0036] Sort the nodes in the group according to the traversal order to obtain the node information and node sequence number of each routing path;

[0037] Deduplication processing is performed on the multiple routing paths whose node information and node sequence numbers are completely consistent to obtain the end-to-end routing information.

[0038] Further, in one embodiment of the present invention, the determining of the cross-domain bearer relationship of the first network topology, associating the cross-domain bearer relationship with the end-to-end routing information to obtain the second network topology specifically includes:

[0039] Determine the cross-domain bearer relationship of the IP circuit, STN circuit or transmission circuit of the first network topology according to the access number, link transceiver port and optical path port relationship, and determine the corresponding cross-domain bearer topology;

[0040] The end-to-end routing information is associated with the cross-domain bearer topology according to the cross-domain bearer relationship to obtain the second network topology.

[0041] On the other hand, an embodiment of the present invention provides a communication network resource serial connection device, including:

[0042] An association matching module, used for acquiring long-distance line information and local line information, and performing association matching on the long-distance line information and the local line information to obtain an association relationship between the long-distance line and the local line;

[0043] A cross-domain serial connection module, used for serially connecting the long-distance line and the local line according to the association relationship to obtain a first network topology;

[0044] A routing reorganization module, used to group and sort the service paths of the first network topology based on a graph search algorithm to obtain end-to-end routing information;

[0045] The cross-layer cascade module is used to determine the cross-domain bearing relationship of the first network topology, associate the cross-domain bearing relationship with the end-to-end routing information, and obtain the second network topology.

[0046] On the other hand, an embodiment of the present invention provides an electronic device, which includes a memory, a processor, a program stored in the memory and executable on the processor, and a data bus for realizing connection communication between the processor and the memory, wherein the program, when executed by the processor, realizes the communication network resource concatenation method as described above.

[0047] On the other hand, an embodiment of the present invention further provides a storage medium, which is a computer-readable storage medium used for computer-readable storage, and the storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the communication network resource concatenation method as described above.

[0048] The advantages and beneficial effects of the present invention will be partly given in the following description, partly become apparent from the following description, or be understood through the practice of the present invention:

[0049] The embodiment of the present invention obtains long-distance line information and local line information, associates and matches the long-distance line information and the local line information, obtains the association relationship between the long-distance line and the local line, concatenates the long-distance line and the local line according to the association relationship, obtains a first network topology, groups and sorts the service paths of the first network topology based on a graph search algorithm, obtains end-to-end routing information, determines the cross-domain bearing relationship of the first network topology, associates the cross-domain bearing relationship with the end-to-end routing information, and obtains a second network topology. The embodiment of the present invention concatenates the long-distance line and the local line according to the association relationship to obtain the first network topology, and groups and sorts the end-to-end routing information based on the graph search algorithm, realizes the cross-domain concatenation of communication network resources, associates the cross-domain bearing relationship with the end-to-end routing information, can associate and jump multiple layers of topology in the topology map, realizes the cross-layer concatenation of communication network resources, and improves the efficiency and reliability of the concatenation of communication network resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] In order to more clearly illustrate the technical solution in the embodiments of the present invention, the following introduction is made to the drawings required for use in the embodiments of the present invention. It should be understood that the drawings introduced below are only for the convenience of clearly describing some embodiments of the technical solution of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.

[0051] Figure 1 A flow chart of the steps of the communication network resource serial connection method provided by an embodiment of the present invention;

[0052] Figure 2 A step flow chart of step S101 provided in an embodiment of the present invention;

[0053] Figure 3 A step flow chart of step S102 provided in an embodiment of the present invention;

[0054] Figure 4 A step flow chart of step S103 provided in an embodiment of the present invention;

[0055] Figure 5 A step flow chart of step S1034 provided in an embodiment of the present invention;

[0056] Figure 6 A step flow chart of step S1036 provided in an embodiment of the present invention;

[0057] Figure 7 A schematic diagram of segment routing of the Chengdu access segment provided by an embodiment of the present invention;

[0058] Figure 8A schematic diagram of segment routing for a long-distance segment provided by an embodiment of the present invention;

[0059] Fig. 9 A schematic diagram of segment routing of the Neijiang access segment provided by an embodiment of the present invention;

[0060] Fig.10 A schematic diagram of end-to-end routing provided by an embodiment of the present invention;

[0061] Fig.11 A step flow chart of step S104 provided in an embodiment of the present invention;

[0062] Fig.12 A schematic diagram of the structure of a communication network resource serial connection device provided by an embodiment of the present invention;

[0063] Fig.13 A schematic diagram of the hardware structure of an electronic device provided by an embodiment of the present invention;

[0064] Fig.14 A schematic diagram of the structure of a storage medium provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0065] Embodiments of the present invention are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present application, and cannot be understood as limitations on the present application. It should be noted that, although the functional module division is performed in the system schematic diagram and the logical order is shown in the flow chart, in some cases, the steps shown or described may be performed in a different order from the module division in the system schematic diagram or the flow chart. For the step numbers in the following embodiments, they are only set for the convenience of explanation, and the order between the steps is not limited in any way. The execution order of each step in the embodiment can be adaptively adjusted according to the understanding of those skilled in the art.

[0066] In the description of the present invention, the meaning of "a plurality" is two or more. If there is a description of the first or the second, it is only for the purpose of distinguishing the technical features, and it cannot be understood as indicating or implying the relative importance or implicitly indicating the number of the indicated technical features or implicitly indicating the order of the indicated technical features. In addition, unless otherwise defined, all technical and scientific terms used in this document have the same meaning as those commonly understood by technicians in the technical field of this application. The terms used in this document are only for the purpose of describing the embodiments of the present application and are not intended to limit the present application.

[0067] The communication network resource concatenation method provided in the embodiment of the present application can be applied to the terminal, can also be applied to the server side, and can also be software running in the terminal or the server side. In some embodiments, the terminal can be a smart phone, a tablet computer, a laptop computer, a desktop computer, a set-top box, etc.; the server side can be configured as an independent physical server, or a server cluster or distributed system composed of multiple physical servers, and can also be configured as a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms; the software can be an application that implements the communication network resource concatenation method, etc., but is not limited to the above forms.

[0068] The present application can be used in many general or special computer system environments or configurations. For example: personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronic devices, network PCs, minicomputers, mainframe computers, distributed computing environments including any of the above systems or devices, etc. The present application can be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present application can also be practiced in distributed computing environments, in which tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules can be located in local and remote computer storage media including storage devices.

[0069] It should be noted that in each specific implementation of the present application, when it comes to the need to perform relevant processing based on data related to user identity or characteristics such as user information, user behavior data, user historical data, and user location information, the user's permission or consent will be obtained first, and the collection, use, and processing of these data will comply with the relevant laws, regulations, and standards of the relevant countries and regions. In addition, when the embodiment of the present application needs to obtain the user's sensitive personal information, the user's separate permission or consent will be obtained through a pop-up window or by jumping to a confirmation page. After clearly obtaining the user's separate permission or consent, the necessary user-related data for the normal operation of the embodiment of the present application will be obtained.

[0070] The embodiment of the present invention provides a method for connecting communication network resources in series, which can realize cross-domain and cross-layer connection of communication network resources. When the communication network involves data from multiple devices, networks, management and other different fields and the data relationship is complex, it can realize the effective integration of communication network resources, and at the same time, it can timely discover anomalies, improve the link mode between data, and realize the connection of communication network resources with a low-time-consuming and low-complexity topological structure.

[0071] like Figure 1 FIG. 1 is a flow chart showing a method for connecting communication network resources in series according to an embodiment of the present invention. Figure 1 The embodiment of the present invention provides a communication network resource serial connection method, which specifically includes the following steps:

[0072] S101. Obtain long-distance line information and local line information, perform correlation matching on the long-distance line information and the local line information, and obtain a correlation relationship between the long-distance line and the local line.

[0073] like Figure 2 FIG. 1 is a flowchart of step S101 provided in an embodiment of the present invention, referring to FIG. Figure 2 As an optional implementation, the long-distance line information and the local line information are correlated and matched to obtain the correlation relationship between the long-distance line and the local line, which specifically includes:

[0074] S1011. Determine line names / access numbers of multiple long-distance lines according to the long-distance line information, and determine line names / access numbers of multiple local lines according to the local line information;

[0075] S1012. Determine the association between the long-distance line and the local line according to the line name / access number.

[0076] Specifically, long-distance lines are obtained from the group's long-distance resource system, and basic information about the long-distance lines is obtained, including line name, access number, rate, customer, customer address, etc.; through the circuit name or access number, the long-distance lines are associated and matched with the line name or access number of the local line of the local resource to achieve matching association between the long-distance lines and the local lines.

[0077] S102: Connect the long-distance lines and the local lines in series according to the association relationship to obtain a first network topology.

[0078] like Figure 3 FIG. 1 is a flow chart of step S102 provided in an embodiment of the present invention, referring to FIG. Figure 3 As an optional implementation, the long-distance line and the local line are connected in series according to the association relationship to obtain a first network topology, which specifically includes:

[0079] S1021. Determine the sending end station and the receiving end station of the long-distance line, and determine the sending end station and the receiving end station of the local line;

[0080] S1022. Connect the long-distance lines and local lines that are related to each other in series according to the sending-end station and the receiving-end station to obtain a first network topology.

[0081] Specifically, through the association between the information of the sending and receiving ends, such as the station, network element, address, etc., and the local line and the long-distance line, the local line and the long-distance line are connected in series to realize the topological connection between the long-distance end and the local end. For example, for the long-distance line A and the local line B that are associated with each other, when the sending end station of the local line B is the user station 1 and the receiving end station is the long-distance station 1, and the starting end station of the long-distance line A is the long-distance station 1 and the receiving end station is the long-distance station 2, the result of the series connection is the user station 1-long-distance station 1-long-distance station 2.

[0082] S103: Group and sort the service paths of the first network topology based on a graph search algorithm to obtain end-to-end routing information.

[0083] Specifically, the multi-paths between topological connections are grouped and sorted, and the routing group numbers and sequence numbers are reorganized to achieve end-to-end topological connection. By constructing edge vectors, grouping and sorting are performed based on graph algorithm search; for long-distance line segments, the routing segments are reorganized through step-by-step low-orbit search.

[0084] like Figure 4 FIG. 1 is a flow chart of step S103 provided in an embodiment of the present invention, referring to FIG. Figure 4 As an optional implementation, the service paths of the first network topology are reorganized and grouped based on a graph search algorithm to obtain end-to-end routing information, which specifically includes:

[0085] S1031. Determine multiple service paths of the first network topology, and obtain initial service data corresponding to the service paths;

[0086] S1032, generating edge vectors according to the initial business data, and constructing a graph structure according to the edge vectors;

[0087] S1033, dividing the service path into multiple service segments, and determining the starting point and the end point of each service segment;

[0088] S1034, performing a bidirectional search on the graph structure according to the starting point and the end point to obtain the edge vector corresponding to each service segment, and then determining the segment routing corresponding to each service segment;

[0089] S1035, integrating the segmented routes to obtain an initial reorganized route;

[0090] S1036: Group the initial reorganized routes, sort them within the groups, and remove duplicates to obtain end-to-end routing information.

[0091] Specifically, the original business data to be concatenated is converted into edge vectors with a starting direction to construct a graph structure.

[0092] The original business data that needs to be concatenated can be obtained from a third-party system. The structures vary and are mainly divided into two types:

[0093] Type 1: Point structure. Each piece of data is a node, including: sequence number, node identifier, node name and other attributes.

[0094] Type 2: Line structure. Each data includes 2 nodes, including: sequence number, A node (sending node) identifier, A node name, A node attributes, Z node (receiving node) identifier, Z node name, Z node attributes.

[0095] After processing, the system uniformly generates edge vectors with directions, for example: node 1→node 2, node 2→node 3, node 3→node 4, node 3→node 5, node n-1→node n.

[0096] The edge vector can not only store the relationship between two nodes, but also store the node attributes of the two nodes. For example, the node attributes can include: node source system, city, station name, station type, node port, etc. This directional edge is stored in the data structure of the directed graph in computer language. Each edge contains the information of the circuit itself and the direction of the next point. Each point route is used as a point in the graph to complete the conversion between the circuit topology model in the network and the directed graph that can be processed by the computer.

[0097] Divide the business into different segments according to business characteristics, find the starting point and end point of each segment, and search the complete path of each segment in both directions.

[0098] The service is divided into different segments based on the service characteristic identifier. For example, a cross-city circuit will pass through the "A-end city access segment", "long-distance segment", and "Z-end city access segment". Among them, the node path of the A-end and Z-end access segments will be from the customer station room to the long-distance station; and the long-distance segment will be from the A-end city long-distance station to the Z-end city long-distance station.

[0099] The system locates the starting and ending nodes of each segment according to different segments, and uses a bidirectional depth-limited search algorithm to find the corresponding edge vector.

[0100] like Figure 5 FIG. 1 is a flow chart of step S1034 provided in an embodiment of the present invention, referring to FIG. Figure 5As an optional implementation, a bidirectional search is performed on the graph structure according to the starting point and the end point to obtain the edge vector corresponding to each service segment, and then determine the segment routing corresponding to each service segment, which specifically includes:

[0101] S10341, using the starting point as the starting point of the forward search and the ending point as the starting point of the reverse search, and performing a depth-first search on the graph structure;

[0102] S10342. When the search point of the forward search meets the search point of the reverse search, determine the edge vector corresponding to the service segment according to the search path of the forward search and the search path of the reverse search;

[0103] S10343. Concatenate the edge vectors to obtain segment routes corresponding to the service segments.

[0104] Specifically, Bidirectional Depth-First Search (BiDFS) is an efficient graph search algorithm. Compared with the traditional unidirectional depth search, it performs depth-first search (DFS) from the starting point and the target point of the graph at the same time until the searches on both sides meet. Set two hash sets p1 and p2 to store the depth-first search paths starting from the starting point and the end point respectively. The bidirectional depth-limited search algorithm can use a single-segment starting point and end point as the search starting point. When the search points meet or the maximum step length has been reached, the search ends. Each time the search is performed, two directions move forward at the same time, which speeds up the time for the starting point and the end point to meet, while narrowing the search range of the search tree and quickly completing the path search. Setting a depth limit avoids deep, large-scale blind searches in complex circuit topologies because the starting points cannot meet, resulting in a waste of computing resources.

[0105] In addition, since the segments are independent of each other, a multi-threaded approach can be used to search multiple segments simultaneously. If the calculation allows, concurrent searches can be performed, which greatly saves search time.

[0106] After multiple edge vectors are determined through bidirectional depth-restricted search, the edge vectors of each segment are co-connected according to the business logic, and then all paths within a single segment are deduplicated, grouped, and sorted within the group to restore the complete end-to-end route.

[0107] According to the business logic, each segment is connected. For example, the station names between segments should be consistent to connect. For example, the first segment route is "node 1→node 2" and the second segment route is "node 21→node 22". Node 2 and node 22 belong to the same station. At this time, the connection order is node 1→node 2~node 22→node 21.

[0108] like Figure 6FIG. 1 is a flow chart of step S1036 provided in an embodiment of the present invention, referring to FIG. Figure 6 As an optional implementation, the initial reorganized routes are grouped, sorted within the group, and deduplicated to obtain end-to-end routing information, which specifically includes:

[0109] S10361. Construct a relationship tree according to the initial reorganized route, where the relationship tree includes a root node, leaf nodes, and intermediate nodes;

[0110] S10362, traversing the relationship tree from the root node until reaching a leaf node, obtaining multiple routing paths and corresponding intra-group nodes;

[0111] S10363, sorting the nodes in the group according to the traversal order, and obtaining the node information and node sequence number of each routing path;

[0112] S10364. De-duplicate multiple routing paths whose node information and node sequence numbers are completely consistent to obtain end-to-end routing information.

[0113] Specifically, after the connection, the edge vector of each segment is split into nodes and mapped to the relationship tree. By traversing from the root node of the relationship tree, each leaf node of the tree is regarded as a group of circuits, and the point routes in each group of circuits are sorted from 1 until the maximum length of the path n. If each node of two paths is the same, it is necessary to remove duplicates. At this point, the group number and sequence number division of the circuit is completed, and the end-to-end routing information is obtained.

[0114] Taking the Chengdu Neijiang xxxx01NP cross-domain circuit as an example, the end-to-end routing information is obtained as follows:

[0115] 1) Form edge vectors based on the original data.

[0116] 2) The original data is as follows:

[0117] The data of the Chengdu access section is shown in Table 1, which adopts a point structure.

[0118] Serial number node City Station 1 N11 Chengdu User station 1 2 N12 Chengdu Aggregation Station 1 3 N13 Chengdu Aggregation Station 2 4 N14 Chengdu Long distance station 1 5 N11 Chengdu User station 1 6 N13 Chengdu Aggregation Station 2

[0119] Table 1

[0120] The data for the long-distance segment are shown in Table 2, which uses a line structure.

[0121] Serial number A-end node A-end cities A-side station Z end node Z-end city Z-side station 1 N21 Chengdu Long distance station 1 N22 Ziyang Long distance station 3 2 N21 Chengdu Long distance station 1 N23 Meishan Long distance station 4 3 N22 Ziyang Long distance station 3 N24 Neijiang Long distance station 2 4 N23 Meishan Long distance station 4 N24 Neijiang Long distance station 2

[0122] Table 2

[0123] The data of Neijiang access section is shown in Table 3, which adopts a point structure.

[0124]

[0125]

[0126] Table 3

[0127] The Chengdu access segment is sorted according to the sequence number, and two adjacent upper and lower records are generated into an edge vector, as shown in Table 4 below.

[0128] 1 N11 Chengdu User station 1 2 N12 Chengdu Aggregation Station 1

[0129] Table 4

[0130] Generate Chengdu segment edge vector: N11→N12.

[0131] If a start node is present, no edge vectors will be generated.

[0132] 4 N14 Chengdu Long distance station 1 5 N11 Chengdu User station 1

[0133] Table 5

[0134] In Table 5 above, N11 is the starting node and N14→N11 will not be generated.

[0135] Finally, the vectors generated by the Chengdu access segment are as follows: N11→N12, N12→N13, N13→N14, N11→N13.

[0136] The long-distance segment adopts a line structure, and the edge vector is generated according to the AZ node of each record. Finally, the following long-distance segment edge vectors can be generated: N21→N22, N21→N23, N22→N24, N22→N24.

[0137] The following edge vectors can be generated for the Neijiang section: N31→N32, N32→N33.

[0138] 2) Divide the business into different segments according to business characteristics, find the starting and ending nodes for each segment, and search the complete path of each segment in both directions.

[0139] Specifically, it can be divided into three sections, including the Chengdu access section with a starting node N11 and an ending node N14, the long-distance section with a starting node N21 and an ending node N24, and the Neijiang access section with a starting node N21 and an ending node N23.

[0140] According to the algorithm, bidirectional search can generate the paths of each segment, and the segment routing of Chengdu access segment is obtained as follows: Figure 7 As shown in the figure, the segment routing of the long-distance segment is as follows Figure 8 As shown in the figure, the segment routing of Neijiang access segment is as follows Fig. 9 shown.

[0141] 3) According to the business logic, each segment is co-connected, and then all paths within a single segment are deduplicated, grouped, and sorted within the group to restore the complete end-to-end route.

[0142] First, the segmented routes are connected and spliced ​​according to whether the station names are equal. N14 and N21 both belong to long-distance station 1, so these two nodes can be spliced. N24 and N33 belong to long-distance station 2, so they can also be spliced. The final end-to-end route is as follows Fig.10 As shown, the relevant segment number, group number and sequence number are shown in Table 6.

[0143]

[0144]

[0145] Table 6

[0146] S104: Determine a cross-domain bearer relationship of the first network topology, associate the cross-domain bearer relationship with the end-to-end routing information, and obtain a second network topology.

[0147] like Fig.11 FIG. 1 is a flowchart of step S104 provided in an embodiment of the present invention, referring to FIG. Fig.11 As an optional implementation, determining a cross-domain bearer relationship of the first network topology, associating the cross-domain bearer relationship with the end-to-end routing information, and obtaining a second network topology specifically includes:

[0148] S1041, determining the cross-domain bearer relationship of the IP circuit, STN circuit or transmission circuit of the first network topology according to the access number, link transceiver port and optical path port relationship, and determining the corresponding cross-domain bearer topology;

[0149] S1042: Associating the end-to-end routing information with the cross-domain bearer topology according to the cross-domain bearer relationship to obtain a second network topology.

[0150] Specifically, the network element topology connection of the IP circuit, STN circuit or transmission circuit connected in series in the first network topology is analyzed; through the access number, link AZ port and cross-domain association relationship (optical path and port relationship, etc.), a comprehensive analysis is made to see whether there is cross-domain bearer; if there is a match, the bearer relationship will be automatically associated with the end-to-end route, and automatically restored and displayed in the topology. You can click on the bearer topology in the topology diagram and automatically jump to the next layer of topology.

[0151] The steps of comprehensively analyzing whether there is cross-domain carrying can be achieved in the following ways: 1) Through the access number, if the access number of the topology relay is consistent with the access number of the transmission circuit, it means that the topology relay is carried by the transmission circuit; 2) Through the cross-domain association table, find the relationship between the optical path and the port. If they can be associated, it means that there is cross-domain carrying.

[0152] The above is a description of the method flow and implementation process of the embodiment of the present invention. It can be understood that the embodiment of the present invention obtains the first network topology by connecting the long-distance line and the local line in series, and obtains the end-to-end routing information by grouping and sorting based on the graph search algorithm, thereby realizing the cross-domain connection of communication network resources, associating the cross-domain bearer relationship with the end-to-end routing information, and being able to associate and jump multiple layers of topology in the topology map, thereby realizing the cross-layer connection of communication network resources and improving the efficiency and reliability of the connection of communication network resources.

[0153] Compared with the prior art, the embodiments of the present invention also have the following advantages:

[0154] 1) The embodiments of the present invention can be combined with specific business networking and characteristics for analysis and connection, and realize end-to-end topology restoration. Starting from the business scenario, it is converted into an edge vector structure, and a segmented and bidirectional search algorithm is adopted, which can be closer to the business, with less redundant calculation and high calculation efficiency;

[0155] 2) By finding out the bearer relationship between network layers and line bearer relationship, the cross-domain and cross-layer association logic is realized based on network networking and network association relationship;

[0156] 3) Starting from customer services, realize the association between customer-circuit-circuit routing-network equipment-equipment port-network topology, so as to achieve the purpose of end-to-end topology connection of services.

[0157] like Fig.12 FIG. 1 is a schematic diagram showing the structure of a communication network resource serial connection device provided by an embodiment of the present invention, referring to FIG. Fig.12 The embodiment of the present invention provides a communication network resource serial connection device, comprising:

[0158] An association matching module is used to obtain long-distance line information and local line information, and to perform association matching on the long-distance line information and the local line information to obtain an association relationship between the long-distance line and the local line;

[0159] A cross-domain serial connection module, used for serially connecting the long-distance line and the local line according to the association relationship to obtain a first network topology;

[0160] A routing reorganization module, used to group and sort the service paths of the first network topology based on a graph search algorithm to obtain end-to-end routing information;

[0161] The cross-layer cascade module is used to determine the cross-domain bearing relationship of the first network topology, associate the cross-domain bearing relationship with the end-to-end routing information, and obtain the second network topology.

[0162] The contents of the above method embodiments are all applicable to the present device embodiments. The functions specifically implemented by the present device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0163] The embodiment of the present invention also provides an electronic device, the electronic device comprising: a memory, a processor, a program stored in the memory and executable on the processor, and a data bus for realizing connection and communication between the processor and the memory, wherein the program is executed by the processor to realize the above-mentioned communication network resource serial connection method. The electronic device can be any intelligent terminal including a tablet computer, a vehicle-mounted computer, etc.

[0164] like Fig.13 FIG. 1 is a schematic diagram of the hardware structure of an electronic device provided in an embodiment of the present invention, referring to FIG. Fig.13 , an embodiment of the present invention provides an electronic device, including:

[0165] The processor 1301 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present invention.

[0166] The memory 1302 may be implemented in the form of a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 1302 may store an operating system and other application programs. When the technical solution provided in the embodiments of this specification is implemented by software or firmware, the relevant program code is stored in the memory 1302, and the processor 1301 calls and executes the communication network resource serial connection method of the embodiment of the present invention;

[0167] Input / output interface 1303, used to implement information input and output;

[0168] The communication interface 1304 is used to realize the communication interaction between the device and other devices. The communication can be realized through a wired manner (such as USB, network cable, etc.) or a wireless manner (such as mobile network, WIFI, Bluetooth, etc.);

[0169] A bus 1305 that transmits information between the various components of the device (e.g., the processor 1301, the memory 1302, the input / output interface 1303, and the communication interface 1304);

[0170] The processor 1301 , the memory 1302 , the input / output interface 1303 and the communication interface 1304 are connected to each other in communication within the device via a bus 1305 .

[0171] like Fig.14 FIG. 1 is a schematic diagram of a storage medium according to an embodiment of the present invention. Fig.14 The embodiment of the present invention also provides a storage medium, which is a computer-readable storage medium used for computer-readable storage. The storage medium stores one or more programs 1401, and the one or more programs 1401 can be executed by one or more processors to implement the above-mentioned communication network resource concatenation method.

[0172] The memory, as a non-transient computer-readable storage medium, can be used to store non-transient software programs and non-transient computer executable programs. In addition, the memory may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory may optionally include a memory remotely disposed relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0173] The embodiment of the present invention also discloses a computer program product or a computer program, wherein the computer program product or the computer program includes computer instructions, and the computer instructions are stored in a computer-readable storage medium. A processor of a computer device can read the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes Figure 1 The method shown.

[0174] In some selectable embodiments, the function / operation mentioned in the block diagram may not occur in the order mentioned in the operation diagram. For example, depending on the function / operation involved, the two boxes shown in succession can actually be executed substantially simultaneously or the above-mentioned boxes can sometimes be executed in reverse order. In addition, the embodiment presented and described in the flow chart of the present invention is provided by way of example, for the purpose of providing a more comprehensive understanding of technology. The disclosed method is not limited to the operation and logic flow presented herein. Selectable embodiments are expected, wherein the order of various operations is changed and the sub-operation of a part for which is described as a larger operation is performed independently.

[0175] In addition, although the present invention is described in the context of functional modules, it should be understood that, unless otherwise specified to the contrary, one or more of the above-mentioned functions and / or features can be integrated into a single physical device and / or software module, or one or more functions and / or features can be implemented in a separate physical device or software module. It is also understood that a detailed discussion of the actual implementation of each module is unnecessary for understanding the present invention. More specifically, in view of the properties, functions and internal relationships of the various functional modules in the device disclosed herein, the actual implementation of the module will be understood within the conventional skills of the engineer. Therefore, those skilled in the art can implement the present invention set forth in the claims without excessive experimentation using ordinary techniques. It is also understood that the specific concepts disclosed are merely illustrative and are not intended to limit the scope of the present invention, which is determined by the full scope of the appended claims and their equivalents.

[0176] If the above functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the above methods of each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[0177] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as an ordered list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or in conjunction with such instruction execution systems, devices or apparatuses. For the purposes of this specification, "computer-readable medium" can be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in conjunction with such instruction execution systems, devices or apparatuses.

[0178] More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection with one or more wires (electronic device), a portable computer disk case (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and editable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be a paper or other suitable medium on which the above-mentioned program is printed, since the above-mentioned program can be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, deciphering or processing in other suitable ways as necessary, and then stored in a computer memory.

[0179] It should be understood that the various parts of the present invention can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, a plurality of steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0180] In the above description of this specification, the description with reference to the terms "one embodiment / example", "another embodiment / example" or "certain embodiments / examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.

[0181] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the claims and their equivalents.

[0182] The above is a specific description of the preferred implementation of the present invention, but the present invention is not limited to the above embodiments. Those skilled in the art may make various equivalent modifications or substitutions without violating the spirit of the present invention. These equivalent modifications or substitutions are all included in the scope defined by the claims of this application.

Claims

1. A communication network resource cascade method, characterized in that: The following steps are involved: Acquire long-distance line information and local line information, and perform correlation matching on the long-distance line information and the local line information to obtain a correlation relationship between the long-distance line and the local line; Connecting the long-distance line and the local line in series according to the association relationship to obtain a first network topology; Grouping and sorting the service paths of the first network topology based on a graph search algorithm to obtain end-to-end routing information; Determine a cross-domain bearing relationship of the first network topology, associate the cross-domain bearing relationship with the end-to-end routing information, and obtain a second network topology.

2. A communication network resource serial connection method according to claim 1, characterized in that: The associating and matching the long-distance line information and the local line information to obtain the associative relationship between the long-distance line and the local line specifically includes: Determine the line names / access numbers of the plurality of long-distance lines according to the long-distance line information, and determine the line names / access numbers of the plurality of local lines according to the local line information; The association relationship between the long-distance line and the local line is determined according to the line name / access number.

3. A communication network resource cascade method according to claim 1, characterized in that: The long-distance line and the local line are connected in series according to the association relationship to obtain a first network topology, which specifically includes: Determine the sending end station and the receiving end station of the long-distance line, and determine the sending end station and the receiving end station of the local line; The first network topology is obtained by connecting the long-distance lines and the local lines that are related to each other in series according to the sending end station and the receiving end station.

4. A communication network resource cascade method according to claim 1, characterized in that: The process of performing routing reorganization and grouping sorting on the service paths of the first network topology based on the graph search algorithm to obtain end-to-end routing information specifically includes: Determine multiple service paths of the first network topology, and obtain initial service data corresponding to the service paths; Generate an edge vector according to the initial business data, and construct a graph structure according to the edge vector; Dividing the service path into a plurality of service segments, and determining a starting point and an end point of each service segment; Perform a bidirectional search on the graph structure according to the starting point and the ending point to obtain the edge vector corresponding to each of the service segments, and then determine the segment routing corresponding to each of the service segments; Integrating the segmented routes to obtain an initial reorganized route; The initial reorganized routes are grouped, sorted within the group, and de-duplicated to obtain the end-to-end routing information.

5. A communication network resource serial connection method according to claim 4, characterized in that: The bidirectional search of the graph structure according to the starting point and the ending point to obtain the edge vector corresponding to each of the service segments, and then determining the segment routing corresponding to each of the service segments, specifically includes: Using the starting point as a forward search starting point and the ending point as a reverse search starting point, a depth-first search is performed on the graph structure; When a search point of a forward search meets a search point of a reverse search, the edge vector corresponding to the service segment is determined according to the search path of the forward search and the search path of the reverse search; The edge vectors are concatenated to obtain the segment routes corresponding to the service segments.

6. A communication network resource serial connection method according to claim 4, characterized in that: The initial reorganized routes are grouped, sorted within the group, and deduplicated to obtain the end-to-end routing information, which specifically includes: Constructing a relationship tree according to the initial reorganized route, the relationship tree comprising a root node, leaf nodes and intermediate nodes; Traversing the relationship tree from the root node until reaching the leaf node, obtaining multiple routing paths and corresponding intra-group nodes; Sort the nodes in the group according to the traversal order to obtain the node information and node sequence number of each routing path; Deduplication processing is performed on the multiple routing paths whose node information and node sequence numbers are completely consistent to obtain the end-to-end routing information.

7. A communication network resource serial connection method according to any one of claims 1 to 6, characterized in that: The determining of the cross-domain bearer relationship of the first network topology and associating the cross-domain bearer relationship with the end-to-end routing information to obtain the second network topology specifically includes: Determine the cross-domain bearer relationship of the IP circuit, STN circuit or transmission circuit of the first network topology according to the access number, link transceiver port and optical path port relationship, and determine the corresponding cross-domain bearer topology; The end-to-end routing information is associated with the cross-domain bearer topology according to the cross-domain bearer relationship to obtain the second network topology.

8. A communication network resource serial connection device, characterized in that: include: An association matching module, used for acquiring long-distance line information and local line information, and performing association matching on the long-distance line information and the local line information to obtain an association relationship between the long-distance line and the local line; A cross-domain serial connection module, used for serially connecting the long-distance line and the local line according to the association relationship to obtain a first network topology; A routing reorganization module, used to group and sort the service paths of the first network topology based on a graph search algorithm to obtain end-to-end routing information; The cross-layer cascade module is used to determine the cross-domain bearing relationship of the first network topology, associate the cross-domain bearing relationship with the end-to-end routing information, and obtain the second network topology.

9. An electronic device, characterized in that: The electronic device includes a memory, a processor, a program stored in the memory and executable on the processor, and a data bus for realizing connection communication between the processor and the memory. When the program is executed by the processor, the steps of the communication network resource concatenation method as described in any one of claims 1 to 7 are realized.

10. A storage medium, the storage medium being a computer-readable storage medium, used for computer-readable storage, characterized in that: The storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the steps of the communication network resource concatenation method as described in any one of claims 1 to 7.

Images