Dynamic service routing topology restoration method and device, electronic equipment and medium

Abstract

The application discloses a dynamic service routing topology restoration method and device, electronic equipment and medium, which can be applied to the technical field of service processing. After the first original service routing table is processed to obtain a second original service routing table, a series connection path is calculated according to the second original service routing table to obtain an output result table, and according to the obtained current query network virtualization instance name, current query starting service network segment information and current query target service network segment information, data query is performed in the output result table to obtain topology connection data, and then the topology connection data is sent to the front end, so that the front end performs service routing topology rendering according to the topology connection data, thereby the full end-to-end service routing topology of the VPN service can be provided, and then the fault point can be quickly located and the service recovery can be assisted, and the fault disposal efficiency and the service recovery efficiency are effectively improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of business processing, and particularly relates to a dynamic business routing topology restoration method and device, electronic equipment and medium. BACKGROUND

[0002] In the related art, the services of the existing network are basically carried on VPNs. Since the MPLS VPN technology uses tunnel technology to transmit data packets, the data packets are encapsulated when entering the tunnel and are decapsulated at the other end of the tunnel, so that the user or administrator in the MPLS VPN cannot directly see or track the exact path of the data packets in the network. In order to view or track the position of the data packets in the network, a routing topology restoration method can be used for restoration. At present, the ping-trace mode is combined with network equipment maintenance data for manual restoration. The cross-professional fault of a communication operator often involves many network element devices, and the routing data is large in magnitude. In addition, the network architecture is complex due to the cloud of IT, which leads to time-consuming and laborious business routing topology restoration, and further affects the fault handling efficiency and the service recovery efficiency.

[0003] To sum up, the technical problems in the related art need to be improved. SUMMARY

[0004] The main purpose of the embodiments of the present application is to provide a dynamic business routing topology restoration method and device, electronic equipment and medium, which can effectively improve the fault handling efficiency and the service recovery efficiency.

[0005] To achieve the above purpose, one aspect of the embodiments of the present application provides a dynamic business routing topology restoration method, which comprises the following steps:

[0006] processing the first original business routing table to obtain a second original business routing table, wherein the first original business routing table comprises a first global routing table of a managed routing network device, a first network virtualization routing table and a first port configuration table, and the second original business routing table comprises a second global routing table of the managed network device, a second network virtualization routing table and a second port configuration table;

[0007] performing concatenated path calculation according to the second original business routing table to obtain an output result table, wherein the output result table comprises a first result table, a second result table and a third result table;

[0008] obtaining a current query network virtualization instance name, current query starting service network segment information and current query target service network segment information;

[0009] According to the current query network virtualization instance name, the current query starting service network segment information and the current query target service network segment information, data is queried in the output result table to obtain topology connection data;

[0010] The topology connection data is sent to a front end to enable the front end to perform service routing topology rendering according to the topology connection data.

[0011] In some embodiments, the processing of the first original service routing table to obtain a second original service routing table comprises:

[0012] Data in the first original service routing table is collected by an offline file import method to obtain a first data set;

[0013] Data in the first data set is parsed to obtain a data parsing result;

[0014] The data parsing result is subjected to a preset rule to obtain the second original service routing table.

[0015] In some embodiments, the processing of the first original service routing table to obtain a second original service routing table comprises:

[0016] Data in the first original service routing table is collected in real time to obtain a first data set;

[0017] Data in the first data set is parsed to obtain a data parsing result;

[0018] The data parsing result is subjected to a preset rule to obtain the second original service routing table.

[0019] In some embodiments, the processing of the first original service routing table to obtain a second original service routing table comprises:

[0020] Data in the second network virtualization routing table is filtered to obtain a to-be-connected path set;

[0021] Initial state data is obtained;

[0022] Data in the second network virtualization routing table is subjected to a deduplication process according to the initial state data;

[0023] Data in the second network virtualization routing table after the deduplication process is associated with data in the first port configuration table to obtain the second result table;

[0024] According to the second network virtualization routing table, the first global routing table and the second port configuration table, the paths in the set of paths to be concatenated are iteratively processed to obtain the first result table and the third result table.

[0025] In some embodiments, the iteratively processing the paths in the set of paths to be concatenated according to the second network virtualization routing table, the first global routing table and the second port configuration table to obtain the first result table and the third result table comprises:

[0026] When the first output data of the set of paths to be concatenated is the initial state data, the first output data is updated according to the second network virtualization routing table to obtain second output data;

[0027] When the first output data of the set of paths to be concatenated is not the initial state data, a next hop interconnection protocol is searched from a first preset field associated with the first global routing table according to the first output data;

[0028] When the next hop interconnection protocol is searched, a new device node is determined from a second preset field associated with the second port configuration table according to the interconnection protocol; and a new edge is searched in the set of paths to be concatenated according to the new device node to obtain a new edge set;

[0029] When the next hop interconnection protocol is not searched, the first result table and the third result table are generated.

[0030] In some embodiments, the filtering the data in the second network virtualization routing table to obtain the set of paths to be concatenated comprises:

[0031] A target field in the second network virtualization routing table is obtained;

[0032] When the target field is a non-empty field, a row data corresponding to the target field in the second network virtualization routing table is obtained to form the set of paths to be concatenated.

[0033] In some embodiments, the querying the output result table according to the current query network virtualization instance name, the current query starting service network segment information and the current query target service network segment information to obtain the topology connection data comprises:

[0034] An origin device protocol is obtained in the second result table according to the current query network virtualization instance name and the current query starting service network segment information;

[0035] An optional target service network segment list is obtained in the third result table according to the current query network virtualization instance name and the origin device protocol.

[0036] According to the current query network virtualization instance name, the current query target service network segment information and the optional target service network segment list, data is queried in the first result table to obtain the topology connection data.

[0037] To achieve the above object, another aspect of the embodiment of the present application provides a dynamic service routing topology restoration device, which comprises:

[0038] A first module is configured to process a first original service routing table to obtain a second original service routing table, wherein the first original service routing table comprises a first global routing table of a managed routing network device, a first network virtualization routing table and a first port configuration table, and the second original service routing table comprises a second global routing table of a managed network device, a second network virtualization routing table and a second port configuration table.

[0039] A second module is configured to perform serial path calculation according to the second original service routing table to obtain an output result table, wherein the output result table comprises a first result table, a second result table and a third result table.

[0040] A third module is configured to obtain a current query network virtualization instance name, current query starting service network segment information and current query target service network segment information.

[0041] A fourth module is configured to query data in the output result table according to the current query network virtualization instance name, the current query starting service network segment information and the current query target service network segment information to obtain topology connection data.

[0042] A fifth module is configured to send the topology connection data to a front end to enable the front end to perform service routing topology rendering according to the topology connection data.

[0043] To achieve the above object, another aspect of the embodiment of the present application provides an electronic device, which comprises:

[0044] at least one processor;

[0045] at least one memory configured to store at least one program;

[0046] When the at least one program is executed by the at least one processor, the at least one processor implements the above method.

[0047] To achieve the above object, another aspect of the embodiment of the present application provides a computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to implement the above method.

[0048] The embodiments of the present application at least have the following beneficial effects: the present application provides a dynamic service routing topology restoration method and device, electronic equipment and medium, after the first original service routing table is processed to obtain the second original service routing table, the output result table is obtained by performing serial path calculation according to the second original service routing table, after the current query network virtualization instance name, the current query starting service network segment information and the current query target service network segment information are obtained, the topology connection data is obtained by querying the output result table according to the current query network virtualization instance name, the current query starting service network segment information and the current query target service network segment information, and then the topology connection data is sent to the front end, so that the front end performs service routing topology rendering according to the topology connection data, so that the full end-to-end service routing topology of the VPN service can be provided, and then the fault point can be quickly located and the service recovery can be assisted, and the fault handling efficiency and the service recovery efficiency can be effectively improved. BRIEF DESCRIPTION OF DRAWINGS

[0049] Figure 1 is a flowchart of the dynamic service routing topology restoration method provided by the embodiments of the present application;

[0050] Figure 2 is a schematic diagram of the second port configuration table provided by the embodiments of the present application;

[0051] Figure 3 is a schematic diagram of the second global routing table provided by the embodiments of the present application;

[0052] Figure 4 is a schematic diagram of the second network virtualization routing table provided by the embodiments of the present application;

[0053] Figure 5 is a schematic diagram of the first result table provided by the embodiments of the present application;

[0054] Figure 6 is a schematic diagram of the first result table provided by the embodiments of the present application; Figure 5 is an extension schematic diagram of the first result table shown in the figure;

[0055] Figure 7 is a schematic diagram of the second result table provided by the embodiments of the present application;

[0056] Figure 8 is a schematic diagram of the second result table provided by the embodiments of the present application;

[0057] Figure 9 is a structural schematic diagram of the dynamic service routing topology restoration device provided by the embodiments of the present application;

[0058] Figure 10 is a hardware structure schematic diagram of the electronic equipment provided by the embodiments of the present application. DETAILED DESCRIPTION

[0059] In order to make the purposes, technical solutions and advantages of the present application clearer, the present application will be further described in details below in combination with the accompanying drawings and examples. It should be understood that the specific examples described herein merely serve to explain the present application and do not limit the present application. When the following description refers to the accompanying drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary examples do not represent all implementations consistent with embodiments of the present application. They are merely examples of apparatuses and methods consistent with some aspects of embodiments of the present application.

[0060] It can be understood that the terms "first", "second", and the like used in the present application can be used herein to describe various concepts, but unless specifically stated, these concepts are not limited by these terms. These terms are only used to distinguish one concept from another concept. For example, without departing from the scope of embodiments of the present application, the first information can also be referred to as the second information, and similarly, the second information can also be referred to as the first information. Depending on the context, the word "if" as used herein can be interpreted as "when" or "upon" or "in response to determining".

[0061] The terms "at least one", "multiple", "each", "any", and the like used in the present application include one, two or more than two, multiple includes two or more than two, each refers to each of the corresponding plurality, and any refers to any one of the plurality.

[0062] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill 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.

[0063] Before the embodiments of the present application are described in detail, first, some nouns and terms involved in the embodiments of the present application are described, and the nouns and terms involved in the embodiments of the present application are applicable to the following explanations:

[0064] MPLS VPN (Multiprotocol Label Switching Virtual Private Network): MPLS VPN is a technology that uses MPLS technology to create virtual private networks in service providers' networks. It allows different customers to have isolated network environments on shared infrastructure while supporting the transmission of different protocols. MPLS VPN achieves isolation by using VRF (Virtual Routing and Forwarding) technology on PE (Provider Edge) devices, allowing different VPN instances to run on the same device without interfering with each other. MPLS VPN supports various services such as IP VPN and is easy to expand and manage.

[0065] VRF (Virtual Routing and Forwarding): VRF is a network virtualization technology that allows multiple logically independent routing and forwarding instances to be created on a physical router. Each VRF has its own routing table and can make independent routing decisions. VRF allows different customers or services to run on the same physical network without affecting each other, achieving logical isolation of the network. In MPLS VPN, VRF is used to create isolated VPN instances, each of which can have its own routing and forwarding policies.

[0066] Global Routing Table: The global routing table is a database in the router that contains all the routing information of the entire network. This table is used to determine the path of data packets from the source to the destination. The global routing table usually contains various types of routing information, such as direct routes, static routes, and routes learned through various dynamic routing protocols.

[0067] Port Configuration Table: The port configuration table is a data structure on network devices that records the configuration information of each port, such as the port-bound IP, VPN name, next hop, etc. These configuration information is used to ensure that network devices can correctly communicate with connected devices. The port configuration table is crucial for the stability and performance of the network.

[0068] VRF Name and VPN Name: When configuring MPLS VPN, each VRF or VPN instance will have a unique name or identifier. This name is used to distinguish different virtual network instances for easy management and configuration. In actual operation, the VRF name is usually associated with a specific VPN service, allowing network administrators to easily identify and operate specific VPN networks.

[0069] Network management refers to the unified and centralized management and control of various resources in the network. This involves the integrated management of network devices, servers, storage, cloud services and other resources, providing cross-platform integration and orchestration, supporting multi-tenant access, and assisting enterprises in efficient operation and maintenance.

[0070] In the related art, in the cross-professional cloud network fault scenario of a communication operator, common problems include difficult fault location, long troubleshooting time, and high troubleshooting pressure. These problems mainly occur because the current communication network is ITized and cloudized, and involves a large number of network elements and many professionals. The current network services are basically carried on VPNs. Since the MPLS VPN technology uses tunnel technology to transmit data packets, the data packets are encapsulated when entering the tunnel and are decapsulated at the other end of the tunnel, so that the user or administrator in the MPLS VPN cannot directly see or track the exact path of the data packets in the network. In order to view or track the location of the data packets in the network, a route topology restoration method can be used for restoration. Currently, the ping-trace method is used in combination with network device maintenance data for manual restoration, which results in time-consuming and laborious business route topology restoration, thereby affecting the fault handling efficiency and service recovery efficiency.

[0071] Therefore, in the embodiments of the present application, a dynamic business route topology restoration method and device, an electronic device and a medium are provided. After the first original business route table is processed to obtain a second original business route table, the output result table is obtained by performing serial path calculation according to the second original business route table. After obtaining the current query network virtualization instance name, the current query starting business network segment information and the current query target business network segment information, the topology connection data is obtained by querying the output result table according to the current query network virtualization instance name, the current query starting business network segment information and the current query target business network segment information. Then, the topology connection data is sent to the front end, so that the front end performs business route topology rendering according to the topology connection data, thereby providing the full end-to-end business route topology of the VPN service, and assisting in quickly locating the fault point and recovering the service, thereby effectively improving the fault handling efficiency and the service recovery efficiency.

[0072] The dynamic service routing topology restoration method provided by the embodiments of the present application relates to the technical field of service processing. The dynamic service routing topology restoration method provided by the embodiments of the present application can be applied to a terminal, can be applied to a server, and can also be software running in the terminal or the server. In some embodiments, the terminal can be a smart phone, a tablet computer, a notebook computer, a desktop computer, a smart speaker, a smart watch, a vehicle-mounted terminal, and the like, but is not limited thereto. 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 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 server can also be a node server in a blockchain network. The software can be an application that implements the dynamic service routing topology restoration method, and the like, but is not limited to the above forms.

[0073] 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, and the like. The present application can be described in the general context of computer-executable instructions executed by a computer, such as a program module. Generally, program modules include routines, programs, objects, components, data structures, and the like 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.

[0074] Figure 1 is an optional flowchart of the dynamic service routing topology restoration method provided by the embodiments of the present application, Figure 1 The method in the above method can include, but is not limited to, steps S110 to S150:

[0075] Step S110, processing a first original service routing table to obtain a second original service routing table, the first original service routing table including a first global routing table of a managed routing network device, a first network virtualization routing table, and a first port configuration table, and the second original service routing table including a second global routing table of the managed network device, a second network virtualization routing table, and a second port configuration table;

[0076] Step S120, perform concatenation path calculation according to the second original service routing table to obtain an output result table, the output result table including the first result table, the second result table and the third result table;

[0077] Step S130, obtain a current query network virtualization instance name, current query starting service network segment information and current query target service network segment information;

[0078] Step S140, perform data query in the output result table according to the current query network virtualization instance name, the current query starting service network segment information and the current query target service network segment information to obtain topology connection data;

[0079] Step S150, send the topology connection data to the front end to enable the front end to perform service routing topology rendering according to the topology connection data.

[0080] In the embodiment of the present application, the data in the first original service routing table can include but is not limited to service routing data corresponding to all managed network devices across professions in a VPN service scenario, for example, nodes formed by devices and connection relationships between devices. After obtaining the first original service routing table, the embodiment processes the first original service routing table by a preset setting mode to obtain the second original service routing table. The second original service routing table includes but is not limited to Figure 2 a second port configuration table (INTERFACE_CONFIG_TABLE) shown in Figure 3 a second global routing table (GLOBAL_ROUTE_TABLE) shown in Figure 4 and a second network virtualization routing table (VPN_ROUTE_TABLE) shown in Figure 2 , Figure 3 and Figure 4 As can be known from the above, the tables all include but are not limited to data coding (table name or file name), field English name, field Chinese name and field type.

[0081] It can be understood that the embodiment can obtain a first data set by collecting data of the first original service routing table through the offline file import method, and then obtain a data analysis result by analyzing the first data set, and then perform a warehousing operation on the data analysis result according to a preset rule, and then obtain a second original service routing table. Specifically, the embodiment obtains a corresponding second global routing table, a second network virtualization (VRF) routing table and a second port configuration table by collecting, analyzing and warehousing the first global routing table, the first VRF routing table and the first port configuration table in the offline process respectively. For example, when the first global routing table and the first VRF routing table in the offline process are obtained, the second global routing table is obtained by collecting, analyzing and warehousing the first global routing table, and the second VRF routing table is obtained by collecting, analyzing and warehousing the first VRF routing table.

[0082] In other embodiments, the embodiment can also obtain a second original service routing table by collecting data in the first original service routing table to obtain a first data set, analyzing the data set to obtain a data analysis result, and then performing a warehousing operation on the data analysis result according to a preset rule. For example, when any one of the first global routing table, the first VRF routing table and the first port configuration table is changed, the embodiment will trigger the function of data collection, and then the latest data can be collected to improve the timeliness of the data, so that the data in the second global routing table, the second VRF routing table and the second port configuration table after warehousing is closer to the actual situation.

[0083] In the embodiment of the application, after obtaining the second global routing table, the second VRF routing table and the second port configuration table, a concatenated path calculation is performed according to the second global routing table, the second VRF routing table and the second port configuration table to obtain an output result table. The output result table includes but is not limited to Figure 5 and Figure 6 the first result table (vrf_target_link_result) shown in Figure 7 the second result table (all_vrf_direct_and_static) and Figure 8The third result table (vrf_startIP_target_ip_range) is shown. Specifically, each row in the first result table is a connection (the connection represents that there is a mapping relationship between two devices), the data in the second result is used to record the service network segment under each device, the data in the third result table is used to record the mapping relationship of VRF, start IP and target service, and the target service network segment can be selected by the frame. Among them, the data in the first result table can be filtered according to the VPN name (vrf_name), start point (start_device_name or start_device_ip) and service target network segment (target_service_ip_range) to obtain all paths from the start IP to the target service network segment, which can be used for visualizing the topology. A unique (vrf_name, start_device_name or start_device_ip, target service IP network segment) corresponds to a visualized topology.

[0084] It can be understood that the path calculation process of the embodiment includes but is not limited to the following steps:

[0085] Step S210, filtering the data in the second network virtualization routing table to obtain a to-be-chained path set;

[0086] Step S220, obtaining initial state data;

[0087] Step S230, performing deduplication processing on the data in the second network virtualization routing table according to the initial state data;

[0088] Step S240, associating the data in the second network virtualization routing table after deduplication processing with the data in the first port configuration table to obtain a second result table;

[0089] Step S250, performing iteration processing on the paths in the to-be-chained path set according to the second network virtualization routing table, the first global routing table and the second port configuration table to obtain a first result table and a third result table.

[0090] It can be understood that the embodiment can obtain the target field in the second network virtualization routing table (VPN_ROUTE_TABLE), and when the target field is a non-empty field, obtain the row data corresponding to the target field in the second network virtualization routing table to form a to-be-chained path set. Specifically, the target field can be the DESTINATION field. When the DESTINATION field is not empty, obtain the corresponding row data to form the to-be-chained path set. Exemplarily, it is assumed that the VPN field is VPN i , the DEVICE_IP field is the start device S i, the DESTINATION field is the target network segment D i , the NEXTHOP field is the VPN export device OUT i , and the set of paths to be concatenated is The connection relationship of each path P i is represented by G i , and is uniquely identified by (VPN i , S i , G i ), so the set of paths to be concatenated is which can be expressed as the following formula:

[0091]

[0092] Where G i = (V i , E i ), V i is a device node, E i is a connection between devices, and m represents the total number of paths.

[0093] In the embodiments of the present application, after obtaining the set of paths to be concatenated, initial state data is obtained. Specifically, before the set of paths to be concatenated is iteratively processed, the initial state data V i = {S i} is set, and after the data in the second network virtualization routing table (VPN_ROUTE_TABLE) is processed for deduplication according to the initial state data, the data in the second network virtualization routing table after deduplication is associated with the data in the first port configuration table to obtain a second result table (all_vrf_direct_and_static).

[0094] It can be understood that when the set of paths to be concatenated is iteratively processed, the paths in the set of paths to be concatenated can be iteratively processed according to the second network virtualization routing table, the first global routing table and the second port configuration table to obtain the first result table and the third result table. Specifically, when the first output data of the set of paths to be concatenated is the initial state data, the second output data is obtained by updating the first output data according to the second network virtualization routing table; when the first output data of the set of paths to be concatenated is not the initial state data, the interconnection protocol of the next hop is searched from the first preset field associated in the first global routing table according to the first output data; when the interconnection protocol of the next hop is searched, the new device node is determined from the second preset field associated in the second port configuration table according to the interconnection protocol; the new edge set is obtained by searching for a new edge in the set of paths to be concatenated according to the new device node; when the interconnection protocol of the next hop is not searched, the first result table and the third result table are generated.

[0095] Exemplarily, assuming that k(k≥1) iterations are performed on the path, when the first output data of the set of paths to be concatenated is equal to the initial state data (OUT i =S i ), the first output data OUT i is updated according to the associated NEXTHOP field in the second network virtualization routing table (VPN_ROUTE_TABLE); otherwise, the first output data OUT i is not updated. Then, the interconnection protocol (IP) of the next hop is searched from the associated first preset field (NEXTHOP field) in the first global routing table (GLOBAL_ROUTE_TABLE) according to the first output data OUT i , the new device node is determined from the associated second preset field (DEVICE_IP field) in the second port configuration table (INTERFACE_CONFIG_TABLE) through the interconnection IP, and the new edge is searched in the set of paths to be concatenated according to the new device node , thereby obtaining a new edge set. The new edge set can be represented by the following formula:

[0096]

[0097] In the formula, V is the node set of the path P i after the last iteration, is the newly added node set of the path P i after the current iteration, is the newly added edge set of the path P i after the current iteration.

[0098] The topology G i of the path P i in the set of paths to be concatenated can be updated based on the new edge set by the following formula:

[0099] V is the node set of the path P i after the current iteration.

[0100] When the interconnection IP of the next hop is not searched, it indicates that the path in the set of paths to be concatenated and the search completion and the searched end point. Specifically, when is an empty set, it indicates that the path cannot search the node of the next hop; when goes to D iWhen the route of the path is direct, it indicates that the search reaches the end point. Therefore, the path iteration process is stopped. When all paths stop iteration, the first result table (vrf_target_link_result) and the third result table (vrf_startIP_target_ip_range) can be obtained. When there is a path that stops iteration, the value of k is increased by 1, and the iteration process is repeated.

[0101] In the embodiment of the present application, after the output table including the first result table, the second result table and the third result table is obtained, the topology connection data can be obtained by querying the output result table according to the current query network virtualization instance name (VPN_name) input by the user in the interactive interface, the current query starting service network segment information and the current query target service network segment information. Specifically, the query process of the embodiment includes but is not limited to the following steps:

[0102] In step S310, the starting device protocol is obtained from the second result table according to the current query network virtualization instance name and the current query starting service network segment information.

[0103] In step S310, the optional target service network segment list is obtained from the third result table according to the current query network virtualization instance name and the starting device protocol.

[0104] In step S310, the topology connection data is obtained by querying the first result table according to the current query network virtualization instance name, the starting device protocol, the current query target service network segment information and the optional target service network segment list.

[0105] It can be understood that the interactive interface is set in the front end, and the processing process of the embodiment can be performed in the background. After the current query network virtualization instance name, the current query starting service network segment information and the current query target service network segment information are input in the front end, the starting device protocol (IP) can be determined in the second result table (all_vrf_direct_and_static) according to the field corresponding to the current query network virtualization instance name (VPN_name) and the current query starting service network segment information in the background. Specifically, since the starting device IP obtained at this time can not be unique, that is, there can be multiple same starting device IP. Therefore, the optional target service network segment list is obtained in the third result table (vrf_startIP_target_ip_range) according to the VPN_name and the starting device protocol, and the fuzzy search process is completed.

[0106] Specifically, when the fuzzy search process is completed, the embodiment can further filter the topology connection data in the first result table (vrf_target_link_result) according to the VPN_name, the start device IP, the current query target service network segment information and the optional target service network segment list, and then send the topology connection data to the front end, so that the front end can perform a dynamic service routing topology restoration process according to the topology connection data for rendering, and then the relevant personnel can quickly locate the fault point in the service network through the rendered topology restoration diagram, thereby effectively improving the fault handling efficiency and service recovery efficiency.

[0107] As can be known from the above, the method provided by the embodiment provides a full-process end-to-end real service routing topology of the VPN service, thereby assisting in quickly locating the fault point and service recovery, and reducing the impact on customer perception. Meanwhile, the method of using big data technology to perform parallel calculation on the concatenation paths of all routing devices from the start point to the target network segment, by collecting and analyzing the global routing table, the VRF routing and the port configuration table of the managed network device, and based on the routing and forwarding principle of the network device, calculating the real service routing topology of the VPN, the service routing topology passed by the VPN service can be quickly restored.

[0108] With reference to Figure 9 The embodiment of the present application provides a dynamic service routing topology restoration device, and the device comprises:

[0109] A first module 910 is configured to process a first original service routing table to obtain a second original service routing table, the first original service routing table comprising a first global routing table, a first network virtualization routing table and a first port configuration table of a managed network device, and the second original service routing table comprising a second global routing table, a second network virtualization routing table and a second port configuration table of the managed network device;

[0110] A second module 920 is configured to perform concatenation path calculation according to the second original service routing table to obtain an output result table, the output result table comprising a first result table, a second result table and a third result table;

[0111] A third module 930 is configured to obtain a current query network virtualization instance name, current query start service network segment information and current query target service network segment information;

[0112] A fourth module 940 is configured to perform data query in the output result table according to the current query network virtualization instance name, the current query start service network segment information and the current query target service network segment information to obtain topology connection data;

[0113] A fifth module 950 is configured to send the topology connection data to a front end, so that the front end performs service routing topology rendering according to the topology connection data.

[0114] It can be understood that the contents in the above method embodiments are all applicable to the device embodiments, the device embodiments specifically implement the functions same as those of the above method embodiments, and achieve the same beneficial effects as those of the above method embodiments.

[0115] The electronic device provided in the embodiment of the present application includes a memory and a processor. The memory stores a computer program. The processor implements the dynamic service routing topology restoration method when executing the computer program. The electronic device can be any intelligent terminal, such as a tablet computer or a vehicle-mounted computer.

[0116] It can be understood that the contents in the above method embodiments are all applicable to the device embodiments, the device embodiments specifically implement the functions same as those of the above method embodiments, and achieve the same beneficial effects as those of the above method embodiments.

[0117] Please refer to Figure 10 , Figure 10 The hardware structure of the electronic device of another embodiment is illustrated, and the electronic device includes:

[0118] The processor 1010 can be implemented in the form of a general-purpose 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 implement the technical solutions provided in the embodiments of the present application.

[0119] The memory 1020 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 1020 can store an operating system and other application programs. When the technical solutions provided in the embodiments of the present application are implemented by software or firmware, the related program codes are stored in the memory 1020 and are called and executed by the processor 1010 to implement the dynamic service routing topology restoration method in the embodiments of the present application.

[0120] The input / output interface 1030 is used to realize information input and output.

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

[0122] bus 1050 , which transmits information between various components of the device (e.g., processor 1010 , memory 1020 , input / output interface 1030 , and communication interface 1040 );

[0123] The processor 1010 , the memory 1020 , the input / output interface 1030 , and the communication interface 1040 are connected to each other in communication within the device via a bus 1050 .

[0124] An embodiment of the present application further provides a computer-readable storage medium storing a computer program, which implements the above-mentioned dynamic service routing topology restoration method when executed by a processor.

[0125] It can be understood that the contents of the above method embodiments are all applicable to the present storage medium embodiment, the functions specifically implemented by the present storage medium embodiment are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

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

[0127] The embodiments described in the embodiments of this application are intended to more clearly illustrate the technical solutions of the embodiments of this application and do not constitute a limitation on the technical solutions provided by the embodiments of this application. Those skilled in the art will appreciate that with the evolution of technology and the emergence of new application scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0128] Those skilled in the art will understand that the technical solutions shown in the figures do not constitute a limitation on the embodiments of the present application, and may include more or fewer steps than shown in the figures, or a combination of certain steps, or different steps.

[0129] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, i.e., they may be located in one place or distributed across multiple network units. Some or all of the modules may be selected based on actual needs to achieve the objectives of this embodiment.

[0130] Those skilled in the art can understand that all or some of the steps in the method disclosed above, the function modules / units in the system and the device can be implemented as software, firmware, hardware or appropriate combination thereof.

[0131] The terms "first", "second", "third", "fourth" and the like in the description of the application and in the claims, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the use of these terms herein is to be construed to cover a general order and / or structure unless otherwise indicated. Furthermore, the terms "comprise", "comprising", "has", "having", "includes", "including", "contain", "containing" or any other similar forms are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises, has, includes, contains items or components does not include items or components not explicitly recited. The terms "a" or "an", as used herein in the detailed description and in the claims, mean "one or more" or "at least one", unless otherwise indicated.

[0132] It should be understood that, in the present application, "at least one" means one or more, and "multiple" means two or more. "And / or" is used to describe the relationship between associated objects, which means that there can be three relationships, for example, "A and / or B" can mean that there are three cases: only A, only B, and A and B at the same time, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects. "At least one of the following" or similar expressions means any combination of these items, including any combination of single or multiple items. For example, at least one of a, b or c can mean a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be singular or plural.

[0133] In several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the above-mentioned units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be omitted or not executed. In addition, the coupling or direct coupling or communication connection between the displayed or discussed objects can be indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0134] The units described as separate components above can or can not be physically separate, and the components shown as units can or can not be physical units, that is, can be located in one place, or can be distributed to multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the embodiment scheme.

[0135] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can exist physically, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0136] The integrated unit, if realized in the form of a software functional unit and sold or used as an independent product, can be stored in a computer readable storage medium. Based on such understanding, the technical scheme of the present application, essentially or the part that contributes to the prior art, or all or part of the technical scheme can be embodied in the form of a software product. The computer software product is stored in a storage medium, and includes multiple 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 of the embodiments of the present application. The foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various program storage media.

[0137] The preferred embodiments of the embodiments of the present application are described above with reference to the accompanying drawings, and are not limited to the scope of the embodiments of the present application. Any modifications, equivalent replacements and improvements made by those skilled in the art without departing from the scope and essence of the embodiments of the present application shall be within the scope of the embodiments of the present application.

Claims

1. A method for restoring a dynamic traffic routing topology, characterized by, The method comprises the following steps: processing a first original service routing table to obtain a second original service routing table, wherein the first original service routing table comprises a first global routing table, a first network virtualization routing table and a first port configuration table of a network device that has been managed, and the second original service routing table comprises a second global routing table, a second network virtualization routing table and a second port configuration table of the network device that has been managed; performing serial path calculation according to the second original service routing table to obtain an output result table, wherein the output result table comprises a first result table, a second result table and a third result table; obtaining a current query network virtualization instance name, current query starting service network segment information and current query target service network segment information; performing data query in the output result table according to the current query network virtualization instance name, the current query starting service network segment information and the current query target service network segment information to obtain topology connection data; sending the topology connection data to a front end to enable the front end to perform service routing topology rendering according to the topology connection data.

2. The method of claim 1, wherein, The processing of the first original service routing table to obtain the second original service routing table comprises: performing data collection on the first original service routing table by an offline file import method to obtain a first data set; performing data analysis on the first data set to obtain a data analysis result; performing a database storage operation on the data analysis result according to a preset rule to obtain the second original service routing table.

3. The method of claim 1, wherein, The processing of the first original service routing table to obtain the second original service routing table comprises: performing real-time collection on data in the first original service routing table to obtain a first data set; performing data analysis on the data set to obtain a data analysis result; performing a database storage operation on the data analysis result according to a preset rule to obtain the second original service routing table.

4. The method of claim 1, wherein, The serial path calculation according to the second original service routing table to obtain the output result table comprises: performing screening on data in the second network virtualization routing table to obtain a to-be-serially-connected path set; obtaining initial state data; performing deduplication processing on data in the second network virtualization routing table according to the initial state data; associating data in the second network virtualization routing table after the deduplication processing with data in the first port configuration table to obtain the second result table; performing iteration processing on paths in the to-be-serially-connected path set according to the second network virtualization routing table, the first global routing table and the second port configuration table to obtain the first result table and the third result table.

5. The method according to claim 4, characterized in that The iteration processing on the paths in the to-be-serially-connected path set according to the second network virtualization routing table, the first global routing table and the second port configuration table to obtain the first result table and the third result table comprises: when first output data of the to-be-serially-connected path set is the initial state data, updating the first output data according to the second network virtualization routing table to obtain second output data; When the first output data of the to-be-connected path set is not the initial state data, searching for an interconnection protocol of a next hop from a first preset field associated with the first global routing table according to the first output data; When the interconnection protocol of the next hop is searched, determining a new device node from a second preset field associated with the second port configuration table according to the interconnection protocol; searching for a new edge in the to-be-connected path set according to the new device node, and obtaining a new edge set; When the interconnection protocol of the next hop is not searched, generating the first result table and the third result table.

6. The method of claim 4, wherein, The filtering of the data in the second network virtualization routing table to obtain the to-be-connected path set comprises: obtaining a target field in the second network virtualization routing table; when the target field is a non-empty field, obtaining row data corresponding to the target field in the second network virtualization routing table to form the to-be-connected path set.

7. The method of claim 1, wherein, The data query in the output result table according to the current query network virtualization instance name, the current query starting service network segment information and the current query target service network segment information to obtain topology connection data comprises: obtaining a starting point device protocol in the second result table according to the current query network virtualization instance name and the current query starting service network segment information; obtaining an optional target service network segment list in the third result table according to the current query network virtualization instance name and the starting point device protocol; performing data query in the first result table according to the current query network virtualization instance name, the starting point device protocol, the current query target service network segment information and the optional target service network segment list to obtain the topology connection data.

8. A dynamic service routing topology restoration device, characterized in that: The device comprises: a first module configured to process a first original service routing table to obtain a second original service routing table, wherein the first original service routing table comprises a first global routing table, a first network virtualization routing table and a first port configuration table of a managed network device, and the second original service routing table comprises a second global routing table, a second network virtualization routing table and a second port configuration table of the managed network device; a second module configured to perform connected path calculation according to the second original service routing table to obtain an output result table, wherein the output result table comprises a first result table, a second result table and a third result table; a third module configured to obtain a current query network virtualization instance name, current query starting service network segment information and current query target service network segment information; a fourth module configured to perform data query in the output result table according to the current query network virtualization instance name, the current query starting service network segment information and the current query target service network segment information to obtain topology connection data; a fifth module configured to send the topology connection data to a front end, so that the front end performs service routing topology rendering according to the topology connection data.

9. An electronic device, comprising: comprise: at least one processor; at least one memory for storing at least one program; When the at least one program is executed by the at least one processor, the at least one processor is caused to implement the method recited in any one of claims 1 to 7.

10. A computer-readable storage medium storing a computer program, the computer program comprising instructions that, when executed by a computer, cause the computer to perform the method of any one of claims 1 to 9. The computer program, which is executed by a processor, implements the method recited in any one of claims 1 to 7.

Images