Dynamic time-sensitive application network routing method and apparatus, storage medium, and electronic device

Abstract

The application discloses a dynamic time-sensitive application network routing method and device, a storage medium and an electronic device, and the method comprises the following steps: in the case that a node application initiates a data request to a center node, the center node determines a candidate path based on a network state matrix model, wherein the node application is a user node mapped on a data plane of a logical network topology of a dynamic time-sensitive application network, and the center node is located on a control plane of the logical network topology; a communication time delay of each candidate path calculated based on a routing metric is used to determine a target path from the candidate path, and a path planning parameter is formed; on the basis of the same time reference, the center node performs quadratic programming on the target path, and forms a shaping configuration parameter; and the center node issues the path planning parameter and the shaping configuration parameter to the node application, so that the node application performs data forwarding based on the target path. The application solves the technical problem of deterministic time delay transmission of time-sensitive applications in a dynamic complex network.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of application network routing planning, in particular to a dynamic time-sensitive application network routing method and device, a storage medium and an electronic equipment. BACKGROUND

[0002] With the rapid development of the Internet industry, different network demands emerge in various fields. The hierarchical structure and protocol of the traditional network, while supporting the successful application of the Internet and mobile Internet, have been unable to meet the special needs of various fields for the network.

[0003] The continuous development of the Internet industry has led to the emergence of data center environments that carry complex application systems, which have put forward higher control granularity and more agile operation and management mode network service requirements. The software-defined network technology SDN, based on the idea of global view, centralized planning, and hierarchical control, provides fine-grained flow control and routing online editing capabilities by building network service center nodes, decoupling network device data and control, and providing flow-based fine-grained flow control and routing online editing capabilities. In addition to optimizing network load traffic, it also improves the efficiency of bandwidth resources and, to some extent, improves the flexibility of network management and the efficiency of network resource use. However, when faced with the low-latency, high-quality network requirements of dynamic time-sensitive applications in dynamic time-sensitive application network environments, the network control strategy and service capabilities of SDN based on flow tables and Openflow / P4 protocols cannot provide deterministic routing planning time for the central control node when the time-sensitive application network topology and node change, thus failing to quickly respond to the transmission and routing requirements of time-sensitive traffic. Therefore, the traditional SDN framework has obvious shortcomings in dealing with dynamic time-sensitive application network scenarios.

[0004] The rapid development of wireless technology has made wireless ad hoc network technology with scalability, self-healing, and automatic configuration capabilities widely used in wireless local area networks and wireless Internet, and has solved the "last mile" problem of user access to the network. Wireless ad hoc network technology is based on the idea of "post-planning" and uses "flood connection, path planning, communication maintenance, and continuous connection" to achieve multi-hop routing communication in a flat or hierarchical network composed of "terminal-router-gateway". To some extent, it solves the problem of beyond-line-of-sight connection, networking, and communication services under the limitation of line-of-sight transmission, while having dynamic network adaptive capabilities. However, when faced with time-sensitive traffic, the passive sensing and adjustment of the routing strategy make it take an uncertain time to reconnect when the node topology and load situation on the original connection path change, causing application communication jitter or even uncertain interval interruption. Therefore, the traditional ad hoc network technology is limited by the complexity of the topology and the load situation of the nodes in the dynamic time-sensitive application network environment, and has insufficient service capabilities for high-quality time-sensitive traffic in dynamic and complex topology network environments.

[0005] With the development of the application of the concept of "Internet +" in vertical industries, more and more industrial applications require the field network to provide a certain end-to-end transmission delay and high-reliability transmission service. Time-sensitive network (TSN) is based on the idea of channel planning and rectifier control. By constructing a global network control node and a time-based channel shaper, all application flow data in the network are uniformly identified, synchronized, managed, controlled and verified to realize delay-based routing planning and accurate frame traffic control, provide application-based time-synchronous periodic traffic shaping and adjustment, seamless redundant data transmission, path reservation and network configuration, and meet the transmission requirements of time-sensitive application traffic under certain conditions. However, the flow identification of the traditional TSN is a complex model training method under stable business relationship, which can provide accurate routing planning and traffic shaping capability for all nodes in the network, but cannot respond to sudden traffic and network node and topology changes, so that once the above situation occurs, technicians need to retrain and configure the entire network model, which causes the dynamic adaptation capability to be unable to meet the sudden time-sensitive application, and the lack of interpretable network service mechanism limits the application scenario.

[0006] At present, no effective solution has been proposed for the above problems. SUMMARY

[0007] The embodiments of the present application provide a dynamic time-sensitive application network routing method, device, storage medium and electronic equipment to at least solve the technical problem of deterministic delay transmission of time-sensitive applications in dynamic complex networks.

[0008] According to an aspect of an embodiment of the present application, a dynamic time-sensitive application network routing method is provided, comprising: in the case that a node application initiates a data request to a center node, the center node determines a candidate path based on a network state matrix model, wherein the node application is a user node on a data plane of a logical network topology mapped by a dynamic time-sensitive application network, and the center node is located on a control plane of the logical network topology; based on the communication delay of each candidate path calculated by the routing metric, a target path is determined from the candidate paths, and a path planning parameter is formed; based on the same time reference, the center node performs quadratic programming on the target path, and forms a shaping configuration parameter; and the center node downlink the path planning parameter and the shaping configuration parameter to the node application, so that the node application performs data forwarding based on the target path.

[0009] Preferably, the node application initiates a data request to the center node, comprising: the node application sends the data request to the center node according to the communication protocol, wherein the data request carries the communication delay requirement and the sending time requirement.

[0010] Preferably, the center node determines the candidate paths based on the network state matrix model, comprising: the center node reads the stored network state matrix model based on the data request, wherein the network state matrix model represents the connectivity state, communication capability and load flow state of the node application.

[0011] Preferably, the path planning parameter is formed in node granularity.

[0012] Preferably, the center node performs secondary planning on the target path based on the same time reference, comprising: the center node performs secondary planning on the traffic distribution, channel selection and traffic shaping of the target path based on the connectionless path planning algorithm and the network state matrix model based on the same time reference.

[0013] Preferably, the shaping configuration parameter is formed in node granularity, and the network state matrix model is updated.

[0014] Preferably, after the center node distributes the path planning parameter and the shaping configuration parameter to the node application, the center node updates the network state matrix model according to the chronological schedule in the case of receiving the configuration feedback data of the node application.

[0015] According to another aspect of the embodiments of the present application, a dynamic time-sensitive application network routing device is further provided, comprising: a candidate path unit, configured to determine candidate paths based on a network state matrix model in the case that a node application initiates a data request to a center node, wherein the node application is a user node mapped on a data plane of a logical network topology of a dynamic time-sensitive application network, and the center node is located on a control plane of the logical network topology; a target path unit, configured to determine a target path from the candidate paths based on the communication delay of each candidate path calculated by a routing metric, and form a path planning parameter; a secondary planning unit, configured to perform secondary planning on the target path based on the same time reference, and form a shaping configuration parameter; and a distribution unit, configured to distribute the path planning parameter and the shaping configuration parameter to the node application by the center node, so that the node application performs data forwarding based on the target path.

[0016] According to still another aspect of the embodiments of the present application, a computer readable storage medium is further provided, and the computer readable storage medium stores a computer program, wherein the computer program is set to execute the dynamic time-sensitive application network routing method when running.

[0017] According to a further aspect of the embodiments of the present application, an electronic device is also provided, which comprises a memory and a processor, wherein the memory stores a computer program, and the processor is configured to execute the dynamic time-sensitive application network routing method by using the computer program.

[0018] In the embodiments of the present application, in the case that a node application initiates a data request to a center node, the center node determines candidate paths based on a network state matrix model, the node application is a user node mapped on a data plane of a logical network topology of a dynamic time-sensitive application network, the center node is located in a control plane of the logical network topology, a communication delay of each candidate path calculated based on a routing metric is used to determine a target path from the candidate paths, and path planning parameters are formed, on the basis of a same time reference, the center node performs quadratic programming on the target path and forms shaping configuration parameters, and the center node sends the path planning parameters and the shaping configuration parameters to the node application, so that the node application forwards data based on the target path. In this way, the complex network topology is described in the form of a matrix model, and a routing metric method mainly based on a communication delay and a path planning method are used, so that the reliability of time-sensitive traffic transmission in a dynamic network environment is improved, the problem of uncertain routing transmission caused by network topology changes in a traditional network management and control process is effectively solved, multi-priority and determined delay transmission services are provided for burst time-sensitive traffic, the purpose of supporting agile construction of upper-layer services of a time-sensitive application network is achieved, and the technical effects of supporting integrated integration and capacity overall use of upper-layer applications are achieved, thereby solving the technical problem of determined delay transmission of time-sensitive applications in a dynamic complex network. BRIEF DESCRIPTION OF DRAWINGS

[0019] The accompanying drawings, which are included to provide a further understanding of the present application and are incorporated in and constitute a part of this application, illustrate embodiments of the present application and serve to explain the present application. In the drawings:

[0020] Figure 1 FIG. 1 is a flowchart of an optional dynamic time-sensitive application network routing method according to an embodiment of the present application;

[0021] Figure 2 FIG. 2 is a schematic diagram of an optional time-sensitive application network architecture according to an embodiment of the present application;

[0022] Figure 3 FIG. 3 is a schematic diagram of an optional network management and control system architecture according to an embodiment of the present application;

[0023] Figure 4is a schematic diagram of an optional load flow data concept according to an embodiment of the application;

[0024] Figure 5 is a schematic diagram of an optional communication latency composition according to an embodiment of the application;

[0025] Figure 6 is a schematic diagram of an optional connectivity path search procedure according to an embodiment of the application;

[0026] Figure 7 is a schematic diagram of an optional dynamic time-sensitive application network routing device according to an embodiment of the application;

[0027] Figure 8 is a schematic diagram of an optional electronic device according to an embodiment of the application. DETAILED DESCRIPTION

[0028] In order to make the persons skilled in the art better understand the application scheme, the technical scheme in the embodiments of the application will be described clearly and completely below in conjunction with the drawings in the embodiments of the application. Obviously, the described embodiments are only a part of the embodiments of the application, rather than all the embodiments. Based on the embodiments in the application, all the other embodiments obtained by the person skilled in the art without creative work should belong to the protection scope of the application.

[0029] It should be noted that the terms "first", "second", and the like in the specification and claims of the application and the above-mentioned drawings are used to distinguish similar objects, and do not necessarily have to be used to describe a specific order or sequence. It should be understood that the data used in this way can be exchanged under appropriate circumstances, so that the embodiments of the application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion, for example, a process, method, system, product or device that includes a series of steps or units does not have to be limited to those steps or units clearly listed, but can include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0030] According to an aspect of an embodiment of the present application, a dynamic time-sensitive application network routing method is provided. The dynamic time-sensitive application network routing method, in a dynamic time-sensitive application network environment, under the demand of time-sensitive applications for stable, reliable, and on-demand network services provided by a network management system, on the basis of software-defined network technology (SDN), referring to wireless ad hoc network (AD HoC), wireless mesh network (Mesh), time-sensitive network (TSN) routing strategy, and network quality of service (QoS) evaluation method, using the separation of SDN data plane and control plane, the idea of TSN flow control, starting from the perspective of overall planning, integrating a network state matrix model, and combining communication delay-based routing metrics, the dynamic time-sensitive application network routing method realizes layer-by-layer path planning for connectionless switching.

[0031] As an optional implementation, as shown in Figure 1 The dynamic time-sensitive application network routing method includes the following steps.

[0032] In S102, in a case where a node application initiates a data request to a center node, the center node determines a candidate path based on a network state matrix model, wherein the node application is a user node mapped on a data plane of a logical network topology of a dynamic time-sensitive application network, and the center node is located on a control plane of the logical network topology.

[0033] In S104, a communication delay of each candidate path calculated based on a routing metric is used to determine a target path from the candidate paths, and a path planning parameter is formed.

[0034] In S106, the center node performs secondary planning on the target path based on the same time reference, and a shaping configuration parameter is formed.

[0035] In S108, the center node issues the path planning parameter and the shaping configuration parameter to the node application, so that the node application performs data forwarding based on the target path.

[0036] Optionally, the network state matrix model decouples the routing elements of a destination address, a network mask, a priority, a next-hop address, an output interface, and a routing metric in a traditional routing table, constructs a global connection matrix in a matrix manner, and forms a description of the global network state by supplementing a node communication model, a load model, and a delay model.

[0037] Optionally, the delay-based routing metric method takes delay as the main standard, calculates the delay of a transmission, propagation, and processing process, forms a delay-based metric method for each route, supports subsequent path planning, and thus adapts to the high-quality and time-sensitive network service demand of time-sensitive applications.

[0038] As an optional implementation, the node application initiates a data request to the center node, comprising: the node application sends the data request to the center node according to the communication protocol, wherein the data request carries the communication delay requirement and the sending time requirement.

[0039] As an optional implementation, the center node determines the candidate path based on the network state matrix model, comprising: the center node reads the stored network state matrix model based on the data request, wherein the network state matrix model represents the connectivity state, the communication capability and the load flow state of the node application.

[0040] As an optional implementation, the path planning parameter is formed, comprising: the path planning parameter is formed at the node granularity.

[0041] As an optional implementation, the center node performs secondary planning on the target path based on the same time reference, comprising: the center node performs secondary planning on the traffic allocation, the channel selection and the traffic shaping of the target path based on the network state matrix model according to the connectionless path planning algorithm based on the same time.

[0042] Optionally, based on the connectionless exchange-oriented path planning algorithm, in order to solve the problem that the existing path planning method cannot meet the high-quality and time-sensitive network service demand of time-sensitive applications in a dynamic network environment, a communication delay-based routing metric method based on a network state matrix model is combined with a connectionless flow data unpacking method to form a connectionless exchange-oriented path scheduling table which is sent to each node, thereby realizing on-demand routing of traffic between nodes.

[0043] Optionally, based on the network management and control system architecture for dynamic time-sensitive application networks, based on the network controller deployment architecture under the SDN control plane and data platform layer, combined with the characteristics of dynamic time-sensitive application network environment, a controller function and deployment architecture that meets the application scenario and has redundancy capability are designed, thereby realizing dynamic routing management and control and node collaboration in a dynamic time-sensitive application network environment.

[0044] As an optional implementation, the shaping configuration parameter is formed, comprising: the shaping configuration parameter is formed at the node granularity, and the network state matrix model is updated.

[0045] As an optional implementation, after the center node sends the path planning parameter and the shaping configuration parameter to the node application, the center node further updates the network state matrix model according to the sequence time schedule in the case that the center node receives the configuration feedback data of the node application.

[0046] In the embodiments of the present application, the dynamic time-sensitive application network routing method, under the background of SDN and P4 technology, refers to the Mesh and TSN technical methods, describes the complex network topology in a matrix model, optimizes the network state sensing mechanism, and at the same time, matches the routing metric method mainly based on communication delay and the path planning method for connectionless switching, improves the network resource utilization and the dynamic adaptability of the topology, solves the deterministic delay transmission problem of time-sensitive applications in dynamic complex networks, provides resilient, agile and high-quality network services for various distributed applications, and supports integrated integration and capacity planning of upper-layer applications.

[0047] The dynamic time-sensitive application network is not limited to a special network for transmitting time-sensitive and periodic data, which is composed of various sensors as nodes and connected through wired and wireless communication devices. The dynamic nature refers to the situation that the nodes access or exit the network and the source and destination addresses of the traffic are random.

[0048] The above-mentioned dynamic time-sensitive application network routing method is based on SDN and follows the "center" principle. Based on certain constraints, the nodes in good communication with each node in the network are selected as center nodes, and the physical network topology is associated and mapped to the logical layer. In the logical network topology, it is abstracted as a two-layer structure, in which the high-level nodes determined as "center nodes" are located in the control plane and undertake decision planning and network control functions, and the remaining nodes are located in the data plane and undertake data forwarding and traffic shaping functions. The network architecture of the dynamic time-sensitive application network is not limited to that shown in Figure 2 .

[0049] In Figure 2 , the nodes in the physical network topology are asymmetrically linked in a mesh, the center node (node 5) abstracted in the logical network topology is located in the control plane, and the network control service system is deployed, the remaining nodes are located in the data plane, and the switching and shaping software is deployed, the nodes in the two planes are connected with limited hops, and the bandwidth-adaptive collection mechanism is selected to ensure the perception of the control plane to the connectivity and load state of the data plane nodes, to support the routing planning and data flow shaping of the data platform nodes, and to provide stable and reliable network services for different upper-layer applications to meet their network service quality requirements.

[0050] The overall architecture of the network control system is not limited to that shown in Figure 3The control plane is provided with a planning layer and a management and control layer, and the data plane is provided with a switching layer and a rectifying layer. The rectifying layer interacts with specific applications, and the specific applications send application data to the rectifying layer and receive the chronological state of the rectifying layer. The rectifying layer sends the data queue to the gate-controlled switching circuit of the switching layer through a shaper. The gate-controlled switching circuit is connected between communication devices through a communication bus. The communication devices send traffic and device data to the data collection of the management and control layer. The data collection forwards the traffic and device information to the network state update of the planning layer. The network state update and the traffic shaping and path planning transmit network state data. The traffic shaping and path planning send the path to the path distribution of the management and control layer and send the traffic shaping to the shaping configuration distribution. The path distribution sends the P4 protocol to the gate-controlled switching circuit, and the shaping configuration distribution sends the XML protocol to the Netconf agent end. The Netconf agent end sends the configuration file to the shaping configuration script analysis.

[0051] Specifically, the network state matrix model is exemplified. The time-sensitive application network state includes network topology node connectivity state, communication capability and load flow state. The node connectivity state is a description of the communication connectivity state between nodes. The single and double channel between nodes, wired and wireless mode and potential communication attenuation and interference factors are considered. The dynamic access and exit of network nodes are combined. The network node connectivity and bandwidth are objectively described. The linear expansion and routing traversal capability are provided. The connectivity of n nodes in the network is represented by a matrix L. The connectivity state of the network node is defined as an n x n matrix L = (a i，j ), wherein:

[0052] (1) a i，j = 1, indicating that node i can receive communication data from node j;

[0053] (2) a i，j = 0, indicating that node i cannot receive communication data from node j.

[0054] Then, the i row of the connectivity state matrix L represents the one-way connectivity of the remaining n nodes with node i, and the j column of the connectivity state matrix L represents the connectivity of node j with the remaining n nodes.

[0055] The communication capability is a quantitative and objective description of the maximum data transmission capability of different types of communication devices in the node. The data plane node reports to the control plane node once after entering the network according to the pre-agreed communication device model code. The control plane node associates the communication bandwidth of each node in the data plane based on the implemented communication device capability index database of each type to form an m x k matrix S n = {s m，k}, wherein S m，kThis represents the k-th capability indicator of the m-th communication device at node n. Capability indicators include, but are not limited to, communication type, power, bandwidth, frequency modulation, anti-interference, attenuation, and rectification.

[0056] Load flow state is a quantitative description of the period and corresponding duty cycle of the load data flow of each communication device in the data plane node in the current and future period. It is formed by the control plane node based on the planned and effective time-sensitive traffic, on a per-communication-device / channel basis, by traversing the data flow allocated to that communication device / channel to form an m-dimensional data set C. n ={c1, ..., c m} and c m ×3 matrix Used to describe the changes in the time-sensitive load flow state of this node over a future period of time, where:

[0057] (1)c m This represents the number of load data streams of the m-th communication device at node n;

[0058] (2) This indicates that the m-th communication device is currently at the c-th position. m The termination time T (year, month, day, hour, minute, second, millisecond, microsecond) of each data stream;

[0059] (3) This indicates that the m-th communication device is currently at the c-th position. m The periodicity t (seconds, milliseconds, microseconds) of each data stream;

[0060] (4) This indicates that the m-th communication device is currently at the c-th position. m Duty cycle of each data stream.

[0061] The related load flow data concept diagram is not limited to... Figure 4 It should be noted that the data of each load stream transmitted on the same communication device must simultaneously satisfy the channel idle and existing load stream period constraints.

[0062] Channel idle constraint refers to the channel idle time Cit of communication device m. m It must be greater than the transmission time of the newly added load stream data at that channel baud rate, and is not limited to being expressed as: Among them, BPS m Let D be the effective baud rate of the communication device m. f Periodically transmit data for newly added load stream data.

[0063] Existing load stream period constraints are further divided into absolute constraints and relative constraints. An absolute constraint on existing load stream periods means that the period of the largest period of load stream data transmitted on the same channel must be an integer multiple of the periods of other load stream data, and is not limited to being expressed as:

[0064] The existing relative constraint on load stream cycle refers to the theoretical maximum number of frames that can be transmitted for load stream data that does not meet the absolute constraint on cycle. These two principles are sufficient conditions to support connectionless data exchange routing.

[0065] Routing metrics are not limited to network devices at any node in the network; they represent the network cost required to transmit application traffic to the target node and are a key factor supporting optimal routing.

[0066] Since application scenarios primarily demand deterministic, reliable, and low-jitter transmission of time-sensitive traffic, with transmission latency being a key performance indicator, latency is used as the primary routing metric to support path selection for dynamic, time-sensitive network application traffic. Considering the unpredictability of data flows generated by time-sensitive applications, the network latency ΔT of data flow f is... f It can be determined by the communication delay ΔT f1 With service delay ΔT f2 It consists of two parts, and is not limited to being represented as: ΔT f =ΔT f1 +ΔT f2 .

[0067] Since communication latency is mainly affected by the nodes through which the data stream passes, we first analyze the transmission structure of similar communication devices between two nodes in the network. The latency composition of point-to-point communication is not limited to... Figure 5 As shown.

[0068] Depend on Figure 5 It can be seen that latency consists of four types: transmission latency, propagation latency, processing latency, and queuing latency, which can be expressed by the following formula: in:

[0069] Transmission delay refers to the time required for a data block to enter the transmission medium from the node when sending data. In other words, it's the total time from the start of a station sending a data frame to the completion of the data frame transmission (or the total time required for a receiving station to receive a data frame). It is determined by the length of the transmitted data frame and the bandwidth of the communication equipment. The formula is not limited to the following:

[0070] Processing delay refers to the time taken by the communication device to process the application data after it enters the communication device, such as packet decomposition, protocol separation, data extraction, error checking and routing, etc. It is determined by the internal computing power and software design of the communication device, and is related to the data displacement caused by the specific communication device and rectification. The data formula is not limited to: Δt1=ε m +g m (s m，k ), where g m (s m，k ) is the data displacement delay caused by data rectification;

[0071] Queuing delay refers to the time from entering to starting transmission due to the failure of sending data to send into the sending buffer. It is affected by the buffer size, queued data volume and communication bandwidth of the communication device. The data formula is not limited to:

[0072] Propagation delay refers to the time taken by electromagnetic signals or optical signals to travel a certain distance in the transmission medium, i.e. the total time from the start of data transmission at the sending end to the reception of data at the receiving end (or from the sending of an acknowledgement frame at the receiving end to the reception of the acknowledgement frame at the sending end). It is determined by the communication method, medium and distance. The data formula is not limited to:

[0073] Considering the propagation delay as a fraction, when there is a rectification device in the data plane node, the queuing delay problem can be composed of transmission delay and processing delay, so the communication delay between nodes is not limited to: Then the communication delay of data flow f can be represented as: Where R f ={x j} is the data set of data flow f passing through the path planning node.

[0074] Regarding service delay, it can be understood as the communication delay of each data node to the center node in the non-delay state. Considering that this delay is the highest priority in the whole network, it is not limited to be considered as a constant ε. Based on the above analysis, the transmission delay ΔT f of a certain indivisible data flow f in the network can be obtained by combining the network state data, which is a deterministic delay.

[0075] The path planning algorithm for connectionless switching is based on the concept of connectionless switching in classic TCP / IP network. Based on the potential communication path, according to the state of each path node and the routing metric method, the series of algorithms are used to split and aggregate the time-sensitive application data flow to adapt to the topology and load status of the communication network.

[0076] For the acquisition of communication path, according to the corresponding communication state matrix L m =(ai，j ), from the source node P s , according to the flow as shown in Figure 6 , records the node position, reads the node connectivity data, returns to the upper node in the case of judging that the node has been traversed, and loops to record the node position. In the case of judging that the node has not been traversed, it is judged whether it is the destination node, in the case of judging that it is not, it enters the lower node, and loops to record the node position. In the case of judging that it is the destination node, the path node information is reserved to the path node combination, and it is judged whether the traversal is completed. If the judgment is yes, it returns all the path sets.

[0077] The potential connectivity path matrix R m = {r i，j} of the model-based communication equipment is obtained, where r i，j records the node number of the jth hop of the ith path. According to the above flow, the connectivity path matrices of various types of communication equipment are obtained in turn. For the splitting of the time-sensitive application data stream, the channel idle and the communication cycle constraint are taken as the splitting principle. Based on the formed connectivity path matrices of various types of communication equipment, the time delay satisfying condition and the data splitting strategy are determined from the broadband equipment to the narrowband equipment in the granularity of the communication equipment type on the basis of the application constraint time delay, and finally the data stream path planning is formed. The relevant planning data is synchronized to the network state database of the center node to form the path node next hop routing, rectification and data summary splitting configuration, and to guide the time-sensitive application flow to route on demand.

[0078] It should be noted that, for the foregoing method embodiments, in order to simply describe, they are all expressed as a series of action combinations, but those skilled in the art should know that the present application is not limited by the action sequence described, because according to the present application, certain steps can be performed in other sequences or simultaneously. Secondly, those skilled in the art should know that the embodiments described in the specification all belong to preferred embodiments, and the actions and modules involved are not necessarily necessary for the present application.

[0079] According to another aspect of the embodiment of the present application, a dynamic time-sensitive application network routing device for implementing the above-mentioned dynamic time-sensitive application network routing method is also provided. As shown in Figure 7 , the device comprises:

[0080] The candidate path unit 702 is configured to determine a candidate path based on a network state matrix model in the case that a node application initiates a data request to a center node, where the node application is a user node mapped on a data plane of a logical network topology by a dynamic time-sensitive application network, and the center node is located on a control plane of the logical network topology.

[0081] The target path unit 704 is configured to determine a target path from the candidate paths based on the communication delay of each candidate path calculated by the routing metric calculation unit, and form a path planning parameter;

[0082] The quadratic programming unit 706 is configured to perform quadratic programming on the target path by the central node based on the same time reference, and form a shaping configuration parameter;

[0083] The issuing unit 708 is configured to issue the path planning parameter and the shaping configuration parameter to the node application by the central node, so that the node application performs data forwarding based on the target path.

[0084] Optionally, the candidate path unit 702 initiates a data request to the central node by the node application, including that the node application sends the data request to the central node according to a communication protocol, wherein the data request carries a communication delay requirement and a sending time requirement.

[0085] Optionally, the candidate path unit 702 determines the candidate path based on a network state matrix model by the central node, including that the central node reads the stored network state matrix model based on the data request, wherein the network state matrix model represents the connectivity state, the communication capability and the load flow state of the node application.

[0086] Optionally, the target path unit 704 forms the path planning parameter, including that the path planning parameter is formed in a node granularity.

[0087] Optionally, the quadratic programming unit 706 performs quadratic programming on the target path by the central node based on the same time reference, including that the central node performs quadratic programming on the traffic distribution, the channel selection and the traffic shaping of the target path based on a connectionless path planning algorithm and the network state matrix model based on the same time.

[0088] Optionally, the quadratic programming unit 706 forms the shaping configuration parameter, including that the shaping configuration parameter is formed in a node granularity, and the network state matrix model is updated.

[0089] Optionally, the dynamic time-sensitive application network routing device further includes an updating unit configured to update the network state matrix model according to a sequential schedule by the central node after the path planning parameter and the shaping configuration parameter are issued to the node application by the central node, and in a case that configuration feedback data of the node application is received.

[0090] In the embodiment of the present application, in the case that a node application initiates a data request to a center node, the center node determines a candidate path based on a network state matrix model, the node application is a user node mapped on a data plane of a logical network topology of a dynamic time-sensitive application network, the center node is located on a control plane of the logical network topology, a communication delay of each candidate path calculated based on a routing metric is used to determine a target path from the candidate paths, and path planning parameters are formed. On the basis of the same time reference, the center node performs quadratic programming on the target path and forms shaping configuration parameters. The center node sends the path planning parameters and the shaping configuration parameters to the node application, so that the node application forwards data based on the target path. In this way, the complex network topology is described in the form of a matrix model, and a routing metric method and a path planning method mainly based on a communication delay are used. On the one hand, the reliability of time-sensitive traffic transmission in a dynamic network environment is improved, and the problem of uncertain routing transmission caused by network topology changes in a traditional network management process is effectively solved. On the other hand, multi-priority and determined delay transmission services are provided for burst time-sensitive traffic, so as to support agile construction of an upper-layer service of a time-sensitive application network, thereby realizing routing dynamic management and node cooperation in a dynamic time-sensitive application network environment, improving time-sensitive traffic processing capability and communication efficiency in the network environment, providing a resilient, agile, and high-quality network service for various distributed applications, supporting integrated integration and capability overall use of an upper-layer application, and further solving the technical problem of determined delay transmission of a time-sensitive application in a dynamic complex network.

[0091] According to still another aspect of the embodiment of the present application, an electronic device for implementing the above-described dynamic time-sensitive application network routing method is also provided, which can be a terminal device or a server. As shown in Figure 8 the electronic device includes a memory 802 in which a computer program is stored and a processor 804 configured to execute steps in any of the method embodiments described above by using the computer program.

[0092] Optionally, in the embodiment, the electronic device described above can be located in at least one of a plurality of network devices of a computer network.

[0093] Optionally, in the embodiment, the processor can be configured to execute the following steps by using the computer program:

[0094] S1, in the case that a node application initiates a data request to a center node, the center node determines a candidate path based on a network state matrix model, wherein the node application is a user node mapped on a data plane of a logical network topology of a dynamic time-sensitive application network, and the center node is located on a control plane of the logical network topology.

[0095] S2, based on the communication latency of each candidate path calculated by the routing metric, determines the target path from the candidate paths and forms path planning parameters;

[0096] S3, based on the same time reference, the central node performs secondary planning on the target path and forms integer configuration parameters;

[0097] S4, the central node sends the path planning parameters and shaping configuration parameters to the node applications so that the node applications can forward data based on the target path.

[0098] Alternatively, as those skilled in the art will understand, Figure 8 The structure shown is for illustrative purposes only; the electronic device can be any terminal device. Figure 8 This does not limit the structure of the aforementioned electronic devices. For example, the electronic device may also include components that are more... Figure 8 The more or fewer components shown (such as network interfaces, etc.), or having the same Figure 8 The different configurations shown.

[0099] The memory 802 can be used to store software programs and modules, such as the program instructions / modules corresponding to the monitoring method and device for intelligent devices in this embodiment of the invention. The processor 804 executes various functional applications and data processing by running the software programs and modules stored in the memory 802, thereby realizing the aforementioned dynamic time-sensitive application network routing method. The memory 802 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 802 may further include memory remotely located relative to the processor 804, and these remote memories can be connected to the terminal via a network. Examples of the aforementioned networks include, but are not limited to, the Internet, enterprise intranets, local area networks, mobile communication networks, and combinations thereof. Specifically, the memory 802 may be used, but is not limited to, to store information such as network state matrix models, candidate paths, target paths, path planning parameters, and shaping configuration parameters. As an example, such as... Figure 8 As shown, the memory 802 may include, but is not limited to, the operation unit 602 and the establishment unit 604 of the dynamic time-sensitive application network routing device. Furthermore, it may include, but is not limited to, other module units of the dynamic time-sensitive application network routing device, which will not be described in detail in this example.

[0100] Optionally, the transmission device 806 is configured to receive or send data via a network. Examples of the network include a wired network and a wireless network. In an example, the transmission device 806 includes a network interface controller (NIC) which can be connected to other network devices and routers through a network cable to communicate with the Internet or a local area network. In an example, the transmission device 806 is a radio frequency (RF) module which is configured to communicate with the Internet in a wireless manner.

[0101] In addition, the electronic device further includes a display 808 configured to display the target path, and a connection bus 810 configured to connect various module components in the electronic device.

[0102] In other embodiments, the terminal device or the server can be a node in a distributed system, and the distributed system can be a blockchain system formed by the plurality of nodes connected through network communication. The nodes can form a peer-to-peer (P2P) network, and any computing device such as a server, a terminal, or other electronic device can become a node in the blockchain system by joining the P2P network.

[0103] According to an aspect of the present application, a computer program product or computer program is provided, which includes computer instructions stored in a computer readable storage medium. A processor of a computer device reads the computer instructions from the computer readable storage medium, and the processor executes the computer instructions to enable the computer device to perform the method provided in any of the various optional implementations of the dynamic time-sensitive application network routing aspect. The computer program is configured to execute the steps in any of the method embodiments when executed.

[0104] Optionally, in the present embodiment, the computer readable storage medium can be configured to store a computer program for executing the following steps:

[0105] S1, in the case where a node application initiates a data request to a center node, the center node determines a candidate path based on a network state matrix model, wherein the node application is a user node mapped on a data plane of a logical network topology of a dynamic time-sensitive application network, and the center node is located on a control plane of the logical network topology;

[0106] S2, determining a target path from the candidate paths based on a communication delay of each candidate path calculated by the routing metric, and forming a path planning parameter;

[0107] S3, on the basis of the same time reference, the center node performs quadratic programming on the target path, and forms a shaping configuration parameter;

[0108] S4, the center node sends the path planning parameter and the shaping configuration parameter to the node application, so that the node application forwards data based on the target path.

[0109] Optionally, in the embodiment, those skilled in the art can understand that all or part of the steps in the various methods of the above-mentioned embodiments can be completed by instructing the hardware related to the terminal device through a program, and the program can be stored in a computer readable storage medium, and the storage medium can include a flash disk, a read-only memory (Read-Only Memory, ROM), a random access memory (Random Access Memory, RAM), a magnetic disk or an optical disk, etc.

[0110] The serial numbers of the above-mentioned embodiments of the application are only for description, not representing the advantages and disadvantages of the embodiments.

[0111] The integrated units in the above-mentioned embodiments, if realized in the form of software function units and sold or used as independent products, can be stored in the above-mentioned computer readable storage medium. Based on such understanding, the technical solutions of the application or the whole or part of the technical solutions that essentially contribute to the prior art can be embodied in the form of software products, and the computer software product is stored in the storage medium, including a plurality of instructions for causing one or more computer devices (which can be personal computers, servers or network devices, etc.) to execute all or part of the steps of the methods described in various embodiments of the application.

[0112] In the above-mentioned embodiments of the application, the description of each embodiment has its own emphasis, and the parts not described in detail in a certain embodiment can be referred to the related description of other embodiments.

[0113] In several embodiments provided in the present application, it should be understood that the disclosed client can be implemented by other ways. Among them, the above-mentioned device embodiments are only schematic, for example, the division of the units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the displayed or discussed each other can be through some interface, indirect coupling or communication connection between units or modules, which can be electrical or other forms.

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

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

[0116] The above is only the preferred embodiment of the present application, and it should be pointed out that for ordinary skilled in the art, without departing from the principles of the present application, a number of improvements and refinements can be made, and these improvements and refinements should be considered as the protection scope of the present application.

Claims

1. A dynamic time-sensitive application network routing method, characterized in that, include: When a node application initiates a data request to the central node, the central node determines a candidate path based on the network state matrix model. The node application is a user node that is dynamically mapped to the data plane of the logical network topology in a time-sensitive application network. The central node is located in the control plane of the logical network topology. Based on the communication latency of each candidate path calculated using routing metrics, the target path is determined from the candidate paths, and path planning parameters are formed at the node granularity. Based on the same time reference, the central node performs secondary planning on the target path and forms integer configuration parameters, including: the central node performs secondary planning on the traffic allocation, channel selection and traffic shaping of the target path based on the connectionless path planning algorithm and the network state matrix model, on the same time reference, to form the integer configuration parameters at the node granularity and update the network state matrix model; The central node sends the path planning parameters and the shaping configuration parameters to the node application, so that the node application can forward data based on the target path.

2. The method according to claim 1, characterized in that, The node application initiates a data request to the central node, including: The node application sends the data request to the central node according to the communication protocol, wherein the data request carries communication latency requirements and transmission time requirements.

3. The method according to claim 1, characterized in that, The central node determines candidate paths based on a network state matrix model, including: The central node reads the stored network state matrix model based on the data request, wherein the network state matrix model represents the connectivity status, communication capabilities, and load flow of the node application.

4. The method according to claim 1, characterized in that, After the central node sends the path planning parameters and the shaping configuration parameters to the node application, the process further includes: Upon receiving configuration feedback data from the node application, the central node updates the network state matrix model according to the chronological progress.

5. A dynamic time-sensitive application network routing device, characterized in that, include: A candidate path unit is used to determine a candidate path based on a network state matrix model when a node application initiates a data request to the central node. The node application is a user node that is dynamically mapped to the data plane of the logical network topology in a time-sensitive application network. The central node is located in the control plane of the logical network topology. The target path unit is used to determine the target path from the candidate paths based on the communication latency calculated based on the routing metric, and to form path planning parameters at the node granularity. The secondary planning unit is used to perform secondary planning on the target path by the central node based on the same time reference, and form the integer configuration parameters. The central node performs secondary planning on the traffic allocation, channel selection and traffic shaping of the target path based on the connectionless path planning algorithm and the network state matrix model, on the same time reference, to form the integer configuration parameters at the node granularity, and update the network state matrix model. The distribution unit is used by the central node to distribute the path planning parameters and the shaping configuration parameters to the node application, so that the node application can forward data based on the target path.

6. A computer-readable storage medium, characterized in that, The computer-readable storage medium includes a stored program, wherein the program, when executed, performs the method described in any one of claims 1 to 4.

7. An electronic device comprising a memory and a processor, characterized in that, The memory stores a computer program, and the processor is configured to execute the method described in any one of claims 1 to 4 through the computer program.

Images