Intelligent configuration method, device, equipment and computer program product of communication route

Abstract

The invention provides an intelligent configuration method, device and equipment of a communication route and a computer program product, and relates to the technical field of communication. The method comprises the following steps: receiving a route search limiting condition, wherein the search limiting condition comprises a route starting point and a route ending point; acquiring communication link data in a communication network; screening and filtering the communication link data based on a route search limiting condition to obtain a candidate link set; routing search is carried out in the candidate link set, and at least one feasible routing scheme from the routing starting point to the routing ending point is found out; and determining a target routing scheme in the at least one feasible routing scheme so as to perform resource configuration and opening of the communication service according to the target routing scheme. According to the embodiment of the invention, the routing scheme from the routing starting point to the routing ending point can be intelligently generated.

Description

Technical Field

[0001] This disclosure relates to the field of communication technology, and in particular to a method, apparatus, electronic device, computer-readable storage medium, and computer program product for intelligent configuration of communication routing. Background Technology

[0002] This section is intended to provide background or context for the embodiments of this disclosure as set forth in the claims. The description herein is not intended to be a prior art simply because it is included in this section.

[0003] The telecommunications industry offers a wide variety of complex services and products. With the advent of the 5G (5th Generation Mobile Networks) era, numerous new service models are constantly emerging. Not only are the functions of various telecommunications network services diverse, but their internal logic and routing resource allocation mechanisms also differ significantly. Different services often have unique routing strategies and resource configuration requirements.

[0004] Currently, the traditional method of manually configuring routes is inefficient. Especially in the route lookup and configuration stage of PE (Provider Edge) routers, engineers need to manually calculate the path, which is tedious and prone to errors.

[0005] Against this backdrop, how to build an intelligent routing management and configuration method has become a key technical problem that urgently needs to be solved. Summary of the Invention

[0006] The purpose of this disclosure is to provide a method, apparatus, electronic device, computer-readable storage medium, and computer program product for intelligent configuration of communication routes, which can intelligently construct routing schemes from the starting point to the ending point of the route.

[0007] Other features and advantages of this disclosure will become apparent from the following detailed description, or may be learned in part from practice of this disclosure.

[0008] This disclosure provides an intelligent configuration method for communication routes, comprising: receiving route search constraints, the search constraints including a route start point and a route end point; acquiring communication link data in a communication network; filtering the communication link data based on the route search constraints to obtain a candidate link set; performing a route search in the candidate link set to find at least one feasible route from the route start point to the route end point; and determining a target route from the at least one feasible route to enable resource configuration and activation of communication services based on the target route.

[0009] In some embodiments, performing a route search in the candidate link set to find at least one feasible route from the route start point to the route end point includes: filtering all links in the candidate link set that have the route start point as an endpoint as first transmission links, wherein the other endpoint of the first transmission link is a first node; identifying a node with the same name as the route end point among the first nodes as a first candidate node; and using the first transmission link corresponding to the first candidate node as a feasible route from the route start point to the route end point.

[0010] In some embodiments, the method further includes: selecting all transmission links with the route termination point as endpoints from the candidate link set as second transmission links, wherein the other endpoint of the second transmission link is a second node; selecting nodes with the same node name from the first node and the second node as second candidate nodes; and concatenating the first transmission link connecting the route start point and the second candidate node, and the second transmission link connecting the second candidate node and the route termination point to form a feasible routing scheme from the route start point to the route termination point.

[0011] In some embodiments, the method further includes: selecting all transmission links with the first node as an endpoint from the candidate link set as third transmission links, wherein the other endpoint of the third transmission link is a third node; determining nodes with the same node name from the third node and the second node as third candidate nodes; connecting the third transmission link connecting the third candidate node and the second transmission link connecting the third candidate node; determining the peer node of the third candidate node on the third transmission link as a fourth candidate node; and connecting the first transmission link connecting the fourth candidate node with the third transmission link connecting the third candidate node to form a feasible routing scheme from the route start point to the route end point.

[0012] In some embodiments, the routing search constraints include at least one of bandwidth size, channel type, channel name, and routing field; wherein, filtering the communication link data based on the routing search constraints to obtain a candidate link set includes: filtering the communication link data based on at least one of the bandwidth size, channel type, channel name, and routing field to obtain multiple candidate links; and generating the candidate link set based on the multiple candidate links.

[0013] In some embodiments, the route search constraints include a route field; wherein, performing a route search in the candidate link set to find at least one feasible route from the route start point to the route end point includes: if the route field is a submarine cable name, finding an international transmission channel passing through the submarine cable corresponding to the submarine cable name; and determining the time slots after splitting the international transmission channel as the route time slots that each feasible route must pass through.

[0014] In some embodiments, the search constraints may include bandwidth requirements, latency requirements, and the number of sites / devices traversed; wherein, determining the target routing scheme from the at least one feasible routing scheme includes: filtering the at least one feasible routing scheme by at least one of the number of sites / devices traversed, the bandwidth requirements, and the latency requirements to obtain at least one candidate routing scheme; and selecting the routing scheme with the minimum latency or the minimum bandwidth from the at least one candidate routing scheme as the target routing scheme.

[0015] In some embodiments, the method further includes: determining that there is no feasible routing scheme between the route start point and the route end point; determining a target point whose distance from the route end point is less than a preset threshold; and performing a route search in the candidate link set to find a routing scheme from the route start point to the target point. Display the routing scheme from the starting point of the route to the destination point, and indicate that there is no route from the destination point to the end point of the route.

[0016] This disclosure provides an intelligent configuration device for communication routing, including: a search condition determination module, a link data acquisition module, a filtering module, a feasible solution determination module, and a target solution determination module.

[0017] The search condition determination module receives route search constraints, including a route start point and a route end point. The link data acquisition module acquires communication link data in the communication network. The filtering module filters the communication link data based on the route search constraints to obtain a candidate link set. The feasible solution determination module performs a route search in the candidate link set to find at least one feasible route from the route start point to the route end point. The target solution determination module determines a target route from the at least one feasible route to enable resource configuration and activation of communication services based on the target route.

[0018] This disclosure provides an electronic device comprising: a memory and a processor; the memory for storing computer program instructions; and the processor for calling the computer program instructions stored in the memory to implement the intelligent configuration method for communication routing as described above.

[0019] This disclosure provides a computer-readable storage medium storing computer program instructions to implement the intelligent configuration method for communication routing as described in any of the preceding embodiments.

[0020] This disclosure provides a computer program product or computer program that includes computer program instructions stored in a computer-readable storage medium. The computer program instructions are read from the computer-readable storage medium, and the processor executes the computer program instructions to implement the aforementioned intelligent configuration method for communication routing.

[0021] The intelligent configuration method, apparatus, electronic device, computer-readable storage medium, and computer program product for communication routing provided in this disclosure significantly improve the efficiency and accuracy of communication service resource configuration through an automated route filtering and search mechanism. This method can quickly filter network link data based on user-input constraints (such as route start and end points), dynamically generate multiple feasible routing schemes, and support user selection of the optimal solution to achieve one-click service activation and resource configuration. This effectively avoids the tedious process and potential errors of traditional manual route searching, reduces operation and maintenance costs, and enhances the intelligence and adaptability of network management.

[0022] It should be understood that the above general description and the following detailed description are merely exemplary and do not limit this disclosure. Attached Figure Description

[0023] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this disclosure and, together with the description, serve to explain the principles of this disclosure. It is obvious that the drawings described below are merely some embodiments of this disclosure, and those skilled in the art can obtain other drawings based on these drawings without any inventive effort.

[0024] The exemplary embodiments of this disclosure will now be described in detail with reference to the accompanying drawings.

[0025] Figure 1 A schematic diagram of a scenario is shown that can be applied to a smart configuration method or a smart configuration device for communication routing in embodiments of this disclosure.

[0026] Figure 2 This is a flowchart illustrating an intelligent configuration method for communication routing according to an exemplary embodiment.

[0027] Figure 3 This is a flowchart illustrating a feasible routing scheme determination method based on an exemplary attempt.

[0028] Figure 4 This is a flowchart illustrating a feasible routing scheme determination method according to an exemplary embodiment.

[0029] Figure 5 This is a flowchart illustrating a feasible routing scheme determination method according to an exemplary embodiment.

[0030] Figure 6 This is a method for searching a feasible routing scheme according to an exemplary embodiment.

[0031] Figure 7 This is a method for searching a feasible routing scheme according to an exemplary embodiment.

[0032] Figure 8 This is a block diagram illustrating an intelligent configuration device for communication routing according to an exemplary embodiment.

[0033] Figure 9 A schematic diagram of the structure of an electronic device suitable for implementing embodiments of the present disclosure is shown. Detailed Implementation

[0034] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the embodiments set forth herein; rather, they are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the exemplary embodiments to those skilled in the art. The same reference numerals in the drawings denote the same or similar parts, and therefore repeated descriptions of them will be omitted.

[0035] Those skilled in the art will recognize that embodiments of this disclosure can be a system, apparatus, device, method, or computer program product. Therefore, this disclosure can be implemented in the following forms: entirely hardware, entirely software (including firmware, resident software, microcode, etc.), or a combination of hardware and software.

[0036] The features, structures, or characteristics described in this disclosure can be combined in any suitable manner in one or more embodiments. Numerous specific details are provided in the following description to give a thorough understanding of embodiments of this disclosure. However, those skilled in the art will recognize that the technical solutions of this disclosure can be practiced with one or more specific details omitted, or other methods, components, apparatuses, steps, etc., can be employed. In other instances, well-known methods, apparatuses, implementations, or operations are not shown or described in detail to avoid obscuring various aspects of this disclosure.

[0037] In this disclosure, the terms "module" or "unit" refer to a computer program or part of a computer program that has a predetermined function and works with other related parts to achieve a predetermined goal, and can be implemented wholly or partially using software, hardware (such as processing circuitry or memory), or a combination thereof. Similarly, a processor (or multiple processors or memory) can be used to implement one or more modules or units. Furthermore, each module or unit can be part of an overall module or unit that includes the functionality of that module or unit.

[0038] The accompanying drawings are merely illustrative of this disclosure, and the same reference numerals in the drawings denote the same or similar parts, thus omitting repeated descriptions of them. Some block diagrams shown in the drawings do not necessarily correspond to physically or logically independent entities. These functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0039] The flowchart shown in the accompanying drawings is merely illustrative and does not necessarily include all content and steps, nor does it require execution in the described order. For example, some steps may be broken down, while others may be combined or partially combined; therefore, the actual execution order may change depending on the specific circumstances.

[0040] In the description of this disclosure, unless otherwise stated, " / " means "or," for example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Furthermore, "at least one" means one or more, and "multiple" means two or more. The terms "first," "second," etc., do not limit the quantity or order of execution, and "first," "second," etc., do not necessarily imply differences; the terms "contains," "includes," and "has" are used to indicate an open-ended meaning of inclusion and refer to the existence of additional elements / components / etc. besides those listed.

[0041] To better understand the above-mentioned objectives, features and advantages of the present invention, the present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments. It should be noted that, unless otherwise specified, the embodiments and features in the embodiments of the present disclosure can be combined with each other.

[0042] The exemplary embodiments of this disclosure will now be described in detail with reference to the accompanying drawings.

[0043] Figure 1A schematic diagram of a scenario is shown that can be applied to a smart configuration method or a smart configuration device for communication routing in embodiments of this disclosure.

[0044] Please refer to Figure 1 The diagram illustrates an implementation environment provided by an exemplary embodiment of this disclosure.

[0045] like Figure 1 As shown, system architecture 100 may include terminal devices 101, 102, and 103, a network 104, and a server 105. Network 104 serves as the medium for providing communication links between terminal devices 101, 102, and 103 and server 105. Network 104 may include various connection types, such as wired or wireless communication links, or fiber optic cables, etc.

[0046] Users can use terminal devices 101, 102, and 103 to interact with server 105 via network 104 to receive or send messages, etc. Terminal devices 101, 102, and 103 can be various electronic devices with displays and web browsing capabilities, including but not limited to smartphones, tablets, laptops, desktop computers, wearable devices, virtual reality devices, smart home devices, etc.

[0047] Server 105 can be a server that provides various services, such as a backend management server that supports the devices operated by users using terminal devices 101, 102, and 103. The backend management server can analyze and process received requests and other data, and feed the processing results back to the terminal devices.

[0048] A server can be a standalone physical server, a server cluster or a distributed system consisting of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms. This disclosure does not impose any restrictions on this.

[0049] Server 105 may, for example, receive routing search constraints, the search constraints including a route start point and a route end point; server 105 may, for example, acquire communication link data in a communication network; server 105 may, for example, filter the communication link data based on the routing search constraints to obtain a candidate link set; server 105 may, for example, perform a route search in the candidate link set to find at least one feasible route from the route start point to the route end point; server 105 may, for example, determine a target route from the at least one feasible route to configure and activate communication services according to the target route.

[0050] It should be understood that Figure 1 The number of terminal devices, networks, and servers shown is merely illustrative. Server 105 can be a single physical server or a combination of multiple servers. Depending on actual needs, it can have any number of terminal devices, networks, and servers.

[0051] Under the above system architecture, this disclosure provides an intelligent configuration method for communication routing, which can be executed by any electronic device with computing capabilities.

[0052] Figure 2 This is a flowchart illustrating an intelligent configuration method for communication routing according to an exemplary embodiment. The method provided in this disclosure can be executed by any electronic device with computing power, for example, the method can be implemented by the above-described... Figure 1 The execution can be performed by a server or terminal device in the embodiments, or it can be performed by both a server and a terminal device. In the following embodiments, the server is used as the execution subject for illustration, but this disclosure is not limited to this.

[0053] Reference Figure 2 The intelligent configuration method for communication routing provided in this embodiment may include the following steps.

[0054] Step S202: Receive route search constraints, which include the route start point and the route end point.

[0055] In some embodiments, the above routing constraints may include route start and end points, bandwidth, number of devices / sites traversed (e.g., the number of devices / sites may be less than or equal to 8), channel type, channel name, latency requirements (e.g., latency may be less than or equal to 0), routing fields, etc.

[0056] The route start point can be the name of the A-End station (required), and the route end point can be the name of the Z-End station (required).

[0057] In an end-to-end communication circuit or service, A-end can refer to the starting end or origin of the service; Z-end can refer to the ending end or destination of the service.

[0058] "Cyberstation" is a general term that can refer to a specific physical site or location in a communication network where communication equipment is installed. It can be understood as a "node" or "hub" in a communication network.

[0059] The name of the A-end (or Z-end) station can be the name of a building.

[0060] Step S204: Obtain communication link data in the communication network.

[0061] Communication link data refers to the collection describing all physical or logical connections, states, and attributes between various network nodes (stations, equipment) in a communication network. Essentially, it is the digital sum of the entire communication network's "map" and "traffic information."

[0062] These link data typically exist in the form of databases or models and can contain information in the following key dimensions.

[0063] 1. Topology Connectivity.

[0064] This is the most basic data, describing "who is connected to whom".

[0065] Link ID: A unique number for each link, used to distinguish them.

[0066] Endpoint Information: Clearly indicates which two devices or ports this link connects to. For example: which device in "A-end station" is connected.

[0067] 2. Physical Resource Attributes.

[0068] Describe the "material" and "physical capacity" of the link itself.

[0069] Media Type: Is it fiber optic, microwave, copper cable, or satellite link?

[0070] Fiber / Cable Information: If it is an optical cable, specify which fiber core it is and what the cable number is.

[0071] Total Bandwidth / Capacity: The theoretical maximum bandwidth that this link can provide, such as 10Gbps or 100Gbps.

[0072] 3. Logical Business and Status Information

[0073] Describing the current "health status" and "busyness" of the link is crucial for intelligent computing to find the optimal path.

[0074] Available Bandwidth: The current remaining available bandwidth capacity. This changes dynamically.

[0075] Current Status: Is the link "in use", "idle", "reserved", "faulty", or "under maintenance"?

[0076] Performance metrics include latency, packet loss rate, and jitter. For demanding applications (such as 5G slicing and financial transactions), paths with low latency and low packet loss should be selected.

[0077] Ownership / Leasing Information: Is this link self-built, leased, or shared? This relates to cost calculation.

[0078] 4. Administrative Information.

[0079] Admin Status: Whether the administrator has enabled (Up) or disabled (Down).

[0080] Cost / Weight: A "cost" value assigned to a link by the user, used in the path calculation algorithm. The system can prioritize the path with the lowest total cost.

[0081] In some embodiments, before acquiring communication link data in the communication network, circuit utilization calculations can be performed on each communication link in the communication network; multiple links between single points can be abstracted into one link.

[0082] Specifically, link data can be scanned and post-processed at appropriate time intervals.

[0083] In some embodiments, the post-processing operations described above may include circuit utilization calculation, integration of multiple links between single points into a single link, etc.

[0084] In some embodiments, the post-processed data can be persistently stored as routing graph metadata, which can then be used for searching before the next cycle. Through abstraction and compression, the application data volume can be effectively reduced by more than 95%, greatly improving search efficiency while effectively maintaining search accuracy.

[0085] In some embodiments, considering subsequent search requirements, the graph composed of abstract data can be defined as an unweighted, undirected graph structure. The abstraction time period can be determined based on the data update frequency.

[0086] In some embodiments, circuit utilization may refer to the ratio of the bandwidth currently used by a link to its total bandwidth.

[0087] The core purpose of calculating circuit utilization is to provide intelligent routing systems with real-time, dynamic network status awareness. By monitoring link bandwidth usage, the system can accurately identify congested nodes and proactively avoid high-load paths, thereby preventing network congestion and ensuring service quality. At the same time, it can dynamically adjust traffic allocation based on utilization data to achieve network load balancing, maximize resource utilization efficiency, and ultimately build a highly efficient, stable, and self-optimizing intelligent network.

[0088] By abstracting multiple links between single points, multiple physical optical fibers or circuits may exist between two identical network nodes (such as two central offices) (a phenomenon known as "link bundling" or "aggregation"). Instead of treating them as 10 independent, narrow paths, the system abstracts and merges them into a single, wider "logical avenue." This method significantly reduces computational load, greatly simplifying the network topology. Imagine if there were 10 direct links between A and Z; without abstraction, the algorithm would have to calculate each of these 10 paths separately, resulting in exponentially increasing complexity. After abstraction, there is only one logical "road" between A and Z, and the algorithm only needs to process this single logical entity, leading to drastically faster computation.

[0089] In some embodiments, the total bandwidth of this abstracted "logical link" is the sum of the bandwidths of all physical links, and its available bandwidth is also the sum of the available bandwidths of all physical links. This more realistically reflects the overall transmission capacity between two nodes. For routing calculations, the focus is on "how much bandwidth I can get from A to Z in total," rather than "which specific fiber optic cable to use."

[0090] Furthermore, this abstract "logical highway" is redundant. If one of the physical fiber optic cables breaks, as long as other physical links remain operational, the "logical highway" still exists, only the total bandwidth is reduced. This is transparent to upper-layer services and routing calculations; services are not interrupted, and the system only needs to recalculate the utilization rate based on the new total bandwidth, thus improving the network's fault tolerance.

[0091] Step S206: Filter the communication link data based on the routing search constraints to obtain a set of candidate links.

[0092] In some embodiments, the routing search constraints may include a routing field. Specifically, performing a routing search within a set of candidate links to find at least one feasible route from the starting point to the ending point may include: if the routing field is a submarine cable name, finding the international transmission channel that passes through the submarine cable corresponding to the cable name; and determining the time slots after splitting the international transmission channel as the routing time slots that each feasible routing scheme must traverse.

[0093] Specifically, when the routing field in the search constraints is the name of a submarine cable, it is necessary to find the international transmission channel that passes through this submarine cable and the time slots that are divided into by this international transmission channel as the necessary routes. Based on the above conditions, query the route scheme that meets the requirements between the route start point and the route end point.

[0094] In this context, a time slot refers to a fixed, periodically allocated unit of bandwidth in a high-speed transmission channel. You can think of it as a fixed lane on a multi-lane highway.

[0095] An international transmission channel refers to an end-to-end logical communication channel established between network nodes in different countries or regions via transnational media such as submarine optical cables, terrestrial optical cables, or satellites. It provides users (usually operators, large enterprises, or internet companies) with a manageable, marketable transnational data transmission path with specific bandwidth and performance guarantees.

[0096] In some embodiments, the searched routing scheme may include resource objects such as: time slots, international transmission channels, OTN (Optical Transport Network) links, channels, or transmission NNI (Transmission Network-to-Network Interface).

[0097] In the field of optical communication, a wavelength division multiplexing (WDM) channel refers to an independent transmission channel that is divided on a physical optical fiber and carried by a specific wavelength (λ, Lambda) through wavelength division multiplexing (WDM) technology.

[0098] An OTN link refers to an end-to-end physical and logical connection in an optical transport network (OTN) between two adjacent OTN devices (such as optical line terminals or optical cross-connect devices) that are connected by optical fiber and communicate in accordance with the OTN standard protocol.

[0099] NNI is an interface specification for interconnecting two different network devices (belonging to the same operator or different operators). It defines a complete set of rules for how devices "communicate," including physical connections, frame formats, signaling, and OAM (Operation, Administration, and Maintenance).

[0100] In some embodiments, when the bandwidth input by the user is small, a low-order time slot or transmission NNI can be allocated first (if none is available, a high-order time slot or OTN relay can be allocated). When the bandwidth input by the user is large, an OTN relay can be allocated first (if no OTN relay is available, a high-order channel or high-order time slot can be allocated).

[0101] In some embodiments, a "timeslot" is the smallest unit of bandwidth allocation, similar to a "lane" on a highway. Different levels of timeslots correspond to different bandwidth capacities.

[0102] In some embodiments, low-order time slots (such as 2M, 45M, 155M, 622M) can be used to carry small-granularity services, such as voice, leased lines, and low-bandwidth data services.

[0103] In some embodiments, higher-order time slots (such as 2.5G, 10G, 100G) can be used to carry large-granularity services, such as core network transmission, data center interconnection, and high-bandwidth leased lines.

[0104] In some embodiments, during route allocation, low-bandwidth services (e.g., ≤ 622M) are given priority to use lower-order time slots, resulting in high resource utilization; if there are insufficient lower-order time slots, higher-order time slots can be used (although this may waste bandwidth, it ensures service availability).

[0105] OTN (Optical Transport Network) is a high-capacity, highly reliable optical transmission technology. An OTN trunk refers to a relay segment established between two OTN devices in an OTN network, used for long-distance, high-capacity optical signal transmission; it typically carries high-order channels with bandwidths usually in the 10G / 100G / 200G range; suitable for carrying high-bandwidth services such as data center interconnection, 5G backhaul, and cloud services.

[0106] High-bandwidth services (e.g., ≥ 10G) are preferentially allocated to OTN trunks because of their large capacity and high efficiency; if no OTN trunks are available, higher-order channels or higher-order time slots can be used as a fallback (e.g., through channel or OTN multiplexing segment splitting).

[0107] NNI stands for Network Interface, used for interconnection between different operators or network domains. In transmission networks, NNI typically refers to the interface between transmission devices, such as fiber optic interfaces, OTUk interfaces, and Ethernet interfaces. NNI can also provide time slot splitting functionality, dividing large bandwidth channels into smaller bandwidth units (such as 2M / 45M / 155M).

[0108] In some embodiments, low-bandwidth services may preferentially use low-order time slots split from NNI; if no NNI resources are available, high-order time slots or OTN trunks may be used instead (although this may be uneconomical, it can guarantee service availability).

[0109] In some embodiments, the route search constraints may include at least one of the following: bandwidth size, channel type, channel name, and route field.

[0110] In some embodiments, filtering communication link data based on routing search constraints to obtain a candidate link set may include: filtering communication link data based on at least one of bandwidth size, channel type, channel name, and routing field to obtain multiple candidate links; generating a candidate link set based on the multiple candidate links so as to search for feasible routing schemes in the candidate link set.

[0111] Step S208: Perform a route search in the candidate link set to find at least one feasible route from the route start point to the route end point.

[0112] Step S210: Determine the target routing scheme from at least one feasible routing scheme so as to configure and activate communication services according to the target routing scheme.

[0113] In some embodiments, search constraints may include bandwidth requirements, latency requirements, and the number of sites / devices traversed.

[0114] In some embodiments, determining a target routing scheme from at least one feasible routing scheme may include: filtering at least one feasible routing scheme by at least one of the number of sites / devices passed through, bandwidth requirements, and latency requirements to obtain at least one candidate routing scheme; and selecting the routing scheme with the minimum latency or the minimum bandwidth from the at least one candidate routing scheme as the target routing scheme.

[0115] In other embodiments, the route with the lowest cost can be selected from at least one candidate route as the target route.

[0116] In some embodiments, if no feasible route is found between the route start point and the route end point, a target point (e.g., a device station) whose distance from the route end point is less than a preset threshold is determined; then a route search is performed in the candidate link set to find a route from the route start point to the target point; then the route from the route start point to the target point is displayed, and a message is displayed indicating that a route from the target point to the route end point is missing.

[0117] In some embodiments, the target point may be the point closest to the route termination point, such as a point in a neighboring province or city.

[0118] In some embodiments, indicating a missing route from the destination to the route termination point can facilitate users to purchase or build services between the destination and the route termination point to complete the services between the route start point and the route termination point.

[0119] The above method can improve the efficiency of resource allocation, solve the tedious process of PE route finding, propose intelligent route search for system construction, support the display of all automatically calculated routing schemes of the system, and automatically configure routing information according to the user's selection when configuring business routes, enabling business scenarios and configuring the entire transmission circuit.

[0120] The intelligent configuration method for communication routing provided in this disclosure receives search instructions containing start and end points and multi-dimensional constraints (such as bandwidth, latency, and required pathways), automatically acquires and intelligently processes network link data (including calculating utilization and abstracting and aggregating links to simplify the topology), efficiently filters candidate links, dynamically calculates multiple feasible routing schemes, and finally automatically determines the optimal route based on optimization objectives (such as shortest path, lowest latency, and lowest cost). This method realizes a transformation from traditional tedious manual searching to fully automated intelligent planning, greatly improving service activation efficiency and network resource utilization, while enhancing network reliability and adaptability.

[0121] Figure 3 This is a flowchart illustrating a feasible routing scheme determination method based on an exemplary attempt.

[0122] refer to Figure 3 A route search is performed on the candidate link set to find at least one feasible route from the route start point to the route end point, which may include the following steps.

[0123] Step S302: Select all links with the route start point as the endpoint from the candidate link set and use them as the first transmission link, where the other endpoint of the first transmission link is the first node.

[0124] Step S304: In the first node, determine the node with the same name as the route termination point as the first candidate node.

[0125] Step S306: The first transmission link corresponding to the first candidate node is taken as a feasible routing scheme from the starting point of the route to the ending point of the route.

[0126] The method described above implements an efficient and accurate direct route priority search strategy. It quickly filters links directly connected to the starting point and immediately matches whether a direct path to the ending point exists, thereby discovering the optimal direct route solution in the topology with the shortest computation time. This not only significantly improves route calculation efficiency and reduces system overhead, but also provides a foundation for subsequent complex searches, ensuring the agility of service deployment.

[0127] Figure 4 This is a flowchart illustrating a feasible routing scheme determination method according to an exemplary embodiment.

[0128] refer to Figure 4 The process of performing a route search in the candidate link set to find at least one feasible route from the route start point to the route end point may also include the following steps.

[0129] Step S402: In the candidate link set, select all transmission links with the route termination point as the endpoint as the second transmission link, wherein the other endpoint of the second transmission link is the second node.

[0130] Step S404: Select nodes with the same name from the first node and the second node, which are then selected as the second candidate nodes.

[0131] Step S406: The first transmission link connecting the route start point and the second candidate node, and the second transmission link connecting the second candidate node and the route end point are spliced ​​together to form a feasible route scheme from the route start point to the route end point.

[0132] Figure 5 This is a flowchart illustrating a feasible routing scheme determination method according to an exemplary embodiment.

[0133] refer to Figure 5 The process of performing a route search in the candidate link set to find at least one feasible route from the route start point to the route end point may also include the following steps.

[0134] Step S502: In the candidate link set, select all transmission links with the first node as the endpoint as the third transmission link, where the other endpoint of the third transmission link is the third node.

[0135] Step S504: From the third node and the second node, determine the node with the same node name as the third candidate node.

[0136] Step S506: Connect the third transmission link connecting the third candidate node and the second transmission link connecting the third candidate node.

[0137] Step S508: Determine the peer node of the third candidate node on the third transmission link as the fourth candidate node.

[0138] Step S510: Connect the first transmission link connecting the fourth candidate node to the third transmission link connecting the third candidate node to form a feasible routing scheme from the route start point to the route end point.

[0139] Below, this application will combine Figure 6 and Figure 7 This provides a specific scheme for searching and configuring feasible routing options.

[0140] In some embodiments, common AZ-side routing search scenarios may include: channel + transport NNI (Network-to-Network Interface), channel + device port, channel + channel, and device port + device port.

[0141] In some embodiments, the route search restrictions entered by the user may include the following: A-end station name (required), Z-end station name (required), bandwidth (required), number of devices / sites passed through (can be less than or equal to 8), channel type, channel name, latency requirement (must include data with empty latency), routing field, and the number of overseas route segments should not exceed 3 by default. Multiple conditions can be combined for the search based on the above content.

[0142] When entering the name of a submarine cable in the route selection field, it is necessary to find the international transmission channel that passes through this submarine cable and the time slots that are divided into the international transmission channel as the necessary routes.

[0143] You can use the above conditions to query routing schemes that meet the requirements within two local stations.

[0144] In some embodiments, the resource objects included in the searched routing scheme may include: time slots, international transmission channels, OTN links, channels, and transmission NNIs. These five resources are combined to form an end-to-end routing scheme.

[0145] In some embodiments, when the bandwidth input by the user is small, a low-order time slot or transmission NNI can be allocated first (if none is available, a high-order time slot or OTN relay can be allocated). When the bandwidth input by the user is large, an OTN relay can be allocated first (if no OTN relay is available, a high-order channel or high-order time slot can be allocated).

[0146] The current bandwidth scenario for channel splitting time slots is as follows: the transmission link type that needs to be restricted is matched based on the bandwidth value input by the user.

[0147] 1. SDH multiplex segment splitting time slot bandwidth: 2M, 50M, 155M, 1G, 2.5G, 10G, 100G; 2. Time slot bandwidth of international transmission channel splitting: 2M, 45M, 50M, 155M, 622M, 1G, 2.5G, 10G, 100G; 3. Time slot bandwidth split from OTN relay: 10G, 100G; 4. Time slot bandwidth of OCH optical channel splitting: 2M, 155M, 2.5G, 10G, 100G, 200G; 5. Bandwidth of time slots split from the channel: 1G, 10G; 6. The time slot bandwidths split from NNI are: 2M, 45M, 155M, 622M, 1G, 2.5G, and 10G. 7. High-order time slots are split into low-order time slot bandwidths: 2M, 45M, 155M, 622M, 1G, 1.25G, 2.5G, 10G, 100G.

[0148] In some embodiments, such as Figure 6 or Figure 7 As shown, before performing route search, link data can be scanned and post-processed at appropriate time intervals. Post-processing operations include circuit utilization calculation and abstracting multiple links between a single point into a single link.

[0149] In some embodiments, such as Figure 6 or Figure 7 As shown, before performing a route search, the post-processed data can be persistently stored as route graph metadata, which can then be used for searching before the next cycle. Through abstraction and compression, the application data volume can be effectively reduced by more than 95%, greatly improving search efficiency while effectively maintaining search accuracy.

[0150] In some embodiments, considering subsequent search requirements, the graph composed of abstract data can be defined as an unweighted, undirected graph structure. The abstraction time period is determined based on the data update frequency.

[0151] In some embodiments, such as Figure 6 As shown, you can invoke the intelligent routing search engine to perform route searches and configurations based on search criteria. This can include the following steps, which you can refer to for details. Figure 7 .

[0152] Step 1: Routing scheme for a single link.

[0153] First, match a transmission link directly based on the user-input route start point and route end point fields. If a matching transmission link is found, output the result directly. If no matching result is found, execute the following scheme.

[0154] Step 2: Routing scheme for multiple links.

[0155] If a direct route cannot be found, you can continue to search for routing schemes along multiple links. For example, to search for a route from station A to station G: A-Transmission Link 1-B-Transmission Link 2-C-Transmission Link 3-D-Transmission Link 4-E-Transmission Link 5-F-Transmission Link 6-G, the steps are as follows.

[0156] Step 1: Find the transmission link 1 from A to B based on the name of the originating station A: First, match the stations at the data AZ end of the transmission link based on the name of station A, and find the matching transmission link 1.

[0157] Step 2: Find the transmission link 6 from F to G based on the destination station name G: Then, match the stations at the data AZ end of the transmission link based on the station name G, and find the matching transmission link 6.

[0158] Step 3: Find the route from B to F: Search for the next station's transmission link based on the other end of transmission link 1, and repeat the search until the station G in transmission link 6 is matched.

[0159] Step 3: Router configuration.

[0160] Based on resource type or business scenario, the list of multiple routing solutions retrieved in the route search is categorized and sorted according to the above two points, with the shortest path placed first, as shown below: 1. Transmission link 1-G; 2. Transmission Link 1-B-Transmission Link 2-G; 3. Transmission Link 1-B-Transmission Link 2-C-Transmission Link 3-G; 4. Transmission Link 1-B-Transmission Link 2-C-Transmission Link 3-D-Transmission Link 4-G; 5. Transmission Link 1-B-Transmission Link 2-C-Transmission Link 3-D-Transmission Link 4-E-Transmission Link 5-G; 6. Transmission Link 1-B-Transmission Link 2-C-Transmission Link 3-D-Transmission Link 4-E-Transmission Link 5-F-Transmission Link 6-G.

[0161] In some embodiments, a suitable routing scheme can be selected from the multiple routing options described above, and the corresponding circuit code can be entered and reserved. After confirmation and saving, the system will automatically add the circuit and its routing information to the resource management. Users can retrieve the routing resource by circuit code in the comprehensive query function and view the specific routing path automatically assigned by the system in the graphical interface.

[0162] The intelligent communication routing configuration method proposed in this embodiment achieves efficient and accurate routing calculation by integrating multi-condition combination search, intelligent resource allocation, and topology data abstraction and compression. It can flexibly generate end-to-end routing schemes according to business needs and automatically select the optimal resource allocation strategy based on constraints such as bandwidth or cost. By abstracting the network topology into a simplified model, it significantly improves data processing and path search efficiency. This solution supports full-process automation from intelligent route recommendation to one-click service activation, effectively improving the intelligence level and operational efficiency of communication service resource allocation.

[0163] It should be particularly noted that the steps in each embodiment of the above-described intelligent configuration method for communication routing can be interchanged, substituted, added, or deleted. Therefore, these reasonable permutations and combinations of the intelligent configuration method for communication routing should also fall within the protection scope of this disclosure, and the protection scope of this disclosure should not be limited to the described embodiments.

[0164] Based on the same inventive concept, this disclosure also provides an intelligent configuration device for communication routing, as described in the following embodiments. Since the principle by which this device embodiment solves the problem is similar to that of the above-described method embodiments, the implementation of this device embodiment can refer to the implementation of the above-described method embodiments, and repeated details will not be elaborated further.

[0165] Figure 8 This is a block diagram illustrating an intelligent configuration device for communication routing according to an exemplary embodiment. (Refer to...) Figure 8 The intelligent configuration device 800 for communication routing provided in this embodiment may include: a search condition determination module 801, a link data acquisition module 802, a filtering module 803, a feasible solution determination module 804, and a target solution determination module 805.

[0166] The search condition determination module 801 can be used to receive route search constraints, including a route start point and a route end point; the link data acquisition module 802 can be used to acquire communication link data in the communication network; the filtering module 803 can be used to filter the communication link data based on the route search constraints to obtain a candidate link set; the feasible solution determination module 804 can be used to perform a route search in the candidate link set to find at least one feasible route from the route start point to the route end point; and the target solution determination module 805 can be used to determine a target route from the at least one feasible route to enable resource configuration and activation of communication services based on the target route.

[0167] It should be noted that the search condition determination module 801, link data acquisition module 802, filtering module 803, feasible solution determination module 804, and target solution determination module 805 mentioned above correspond to S202 to S210 in the method embodiment. The examples and application scenarios implemented by the above modules and corresponding steps are the same, but are not limited to the content disclosed in the above method embodiment. It should be noted that the above modules, as part of the device, can be executed in a computer system such as a set of computer-executable instructions.

[0168] In some embodiments, the feasible solution determination module 804 may include: a first transmission link determination submodule, a first candidate node determination submodule, and a first routing scheme determination submodule.

[0169] The first transmission link determination submodule can be used to filter all links with the route start point as the endpoint from the candidate link set, and use them as the first transmission links, wherein the other endpoint of the first transmission link is the first node; the first candidate node determination submodule can be used to determine the node with the same name as the route end point from the first node, and use it as the first candidate node; the first routing scheme determination submodule can be used to use the first transmission link corresponding to the first candidate node as a feasible routing scheme from the route start point to the route end point.

[0170] In some embodiments, the intelligent configuration device 800 for communication routing may further include: a second transmission link determination module, a second candidate node determination module, and a second scheme determination module.

[0171] The second transmission link determination module can be used to filter all transmission links with the route termination point as the endpoint from the candidate link set, and use them as the second transmission links, wherein the other endpoint of the second transmission link is the second node; the second candidate node determination module can be used to filter nodes with the same node name from the first node and the second node, and use them as the second candidate nodes; the second scheme determination module can be used to splice the first transmission link connecting the route start point and the second candidate node, and the second transmission link connecting the second candidate node and the route termination point, to form a feasible routing scheme from the route start point to the route termination point.

[0172] In some embodiments, the intelligent configuration device 800 for communication routing may further include: a third transmission link determination module, a third candidate node determination module, a first connection module, a fourth candidate node determination module, and a third scheme determination module.

[0173] The third transmission link determination module can be used to filter all transmission links with the first node as an endpoint from the candidate link set as third transmission links, wherein the other endpoint of the third transmission link is the third node; the third candidate node determination module can be used to determine the node with the same node name from the third node and the second node as the third candidate node; the first connection module can be used to connect the third transmission link connecting the third candidate node and the second transmission link connecting the third candidate node; the fourth candidate node determination module can be used to determine the peer node of the third candidate node on the third transmission link as the fourth candidate node; the third scheme determination module can be used to connect the first transmission link connecting the fourth candidate node with the third transmission link connecting the third candidate node to form a feasible routing scheme from the route start point to the route end point.

[0174] In some embodiments, the route search constraints include at least one of the following: bandwidth size, channel type, channel name, and routing field; wherein, the filtering module 803 may include a filtering submodule and a link set determination submodule.

[0175] The filtering submodule can be used to filter the communication link data based on at least one of the bandwidth size, the channel type, the channel name, and the routing field to obtain multiple candidate links; the link set determination submodule can be used to generate the candidate link set based on the multiple candidate links.

[0176] In some embodiments, the route search constraints include a route field; wherein, the feasible solution determination module 804 may include: a transmission channel determination submodule and a necessary time slot determination submodule.

[0177] The transmission channel determination submodule can be used to find the international transmission channel that passes through the submarine cable corresponding to the submarine cable name if the routing field is a submarine cable name; the required time slot determination submodule can be used to determine the time slots after the international transmission channel is split as the route time slots that each feasible routing scheme must pass through.

[0178] In some embodiments, the search constraints may include bandwidth requirements, latency requirements, and the number of sites / devices traversed; wherein, determining the target routing scheme from the at least one feasible routing scheme includes: filtering the at least one feasible routing scheme by at least one of the number of sites / devices traversed, the bandwidth requirements, and the latency requirements to obtain at least one candidate routing scheme; and selecting the routing scheme with the minimum latency or the minimum bandwidth from the at least one candidate routing scheme as the target routing scheme.

[0179] In some embodiments, the intelligent configuration device 800 for communication routing may further include: a scheme non-existence determination module, a target point determination module, a route search module, and a display module.

[0180] The system includes a route non-existence determination module to determine that there is no feasible route between the route start point and the route end point; a target point determination module to determine a target point whose distance from the route end point is less than a preset threshold; a route search module to perform a route search in the candidate link set to find a route from the route start point to the target point; and a display module to display the route from the route start point to the target point and indicate that a route from the target point to the route end point is missing.

[0181] Since the functions of the device 800 have been described in detail in their respective method embodiments, they will not be repeated here.

[0182] The modules and / or sub-modules and / or units described in the embodiments of this disclosure can be implemented in software or hardware. The described modules and / or sub-modules and / or units can also be located in a processor. The names of these modules and / or sub-modules and / or units do not, in some cases, constitute a limitation on the module and / or sub-module and / or unit itself.

[0183] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in a flowchart or block diagram may represent a portion of a module or program segment containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, may be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer program instructions.

[0184] Furthermore, the above figures are merely illustrative of the processes included in the method according to exemplary embodiments of this disclosure and are not intended to be limiting. It is readily understood that the processes shown in the above figures do not indicate or limit the temporal order of these processes. Additionally, it is readily understood that these processes may be executed synchronously or asynchronously, for example, in multiple modules.

[0185] Figure 9 A schematic diagram of an electronic device suitable for implementing embodiments of the present disclosure is shown. It should be noted that... Figure 9 The electronic device 900 shown is merely an example and should not be construed as limiting the functionality and scope of use of the embodiments disclosed herein.

[0186] like Figure 9 As shown, the electronic device 900 includes a central processing unit (CPU) 901, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 902 or a program loaded from a storage section 908 into a random access memory (RAM) 903. The RAM 903 also stores various programs and data required for the operation of the electronic device 900. The CPU 901, ROM 902, and RAM 903 are interconnected via a bus 904. An input / output (I / O) interface 905 is also connected to the bus 904.

[0187] The following components are connected to I / O interface 905: an input section 906 including a keyboard, mouse, etc.; an output section 907 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.; a storage section 908 including a hard disk, etc.; and a communication section 909 including a network interface card such as a LAN card, modem, etc. The communication section 909 performs communication processing via a network such as the Internet. A drive 910 is also connected to I / O interface 905 as needed. A removable medium 911, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on drive 910 as needed so that computer programs read from it can be installed into storage section 908 as needed.

[0188] In particular, according to embodiments of this disclosure, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of this disclosure include a computer program product comprising a computer program carried on a computer-readable storage medium, the computer program containing computer program instructions for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication section 909, and / or installed from removable medium 911. When the computer program is executed by central processing unit (CPU) 901, it performs the functions defined above in the system of this disclosure.

[0189] It should be noted that the computer-readable storage medium disclosed herein may be a computer-readable signal medium or a computer-readable storage medium, or any combination thereof. A computer-readable storage medium may be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In this disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In this disclosure, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable computer program instructions. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. Computer-readable signal media can also be any computer-readable storage medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. Computer program instructions contained on a computer-readable storage medium can be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, RF, etc., or any suitable combination thereof.

[0190] In another aspect, this disclosure also provides a computer-readable storage medium, which may be included in the device described in the above embodiments; or it may exist independently and not assembled into the device. The computer-readable storage medium carries one or more programs that, when executed by the device, enable the device to perform the following functions: receiving route search constraints, including a route start point and a route end point; acquiring communication link data in a communication network; filtering the communication link data based on the route search constraints to obtain a candidate link set; performing a route search in the candidate link set to find at least one feasible route from the route start point to the route end point; and determining a target route from the at least one feasible route to configure and activate communication services according to the target route.

[0191] According to one aspect of this disclosure, a computer program product or computer program is provided, comprising computer program instructions stored in a computer-readable storage medium. The computer program instructions are read from the computer-readable storage medium, and a processor executes the computer program instructions to implement the methods provided in various optional implementations of the above embodiments.

[0192] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions of the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, or portable hard drive) and includes several computer program instructions to cause an electronic device (such as a server or terminal device) to execute the method according to the embodiments of this disclosure.

[0193] Other embodiments of this disclosure will readily occur to those skilled in the art upon consideration of the specification and practice disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of this disclosure that follow the general principles of this disclosure and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of this disclosure are indicated by the claims.

[0194] It should be understood that this disclosure is not limited to the detailed structures, drawing arrangements or implementation methods shown herein; rather, this disclosure is intended to cover various modifications and equivalent arrangements contained within the spirit and scope of the appended claims.

Claims

1. A method for intelligent configuration of communication routes, characterized in that, include: Receive route search constraints, the search constraints including route start point and route end point; Acquire communication link data in the communication network; The communication link data is filtered based on the routing search constraints to obtain a candidate link set; Perform a route search in the candidate link set to find at least one feasible route from the route start point to the route end point; A target routing scheme is determined from the at least one feasible routing scheme so that resources for communication services can be configured and activated according to the target routing scheme.

2. The method according to claim 1, characterized in that, A route search is performed on the candidate link set to find at least one feasible route from the route start point to the route end point, including: All links with the route start point as the endpoint are selected from the candidate link set and designated as the first transmission link, wherein the other endpoint of the first transmission link is the first node; In the first node, identify the node with the same name as the route termination point as the first candidate node; The first transmission link corresponding to the first candidate node is taken as a feasible routing scheme from the route start point to the route end point.

3. The method according to claim 2, characterized in that, The method further includes: In the candidate link set, all transmission links with the route termination point as the endpoint are selected as the second transmission links, wherein the other endpoint of the second transmission link is the second node; From the first node and the second node, select nodes with the same name as the second candidate nodes; The first transmission link connecting the route start point and the second candidate node, and the second transmission link connecting the second candidate node and the route end point are spliced ​​together to form a feasible routing scheme from the route start point to the route end point.

4. The method according to claim 3, characterized in that, The method further includes: In the candidate link set, all transmission links with the first node as the endpoint are selected as the third transmission links, wherein the other endpoint of the third transmission link is the third node; From the third node and the second node, determine the node with the same name as the third candidate node; Connect the third transmission link connecting the third candidate node and the second transmission link connecting the third candidate node; The peer node of the third candidate node on the third transmission link is determined as the fourth candidate node; The first transmission link connecting the fourth candidate node is connected to the third transmission link connecting the third candidate node to form a feasible routing scheme from the route start point to the route end point.

5. The method according to claim 1, characterized in that, The routing search constraints include at least one of the following: bandwidth size, channel type, channel name, and routing field; wherein, the communication link data is filtered based on the routing search constraints to obtain a candidate link set, including: The communication link data is filtered based on at least one of the bandwidth size, channel type, channel name, and routing field to obtain multiple candidate links; The candidate link set is generated based on the multiple candidate links.

6. The method according to claim 1, characterized in that, The route search constraints include a route field; wherein, performing a route search within the candidate link set to find at least one feasible route from the route start point to the route end point includes: If the routing field is a submarine cable name, then find the international transmission channel that passes through the submarine cable corresponding to the submarine cable name; The time slots after the international transmission channel is split are determined as the routing time slots that each feasible routing scheme must pass through.

7. The method according to claim 1, characterized in that, The search constraints may include bandwidth requirements, latency requirements, and the number of sites / devices traversed; wherein, determining the target routing scheme from the at least one feasible routing scheme includes: The at least one feasible routing scheme is filtered by at least one of the following: the number of stations / devices passed through, the bandwidth requirement, and the latency requirement, to obtain at least one candidate routing scheme. The routing scheme with the minimum latency or the minimum bandwidth among the at least one candidate routing scheme is selected as the target routing scheme.

8. The method according to claim 1, characterized in that, The method further includes: It was determined that there was no feasible route between the route start point and the route end point; Determine target points whose distance from the route termination point is less than a preset threshold; Perform a route search in the candidate link set to find a route scheme from the route start point to the target point; Display the routing scheme from the starting point of the route to the destination point, and indicate that there is no route from the destination point to the end point of the route.

9. The method according to claim 1, characterized in that, Before acquiring communication link data in the communication network, the method further includes: The circuit utilization rate of each communication link in the communication network is calculated separately. Abstract multiple links between individual points into a single link.

10. An intelligent configuration device for communication routing, characterized in that, include: The search condition determination module is used to receive route search constraints, which include route start point and route end point; The link data acquisition module is used to acquire communication link data in the communication network. The filtering module is used to filter the communication link data based on the routing search constraints to obtain a set of candidate links; The feasible solution determination module is used to perform route search in the candidate link set and find at least one feasible route from the route start point to the route end point. The target route determination module is used to determine a target route scheme from the at least one feasible route scheme, so as to configure and activate communication services according to the target route scheme.

11. An electronic device, characterized in that, include: Memory and processor; The memory is used to store computer program instructions; the processor calls the computer program instructions stored in the memory to implement the intelligent configuration method for communication routing as described in any one of claims 1-9.

12. A computer-readable storage medium storing computer program instructions thereon, characterized in that, When the computer program instructions are executed by the processor, they implement the intelligent configuration method for communication routing as described in any one of claims 1-9.

13. A computer program product comprising computer program instructions stored in a computer-readable storage medium, characterized in that, When the computer program instructions are executed by the processor, they implement the method according to any one of claims 1-9.

Images