Communication network resource concatenation method and apparatus, electronic device, and storage medium

Abstract

The application discloses a communication network resource concatenation method and device, electronic equipment and storage medium, and comprises the following steps: acquiring long-distance line information and local line information, associating and matching the long-distance line information and the local line information to obtain the association relationship between the long-distance line and the local line; concatenating the long-distance line and the local line 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; determining the cross-domain bearing relationship of the first network topology, associating the cross-domain bearing relationship with the end-to-end routing information to obtain a second network topology. The application can realize cross-domain and cross-layer concatenation of communication network resources, improve the efficiency and reliability of communication network resource concatenation, and can be widely applied to the technical field of communication network management.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of communication network management, and in particular to a communication network resource concatenation method and device, an electronic device and a storage medium. BACKGROUND

[0002] A communication network has the characteristics of large scale and strong complexity, and how to effectively concatenate data in numerous nodes and links is a challenge and difficulty at present. In the prior art, the following problems exist in the resource concatenation of a communication network:

[0003] 1) The object of concatenation usually manages a large amount of information, including device information, network information, management information, etc., and this process will occupy a large amount of system resources, which is prone to cause data redundancy, resulting in lag and slow transmission speed;

[0004] 2) The resource concatenation process of a communication network involves data in multiple devices, networks, management and other fields, and the data relationship is complex and difficult to effectively integrate;

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

[0006] The above problems need to be solved. SUMMARY

[0007] The present application aims to at least partially solve one of the problems in the prior art.

[0008] To this end, one purpose of the embodiments of the present application is to provide a communication network resource concatenation method, which can realize cross-domain and cross-layer concatenation of communication network resources, and improve the efficiency and reliability of communication network resource concatenation.

[0009] Another purpose of the embodiments of the present application is to provide a communication network resource concatenation device.

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

[0011] On the one hand, the embodiments of the present application provide a communication network resource concatenation method, comprising the following steps:

[0012] Obtaining long-distance line information and local line information, and associating and matching the long-distance line information and the local line information to obtain the association relationship between the long-distance line and the local line;

[0013] According to the association relationship, concatenating the long-distance line and the local line 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] 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.

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

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

[0018] determining the association relationship between the long-distance line and the local line according to the line names / access numbers.

[0019] Further, in an embodiment of the present application, the concatenating the long-distance line and the local line according to the association relationship to obtain a first network topology specifically comprises:

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

[0021] concatenating the long-distance line and the local line associated with each other according to the sending end station and the receiving end station to obtain the first network topology.

[0022] Further, in an embodiment of the present application, the grouping and sorting the service paths of the first network topology based on a graph search algorithm to obtain end-to-end routing information specifically comprises:

[0023] determining a plurality of service paths of the first network topology, and obtaining initial service data corresponding to the service paths;

[0024] generating an edge vector according to the initial service data, and constructing a graph structure according to the edge vector;

[0025] dividing the service paths into a plurality of service segments, and determining a starting point and a terminal point of each of the service segments;

[0026] performing bidirectional search on the graph structure according to the starting point and the terminal point to obtain the edge vector corresponding to each of the service segments, and further determining a segment route corresponding to each of the service segments;

[0027] integrating the segment routes to obtain an initial reorganized route;

[0028] Grouping, in-group sorting and de-duplication processing of the initial recombined routes are performed to obtain the end-to-end routing information.

[0029] Further, in an embodiment of the present application, the bidirectional search of the graph structure according to the starting point and the ending point to obtain the edge vector corresponding to each service segment, and further determine the segment route corresponding to each service segment, specifically includes:

[0030] The starting point is taken as the starting point of forward search, and the ending point is taken as the starting point of reverse search, and the graph structure is searched in depth-first manner;

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

[0032] The edge vector is spliced to obtain the segment route corresponding to the service segment.

[0033] Further, in an embodiment of the present application, the grouping, in-group sorting and de-duplication processing of the initial recombined routes to obtain the end-to-end routing information, specifically includes:

[0034] A relationship tree is constructed according to the initial recombined routes, and the relationship tree includes root nodes, leaf nodes and intermediate nodes;

[0035] The relationship tree is traversed from the root node until the leaf node is reached to obtain a plurality of routing paths and corresponding in-group nodes;

[0036] The in-group nodes are sorted according to the traversal order to obtain node information and node serial numbers of each routing path;

[0037] The plurality of routing paths with the same node information and node serial numbers are de-duplicated to obtain the end-to-end routing information.

[0038] Further, in an embodiment of the present application, the determination of the cross-domain bearing relationship of the first network topology, the association of the cross-domain bearing relationship with the end-to-end routing information, and the obtaining of the second network topology, specifically includes:

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

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

[0041] In another aspect, an embodiment of the present application provides a communication network resource concatenation apparatus, comprising:

[0042] An association matching module is configured to acquire long-distance line information and local line information, and 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.

[0043] A cross-domain concatenation module is configured to concatenate the long-distance line and the local line according to the association relationship to obtain a first network topology.

[0044] A routing reorganization module is configured to perform grouping and sorting on a service path of the first network topology based on a graph search algorithm to obtain end-to-end routing information.

[0045] A cross-layer concatenation module is configured to 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.

[0046] In another aspect, an embodiment of the present application provides an electronic device, which comprises 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, and the program is executed by the processor to realize the communication network resource concatenation method as described above.

[0047] In another aspect, an embodiment of the present application further provides a storage medium, which is a computer readable storage medium, for computer readable storage, and the storage medium stores one or more programs, and the one or more programs are executable by one or more processors to realize the communication network resource concatenation method as described above.

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

[0049] The embodiment of the present application obtains long-distance line information and local line information, performs correlation matching on the long-distance line information and the local line information, obtains the correlation relationship between the long-distance line and the local line, performs concatenation on the long-distance line and the local line according to the correlation relationship, obtains a first network topology, performs grouping and sorting on the service path 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, and performs correlation between the cross-domain bearing relationship and the end-to-end routing information, to obtain a second network topology. The embodiment of the present application performs concatenation according to the correlation relationship between the long-distance line and the local line to obtain a first network topology, and performs grouping and sorting based on a graph search algorithm to obtain end-to-end routing information, thereby realizing cross-domain concatenation of communication network resources, performing correlation between the cross-domain bearing relationship and the end-to-end routing information, and realizing cross-layer concatenation of communication network resources, thereby improving the efficiency and reliability of communication network resource concatenation. BRIEF DESCRIPTION OF DRAWINGS

[0050] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following introduces the drawings needed to be used in the embodiments of the present application. It should be understood that the drawings introduced below are merely for the convenience of clearly describing some embodiments in the technical solutions of the present application, and other drawings can also be obtained by those skilled in the art without any creative labor on the basis of these drawings.

[0051] Figure 1 A step flow chart of the communication network resource concatenation method provided by the embodiment of the present application is shown in FIG. 1.

[0052] Figure 2 A step flow chart of step S101 provided by the embodiment of the present application is shown in FIG. 2.

[0053] Figure 3 A step flow chart of step S102 provided by the embodiment of the present application is shown in FIG. 3.

[0054] Figure 4 A step flow chart of step S103 provided by the embodiment of the present application is shown in FIG. 4.

[0055] Figure 5 A step flow chart of step S1034 provided by the embodiment of the present application is shown in FIG. 5.

[0056] Figure 6 A step flow chart of step S1036 provided by the embodiment of the present application is shown in FIG. 6.

[0057] Figure 7 A schematic diagram of segment routing of Chengdu access segment provided by the embodiment of the present application is shown in FIG. 7.

[0058] Figure 8A schematic diagram of the segmented routing of the long-distance segment provided by the embodiment of the present application is shown in the following figure;

[0059] Figure 9 A schematic diagram of the segmented routing of the Neijiang access segment provided by the embodiment of the present application is shown in the following figure;

[0060] Figure 10 A schematic diagram of the end-to-end routing provided by the embodiment of the present application is shown in the following figure;

[0061] Figure 11 A step flow chart of the step S104 provided by the embodiment of the present application is shown in the following figure;

[0062] Figure 12 A structural schematic diagram of the communication network resource concatenation device provided by the embodiment of the present application is shown in the following figure;

[0063] Figure 13 A hardware structural schematic diagram of the electronic device provided by the embodiment of the present application is shown in the following figure;

[0064] Figure 14 A structural schematic diagram of the storage medium provided by the embodiment of the present application is shown in the following figure. DETAILED DESCRIPTION

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

[0066] In the description of the present application, the meaning of multiple is two or more, and if the first, second is described, it is only for the purpose of distinguishing technical features, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features or implicitly indicating the sequence of indicated technical features. In addition, unless otherwise defined, all technical and scientific terms used herein have the same meaning as understood by those skilled in the art to which the present application belongs. The terms used herein 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 by the embodiments of the present application can be applied to a terminal, can be applied to a server end, and can also be software running in the terminal or the server end. In some embodiments, the terminal can be a smart phone, a tablet computer, a notebook computer, a desktop computer, a set-top box, etc.; the server end can be configured as a stand-alone physical server, can be configured as a server cluster or a distributed system formed by multiple physical servers, can also be configured as a cloud server providing basic cloud computing services such as cloud service, cloud database, cloud computing, cloud function, cloud storage, network service, cloud communication, middleware service, domain name service, security service, CDN, and big data and artificial intelligence platform; and the software can be an application that implements the communication network resource concatenation method, 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 electronics, 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 a distributed computing environment, in which tasks are performed by remote processing devices connected by 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 embodiment of the present application, when relevant processing needs to be performed according to user information, user behavior data, user history data, and user location information, etc. related to the identity or characteristics of the user, the user's permission or consent will be obtained first, and the collection, use and processing of these data will comply with relevant laws, regulations and standards of the country and region. In addition, when the embodiments of the present application need to obtain sensitive personal information of the user, the separate permission or separate consent of the user will be obtained through a pop-up window or a jump to a confirmation page, etc. After obtaining the separate permission or separate consent of the user, the necessary user-related data for enabling the embodiments of the present application to normally run is obtained.

[0070] The embodiment of the present application provides a communication network resource concatenation method, which can realize cross-domain and cross-layer connection of communication network resources, realizes effective integration of communication network resources in the case that communication network involves data of different fields such as multiple devices, networks and management and the data relationship is complex, can discover abnormalities in time, perfects the link mode between data, and realizes concatenation of communication network resources with low time consumption and low complexity of topology structure.

[0071] As shown in Figure 1 , it is a step flow chart of the communication network resource concatenation method provided by the embodiment of the present application, referring to Figure 1 , the embodiment of the present application provides a communication network resource concatenation method, which specifically includes the following steps:

[0072] S101, long distance line information and local line information are acquired, the long distance line information and the local line information are associated and matched, and the associated relationship of the long distance line and the local line is obtained.

[0073] As shown in Figure 2 , it is a step flow chart of step S101 provided by the embodiment of the present application, referring to Figure 2 , further as an optional implementation, the long distance line information and the local line information are associated and matched, and the associated relationship of the long distance line and the local line is obtained, which specifically includes:

[0074] S1011, the line names / access numbers of multiple long distance lines are determined according to the long distance line information, and the line names / access numbers of multiple local lines are determined according to the local line information;

[0075] S1012, the associated relationship of the long distance line and the local line is determined according to the line names / access numbers.

[0076] Specifically, the long distance line is acquired from a group long distance resource system, and the basic information of the long distance line including the line name, the access number, the rate, the belonging customer, the customer address and the like is acquired; the long distance line and the line name or the access number of the local line of the local resource are associated and matched through the circuit name or the access number, and the matching association of the long distance line and the local line is realized.

[0077] S102, the long distance line and the local line are concatenated according to the associated relationship, and a first network topology is obtained.

[0078] As shown in Figure 3 , it is a step flow chart of step S102 provided by the embodiment of the present application, referring to Figure 3 , further as an optional implementation, the long distance line and the local line are concatenated according to the associated relationship, and a first network topology is obtained, 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, according to the sending end station and the receiving end station, the long-distance line and the local line are connected in series, and the first network topology is obtained.

[0081] Specifically, by the association relationship between the local line and the long-distance line, the local line and the long-distance line are connected in series through the local station, the network element, the address and other information of the sending end and the receiving end, and the long-distance end and the local end topology connection are realized. For example, for the long-distance line A and the local line B associated with each other, when the sending end station of the local line B is the user station 1, the receiving end station is the long-distance station 1, and the sending end station of the long-distance line A is the long-distance station 1, the receiving end station is the long-distance station 2, the result of the connection in series is user station 1-long-distance station 1-long-distance station 2.

[0082] S103, grouping and sorting the service path of the first network topology based on a graph search algorithm, to obtain end-to-end routing information.

[0083] Specifically, the multi-path between the topology connection is grouped and sorted, the routing group number and the serial number are recombined, and the end-to-end topology connection is realized. The grouping and sorting are performed by constructing an edge vector and based on a graph algorithm search; for the long-distance line segment, the routing segment is recombined by step-by-step low-orbit search.

[0084] As Figure 4 shown is a step flow chart of step S103 provided by the embodiment of the application, referring to Figure 4 , further as an optional implementation, the service path of the first network topology is recombined and grouped and sorted based on a graph search algorithm, to obtain end-to-end routing information, which specifically includes:

[0085] S1031, determine a plurality of service paths of the first network topology, and obtain initial service data corresponding to the service paths;

[0086] S1032, generate an edge vector according to the initial service data, and construct a graph structure according to the edge vector;

[0087] S1033, divide the service paths into a plurality of service segments, and determine the starting point and the ending point of each service segment;

[0088] S1034, bidirectionally search the graph structure according to the starting point and the ending point, to obtain an edge vector corresponding to each service segment, and further determine a segment routing corresponding to each service segment;

[0089] S1035, integrate the segment routing, to obtain an initial recombined routing;

[0090] S1036. The initial reassembled routes are grouped, sorted within groups, and deduplicated to obtain end-to-end routing information.

[0091] Specifically, the original business data that needs to be concatenated is transformed into edge vectors with starting directions to construct a graph structure.

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

[0093] Type 1: Dot 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 item includes 2 nodes: sequence number, A node (sending node) identifier, A node name, A node attributes, Z node (receiving node) identifier, Z node name, and Z node attributes.

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

[0096] Edge vectors can store not only the relationship between two nodes, but also the node attributes, such as the node's source system, city, station name, station type, and port. These directed edges are stored in the directed graph data structure in computer languages. Each edge contains information about the circuit itself and the direction to the next node. Each node is routed as a point in the graph, completing the conversion between the circuit topology model in the network and the directed graph that can be processed by the computer.

[0097] The business is divided into different segments according to its characteristics. For each segment, the start and end points are identified, and the complete path of each segment is searched bidirectionally.

[0098] Based on service characteristics, services are segmented into different segments. For example, a cross-city circuit will pass through three segments: "City A Access Segment", "Long-distance Segment", and "City Z Access Segment". In the A and Z access segments, the node path will be from the customer's central office to the long-distance central office; while the long-distance segment will be from the long-distance central office in City A to the long-distance central office in City Z.

[0099] The system locates the start and end nodes of each segment based on different segments, and uses a bidirectional depth-limited search algorithm to find the corresponding edge vectors.

[0100] like Figure 5 The diagram shown is a flowchart of step S1034 provided in an embodiment of the present invention. (Refer to...) Figure 5As a further optional implementation, a bidirectional search is performed on the graph structure according to the start point and the end point to obtain an edge vector corresponding to each service segment, and then a segment route corresponding to each service segment is determined, which specifically includes:

[0101] S10341, taking the start point as a forward search starting point and taking the end point as a reverse search starting point, 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, determining an 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, performing splicing processing on the edge vector to obtain a segment route corresponding to the service segment.

[0104] Specifically, bidirectional depth-first search (BiDFS) is an efficient graph search algorithm. Compared with the traditional unidirectional depth-first search, it simultaneously performs a depth-first search (DFS) from the start point and the target point of the graph until the searches of the two sides meet. Two hash sets p1 and p2 are set to store the paths of the depth-first searches starting from the start point and the end point, respectively. The bidirectional depth-first search algorithm can take the start point and the end point of a single segment as the search starting points, and the search ends when the search points meet or the maximum step length is reached. During each search, the two directions simultaneously advance, which speeds up the meeting time of the start point and the end point and narrows the search range of the search tree, thereby quickly completing the path search. Depth limitation is set to avoid blind search in a deep layer and a large scale due to the inability of the start point to meet in a complex circuit topology, thereby wasting computing resources.

[0105] In addition, since the segments are independent of each other, a multi-threaded mode can be used, and multiple segment searches can be performed simultaneously. In the case of allowing concurrent search, the search time can be greatly saved.

[0106] After determining the multiple edge vectors through bidirectional depth-first search, each segment edge vector is coordinated according to the business logic, and then all paths in a single segment are de-duplicated, grouped, and sorted within the group to restore the complete end-to-end route.

[0107] According to the business logic, each segment is coordinated, for example, the local station name between the segments should be consistent to enable coordination. For example, the first segment route is “node 1→node 2” and the second segment route is “node 21→node 22”, where node 2 and node 22 belong to the same local station. At this time, the coordination sequence is node 1→node 2→node 22→node 21.

[0108] For example, Figure 6A step flow chart of step S1036 provided by the embodiment of the application is shown, referring to Figure 6 Further, as an optional implementation, the initial recombined routes are grouped, in-group sorted, and de-duplicated to obtain end-to-end routing information, which specifically includes:

[0109] S10361, constructing a relationship tree according to the initial recombined routes, the relationship tree including root nodes, leaf nodes, and intermediate nodes;

[0110] S10362, traversing the relationship tree from the root node until reaching the leaf nodes to obtain a plurality of routing paths and corresponding in-group nodes;

[0111] S10363, sorting the in-group nodes according to the traversal order to obtain node information and node serial numbers of each routing path;

[0112] S10364, de-duplicating a plurality of routing paths with completely identical node information and node serial numbers to obtain end-to-end routing information.

[0113] Specifically, after the coordination, for the edge vector of each segment, the nodes are disassembled and mapped to the relationship tree, and by traversing the root node of the relationship tree, each leaf node of the tree is reached as a group of circuits, and the point routing in each group of circuits is sorted from 1 to the maximum path length n. If the nodes of two paths are the same, de-duplication is needed. Thus, the circuit group number and serial number division is completed, and the end-to-end routing information is obtained.

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

[0115] 1) Forming an edge vector according to the original data.

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

[0117] The data of the Chengdu access segment is shown in Table 1, and the point structure is adopted.

[0118] Number Node City Station 1 N11 Chengdu Subscriber Station 1 2 N12 Chengdu Aggregation Station 1 3 N13 Chengdu Aggregation Station 2 4 N14 Chengdu Long Distance Station 1 5 N11 Chengdu Subscriber Station 1 6 N13 Chengdu Aggregation Station 2

[0119] Table 1

[0120] The data of the long-distance segment is shown in Table 2, and the line structure is adopted.

[0121] Number A-end Node A-end City A-end Station Z-end Node Z-end City Z-end 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 the Neijiang access segment is shown in Table 3, and the point structure is adopted.

[0124]

[0125]

[0126] Table 3

[0127] The Chengdu access section is sorted according to the serial number, and an edge vector is generated from the adjacent upper and lower records, as shown in the following Table 4.

[0128] 1 N11 Chengdu Subscriber Station 1 2 N12 Chengdu Aggregation Station 1

[0129] Table 4

[0130] The Chengdu section edge vector is generated: N11→N12.

[0131] If the starting node appears, the edge vector will not be generated.

[0132] 4 N14 Chengdu Long Distance Station 1 5 N11 Chengdu Subscriber Station 1

[0133] Table 5

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

[0135] The final Chengdu access section generated vector is as follows: N11→N12, N12→N13, N13→N14, N11→N13.

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

[0137] The Neijiang section can generate the following edge vector: N31→N32, N32→N33.

[0138] 2) According to the business characteristics, the business is divided into different sections, and the starting and ending nodes of each section are found out. The complete path of each section is searched bidirectionally.

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

[0140] According to the bidirectional search algorithm, the paths of the respective sections can be generated, and the segmented routing of the Chengdu access section is as shown in Figure 7 , the segmented routing of the long-distance section is as shown in Figure 8 , and the segmented routing of the Neijiang access section is as shown in Figure 9 .

[0141] 3) According to the business logic, each section is coordinated, and then all the paths in a single section are de-duplicated, grouped, sorted in the group, and restored to a complete end-to-end route.

[0142] First, the interworking between segment routing is carried out, and splicing is carried out according to whether the station names are equal. N14 and N21 belong to long-distance station 1, so the two nodes can be spliced, and N24 and N33 belong to long-distance station 2 and can also be spliced. The final end-to-end routing is as shown in the figure Figure 10 The relevant segment number, group number and serial number are shown in Table 6.

[0143]

[0144]

[0145] Table 6

[0146] S104, 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.

[0147] As Figure 11 shown is a step flowchart of step S104 provided by the embodiment of the application, and the step S104 is further described in detail with reference to Figure 11 , as an optional implementation, the cross-domain bearing relationship of the first network topology is determined, the cross-domain bearing relationship is associated with the end-to-end routing information, and the second network topology is obtained, which specifically includes:

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

[0149] S1042, associate the end-to-end routing information with the cross-domain bearing topology according to the cross-domain bearing relationship, and obtain the second network topology.

[0150] Specifically, the network element topology connection of the concatenated IP circuit, the STN circuit or the transmission circuit in the first network topology is analyzed; whether there is cross-domain bearing is comprehensively analyzed through the access number, the link AZ port and the cross-domain association relationship (the optical path and the port relationship); if it can be matched, the bearing relationship is automatically associated with the end-to-end routing, and is automatically restored and displayed in the topology; the bearing topology can be clicked in the topology diagram, and automatically jump to the next layer topology.

[0151] The step of comprehensively analyzing whether there is cross-domain bearing can be realized 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 is indicated that the topology relay is carried by the transmission circuit; 2) through the cross-domain association relationship table, the optical path and the port relationship are found, and if they can be associated, it is indicated that there is cross-domain bearing.

[0152] The method flow and implementation process of the embodiment of the application are described above. It can be understood that the embodiment of the application obtains the first network topology by concatenating the long-distance line and the local line according to the association relationship, and obtains the end-to-end routing information by grouping and sorting based on the graph search algorithm, realizes the cross-domain concatenation of the communication network resources, associates the cross-domain bearing relationship with the end-to-end routing information, can associate and jump in the topology graph, realizes the cross-layer concatenation of the communication network resources, and improves the efficiency and reliability of the communication network resource concatenation.

[0153] Compared with the prior art, the embodiment of the application also has the following advantages:

[0154] 1) The embodiment of the application can analyze and concatenate in combination with specific service networking and characteristics, and realize the restoration of the end-to-end topology, starting from the service scene, converting into the structure of the edge vector, and using the segmented and bidirectional search algorithm, which can be closer to the service, less redundant calculation, and high calculation efficiency.

[0155] 2) By finding the bearing relationship between the network levels and the line bearing relationship, the cross-domain and cross-layer association logic is realized based on the network networking and network association relationship.

[0156] 3) Starting from the customer service, the association between the customer-circuit-circuit route-network device-device port-network topology is realized, so as to achieve the purpose of service end-to-end topology concatenation.

[0157] As Figure 12 shown is a structure schematic diagram of a communication network resource concatenation device provided by the embodiment of the application, with reference to Figure 12 , the embodiment of the application provides a communication network resource concatenation device, which comprises:

[0158] An association matching module is configured to acquire long-distance line information and local line information, and perform association matching on the long-distance line information and the local line information to obtain the association relationship between the long-distance line and the local line.

[0159] A cross-domain concatenation module is configured to concatenate the long-distance line and the local line according to the association relationship to obtain a first network topology.

[0160] A routing recombination module is configured 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] A cross-layer concatenation module is configured 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 a second network topology.

[0162] The contents in the method embodiments are applicable to the device embodiments, the device embodiments specifically implement the functions same as the method embodiments, and achieve the same beneficial effects as the method embodiments.

[0163] The embodiment of the present application further provides an electronic device, which comprises 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, and the program is executed by the processor to realize the communication network resource concatenation method. The electronic device can be any intelligent terminal including a tablet computer, a vehicle-mounted computer and the like.

[0164] As Figure 13 Fig. 1 shows a hardware structure schematic diagram of the electronic device provided by the embodiment of the present application, referring to Figure 13 The embodiment of the present application provides an electronic device, which comprises:

[0165] The processor 1301 can be implemented in the form of a general CPU (Central Processing Unit), a microprocessor, an ASIC (Application Specific Integrated Circuit), or one or more integrated circuits, and is used to execute related programs to realize the technical solutions provided by the embodiment of the present application.

[0166] The memory 1302 can be implemented in the form of a ROM (Read Only Memory), a static storage device, a dynamic storage device, or a RAM (Random Access Memory). The memory 1302 can store an operating system and other application programs, and when the technical solutions provided by the embodiment of the present application are implemented by software or firmware, the related program codes are stored in the memory 1302 and are called and executed by the processor 1301 to realize the communication network resource concatenation method of the embodiment of the present application.

[0167] The input / output interface 1303 is used to realize information input and output.

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

[0169] The bus 1305 transmits information between various components (for example, the processor 1301, the memory 1302, the input / output interface 1303, and the communication interface 1304) of the device.

[0170] The processor 1301, the memory 1302, the input / output interface 1303, and the communication interface 1304 are communicatively connected with each other through the bus 1305.

[0171] As shown in Figure 14 Fig. 6 is a structural schematic diagram of a storage medium provided by an embodiment of the present application. As shown in Figure 14 The embodiment of the present application further provides a storage medium. The storage medium is a computer readable storage medium, used for computer readable storage. The storage medium stores one or more programs 1401. The one or more programs 1401 can be executed by one or more processors, so as to implement the communication network resource concatenation method.

[0172] The memory is a non-transitory computer readable storage medium, which can be used to store non-transitory software programs and non-transitory computer executable programs. In addition, the memory can include a high-speed random access memory, and can further include a non-transitory memory, such as at least one magnetic disk storage device, a flash memory device, or other non-transitory solid-state memory device. In some embodiments, the memory can optionally include a memory remotely arranged relative to the processor, and the remote memory can be connected to the processor through a network. Examples of the network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and a combination thereof.

[0173] The embodiment of the present application further discloses a computer program product or a computer program, which comprises computer instructions 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 in Fig. 6.

[0174] In some alternative embodiments, the functions / operations mentioned in the block diagram can not occur in the order mentioned in the operation diagram. For example, depending on the functions / operations involved, two blocks shown in succession can actually be executed substantially simultaneously or the above blocks can be executed in reverse order at times. In addition, the embodiments presented and described in the flowcharts of the present application are provided by way of example, and the purpose is to provide a more comprehensive understanding of the technology. The disclosed method is not limited to the operations and logical flows presented herein. Alternative embodiments are contemplated, in which the order of various operations is changed and in which sub-operations described as part of larger operations are independently executed.

[0175] Furthermore, although the present application is described in the context of functional modules, it is to be understood that one or more of the functions and / or features described above can be integrated in a single physical device and / or software module, or one or more functions and / or features can be implemented in separate physical devices or software modules. It will also be appreciated that detailed discussion of the actual implementation of each module is unnecessary to an understanding of the present application. Rather, the actual implementation of the modules, in conjunction with their attributes, functions, and internal relationships, are to be understood within the context of the devices disclosed herein. Thus, those skilled in the art with access to the teachings presented herein will be able to devise suitable implementations of the present application without undue experimentation. It is also to be understood that the particular concepts disclosed are merely illustrative and are not intended to limit the scope of the present application, which is defined by the appended claims and equivalents thereof.

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

[0177] The logic and / or steps represented in the flowcharts or otherwise described herein, for example, can be considered as a list of executable instructions for implementing logic functions, which can be specifically 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 and execute instructions from an instruction execution system, device or apparatus, or in conjunction with these instructions execution system, device or apparatus. For the purpose of this specification, "computer readable medium" can be any device that can contain, store, communicate, propagate or transport programs for use by an instruction execution system, device or apparatus, or in conjunction with these instruction execution system, device or apparatus.

[0178] More specific examples (a non-exhaustive list) of the computer-readable medium include the following: an electrical connection (electronic) having one or more wires, a portable computer diskette (magnetic), a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium can also be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, for example, via optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.

[0179] It should be understood that aspects of the application can be implemented in hardware, software, firmware or combinations thereof. In the above embodiments, various steps or methods can be implemented in software or firmware which are stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any of the following technologies, known in the art, or their combinations can be used: discrete logic circuitry having logic gates for implementing logic functions upon an application of data signals, application specific integrated circuits having appropriate combinational logic gates, programmable gate arrays (PGA), field programmable gate arrays (FPGA), and the like.

[0180] In the above description of the present specification, the description referring to the terms "one embodiment", "another embodiment", or "certain embodiments" or the like means that a specific feature, structure, material or characteristic described in connection with the embodiments or examples is included in at least one embodiment or example of the present application. The illustrative expressions of the above terms do not necessarily refer to the same embodiment or example in the present specification. Also, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner.

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

[0182] The above is a specific description of the preferred embodiments of the present application, but the present application is not limited to the above-described embodiments, and those skilled in the art can make various equivalent modifications or substitutions without departing from the spirit of the present application, and these equivalent modifications or substitutions are included in the scope defined by the claims of the present application.

Claims

1. A method of concatenating resources of a communication network, characterized in that, The method comprises the following steps: obtaining long-distance line information and local line information, and performing associated matching on the long-distance line information and the local line information to obtain an associated relationship between long-distance lines and local lines; concatenating the long-distance lines and the local lines according to the associated relationship to obtain a first network topology; grouping and sorting service paths of the first network topology based on a graph search algorithm to obtain end-to-end routing information; 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; the grouping and sorting of the service paths of the first network topology based on the graph search algorithm to obtain the end-to-end routing information specifically comprises: determining a plurality of service paths of the first network topology, and obtaining initial service data corresponding to the service paths; generating an edge vector according to the initial service data, and constructing a graph structure according to the edge vector; dividing the service paths into a plurality of service segments, and determining starting points and ending points of the service segments; performing bidirectional search on the graph structure according to the starting points and the ending points to obtain the edge vector corresponding to each service segment, and further determining a segment route corresponding to each service segment; integrating the segment routes to obtain an initial reorganized route; grouping, intra-group sorting, and de-duplication processing of the initial reorganized route to obtain the end-to-end routing information; the bidirectional search on the graph structure according to the starting points and the ending points to obtain the edge vector corresponding to each service segment, and further determining a segment route corresponding to each service segment specifically comprises: taking the starting point as a forward search starting point and taking the ending point as a reverse search starting point to perform a depth-first search on the graph structure; when the search point of the forward search meets the search point of the reverse search, determining 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; performing splicing processing on the edge vector to obtain the segment route corresponding to the service segment; the grouping, intra-group sorting, and de-duplication processing of the initial reorganized route to obtain the end-to-end routing information specifically comprises: constructing a relationship tree according to the initial reorganized route, the relationship tree comprising a root node, a leaf node, and an intermediate node; traversing the relationship tree from the root node until reaching the leaf node to obtain a plurality of routing paths and corresponding intra-group nodes; sorting the intra-group nodes according to a traversal order to obtain node information and node serial numbers of each routing path; performing de-duplication processing on a plurality of routing paths with completely identical node information and node serial numbers to obtain the end-to-end routing information.

2. The method of claim 1, wherein, the associated matching on the long-distance line information and the local line information to obtain the associated relationship between long-distance lines and local lines specifically comprises: determining line names / access numbers of a plurality of long-distance lines according to the long-distance line information, and determining line names / access numbers of a plurality of local lines according to the local line information; Determine the association relationship between the long-distance line and the local line according to the line name / access number.

3. The method of claim 1, wherein, The long-distance line and the local line are concatenated according to the association relationship to obtain a first network topology, which specifically comprises: 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 long-distance line and the local line associated with each other are concatenated according to the sending end station and the receiving end station to obtain the first network topology.

4. The method of claim 1 to 3, wherein, The cross-domain bearing relationship of the first network topology is determined, and the cross-domain bearing relationship is associated with the end-to-end routing information to obtain a second network topology, which specifically comprises: The cross-domain bearing relationship of the IP circuit, the STN circuit or the transmission circuit of the first network topology is determined according to the access number, the link transceiver port and the optical path port relationship, and the corresponding cross-domain bearing topology is determined; The end-to-end routing information is associated with the cross-domain bearing topology according to the cross-domain bearing relationship to obtain the second network topology.

5. A communication network resource concatenation apparatus, characterized by, A communication network resource concatenation method as claimed in any one of claims 1 to 4 is implemented, comprising: An association matching module is configured 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; A cross-domain concatenation module is configured to concatenate the long-distance line and the local line according to the association relationship to obtain a first network topology; A routing recombination module is configured 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; A cross-layer concatenation module is configured to determine the cross-domain bearing relationship of the first network topology, and to associate the cross-domain bearing relationship with the end-to-end routing information to obtain a second network topology.

6. An electronic device, comprising: The electronic device comprises a memory, a processor, a program stored on the memory and executable on the processor, and a data bus for realizing connection communication between the processor and the memory, and the program is executed by the processor to realize the steps of the communication network resource concatenation method as claimed in any one of claims 1 to 4.

7. A storage medium, the storage medium being a computer-readable storage medium for computer-readable storage, characterized in that, The storage medium stores one or more programs, which can be executed by one or more processors to realize the steps of the communication network resource concatenation method as claimed in any one of claims 1 to 4.

Images