Method, device and storage medium for visualizing communication routing configuration

Abstract

The application relates to the field of communication configuration, and discloses a visual communication route configuration method, equipment and a storage medium. The method comprises the following steps: a route configuration system receives a service selection instruction, displays a networking type based on the service selection instruction, judges whether a line meets a preset constraint condition when the object is the line, displays optional parameters of the line if the line meets the preset constraint condition, judges whether all configured element components correspond to necessary attributes which are not empty when a configuration confirmation instruction is received, generates a communication topology graph based on all configured element components if all configured element components correspond to necessary attributes which are not empty, and sends the communication topology graph to a route checking system, and the route checking system receives the communication topology graph, generates a configuration list contract based on a checking result. In the embodiment of the application, a visual configuration system capable of accurately expressing communication routes and node related parameters is constructed, and the effect of accurately describing a communication topology structure in a communication configuration process is achieved.

Description

Technical Field

[0001] This invention relates to the field of communication configuration, and more particularly to a visual communication routing configuration method, device, and storage medium. Background Technology

[0002] In the field of communication configuration, routing configuration technology is a core component of network architecture, evolving from basic static and dynamic routing to today's highly intelligent, automated, and secure systems. Static routing relies on network administrators manually entering routing table entries, making it suitable for small networks or scenarios with extremely high security requirements due to its simplicity and security. However, it lacks flexibility; once the network topology changes, manual intervention is required to update the routing table. Dynamic routing, on the other hand, automatically learns and updates its routing table through routing protocols (such as RIP, OSPF, and BGP), adapting to dynamic changes in network topology and making it suitable for large, complex networks. While this technology is relatively complex to configure and debug, its flexibility and adaptability have led to its widespread application in modern networks.

[0003] With the continuous development of network technology, intelligent routing technology is gradually emerging. Software-defined networking (SDN) dynamically configures network resources in a software-defined manner, enabling flexible routing policies and greatly improving network flexibility and response speed. Intent-driven networking (IDN) goes a step further, automatically configuring the network based on business intents, transforming complex business requirements into specific network configurations, reducing human error, and improving network management efficiency.

[0004] Multipath routing technologies such as Equal Cost Multipath (ECMP) and Multi-Topology Routing (MTR) also play important roles in modern networks. ECMP improves network utilization and fault tolerance by distributing traffic across multiple equal-cost paths, making it particularly suitable for data center networks and large enterprise networks. MTR, on the other hand, creates independent routing topologies for different traffic types or service levels, meeting the differentiated needs of various services and improving network service quality. However, due to the complexity of the transmission structures involved in multipath routing configurations, current software data structures cannot accurately and effectively represent communication transmission routes and nodes, necessitating a new technology to address these challenges. Summary of the Invention

[0005] The main objective of this invention is to solve the technical problem that current software data structures cannot accurately and effectively express communication transmission routes and nodes due to the complexity of the transmission structures involved in multi-path routing settings.

[0006] The first aspect of this invention provides a visual communication routing configuration method, which is applied to a visual communication routing configuration system. The visual communication routing configuration system includes a routing configuration system and a routing verification system. The visual communication routing configuration method includes:

[0007] The routing configuration system receives service selection instructions and displays network types based on these instructions.

[0008] Receive the network selection instruction corresponding to the network type, and display the element components corresponding to the network selection instruction, wherein the element components include: lines;

[0009] In the preset configuration interface, the visual drag-and-drop command of the element component is received;

[0010] When the object of the visual drag-and-drop instruction is a line, it is determined whether the line corresponding to the visual drag-and-drop instruction meets the preset constraint conditions.

[0011] If the preset constraints are met, the optional parameters of the line corresponding to the visual drag command are displayed, the parameter setting command is received, and the configuration line corresponding to the parameter setting command is generated.

[0012] When a configuration confirmation instruction is received, it is determined whether all the necessary attributes of the configured element components are not empty;

[0013] If all necessary attributes are not empty, then a communication topology diagram is generated based on all configured element components, and the communication topology diagram is sent to the routing verification system.

[0014] The routing verification system receives the communication topology map, performs verification processing on the communication topology map, and generates a verification result;

[0015] If the verification result is satisfactory, a configuration list contract is generated based on the communication topology diagram.

[0016] Optionally, in a first implementation of the first aspect of the present invention, the step of determining whether the line corresponding to the visual drag command satisfies the preset constraint conditions includes:

[0017] Read the quantity limit of the line corresponding to the visual drag-and-drop command, and determine whether the quantity limit has been reached;

[0018] If the quantity limit has been reached, the configuration of the line corresponding to the visual drag-and-drop command on the configuration interface will be stopped.

[0019] If the quantity limit is not met, then based on the element components configured on the configuration interface, physical constraint processing is performed on the line corresponding to the visual drag command to obtain the physically constrained line.

[0020] Optionally, in a second implementation of the first aspect of the present invention, the element components include: a site, a terminal, and an access point. The step of performing physical constraint processing on the line corresponding to the visual drag-and-drop command based on the element components configured on the configuration interface to obtain the physically constrained line includes:

[0021] Read the connection relationships between the stations, terminals, and access points on the configuration interface corresponding to the visual drag-and-drop command;

[0022] Determine whether the type of the line corresponding to the visual drag-and-drop command matches the connection relationship;

[0023] If the type matches the connection relationship, then query the optional parameters corresponding to the connection relationship and bind the optional parameters to the line corresponding to the visual drag command.

[0024] Optionally, in a third implementation of the first aspect of the present invention, the step of displaying the optional parameters of the line corresponding to the visual drag-and-drop command includes:

[0025] Based on the preset path recommendation algorithm, the optional parameters are processed by price efficiency calculation to obtain the optimal price efficiency solution corresponding to the optional parameters;

[0026] Based on the optimal solution for price efficiency, the optional parameters are subjected to optimal coloring to obtain the coloring optional parameters;

[0027] The text describes optional coloring parameters for the lines corresponding to the visual drag-and-drop command.

[0028] Optionally, in a fourth implementation of the first aspect of the present invention, the step of performing price efficiency calculation on the optional parameters according to a preset path recommendation algorithm to obtain the optimal price efficiency solution corresponding to the optional parameters includes:

[0029] Based on the starting point of the route, an initial price efficiency value is generated;

[0030] Based on a preset exploration probability formula, the t-th connection node of the next connection after the starting point is selected, where t is a positive integer;

[0031] Calculate the price efficiency value of the t-th connection node to the starting point of the line;

[0032] Based on a preset exploration probability formula, select the (t+1)th connection node to be connected to the next connection node of the t-th connection node;

[0033] Calculate the (t+1)th price efficiency value from the (t+1)th connection node to the tth connection node;

[0034] When the (t+1)th connecting node is not the end point of the line, the (t+1)th price efficiency value is updated based on the initial price efficiency value to obtain the updated (t+1)th price efficiency value.

[0035] When the (t+1)th connection node is the end point of the line, the connection distance between the (t+1)th connection node and the starting point of the line is calculated.

[0036] Based on the connection distance, the (t+1)th price efficiency value is updated to obtain the updated (t+1)th price efficiency value. Based on the updated (t+1)th price efficiency value, the optimal price efficiency solution corresponding to the optional parameters is selected.

[0037] Optionally, in a fifth implementation of the first aspect of the present invention, the step of calculating the (t+1)th price efficiency value corresponding to the (t+1)th connection node includes:

[0038] Z(t+1) = W(t+1) / S(t+1), where W(t+1) is the network bandwidth from the t-th connection node to the (t+1)-th connection node, S(t+1) is the bandwidth consumption cost from the t-th connection node to the (t+1)-th connection node, and Z(t+1) is the price efficiency value at the (t+1)-th connection node.

[0039] Optionally, in a sixth implementation of the first aspect of the present invention, the step of updating the (t+1)th price efficiency value based on the initial price efficiency value to obtain the updated (t+1)th price efficiency value includes:

[0040] Z2(t+1)=(1-u)Z1(t+1)+u*Z(0);

[0041] Where Z2(t+1) is the updated price efficiency value at the (t+1)th t ...

[0042] The step of updating the (t+1)th price efficiency value based on the connection distance to obtain the updated (t+1)th price efficiency value includes:

[0043] Z(t+1) = (1-v)Z(t) + ;

[0044] =Z(i) / d i ;

[0045] Among them, the Let Z(i) be the rate of change of the price efficiency value of the i-th connection path, and Z(i) be the price efficiency value of the i-th path. i Z(t) is the distance from the i-th connected node to the (i+1)-th connected node, Z(t) is the updated price efficiency value at the t-th node, Z(t+1) is the updated price efficiency value at the (t+1)-th node, and v is the node switching efficiency decay constant.

[0046] Optionally, in a seventh implementation of the first aspect of the present invention, the step of selecting the (t+1)th connection node of the next connection of the t-th connection node based on a preset exploration probability formula includes:

[0047] n(t) = 1 / d t ;

[0048] n tl (t) = 1 / d tl ;

[0049] ;

[0050] Where P(t) is the probability that the t-th connection node connects to the next (t+1)-th connection node. (t) represents the price efficiency value at the t-th node, n(t) is the heuristic parameter for the transmission distance of the t-th connected node, and d t Let be the distance from the t-th connected node to the (t+1)-th connected node, l be the distance from the t-th connected node to any possible connected node l, and R be the set of possible connected nodes. tl (t) represents the price efficiency value of connecting node t to node l, where n is the number of nodes. tl (t) is the heuristic parameter for the transmission distance from the t-th connected node to node l, d tl Let t be the distance from node t to node l, where a and b are constants.

[0051] A second aspect of the present invention provides a visual communication routing configuration device, comprising: a memory and at least one processor, wherein the memory stores instructions, and the memory and the at least one processor are interconnected via a line; the at least one processor invokes the instructions in the memory to cause the visual communication routing configuration device to execute the above-described visual communication routing configuration method.

[0052] A third aspect of the present invention provides a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the above-described visual communication routing configuration method.

[0053] In this embodiment of the invention, by adapting communication configurations, network types are designed with corresponding element components. These element components are visualized on a configuration interface, allowing for the setting of optional configuration parameters and necessary attributes. Furthermore, optional configuration parameters for connecting lines are constrained based on the constraints imposed by other types of components within these element components. Based on the parameter settings of the element components, a communication topology diagram accurately describing the requirements is generated. In the verification system, this accurately described communication topology diagram is used to generate an executable configuration list contract. This invention constructs a visual configuration system capable of accurately expressing communication routes and node-related parameters, achieving the effect of accurately describing the communication topology during communication configuration. It solves the technical problem that current software data structures cannot accurately and effectively express communication transmission routes and nodes due to the complexity of the transmission structures involved in multi-path routing settings. Attached Figure Description

[0054] Figure 1 This is a schematic diagram of one embodiment of the visual communication routing configuration method in this invention.

[0055] Figure 2a This is a schematic diagram illustrating the network types of the visual communication routing configuration method in this embodiment of the invention;

[0056] Figure 2b This is a first drag-and-drop configuration diagram of the visual communication routing configuration method in an embodiment of the present invention;

[0057] Figure 2c This is a second drag-and-drop configuration diagram of the visual communication routing configuration method in an embodiment of the present invention;

[0058] Figure 3 This is a schematic diagram of a specific embodiment of the 104 steps of the visualized communication routing configuration method in this invention.

[0059] Figure 4 This is a schematic diagram of a specific embodiment of the 105 steps of the visualized communication routing configuration method in this invention.

[0060] Figure 5 This is a schematic diagram of one embodiment of a visual communication routing configuration device according to an embodiment of the present invention. Detailed Implementation

[0061] This invention provides a visual communication routing configuration method, device, and storage medium.

[0062] The embodiments of the present invention will now be described in more detail with reference to the accompanying drawings. While some embodiments of the present invention are shown in the drawings, it should be understood that the present invention can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the accompanying drawings and embodiments are for illustrative purposes only and are not intended to limit the scope of protection of the present invention.

[0063] In the description of the embodiments disclosed in this invention, the term "comprising" and similar terms should be understood as open-ended inclusion, i.e., "including but not limited to". The term "based on" should be understood as "at least partially based on". The term "one embodiment" or "the embodiment" should be understood as "at least one embodiment". The terms "first", "second", etc., may refer to different or the same objects. Other explicit and implicit definitions may also be included below.

[0064] For ease of understanding, the specific process of the embodiments of the present invention is described below. Please refer to [link / reference]. Figure 1 This invention provides an embodiment of a visual communication routing configuration method. The visual communication routing configuration method is applied to a visual communication routing configuration system, which includes a routing configuration system and a routing verification system. The visual communication routing configuration method includes:

[0065] 101. The routing configuration system receives a service selection instruction and displays the network types based on the service selection instruction;

[0066] In this embodiment, the routing configuration system and the routing verification system are in a front-end and back-end relationship. The front-end is provided to the customer by the routing configuration system, where the customer accurately and precisely expresses their current needs. The back-end receives the needs data, verifies the data, and writes the configuration data into the generated configuration list contract according to the original contract template, so as to realize the precise customization of customer needs in the process of commercial communication routing services.

[0067] Please refer to Figure 2a , Figure 2a This is a schematic diagram illustrating the network types of the visual communication routing configuration method in this embodiment of the invention. The first step in the routing configuration system is to select the network type using the service selection command. The network types include VPN, DIA (Internet Leased Line Access), COLO (Cost-Based Hosting), Security, Value-Added Services, and Terminal Management Services.

[0068] The DIA (Dedicated Internet Access) category provides businesses with dedicated IP addresses and bandwidth, ensuring exclusive access and preventing sharing with other users. The COLO (Co-location) category hosts IT equipment and dedicated hardware for multiple companies or individuals, allowing for shared data center infrastructure and efficient resource utilization. The Security category uses technologies like Transport Layer Security (TLS) or Secure Sockets Layer (SSL) to establish encrypted channels and protect data transmission security.

[0069] Furthermore, within the VPN category, there are various networking types such as IPVPN, IPVPN Port, TraditionalVPN, IPSEC VPN, SDWAN-TPY, SDWAN (pure internet networking), SDWAN+4G / 5G, SDWAN-VELO-pure internet, SDWAN-V, VPNDiectX, POP 2 POP, Alibaba Cloud private line, Tencent Cloud private line, Azure cloud private line, AWS cloud private line, Forti SSLVPN, etc.

[0070] IP VPN is a service that uses public network resources to build private networks for customers. Through the backbone network of operators, it adopts technologies such as Multiprotocol Label Switching (MPLS), combined with Quality of Service (QoS) and traffic control technologies, to provide enterprise users with internal communication services such as data, voice, and images between multiple branches across borders (regions), and also provides a variety of value-added services.

[0071] An IPVPN port is a network interface or endpoint used for IPVPN services. In an IPVPN implementation, ports are used for data transmission, management, or control, and specific ports are used for communication between VPN gateways.

[0072] Traditional VPNs are virtual private networks built on traditional network technologies. They rely on dedicated hardware and fixed network configurations. These VPN technologies use encryption and encapsulation techniques to securely transmit data from private networks to public networks, enabling remote access and connections between branch offices.

[0073] IPSec VPN is a security protocol based on the IP protocol used to provide secure communication at the network layer. It ensures the confidentiality, integrity, and reliability of data sources through encryption and authentication technologies. IPSec VPN can be used to build intranet VPNs (connecting corporate headquarters and branch offices), extranet VPNs (connecting the company with partners), and remote access VPNs (allowing remote employees to access the corporate intranet).

[0074] SDWAN-TPY is a software-defined wide area network (WAN) technology endpoint device that manages network resources in a software-defined manner. It enables flexible network configuration and optimization and supports multiple network connection methods, including MPLS, Internet, and 4G / 5G.

[0075] SD-WAN is a software-defined wide area network (WAN) technology. SDWAN (Internet-only WAN) builds a wide area network using only an internet connection, without relying on traditional leased lines such as MPLS. This approach reduces costs while optimizing the performance and reliability of internet connections through SD-WAN technology.

[0076] SD-WAN+4G / 5G is a technology that combines SD-WAN with 4G / 5G network connectivity. It leverages the flexibility and mobility of wireless networks to provide additional access options for SD-WAN. This combination can improve network availability and flexibility, especially in scenarios requiring rapid deployment or where a fixed network connection is unavailable.

[0077] SDWAN-VELO-Pure Internet is a pure internet networking solution that configures SD-WAN with the Velo Protocol. The Velo Protocol is a blockchain-enabled financial system and decentralized settlement network.

[0078] SDWAN-V is a customizable network solution that can be tailored to different needs and scenarios.

[0079] VPN DirectX is a custom VPN solution with an internally customized VPN configuration method.

[0080] POP 2 POP refers to a connection scheme from one network access point to another. A POP 2 POP connection is a direct connection between two network access points used to enable communication between networks.

[0081] Forti SSLVPN is a Virtual Private Network (VPN) solution provided by Fortinet based on the SSL (Secure Sockets Layer) protocol.

[0082] Similarly, under the categories of DIA, COLO, Security, Value-added Services, and Terminal Management Services, there are corresponding specific network types. The relevant network types can be displayed using the service selection command.

[0083] 102. Receive the network selection instruction corresponding to the network type, and display the element components corresponding to the network selection instruction, wherein the element components include: lines;

[0084] In this embodiment, each network type has a corresponding element component. After the network selection command selects the corresponding network type, the element component corresponding to the selected network type is retrieved.

[0085] 103. In the preset configuration interface, receive the visual drag-and-drop command of the element component;

[0086] In this embodiment, the element components include various types such as sites, terminals, access points (POPs), lines, and value-added cabinet services. Please refer to [the relevant documentation]. Figures 2b-2c , Figure 2b This is a first drag-and-drop configuration diagram of the visual communication routing configuration method in this embodiment of the invention. Figure 2c This is a second drag-and-drop configuration diagram of the visual communication routing configuration method in this embodiment of the invention, which connects the site and the terminal together using a Local Loop line.

[0087] 104. When the object of the visual drag-and-drop instruction is a line, determine whether the line corresponding to the visual drag-and-drop instruction meets the preset constraint conditions.

[0088] In this embodiment, the IPVPN network types include Local Loop, In-Building Line, and OS Local Loop. The visual drag-and-drop command, when the corresponding line is dragged and released into the configuration interface, will analyze and determine whether the line meets pre-set constraints. For example, in the IPVPN network type, the OSLocal Loop line cannot connect to a site. Each IPVPN network type can only have one line. To add a line, a new IPVPN network service needs to be started, and then the line added under that network service.

[0089] For details, please refer to Figure 3 , Figure 3 This is a schematic diagram of a specific embodiment of the 104 steps of the visualized communication routing configuration method in this invention. The 104 steps include the following specific implementation methods:

[0090] 1041. Read the quantity limit of the line corresponding to the visual drag-and-drop command, and determine whether the quantity limit has been reached;

[0091] 1042. If the quantity limit has been reached, the configuration of the line corresponding to the visual drag-and-drop command on the configuration interface shall be stopped.

[0092] 1043. If the quantity limit is not met, then based on the element components configured on the configuration interface, physical constraint processing is performed on the line corresponding to the visual drag command to obtain the physically constrained line.

[0093] In steps 1041-1043, first read the quantity limit of the line corresponding to the visual drag-and-drop command. If the quantity limit is set to 1, then each network service should only have one line. Drag the line to the configuration interface under the visual drag-and-drop command and analyze whether the number of existing lines for the network service in the configuration interface is equal to 1. If it is already equal to 1, it means the quantity limit has been reached, and the configuration of the line corresponding to the visual drag-and-drop command on the configuration interface needs to be stopped.

[0094] If the number of lines is less than 1, it is necessary to analyze the actual physical limitations of the lines, such as the bandwidth range, line type, and interface type, based on the element components already placed in the configuration interface, and bind the physical constraints to the line.

[0095] Furthermore, the element components include: a site, a terminal, and an access point, and step 1043 includes the following specific implementation:

[0096] 10431. Read the connection relationship between the stations, terminals, and access points on the configuration interface corresponding to the visual drag-and-drop command;

[0097] 10432. Determine whether the type of the line corresponding to the visual drag-and-drop command matches the connection relationship;

[0098] 10433. If the type matches the connection relationship, then query the optional parameters corresponding to the connection relationship and bind the optional parameters to the line corresponding to the visual drag command.

[0099] In steps 10431-10433, the connection relationship of the line on the interface is read first. For example, if the line is between the station and the terminal, it is first determined whether the line type matches the settings between the station and the terminal. The line type between the station and the terminal is configured as Local Loop line or building line. If the line type is OS Local Loop line, the connection relationship between the station and the terminal does not match.

[0100] When the line type matches the connection relationship between the site and the terminal, the configurable parameters of the Local Loop line corresponding to the connection relationship between the site and the terminal are queried, and the configurable parameters are bound to the line corresponding to the visual drag and drop command. The configurable parameters include: line subtype, supplier, line bandwidth, interface type and other specific and detailed parameters.

[0101] 105. If the preset constraints are met, the optional parameters of the line corresponding to the visual drag command are displayed, the parameter setting command is received, and the configuration line corresponding to the parameter setting command is generated.

[0102] In this embodiment, after displaying the optional parameters, the user selects and sets them on the configuration interface. The configuration line corresponding to the user's parameter setting command is generated based on the user's parameter setting command.

[0103] For further details, please refer to Figure 4 , Figure 4 This is a schematic diagram of a specific embodiment of step 105 of the visualized communication routing configuration method in this invention. Step 105 includes the following specific implementation methods:

[0104] 1051. Based on the preset path recommendation algorithm, the optional parameters are processed by price efficiency calculation to obtain the optimal price efficiency solution corresponding to the optional parameters;

[0105] 1052. Based on the optimal solution for price efficiency, perform optimal coloring processing on the optional parameters to obtain the optional coloring parameters;

[0106] 1053. Display the optional coloring parameters for the lines corresponding to the visual drag-and-drop command.

[0107] In steps 1051-1053, a path recommendation algorithm is first used to calculate the price and efficiency of each path data for the optional parameters, determining the optimal price-efficiency solution for each optional parameter. Price-efficiency measures the cost per unit of bandwidth consumed, helping users choose the most cost-effective route configuration per unit of bandwidth. Based on the optimal price-efficiency solution, the optional parameters are colored to show the recommended option that provides the user with the best overall balance of price, bandwidth, and distance. It should be noted that the price attributes differ for different line subtypes, providers, line bandwidths, and interface types. Ordinary customers cannot understand the complex routing configurations and price relationships. Only when the final list is generated will the price attributes corresponding to the customer's selected configurations be retrieved and calculated. Customers can only compare prices by setting and generating each option individually. Using price-efficiency coloring makes it easier for users to quickly discover the optimal configuration option that combines price, bandwidth, and distance.

[0108] Furthermore, step 1051 includes the following specific implementation methods:

[0109] 10511. Based on the starting point of the route, generate an initial price efficiency value;

[0110] 10512. Based on a preset exploration probability formula, select the t-th connection node of the next connection after the starting point, where t is a positive integer;

[0111] 10513. Calculate the price efficiency value of the t-th connection node to the starting point of the line;

[0112] 10514. Based on the preset exploration probability formula, select the (t+1)th connection node to be connected to the next connection node of the t-th connection node;

[0113] 10515. Calculate the price efficiency value at the (t+1)th digit from the (t+1)th connection node to the tth connection node;

[0114] 10516. When the (t+1)th connecting node is not the end point of the line, the (t+1)th price efficiency value is updated based on the initial price efficiency value to obtain the updated (t+1)th price efficiency value.

[0115] 10517. When the (t+1)th connecting node is the end point of the line, calculate the connection distance between the (t+1)th connecting node and the starting point of the line.

[0116] 10518. Based on the connection distance, update the (t+1)th price efficiency value to obtain the updated (t+1)th price efficiency value, and based on the updated (t+1)th price efficiency value, select the optimal price efficiency solution corresponding to the optional parameters.

[0117] In steps 10511-10518, the starting point of the line can be set as a station, and the corresponding ending point of the line can be set as a terminal. The starting point of the line is marked as 0, and Z(0) is the initial price efficiency value set as a constant, which is set based on experience such as equipment depreciation. Then, based on the exploration probability formula, the starting point is used as the 0th connection node, and the probability of all nodes that the starting point can connect to the next node is calculated. The node with the highest probability is selected as the 1st connection node. The 1st price efficiency value from the starting point to the 1st connection node is calculated according to Z(1) = W(1) / S(1), where Z(1) is the 1st price efficiency value, W(1) is the network bandwidth from the starting point to the 1st connection node, and S(1) is the actual amount from the starting point to the 1st connection node.

[0118] Similarly, using the exploration probability formula, calculate the probability of all nodes that the first connecting node can connect to the next node, and select the node with the highest probability as the second connecting node. Similarly, iteratively calculate the (t+1)th connecting node that the t-th connecting node can connect to, and calculate the price efficiency value Z(t) between the t-th connecting node and the (t+1)-th connecting node.

[0119] If the (t+1)th connecting node is not the end point of the line, then update the (t+1)th price efficiency value Z(t+1) using the initial price efficiency value Z(0) to obtain the updated Z(t+1). Continue iteratively to calculate the next (t+2)th connecting node, calculate the (t+2)th price efficiency value Z(t+2) between the (t+1)th connecting node and the (t+2)th connecting node, and similarly update the (t+2)th price efficiency value Z(t+2) in a loop.

[0120] If the (t+1)th connection node is the endpoint of the line, then the endpoint is the (t+1)th connection node. The physical distance from the endpoint to the (t)th connection node is calculated as the connection distance. Using this connection distance, the (t+1)th price efficiency value is updated, resulting in the updated (t+1)th price efficiency value. Based on all efficiency price values ​​from the starting point (the 0th connection node) to the (t+1)th connection node, the efficiency price value of a connection line is obtained. By calculating the overall efficiency price value of all possible connection lines, the optimal price efficiency solution corresponding to the optional parameter with the highest overall efficiency price value is selected.

[0121] Specifically, step 10515 includes the following specific implementation methods:

[0122] 105151, Z(t+1) = W(t+1) / S(t+1), where W(t+1) is the network bandwidth from the t-th connection node to the (t+1)-th connection node, S(t+1) is the bandwidth consumption amount from the t-th connection node to the (t+1)-th connection node, and Z(t+1) is the price efficiency value at the (t+1)-th connection node.

[0123] In step 105151, the price efficiency value of the ratio of network bandwidth to bandwidth consumption between each node is calculated using the formula Z(t+1) = W(t+1) / S(t+1). The price efficiency value between each node is calculated after each exploration between connected nodes.

[0124] Specifically, step 10516 includes the following specific implementation methods:

[0125] Z2(t+1)=(1-u)Z1(t+1)+u*Z(0);

[0126] Where Z2(t+1) is the updated price efficiency value at the (t+1)th t ...

[0127] When updating the price efficiency value Z1(t+1) at the (t+1)th time, considering the impact of network packet loss rate on price value, the update method is a local update each time the next connected node is found.

[0128] Specifically, step 10517 includes the following specific implementation methods:

[0129] Z(t+1) = (1-v)Z(t) + ;

[0130] =Z(i) / d i ;

[0131] Among them, the Let Z(i) be the rate of change of the price efficiency value of the i-th connection path, and Z(i) be the price efficiency value of the i-th path. i Z(t) is the distance from the i-th connected node to the (i+1)-th connected node, Z(t) is the updated price efficiency value at the t-th node, Z(t+1) is the updated price efficiency value at the (t+1)-th node, and v is the node switching efficiency decay constant.

[0132] This update is a global update from the (t+1)th connecting node of the endpoint to the starting point, and takes into account the distance between each node in the whole to update the overall route price efficiency value.

[0133] Specifically, 10514 includes the following specific implementation methods:

[0134] n(t) = 1 / d t ;

[0135] n tl (t) = 1 / d tl ;

[0136] ;

[0137] Where P(t) is the probability that the t-th connection node connects to the next (t+1)-th connection node. (t) represents the price efficiency value at the t-th node, n(t) is the heuristic parameter for the transmission distance of the t-th connected node, and d t Let be the distance from the t-th connected node to the (t+1)-th connected node, l be the distance from the t-th connected node to any possible connected node l, and R be the set of possible connected nodes. tl (t) represents the price efficiency value of connecting node t to node l, where n is the number of nodes. tl (t) is the heuristic parameter for the transmission distance from the t-th connected node to node l, d tl Let t be the distance from node t to node l, where a and b are constants.

[0138] The probabilistic exploration formula is based on the probability analysis of the price efficiency value and distance of the t-th connected node to the next node. Based on the calculated probability of each possible next connected node, the node with the highest probability is found as the connected node.

[0139] 106. When receiving a configuration confirmation instruction, determine whether all the necessary attributes of the configured element components are not empty;

[0140] In this embodiment, the selection of a site, connection point, and line are essential attributes in the element component. Site attributes include name, address, and contact person, while connection point attributes include region address, bandwidth, and service level. The next step can only proceed if all essential attributes are set in the configuration interface; otherwise, the relevant attributes need to be set.

[0141] 107. If all necessary attributes are not empty, then based on all configured element components, generate a communication topology diagram and send the communication topology diagram to the routing verification system;

[0142] In this embodiment, all visualization element components are configured and combined to generate a communication topology diagram. The price parameters corresponding to the element components are retrieved to generate a price list based on the price parameters. The communication topology diagram and the price list are packaged into a data packet and sent to the routing verification system.

[0143] 108. The routing verification system receives the communication topology map, performs verification processing on the communication topology map, and generates a verification result;

[0144] In this embodiment, the routing verification system receives a communication topology diagram and a quotation list. The engineers at the back end confirm that the settings in the communication topology diagram are physically feasible communication settings, while the management personnel approve the prices in the quotation list at the minimum price. When both approval results are qualified, a qualified verification result is generated.

[0145] 109. When the verification result is qualified, a configuration list contract is generated based on the communication topology diagram.

[0146] In this embodiment, when the verification result is satisfactory, the communication topology diagram and price list are written into a pre-set contract template, replacing the original placeholders, and a configuration list contract is generated. The approved configuration list contract is then sent back to the routing configuration system so that users can view the routing data and corresponding costs of the contract from the routing configuration system. This achieves accurate communication topology configuration and corresponding configuration prices, precisely expresses communication routes and node-related parameters, and accurately quantifies the configuration prices corresponding to the communication topology.

[0147] In this embodiment of the invention, by adapting communication configurations, network types are designed with corresponding element components. These element components are visualized on a configuration interface, allowing for the setting of optional configuration parameters and necessary attributes. Furthermore, optional configuration parameters for connecting lines are constrained based on the constraints imposed by other types of components within these element components. Based on the parameter settings of the element components, a communication topology diagram accurately describing the requirements is generated. In the verification system, this accurately described communication topology diagram is used to generate an executable configuration list contract. This invention constructs a visual configuration system capable of accurately expressing communication routes and node-related parameters, achieving the effect of accurately describing the communication topology during communication configuration. It solves the technical problem that current software data structures cannot accurately and effectively express communication transmission routes and nodes due to the complexity of the transmission structures involved in multi-path routing settings.

[0148] Figure 5 This is a schematic diagram of a visual communication routing configuration device 500 provided in an embodiment of the present invention. The visual communication routing configuration device 500 can vary significantly due to different configurations or performance characteristics. It may include one or more central processing units (CPUs) 510 (e.g., one or more processors) and a memory 520, and one or more storage media 530 (e.g., one or more mass storage devices) for storing application programs 533 or data 532. The memory 520 and storage media 530 can be temporary or persistent storage. The program stored in the storage media 530 may include one or more modules (not shown in the diagram), each module may include a series of instruction operations on the visual communication routing configuration device 500. Furthermore, the processor 510 may be configured to communicate with the storage media 530 and execute the series of instruction operations in the storage media 530 on the visual communication routing configuration device 500.

[0149] The visualization-based communication routing configuration device 500 may also include one or more power supplies 540, one or more wired or wireless network interfaces 550, one or more input / output interfaces 560, and / or one or more operating systems 531, such as Windows Server, Mac OS X, Unix, Linux, Free BSD, etc. Those skilled in the art will understand that... Figure 5 The illustrated communication routing configuration device structure does not constitute a limitation on the visualization-based communication routing configuration device, which may include more or fewer components than illustrated, or combine certain components, or have different component arrangements.

[0150] The present invention also provides a computer-readable storage medium, which may be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium, wherein the computer-readable storage medium stores instructions that, when the instructions are executed on a computer, cause the computer to perform the steps of the visualized communication routing configuration method.

[0151] In the context of this disclosure, a machine-readable medium can be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, apparatus, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can be, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, 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 devices, magnetic storage devices, or any suitable combination of the foregoing.

[0152] Furthermore, although the operations are described in a specific order, this should be understood as requiring that such operations be performed in the specific order shown or in sequential order, or requiring that all illustrated operations be performed to achieve the desired result. In certain environments, multitasking and parallel processing may be advantageous. Similarly, although several specific implementation details are included in the above discussion, these should not be construed as limiting the scope of this disclosure. Certain features described in the context of individual embodiments may also be implemented in combination in a single implementation. Conversely, various features described in the context of a single implementation may also be implemented individually or in any suitable sub-combination in multiple implementations.

[0153] Although the subject matter has been described using language specific to structural features and / or methodological logic, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. Rather, the specific features and actions described above are merely illustrative examples of implementing the claims.

Claims

1. A visual communication routing configuration method, characterized in that, The visualized communication routing configuration method is applied to the visualized communication routing configuration system, which includes a routing configuration system and a routing verification system. The visualized communication routing configuration method includes the following steps: The routing configuration system receives service selection instructions and displays network types based on these instructions. Receive the network selection instruction corresponding to the network type, and display the element components corresponding to the network selection instruction, wherein the element components include: lines; In the preset configuration interface, the visual drag-and-drop command of the element component is received; When the object of the visual drag-and-drop instruction is a line, it is determined whether the line corresponding to the visual drag-and-drop instruction meets the preset constraint conditions. If the preset constraints are met, the optional parameters of the line corresponding to the visual drag command are displayed, the parameter setting command is received, and the configuration line corresponding to the parameter setting command is generated. When a configuration confirmation instruction is received, it is determined whether all the necessary attributes of the configured element components are not empty; If all necessary attributes are not empty, then a communication topology diagram is generated based on all configured element components, and the communication topology diagram is sent to the routing verification system. The routing verification system receives the communication topology map, performs verification processing on the communication topology map, and generates a verification result; When the verification result is qualified, a configuration list contract is generated based on the communication topology diagram, and the configuration list contract is sent to the routing configuration system; The step of displaying the optional parameters of the line corresponding to the visual drag-and-drop command includes: Based on the preset path recommendation algorithm, the optional parameters are processed by price efficiency calculation to obtain the optimal price efficiency solution corresponding to the optional parameters; Based on the optimal solution for price efficiency, the optional parameters are subjected to optimal coloring to obtain the coloring optional parameters; The text describes the optional coloring parameters for the lines corresponding to the visual drag-and-drop command. The step of calculating the price efficiency of the optional parameters according to the preset path recommendation algorithm to obtain the optimal price efficiency solution for the optional parameters includes: Based on the starting point of the route, an initial price efficiency value is generated; Based on a preset exploration probability formula, the t-th connection node of the next connection after the starting point is selected, where t is a positive integer; Calculate the price efficiency value of the t-th connection node to the starting point of the line; Based on a preset exploration probability formula, select the (t+1)th connection node to be connected to the next connection node of the t-th connection node; Calculate the price efficiency value of the (t+1)th connection node to the tth connection node.

2. The visual communication routing configuration method according to claim 1, characterized in that, The step of determining whether the line corresponding to the visual drag command meets the preset constraints includes: Read the quantity limit of the line corresponding to the visual drag-and-drop command, and determine whether the quantity limit has been reached; If the quantity limit has been reached, the configuration of the line corresponding to the visual drag-and-drop command on the configuration interface will be stopped. If the quantity limit is not met, then based on the element components configured on the configuration interface, physical constraint processing is performed on the line corresponding to the visual drag command to obtain the physically constrained line.

3. The visual communication routing configuration method according to claim 2, characterized in that, The element components include: site, terminal, and access point. The step of performing physical constraint processing on the line corresponding to the visual drag-and-drop command based on the element components configured on the configuration interface to obtain the physically constrained line includes: Read the connection relationships between the stations, terminals, and access points on the configuration interface corresponding to the visual drag-and-drop command; Determine whether the type of the line corresponding to the visual drag-and-drop command matches the connection relationship; If the type matches the connection relationship, then query the optional parameters corresponding to the connection relationship and bind the optional parameters to the line corresponding to the visual drag command.

4. The visual communication routing configuration method according to claim 1, characterized in that, The step of calculating the price efficiency of the optional parameters according to the preset path recommendation algorithm to obtain the optimal price efficiency solution for the optional parameters further includes: When the (t+1)th connecting node is not the end point of the line, the (t+1)th price efficiency value is updated based on the initial price efficiency value to obtain the updated (t+1)th price efficiency value. When the (t+1)th connection node is the end point of the line, the connection distance between the (t+1)th connection node and the starting point of the line is calculated. Based on the connection distance, the (t+1)th price efficiency value is updated to obtain the updated (t+1)th price efficiency value. Based on the updated (t+1)th price efficiency value, the optimal price efficiency solution corresponding to the optional parameters is selected.

5. The visual communication routing configuration method according to claim 4, characterized in that, The step of calculating the price efficiency value corresponding to the (t+1)th connection node to the (t)th connection node includes: Z(t+1) = W(t+1) / S(t+1), where W(t+1) is the network bandwidth from the t-th connection node to the (t+1)-th connection node, S(t+1) is the bandwidth consumption cost from the t-th connection node to the (t+1)-th connection node, and Z(t+1) is the price efficiency value at the (t+1)-th connection node.

6. The visual communication routing configuration method according to claim 4, characterized in that, The step of updating the (t+1)th price efficiency value based on the initial price efficiency value to obtain the updated (t+1)th price efficiency value includes: Z2(t+1)=(1-u)Z1(t+1)+u*Z(0); Where Z2(t+1) is the updated price efficiency value at the (t+1)th t ... The step of updating the (t+1)th price efficiency value based on the connection distance to obtain the updated (t+1)th price efficiency value includes: Z(t+1)=(1-v)Z(t)+ ; =Z(i) / d i ; Among them, the Let Z(i) be the rate of change of the price efficiency value of the i-th connection path, and Z(i) be the price efficiency value of the i-th path. i Z(t) is the distance from the i-th connected node to the (i+1)-th connected node, Z(t) is the updated price efficiency value at the t-th node, Z(t+1) is the updated price efficiency value at the (t+1)-th node, and v is the node switching efficiency decay constant.

7. The visual communication routing configuration method according to claim 4, characterized in that, The step of selecting the (t+1)th connection node of the next connection after the t-th connection node based on the preset exploration probability formula includes: n(t)=1 / d t ; n tl (t)=1 / d tl ; ； Where P(t) is the probability that the t-th connection node connects to the next (t+1)-th connection node. (t) represents the price efficiency value at the t-th node, n(t) is the heuristic parameter for the transmission distance of the t-th connected node, and d t Let be the distance from the t-th connected node to the (t+1)-th connected node, l be the distance from the t-th connected node to any possible connected node l, and R be the set of possible connected nodes. tl (t) represents the price efficiency value of connecting node t to node l, where n is the number of nodes. tl (t) is the heuristic parameter for the transmission distance from the t-th connected node to node l, d tl Let t be the distance from node t to node l, where a and b are constants.

8. A visual communication routing configuration device, characterized in that, The visualized communication routing configuration device includes: a memory and at least one processor, wherein the memory stores instructions, and the memory and the at least one processor are interconnected via a line; The at least one processor invokes the instructions in the memory to cause the visual communication routing configuration device to perform the visual communication routing configuration method as described in any one of claims 1-7.

9. A computer-readable storage medium storing a computer program thereon, characterized in that, When the computer program is executed by the processor, it implements the visual communication routing configuration method as described in any one of claims 1-7.

Images