End-to-End Routing Real-Time Chaining and Display Method and Device Based on OTN Hierarchical Routing

Abstract

The embodiments of the present application provide an end-to-end routing real-time concatenation and display method and device based on OTN hierarchical routing. This method accesses data based on a graph database, splits the end-to-end routing into two levels of a main graph and a sub-graph for concatenation, and concurrently processes the sub-graph data, and finally summarizes it on the main graph. Compared with drilling and querying data from a relational database, the end-to-end routing real-time concatenation and display method and device provided by the present invention are more efficient. Moreover, by means of the idea of dynamic programming, the original problem is decomposed into a series of interrelated sub-problems. These sub-problems are smaller in scale, faster in calculation speed, and the sub-problems at the same level can be calculated in parallel, thus improving the data processing efficiency. Based on the above two points, this data storage method can greatly shorten the end-to-end routing concatenation time-consuming, making real-time calculation possible.

Description

Technical Field

[0001] The present application relates to the field of data processing, and in particular, to an end-to-end routing real-time concatenation and display method and device based on OTN hierarchical routing. Background Art

[0002] The OTN network (hierarchical routing) is logically divided into multiple layers, each layer responsible for specific functions and scopes, and different layers interact through specific interfaces. The advantages are that better network management and control can be achieved, and the scalability and flexibility of the network can be improved. Each layer can be optimized and upgraded independently, reducing the complexity of the network. At the data level, OTN routing data is also stored according to the hierarchical and single-channel dimensions.

[0003] The advantages of hierarchical routing are that the data is easy to maintain, the scale of a single-layer routing is small, and it is easy to troubleshoot problems. The disadvantages are that, from the overall perspective of end-to-end communication, when looking at the routing direction, it is necessary to switch back and forth between different hierarchical routings, which is not intuitive and difficult to understand. Some routing problems need to be discovered from an overall perspective, such as OCH segment multiplexing. Moreover, the existing OTN routing data storage depends on the segment group order attribute of the routing data. If the segment group order is missing or inaccurate, the output of the end-to-end routing will fail. And the routing data volume of the OTN network is large. If the data is stored based on a relational database, the query efficiency is slow. It is necessary to build a cache for end-to-end aggregation to a certain layer in advance. The serial construction efficiency is not high, and it depends on the cache. When a certain path of the routing data changes, it cannot be updated in real time dynamically. Summary of the Invention

[0004] Aiming at the problems in the prior art, the present application provides an end-to-end routing real-time concatenation and display method and device based on OTN hierarchical routing, which can realize the visualization of routing data from end to end, and can be expanded according to any level to construct the end-to-end routing in real time.

[0005] To solve at least one of the above problems, the present application provides the following technical solutions:

[0006] In a first aspect, the present application provides an end-to-end routing real-time concatenation and display method based on OTN hierarchical routing, including:

[0007] Synchronize the port data and channel data in the OTN network to the graph database in node type, and establish the connection relationship between ports and the bearing relationship between channels;

[0008] Query the main graph routing based on the top-level channel of the OTN network to obtain the main graph routing data, and generate the main graph routing topology through main graph routing dotting;

[0009] Extract the sub-channel identifiers carrying the subnet links from the main graph routing data, and group the sub-channels among network elements to form multiple sub-graphs;

[0010] Query the sub-graph routing based on the sub-channels to obtain the sub-graph routing data, and generate the sub-graph routing topology map by marking points on the sub-graph routing;

[0011] Merge the sub-graph routing topology map into the main graph routing topology map to obtain the complete routing topology map of the OTN network.

[0012] Further, the steps of establishing the connection relationship between ports and the bearing relationship between channels include:

[0013] Establish a directed connection relationship between ports according to the hierarchical routing data of the OTN network, and assign the attributes of the hierarchical routing data to the connection relationship, and incrementally synchronize the relationship type to the graph database;

[0014] Establish a directed bearing relationship between channels according to the hierarchical routing data of the OTN network, and incrementally synchronize the relationship type to the graph database.

[0015] Further, the step of querying the main graph routing based on the top-level channels of the OTN network to obtain the main graph routing data includes:

[0016] Based on the identifiers of the top-level channels of the OTN network, query the channel bearing relationship in the graph database to obtain the first channel set involved in expanding the top-level channels to the main graph level; query the channel routing based on the first channel set to obtain the main graph routing data.

[0017] Further, the step of generating the main graph routing topology map by marking points on the main graph routing includes:

[0018] Search for the main signal flow and the minimum path coverage according to the main graph routing data; layout the node coordinates based on the main signal direction, select the coordinates of the key intersection points based on the minimum path coverage set; arrange the signal flow for the ports to determine the node coordinates of each port, and generate the main graph routing topology map.

[0019] Further, the step of grouping the sub-channels among network elements to form multiple sub-graphs includes:

[0020] For multiple subnet links between the same network elements, judge whether there is an overlapping part. If the overlapping ratio exceeds the set threshold, expand them together to form a sub-graph; if the overlapping ratio does not exceed the set threshold, expand them separately.

[0021] Further, the step of obtaining sub - graph routing data based on the sub - channel query sub - graph routing includes:

[0022] In a concurrent manner, expand from each of the sub - graph channels to the second channel set involved in the end - to - end routing level, and query the channel routing based on the second channel set to obtain the sub - graph routing data.

[0023] Further, the step of merging the sub - graph routing topology graph into the main - graph routing topology graph to obtain the complete routing topology graph of the OTN network includes:

[0024] According to the connection points between the main - graph routing topology graph and the sub - graph routing topology graph, clarify the position and occupied range of the sub - graph routing topology graph before the main - graph routing topology graph is not expanded;

[0025] By calculating the size range of the sub - graph routing topology graph and subtracting its size range in the main - graph routing topology graph, obtain the change amount that the nearby points need to be moved when the sub - graph routing topology graph is embedded in the main - graph routing topology graph;

[0026] Adjust the coordinates of relevant points according to the calculated change amount, add the sub - graph routing topology graph data to the main - graph routing topology graph, and complete the merging operation of the sub - graph routing topology graph and the main - graph routing topology graph;

[0027] Repeat this process until all the sub - graph routing topology graphs are merged into the main - graph routing topology graph to obtain the complete routing topology graph.

[0028] In a second aspect, the present application provides an end - to - end routing real - time concatenation and display device based on OTN hierarchical routing, including:

[0029] A data transfer and storage module, configured to synchronize the port data and channel data in the OTN network to the graph database in node type, establish the connection relationship between ports and the bearing relationship between channels;

[0030] A main - graph generation module, configured to query the main - graph routing based on the top - level channels of the OTN network to obtain main - graph routing data, and generate a main - graph routing topology graph by dotting the main - graph routing;

[0031] A sub - graph splitting module, configured to extract the sub - channel identifiers carrying the subnet links from the main - graph routing data, and group the sub - channels according to the network elements to form multiple sub - graphs;

[0032] A sub - graph generation module, configured to query the sub - graph routing based on the sub - channels to obtain sub - graph routing data, and generate a sub - graph routing topology graph by dotting the sub - graph routing;

[0033] A data merging module, configured to merge the sub - graph routing topology graph into the main - graph routing topology graph to obtain the complete routing topology graph of the OTN network.

[0034] In a third aspect, the present application provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, the steps of the end - to - end routing real - time concatenation and display method based on OTN hierarchical routing are implemented.

[0035] In a fourth aspect, the present application provides a computer - readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the end - to - end routing real - time concatenation and display method based on OTN hierarchical routing are implemented.

[0036] In a fifth aspect, the present application provides a computer program product, including a computer program / instructions. When the computer program / instructions are executed by a processor, the steps of the end - to - end routing real - time concatenation and display method based on OTN hierarchical routing are implemented.

[0037] As can be seen from the above technical solutions, the present application provides an end - to - end routing real - time concatenation and display method and device based on OTN hierarchical routing. This method accesses data based on a graph database, and has higher efficiency compared to drilling and querying data from a relational database. Moreover, this method splits the end - to - end routing into two levels, namely the main graph and the sub - graph, for concatenation, and concurrently processes the sub - graph data, and finally aggregates it onto the main graph. This method decomposes the original problem into a series of interrelated sub - problems through the idea of dynamic programming. These sub - problems are smaller in scale, faster in calculation speed, and the sub - problems at the same level can be calculated in parallel, improving the data - processing efficiency. Based on the above two points, this data - storage method can significantly shorten the end - to - end routing concatenation time, making real - time calculation possible. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings required for use in the description of the embodiments or the prior art. Obviously, the following - described drawings are some embodiments of the present application. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0039] Figure 1 It is a schematic flowchart of the end - to - end routing real - time concatenation and display method based on OTN hierarchical routing in the embodiments of the present application;

[0040] Figure 2 It is a schematic diagram of the data - storage structure of the graph database for the end - to - end routing real - time concatenation and display method based on OTN hierarchical routing in the embodiments of the present application;

[0041] Figure 3 Schematic diagram of the real-time concatenation processing flow of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing in the embodiments of the present application;

[0042] Figure 4 Schematic diagram of the structure of the main graph routing topology of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing in the embodiments of the present application;

[0043] Figure 5 Schematic diagram of the structure of the sub-graph routing topology of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing in the embodiments of the present application;

[0044] Figure 6 Schematic diagram of the structure of the overall routing topology of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing in the embodiments of the present application;

[0045] Figure 7 Structure diagram of the end-to-end routing real-time concatenation and display device based on OTN hierarchical routing in the embodiments of the present application;

[0046] Figure 8 Schematic diagram of the structure of the electronic device in the embodiments of the present application.

[0047] Reference numerals:

[0048] Electronic device 9600, central processing unit 9100, memory 9140, communication module 9110, input unit 9120, audio processor 9130, display 9160, power supply 9170, buffer memory 9141, application / function storage unit 9142, data storage unit 9143, driver program storage unit 9144, antenna 9111, speaker 9131, microphone 9132. Detailed implementation manners

[0049] To make the objectives, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are some, but not all, of the embodiments of the present application. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present application without creative efforts shall fall within the protection scope of the present application.

[0050] In the technical solutions of the present application, the acquisition, storage, use, processing, etc. of data all comply with the relevant regulations of national laws and regulations.

[0051] In view of the problems existing in the prior art, the present application provides an end-to-end routing real-time concatenation and display method and device based on OTN hierarchical routing. This method stores data based on a graph database, and has higher efficiency compared to drilling and querying data from a relational database. Moreover, this method splits the end-to-end routing into two levels, namely the main graph and the sub-graph, for concatenation, and concurrently processes the sub-graph data, and finally aggregates it onto the main graph. By using the idea of dynamic programming, the original problem is decomposed into a series of interrelated sub-problems. These sub-problems are smaller in scale, faster in calculation speed, and the sub-problems at the same level can be calculated in parallel, thus improving the data processing efficiency. Based on the above two points, this data storage method can significantly shorten the end-to-end routing concatenation time, making real-time calculation possible.

[0052] In order to achieve end-to-end visualization of routing data and be able to expand at any level to construct the end-to-end routing in real time, the present application provides an embodiment of an end-to-end routing real-time concatenation and display method based on OTN hierarchical routing. Generally speaking, this method includes two parts. One is to store data based on a graph database (step S101), and the other is to split the end-to-end routing into two levels, namely the main graph and the sub-graph, for concatenation, concurrently process the sub-graph data, and finally aggregate it onto the main graph (steps S102 - S105). Specifically, see Figure 1 The end-to-end routing real-time concatenation and display method based on OTN hierarchical routing includes the following content:

[0053] Step S101: Synchronize the port data and channel data in the OTN network to the graph database in node type, and establish the connection relationship between ports and the bearing relationship between channels.

[0054] Refer to Figure 2 As shown, in this embodiment, the specific steps of graph database data storage include:

[0055] I. Synchronize port data

[0056] Incrementally synchronize the port data in the OTN network to the graph database in node type.

[0057] II. Synchronize channel data

[0058] Incrementally synchronize the channel data in the OTN network to the graph database in node type.

[0059] III. Synchronize hierarchical routing data

[0060] 1) According to the hierarchical routing data in the OTN network, establish a directed connection relationship between ports, and assign the attributes of the hierarchical routing data to the connection relationship, and incrementally synchronize it to the graph database in relationship type.

[0061] 2) Based on the hierarchical routing data in the OTN network, establish a directed bearing relationship between channels, and incrementally synchronize it to the graph database according to the relationship type.

[0062] The end-to-end routing real-time concatenation and display method based on OTN hierarchical routing provided in this embodiment uses a graph database to store and access hierarchical routing and channel bearing relationship data. Channels are regarded as node objects. When saving routing data to the graph database, the connection relationship between ports and the bearing relationship between channels are maintained at the same time. With these relationship data, the query efficiency is very fast when searching for the bearing relationship from the top-level channel to the bottom-level channel at any level and aggregating hierarchical routing.

[0063] Step S102: Query the main graph routing based on the top-level channel of the OTN network, obtain the main graph routing data, and generate a main graph routing topology by dotting the main graph routing.

[0064] Reference Figure 3 As shown, in this embodiment, the specific steps of real-time concatenation include: one, obtaining the main graph routing; two, dotting the main graph routing; three, constructing the sub-graph input parameters; four, obtaining the sub-graph routing; five, dotting the sub-graph routing; six, merging the sub-graph with the main graph; seven, outputting the complete routing.

[0065] This step S102 provides a specific method for obtaining the main graph routing and dotting the main graph routing in real-time concatenation. In this method, the steps of obtaining the main graph routing include: querying the channel bearing relationship in the graph database based on the ID (identifier) of the top-level channel of the OTN network, so as to obtain the first channel set involved in expanding the top-level channel to the main graph level; querying the channel routing based on this first channel set to obtain the main graph routing data, and transmitting the primary and backup information of the upper-level channel to the lower-level channel. This design can efficiently aggregate multi-level channels and greatly improve the query efficiency.

[0066] The steps of dotting the main graph routing include: searching for the main signal flow and the minimum path coverage according to the main graph routing data; then arranging the node coordinates based on the mainstream signal direction, and selecting the coordinates of the key intersection points based on the minimum path coverage set; finally, arranging the signal flow for the ports to determine the node coordinates of each port and generate the main graph routing topology. The main graph routing topology is shown in Figure 4 As shown. This design determines the preliminary node coordinates based on the mainstream signal direction, can minimize path crossing, balance node density, and at the same time, through fine-tuning of the minimum path coverage, optimize the position of the key hubs to reduce the global hop count and resource consumption.

[0067] In this embodiment, a channel refers to a service line, which is a path for transmitting information.

[0068] The channel routing generally refers to the single-layer routing of a certain layer of channels, which is composed of multiple routing segments and is the specific route through which information is transmitted.

[0069] The channel levels include:

[0070] Customer information layer: Carries actual user services, such as Ethernet, IP, etc.

[0071] Virtual container (VC) layer: Includes VC-12, VC-3, VC-4, etc., which are used to adapt and multiplex customer signals.

[0072] Optical channel data unit (ODUk): Such as ODUk (k = 0, 1, 2, 3, 4), which is used to encapsulate and process service signals of different rates and formats, and provides functions such as multiplexing, cross-connection, and protection.

[0073] Regenerator section (RS): Responsible for regenerating and amplifying optical signals between two regenerators.

[0074] Multiplex section (MS): Used to process related functions after multiple channels are multiplexed together, such as monitoring and maintenance. Optical channel layer (OCH): Directly carries customer service signals and is a transparent transmission channel in the optical network.

[0075] Optical multiplex section layer (OMS): Responsible for multiplexing and transmitting multiple optical channels.

[0076] Optical transmission section layer (OTS): Mainly processes the transmission of optical signals on physical media (such as optical fibers).

[0077] Step S103: Extract the sub-channel identifiers carrying the subnetwork links from the main graph routing data, and group the sub-channels according to the network elements to form multiple sub-graphs.

[0078] This step S103 provides a specific method for constructing the input parameters of the sub-graph in real-time concatenation. This method extracts the sub-channel IDs carrying the SNL segments (Subnetwork Link) from the main graph routing, and forms multiple sub-graphs by grouping according to the network elements. For multiple SNLs between the same network elements, judge whether there are overlapping parts in their routing elements (such as ports, routing segments, etc.). If the overlapping ratio exceeds the set threshold and there are too many identical elements, then the sub-graphs expanded by these SNLs are basically the same and there are many repeated displays. In this case, these SNLs are expanded together to form a sub-graph; if the overlapping degree is low, they are expanded separately. This design can reduce the operation and maintenance complexity, enabling the solution to not only scale to handle high-overlap tasks but also meet differentiated needs in a refined manner, achieving the best balance between efficiency and flexibility.

[0079] Exemplarily, this embodiment also provides the specific process for constructing the sub-graph expansion parameters:

[0080] According to the coordinate rule, the SNL with smaller abscissa and ordinate is preferentially expanded, that is, starting from the upper left corner. Among them, SNL1 and SNL2 are in the same network element. By judging the overlapping degree between the two routes, it is determined that SNL1 and SNL2 are expanded together, and SNL3 is expanded separately.

[0081] The first subgraph to be expanded is as Figure 4 shown. From this, we can obtain the following information:

[0082] 1) Determine that the channel ID set is SNL1 and SNL2.

[0083] 2) Identify the vertex groups as 2→3 and 8→9.

[0084] 3) Record the rectangular range before expansion. The coordinates of its upper left corner are (x1 = 1, y1 = 0), and the coordinates of the lower right corner are (x2 = 2, y2 = 1). From this, the length can be obtained as 1 and the height as 1. This rectangular range is used for subsequent calculations of the position of the subgraph in the main graph and the relocation of related points.

[0085] Step S104: Query the subgraph route based on the sub-channel, obtain the subgraph route data, and generate a subgraph route topology diagram by dotting the subgraph route.

[0086] This step S104 provides a specific method for obtaining the subgraph route and dotting the subgraph route in real-time concatenation. This method includes:

[0087] 1) According to the subgraph input parameters, obtain the subgraph route in a concurrent manner. The obtained route range is from the subgraph channel to the second channel set involved in the end-to-end route level.

[0088] 2) Further query the channel route based on this second channel set to obtain the subgraph route data, and transfer the primary and backup information of the upper-level channel to the lower-level channel.

[0089] 3) Construct the graph data according to the subgraph route data.

[0090] 4) Search for the main signal flow and the minimum path coverage, arrange the signal flow for the ports, and thus determine the coordinates of each port. The route topology diagram of the subgraph is referenced Figure 5 as shown.

[0091] Step S105: Merge the subgraph route topology diagram into the main graph route topology diagram to obtain the complete route topology diagram of the OTN network.

[0092] This step S105 provides a specific method for real-time concatenating and merging the sub-graph routing topology diagram (hereinafter referred to as the sub-graph) into the main-graph routing topology diagram (hereinafter referred to as the main-graph). In this method, after the sub-graph calculation is completed, the size range of the sub-graph can be determined. Based on the connection points between the main-graph and the sub-graph, the position and occupied range of the sub-graph before the main-graph is expanded are clarified. By calculating the size range of the sub-graph and subtracting its size range in the main-graph, the change amount that needs to be vacated by the nearby points when the sub-graph is embedded in the main-graph is obtained. Accordingly, the coordinates of the relevant points are adjusted, and the sub-graph data is added to the main-graph to complete the merging operation of the sub-graph and the main-graph. Repeat this process until all sub-graphs are merged into the main-graph to obtain a complete routing topology diagram.

[0093] Exemplarily, this embodiment also provides the specific process of merging the sub-graph into the main-graph (the main-graph is referred to Figure 4 as shown, and the sub-graph is referred to Figure 5 as shown):

[0094] I. Calculate the length and width of the sub-graph

[0095] Traverse all ports of the sub-graph. If the x coordinate of the port is greater than the currently recorded length value, update the length; if the y coordinate of the port is greater than the currently recorded height value, update the height. After calculation, the length is 4 and the height is 5.

[0096] II. Merge the connection points of the main-graph and the sub-graph

[0097] 1) According to the input parameters of the sub-graph, change the relevant ports and network element instance IDs of the sub-graph to the corresponding IDs of the main-graph.

[0098] 2) Taking the sub-graph as the standard, remove the connection point ports of the main-graph.

[0099] 3) Since the rectangular range before expansion has the upper left corner coordinates (x1 = 1, y1 = 0) and the lower right corner coordinates (x2 = 2, y2 = 1), add the x1 value of the upper left corner coordinate to the abscissa of all points in the sub-graph, and add the y1 value of the upper left corner coordinate to the ordinate, so as to determine the relative position of the sub-graph in the main-graph.

[0100] III. Move the ports of the main-graph

[0101] 1) Obtain the range change: The original length of the sub-graph is 1 and the height is 1. After calculation, the changed length is 5 and the height is 4. So the change range is that the length increases by 4 and the height increases by 3.

[0102] 2) Move the ordinate: Since the rectangular range before expansion has the upper left corner coordinates (x1 = 1, y1 = 0) and the lower right corner coordinates (x2 = 2, y2 = 1), all points with an ordinate greater than 2 need to be moved down by 3 positions.

[0103] 3) Horizontal coordinate shifting: Since the rectangular range before expansion has its upper left corner coordinates as (x1 = 1, y1 = 0) and the lower right corner coordinates as (x2 = 2, y2 = 1), for points with abscissa greater than or equal to 2 and having a relationship with a specific point, they need to be shifted 4 positions to the right. The method for determining whether there is a relationship between points is to generate a multi - fork tree graph with the sink - end port of the sub - graph as the starting point, record the starting point and the paths from other points to the starting point. If the x of point b minus the x of point a is less than or equal to the weight length of the minimum path, it means there is a relationship between the two, and point b needs to be shifted.

[0104] IV. Merging Sub - graphs into the Main Graph

[0105] 1) Add the points and lines of the sub - graph to the main graph.

[0106] 2) Duplicate point removal: Remove duplicate points based on the port ID.

[0107] The effect of merging SNL1 and SNL2 into the main graph is as Figure 6 shown.

[0108] In this embodiment, the method for outputting a complete route includes: post - processing the merged points and lines, for example, assigning styles to topologies, crossovers, cascade crossovers, Ethernet bindings, VP port bindings, MSP\OLP port protection groups, etc.

[0109] The end - to - end route real - time concatenation and display method based on OTN hierarchical routing provided in this embodiment combines the fast query relationship characteristics of the graph database, splits the end - to - end route into two levels of the main graph and sub - graphs for concatenation, concurrently processes the sub - graph data, and finally aggregates it onto the main graph. The idea of splitting large tasks into small tasks and changing serial execution to parallel execution is applied to end - to - end concatenation.

[0110] The end - to - end route real - time concatenation and display method based on OTN hierarchical routing provided in this embodiment has easy - to - maintain routing data. There is no need to change data on a large scale. As long as the local hierarchical data is well - maintained, the hierarchical routing data can be updated in real - time. Moreover, according to the dynamic changes of the hierarchical routing data, real - time concatenation is performed, and the routing freshness is high. By adopting the two major characteristics of graph database concatenation and sub - graph concurrent processing, the efficiency of real - time concatenation is high, and users can't perceive the delay.

[0111] In order to be able to achieve end - to - end visualization of routing data and be able to expand at any level to construct end - to - end routes in real - time, this application provides an embodiment of an end - to - end route real - time concatenation and display device based on OTN hierarchical routing for implementing all or part of the content of the above - mentioned end - to - end route real - time concatenation and display method based on OTN hierarchical routing. See Figure 7 The end - to - end route real - time concatenation and display device based on OTN hierarchical routing specifically includes the following content:

[0112] A data transfer and storage module 10 is used to synchronize port data and channel data in the OTN network to the graph database according to node types, establish the connection relationship between ports and the bearer relationship between channels;

[0113] A main graph generation module 20 is used to query the main graph route based on the top-level channels of the OTN network, obtain the main graph route data, and generate a main graph route topology map by dotting the main graph route;

[0114] A sub-graph splitting module 30 is used to extract the sub-channel identifiers carrying the subnet links from the main graph route data, and group the sub-channels according to network elements to form multiple sub-graphs;

[0115] A sub-graph generation module 40 is used to query the sub-graph route based on the sub-channels, obtain the sub-graph route data, and generate a sub-graph route topology map by dotting the sub-graph route;

[0116] A data merging module 50 is used to merge the sub-graph route topology map into the main graph route topology map to obtain the complete route topology map of the OTN network.

[0117] As can be seen from the above description, the end-to-end route real-time concatenation and display device based on OTN hierarchical routing provided by the embodiments of the present application stores data based on a graph database, and has higher efficiency compared to drilling and querying data from a relational database. Moreover, the device splits the end-to-end route into two levels of main graph and sub-graph for concatenation, and processes the sub-graph data concurrently, and finally aggregates it onto the main graph. This method decomposes the original problem into a series of interrelated sub-problems through the idea of dynamic programming. These sub-problems are smaller in scale, faster in calculation speed, and the sub-problems at the same level can be calculated in parallel, improving the data processing efficiency. Based on the above two points, this data storage method can greatly shorten the end-to-end route concatenation time-consuming, making real-time calculation possible.

[0118] From the hardware level, in order to be able to realize the end-to-end visualization of route data and be able to expand according to any level to construct the end-to-end route in real time, the embodiments of the present application provide an electronic device for implementing all or part of the content in the end-to-end route real-time concatenation and display method based on OTN hierarchical routing. The electronic device specifically includes the following content:

[0119] A processor, a memory, a communications interface, and a bus; wherein, the processor, the memory, and the communications interface complete communication with each other through the bus; the communications interface is used to implement information transmission between the end-to-end routing real-time concatenation and display device based on OTN hierarchical routing and related devices such as a core business system, a user terminal, and a related database; the logic controller may be a desktop computer, a tablet computer, a mobile terminal, etc., and this embodiment is not limited thereto. In this embodiment, the logic controller may be implemented with reference to the embodiments of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing and the embodiments of the end-to-end routing real-time concatenation and display device based on OTN hierarchical routing, the content of which is incorporated herein by reference, and the repeated parts will not be elaborated.

[0120] It can be understood that the user terminal may include a smart phone, a tablet electronic device, a network set-top box, a portable computer, a desktop computer, a personal digital assistant (PDA), a vehicle-mounted device, a smart wearable device, etc. Among them, the smart wearable device may include smart glasses, a smart watch, a smart bracelet, etc.

[0121] In practical applications, part of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing may be executed on the electronic device side as described above, or all operations may be completed in the client device. Specifically, it can be selected according to the processing capacity of the client device and the limitations of the user usage scenario, etc. This application does not make any limitations in this regard. If all operations are completed in the client device, the client device may further include a processor.

[0122] The above-mentioned client device may have a communication module (i.e., a communication unit), and may be communicatively connected to a remote server to implement data transmission with the server. The server may include a server on the task scheduling center side, and may also include a server on an intermediate platform in other implementation scenarios, such as a server on a third-party server platform communicatively linked to the task scheduling center server. The server may include a single computer device, or may include a server cluster composed of multiple servers, or a server structure of a distributed device.

[0123] Figure 8 This is a schematic block diagram of the system composition of the electronic device 9600 according to an embodiment of the present application. As Figure 8 shown, the electronic device 9600 may include a central processing unit 9100 and a memory 9140; the memory 9140 is coupled to the central processing unit 9100. It should be noted that this Figure 8is exemplary; other types of structures can also be used to supplement or replace this structure to implement telecommunication functions or other functions.

[0124] In one embodiment, the function of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing can be integrated into the central processor 9100. Among them, the central processor 9100 can be configured to perform the following controls:

[0125] Step S101: Synchronize the port data and channel data in the OTN network to the graph database according to the node type, and establish the connection relationship between ports and the bearing relationship between channels;

[0126] Step S102: Query the main graph route based on the top-level channel of the OTN network to obtain the main graph route data, and generate the main graph route topology map by dotting the main graph route;

[0127] Step S103: Extract the sub-channel identifiers carrying the subnet links from the main graph route data, and group the sub-channels according to the network elements to form multiple sub-graphs;

[0128] Step S104: Query the sub-graph route based on the sub-channel to obtain the sub-graph route data, and generate the sub-graph route topology map by dotting the sub-graph route;

[0129] Step S105: Merge the sub-graph route topology map into the main graph route topology map to obtain the complete route topology map of the OTN network.

[0130] As can be seen from the above description, the electronic device provided in the embodiment of the present application stores data based on the graph database, and has higher efficiency compared to drilling and querying data from a relational database. Moreover, the electronic device splits the end-to-end route into two levels of the main graph and the sub-graph for concatenation, and processes the sub-graph data concurrently, and finally aggregates it onto the main graph. This method decomposes the original problem into a series of interrelated sub-problems through the idea of dynamic programming. These sub-problems are smaller in scale, faster in calculation speed, and the sub-problems at the same level can be calculated in parallel, improving the data processing efficiency. Based on the above two points, this data storage method can significantly shorten the end-to-end route concatenation time, making real-time calculation possible.

[0131] In another embodiment, the end-to-end routing real-time concatenation and display device based on OTN hierarchical routing can be separately configured from the central processor 9100. For example, the end-to-end routing real-time concatenation and display device based on OTN hierarchical routing can be configured as a chip connected to the central processor 9100, and the function of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing is realized through the control of the central processor.

[0132] Such asFigure 8 As shown, the electronic device 9600 may further include: a communication module 9110, an input unit 9120, an audio processor 9130, a display 9160, and a power supply 9170. It should be noted that the electronic device 9600 does not necessarily have to include Figure 8 all the components shown in; in addition, the electronic device 9600 may further include Figure 8 components not shown in, and reference may be made to the prior art.

[0133] As Figure 8 shown, the central processing unit 9100, sometimes also referred to as a controller or operation control, may include a microprocessor or other processor device and / or logic device. The central processing unit 9100 receives inputs and controls the operation of the various components of the electronic device 9600.

[0134] Among them, the memory 9140 may be, for example, one or more of a buffer, a flash memory, a hard drive, a removable medium, a volatile memory, a non-volatile memory, or other suitable devices. The above information related to failures can be stored, and in addition, programs for executing relevant information can also be stored. And the central processing unit 9100 can execute the program stored in the memory 9140 to implement information storage or processing, etc.

[0135] The input unit 9120 provides inputs to the central processing unit 9100. The input unit 9120 is, for example, a key or a touch input device. The power supply 9170 is used to supply power to the electronic device 9600. The display 9160 is used to display display objects such as images and texts. The display may be, for example, an LCD display, but is not limited thereto.

[0136] The memory 9140 may be a solid-state memory. For example, it may be a read-only memory (ROM), a random access memory (RAM), a SIM card, etc. It may also be a memory that stores information even when powered off, can be selectively erased and has more data. Examples of such a memory are sometimes referred to as EPROMs, etc. The memory 9140 may also be some other type of device. The memory 9140 includes a buffer memory 9141 (sometimes referred to as a buffer). The memory 9140 may include an application / function storage unit 9142, and the application / function storage unit 9142 is used to store application programs and function programs or the processes for operating the electronic device 9600 through the central processing unit 9100.

[0137] The memory 9140 may further include a data storage unit 9143 for storing data such as contacts, digital data, pictures, sounds, and / or any other data used by the electronic device. The driver storage unit 9144 of the memory 9140 may include various drivers of the electronic device for communication functions and / or for performing other functions of the electronic device (such as a messaging application, an address book application, etc.).

[0138] The communication module 9110 is a transmitter / receiver that transmits and receives signals via the antenna 9111. The communication module 9110 (transmitter / receiver) is coupled to the central processor 9100 to provide input signals and receive output signals, which may be the same as in the case of a conventional mobile communication terminal.

[0139] Based on different communication technologies, multiple communication modules 9110 may be provided in the same electronic device, such as a cellular network module, a Bluetooth module, and / or a wireless local area network module, etc. The communication module 9110 (transmitter / receiver) is also coupled to the speaker 9131 and the microphone 9132 via the audio processor 9130 to provide an audio output via the speaker 9131 and receive an audio input from the microphone 9132, thereby implementing normal telecommunication functions. The audio processor 9130 may include any suitable buffers, decoders, amplifiers, etc. In addition, the audio processor 9130 is also coupled to the central processor 9100, so that recording can be performed on the local machine through the microphone 9132, and the sound stored on the local machine can be played through the speaker 9131.

[0140] Embodiments of the present application also provide a computer-readable storage medium capable of implementing all steps of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing in which the execution subject in the above embodiments is a server or a client. A computer program is stored on the computer-readable storage medium. When the computer program is executed by a processor, all steps of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing in which the execution subject in the above embodiments is a server or a client are implemented. For example, when the processor executes the computer program, the following steps are implemented:

[0141] Step S101: Synchronize port data and channel data in the OTN network to the graph database according to node types, and establish a connection relationship between ports and a bearing relationship between channels;

[0142] Step S102: Query the main graph route based on the top-level channel of the OTN network to obtain main graph route data, and generate a main graph route topology map by dotting the main graph route;

[0143] Step S103: Extract the sub-channel identifiers carrying the subnet links from the main graph routing data, and group the sub-channels according to the network elements to form multiple sub-graphs;

[0144] Step S104: Query the sub-graph routing based on the sub-channels to obtain the sub-graph routing data, and generate a sub-graph routing topology map by marking the sub-graph routing;

[0145] Step S105: Merge the sub-graph routing topology map into the main graph routing topology map to obtain the complete routing topology map of the OTN network.

[0146] As can be seen from the above description, the computer-readable storage medium provided by the embodiments of the present application stores data based on a graph database, which is more efficient than drilling and querying data from a relational database. Moreover, this method splits the end-to-end routing into two levels of the main graph and the sub-graph for concatenation, and processes the sub-graph data concurrently, and finally aggregates to the main graph. The computer-readable storage medium decomposes the original problem into a series of interrelated sub-problems through the idea of dynamic programming. These sub-problems are smaller in scale and faster in calculation speed, and the sub-problems at the same level can be calculated in parallel, improving the data processing efficiency. Based on the above two points, this data storage method can significantly shorten the end-to-end routing concatenation time, making real-time calculation possible.

[0147] The embodiments of the present application also provide a computer program product that can implement all the steps in the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing with the execution subject being a server or a client in the above embodiments. When the computer program / instructions are executed by a processor, they implement the steps of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing. For example, the computer program / instructions implement the following steps:

[0148] Step S101: Synchronize the port data and channel data in the OTN network to the graph database in node type, and establish the connection relationship between ports and the bearing relationship between channels;

[0149] Step S102: Query the main graph routing based on the top-level channels of the OTN network to obtain the main graph routing data, and generate a main graph routing topology map by marking the main graph routing;

[0150] Step S103: Extract the sub-channel identifiers carrying the subnet links from the main graph routing data, and group the sub-channels according to the network elements to form multiple sub-graphs;

[0151] Step S104: Query the sub-graph routing based on the sub-channels to obtain the sub-graph routing data, and generate a sub-graph routing topology map by marking the sub-graph routing;

[0152] Step S105: Merge the sub-graph routing topology into the main-graph routing topology to obtain the complete routing topology of the OTN network.

[0153] As can be seen from the above description, the computer program product provided by the embodiments of the present application accesses data based on a graph database, and has higher efficiency compared to drilling and querying data from a relational database. Moreover, this method splits the end-to-end routing into two levels, the main graph and the sub-graph, for cascading, and concurrently processes the sub-graph data, and finally aggregates it onto the main graph. This computer program product decomposes the original problem into a series of interrelated sub-problems through the idea of dynamic programming. These sub-problems are smaller in scale, faster in calculation speed, and the sub-problems at the same level can be calculated in parallel, improving the data processing efficiency. Based on the above two points, this data storage method can significantly shorten the end-to-end routing cascading time, making real-time calculation possible.

[0154] Those skilled in the art should understand that the embodiments of the present invention can be provided as methods, devices, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present invention can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0155] The present invention is described with reference to the flowcharts and / or block diagrams of methods, devices (apparatus), and computer program products according to the embodiments of the present invention. It should be understood that each process and / or block in the flowcharts and / or block diagrams, and the combination of processes and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, such that the instructions executed by the processor of the computer or other programmable data processing devices generate a device for implementing the specified functions in Figure 1 one process or multiple processes and / or blocks Figure 1 one block or multiple blocks.

[0156] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, such that the instructions stored in the computer-readable memory generate a manufactured article including an instruction device that implements the specified functions in Figure 1 one process or multiple processes and / or blocks Figure 1 one block or multiple blocks.

[0157] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus, so that a series of operation steps are executed on the computer or other programmable apparatus to produce a computer-implemented process, thereby the instructions executed on the computer or other programmable apparatus provide steps for realizing the functions specified in one process or a plurality of processes and / or blocks. Figure 1 one process or a plurality of processes and / or blocks Figure 1 steps for realizing the functions specified in one block or a plurality of blocks.

[0158] In the present invention, specific embodiments are used to illustrate the principles and implementation manners of the present invention. The description of the above embodiments is only used to help understand the method and its core idea of the present invention. At the same time, for those of ordinary skill in the art, according to the idea of the present invention, there will be changes in the specific implementation manners and application scopes. In summary, the content of this specification should not be construed as a limitation to the present invention.

Claims

1. An end-to-end routing real-time concatenation and display method based on OTN hierarchical routing, characterized in that, The method includes: Synchronizing port data and channel data in the OTN network to the graph database according to node types, establishing the connection relationship between ports and the bearer relationship between channels; Querying the main graph route based on the top-level channels of the OTN network to obtain main graph route data, and generating a main graph route topology map by dotting the main graph route; Extracting the sub-channel identifiers carrying the subnet links from the main graph route data, and grouping the sub-channels according to network elements to form multiple sub-graphs; Querying the sub-graph route based on the sub-channels to obtain sub-graph route data, and generating a sub-graph route topology map by dotting the sub-graph route; Merging the sub-graph route topology map into the main graph route topology map to obtain the complete route topology map of the OTN network.

2. The end-to-end routing real-time concatenation and display method based on OTN hierarchical routing according to claim 1, characterized in that, The step of establishing the connection relationship between ports and the bearer relationship between channels includes: Establishing a directed connection relationship between ports according to the hierarchical routing data of the OTN network, assigning the attributes of the hierarchical routing data to the connection relationship, and incrementally synchronizing it to the graph database in terms of relationship type; Establishing a directed bearer relationship between channels according to the hierarchical routing data of the OTN network, and incrementally synchronizing it to the graph database in terms of relationship type.

3. The end-to-end routing real-time concatenation and display method based on OTN hierarchical routing according to claim 1, wherein The step of querying the main graph route based on the top-level channels of the OTN network to obtain main graph route data includes: Querying the channel bearer relationship in the graph database based on the identifiers of the top-level channels of the OTN network to obtain the first channel set involved in expanding the top-level channels to the main layer level; querying the channel route based on the first channel set to obtain the main graph route data.

4. The end-to-end routing real-time concatenation and display method based on OTN hierarchical routing according to claim 1, characterized in that The step of generating a main graph route topology map by dotting the main graph route includes: Searching for the main signal flow and the minimum path coverage according to the main graph route data; laying out the node coordinates based on the main signal flow direction, and selecting the coordinates of the key intersection points based on the minimum path coverage set; arranging the signal flow for the ports to determine the node coordinates of each port, and generating the main graph route topology map.

5. The end-to-end routing real-time concatenation and display method based on OTN hierarchical routing according to claim 1, characterized in that, The step of grouping the sub-channels according to network elements to form multiple sub-graphs includes: For multiple subnet links between the same network elements, judging whether there is an overlapping part. If the overlapping ratio exceeds the set threshold, expand them together to form a sub-graph; if the overlapping ratio does not exceed the set threshold, expand them separately.

6. The end-to-end routing real-time concatenation and display method based on OTN hierarchical routing according to claim 1, characterized in that The step of querying the sub-graph route based on the sub-channels to obtain sub-graph route data includes: Adopting a concurrent method to expand from each sub-graph channel to the second channel set involved in the end-to-end routing level, and querying the channel route based on the second channel set to obtain the sub-graph route data.

7. The end-to-end routing real-time concatenation and display method based on OTN hierarchical routing according to claim 1, characterized in that The step of merging the sub-graph route topology map into the main graph route topology map to obtain the complete route topology map of the OTN network includes: Based on the connection points between the main graph route topology map and the sub-graph route topology map, clarifying the position and occupied range of the sub-graph route topology map before the main graph route topology map is expanded; By calculating the size range of the sub-graph routing topology graph and subtracting its size range in the main-graph routing topology graph, the variation amount that nearby points need to be adjusted when the sub-graph routing topology graph is embedded in the main-graph routing topology graph is obtained; According to the calculated variation amount, the coordinates of relevant points are adjusted, and the sub-graph routing topology graph data is added to the main-graph routing topology graph to complete the merging operation of the sub-graph routing topology graph and the main-graph routing topology graph; Repeat this process until all the sub-graph routing topology graphs are merged into the main-graph routing topology graph to obtain the complete routing topology graph.

8. An end-to-end routing real-time concatenation and display device based on OTN hierarchical routing, characterized in that, The device includes: A data transfer and storage module, configured to synchronize port data and channel data in the OTN network to the graph database in node type, establish the connection relationship between ports and the bearing relationship between channels; A main-graph generation module, configured to query the main-graph routing based on the top-level channels of the OTN network to obtain main-graph routing data, and generate a main-graph routing topology graph by dotting the main-graph routing; A sub-graph splitting module, configured to extract the sub-channel identifiers carrying the sub-network links from the main-graph routing data and group the sub-channels according to the network elements to form multiple sub-graphs; A sub-graph generation module, configured to query the sub-graph routing based on the sub-channels to obtain sub-graph routing data, and generate a sub-graph routing topology graph by dotting the sub-graph routing; A data merging module, configured to merge the sub-graph routing topology graph into the main-graph routing topology graph to obtain the complete routing topology graph of the OTN network.

9. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the steps of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing according to any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the steps of the end-to-end routing real-time concatenation and display method based on OTN hierarchical routing according to any one of claims 1 to 7.

Images