A deterministic transmission method, system, device and medium across a wide area

Abstract

The present invention discloses a cross-wide-area deterministic transmission method, system, device and medium. The method includes: when receiving a service flow transmission request sent by a service flow source end through a network control system, generating corresponding configuration information and sending the configuration information to a network bearing system; wherein, the service flow transmission request carries a service flow arrival curve and a service flow end-to-end delay constraint condition; through the network bearing system, generating a corresponding deterministic transmission channel according to the configuration information, so that the service flow source end sends the service flow to the service flow destination end through the deterministic transmission channel. This embodiment solves the problems of complex node structure, high resource allocation complexity and unfavorable large-scale deployment in the prior art, ensures that the transmission delay and jitter between end-to-end have upper bounds, and has the characteristics of wide application range, low node function complexity and simple and convenient configuration.

Description

Technical Field

[0001] The present invention relates to the field of network technologies, and in particular, to a method, system, device, and medium for deterministic transmission across wide areas. Background Art

[0002] Traditional communication networks adopt a "best effort" forwarding mechanism during transmission. Due to the complex network topology, there are micro-burst phenomena at the egress of devices. Traditional networks cannot provide deterministic transmission quality, that is, end-to-end delay and jitter are uncontrollable and unstable, and there is an obvious long-tail effect in the delay distribution. Here, the "end-to-end delay" is defined as: the complete time period (t2 - t1) between the moment (t1) when the traffic flow is sent from the user source end and the moment (t2) when the traffic flow reaches the user destination end. However, with the rapid development of future network services, more and more services require end-to-end deterministic service quality guarantee, such as time-sensitive new Internet applications like remote surgery and cloud-based Programmable Logic Controller (PLC).

[0003] Current mainstream deterministic network technologies include: Time-Sensitive Networking (TSN) for layer 2 and Deterministic Networking (DetNet) for layer 3. The former focuses on the deterministic transmission problem at the local area network level (network hop count less than 7 hops); the latter focuses on ensuring deterministic transmission quality at the backbone network level, providing deterministic transmission between PE nodes in the backbone network. For time-sensitive Internet applications, the entire end-to-end transmission process (involving processes such as local area network aggregation and backbone network transmission) needs to be considered, so a transmission mechanism across wide areas needs to be studied.

[0004] Currently, there is no mature solution for the scenario of deterministic transmission across wide areas. Some researchers simplify the backbone network transmission process into a lossless link or switch with a specific delay, use the TSN forwarding mechanism (such as CQF, TAS, etc.) in the local area network, and configure the TSN gateway forwarding table according to the abstract delay of the backbone network lossless link model to achieve end-to-end deterministic transmission. Some researchers combine the TSN and DetNet mechanisms, use the TSN mechanism in the local area network, and use the DetNet mechanism's backbone network to connect multiple TSN local area networks. Using the end-to-end deterministic transmission mechanism based on time slots, deploy cyclic time slot mapping based on supercycles and edge shaping based on first-hop bias at the network edge to achieve seamless deterministic transmission across wide areas. Summary of the Invention

[0005] The present invention provides a method, system, device and medium for deterministic transmission across a wide area, ensuring that the transmission delay and jitter between end-to-end are both bounded, and having the characteristics of wide application range, low complexity of node functions and simple and convenient configuration.

[0006] According to one aspect of the present invention, there is provided a method for deterministic transmission across a wide area, which is executed by a deterministic transmission system across a wide area. The deterministic transmission system includes: an end system, a network control system and a network bearer system; wherein, the end system includes: a service flow source end and a service flow destination end; the method includes:

[0007] When receiving a service flow transmission request sent by the service flow source end through the network control system, generating corresponding configuration information and sending the configuration information to the network bearer system; wherein, the service flow transmission request carries a service flow arrival curve and a service flow end-to-end delay constraint condition; the configuration information includes: a target transmission path and edge node shaping parameters;

[0008] Through the network bearer system, generating a corresponding deterministic transmission channel according to the configuration information, so that the service flow source end sends a service flow to the service flow destination end through the deterministic transmission channel.

[0009] According to another aspect of the present invention, there is provided a deterministic transmission system across a wide area, including: an end system, a network bearer system and a network control system; wherein, the end system includes: a service flow source end and a service flow destination end;

[0010] Wherein, the network control system is configured to generate corresponding configuration information when receiving a service flow transmission request sent by the service flow source end, and send the configuration information to the network bearer system; wherein, the service flow transmission request carries a service flow arrival curve and a service flow end-to-end delay constraint condition; the configuration information includes: a target transmission path and edge node shaping parameters;

[0011] The network bearer system is configured to generate a corresponding deterministic transmission channel according to the configuration information, so that the service flow source end sends a service flow to the service flow destination end through the deterministic transmission channel.

[0012] According to another aspect of the present invention, there is provided an electronic device, the electronic device includes:

[0013] At least one processor; and

[0014] A memory communicatively connected to the at least one processor; wherein,

[0015] The memory stores a computer program executable by the at least one processor. When executed by the at least one processor, the computer program enables the at least one processor to execute the cross-wide area deterministic transmission method according to any embodiment of the present invention.

[0016] According to another aspect of the present invention, there is provided a computer-readable storage medium storing computer instructions for causing a processor to implement the cross-wide area deterministic transmission method according to any embodiment of the present invention when executed.

[0017] The technical solution of the embodiment of the present invention allocates a target transmission path and edge node shaping parameters for each service flow according to the service flow arrival curve and the service flow end-to-end delay constraint condition, so that the network bears a corresponding deterministic transmission channel generated according to the target transmission path and the edge node shaping parameters, so that the service flow source end transmits the service flow to be transmitted to the service flow destination end through the deterministic transmission channel, solving the problems of complex node structure, high resource allocation complexity and unfavorable large-scale deployment in the prior art, ensuring that the transmission delay and jitter between end-to-end have upper bounds, and having the characteristics of wide application range, low node function complexity and simple and convenient configuration.

[0018] It should be understood that the content described in this part is not intended to identify the key or important features of the embodiments of the present invention, nor is it used to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. Description of the Drawings

[0019] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present invention, and those of ordinary skill in the art can obtain other drawings without creative efforts based on these drawings.

[0020] Figure 1 is a flowchart of a cross-wide area deterministic transmission method provided by an embodiment of the present invention;

[0021] Figure 2 is a structural block diagram of a cross-wide area deterministic transmission system provided by an embodiment of the present invention;

[0022] Figure 3 is a flowchart of another cross-wide area deterministic transmission method provided by an embodiment of the present invention;

[0023] Figure 4 is a flowchart of yet another cross-wide area deterministic transmission method provided by an embodiment of the present invention;

[0024] Figure 5 It is a schematic structural diagram of another cross-wide-area deterministic transmission system provided by an embodiment of the present invention;

[0025] Figure 6 It is a cross-wide-area end-to-end deterministic network architecture diagram provided by an embodiment of the present invention;

[0026] Figure 7 It is a cross-wide-area end-to-end deterministic transmission scenario diagram provided by an embodiment of the present invention;

[0027] Figure 8 It is a schematic structural diagram of an electronic device provided by an embodiment of the present invention. Detailed implementation manners

[0028] In order to enable those skilled in the art to better understand the solution of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0029] It should be noted that the terms "source end", "destination end", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and do not have to be used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged under appropriate circumstances, so that the embodiments of the present invention described here can be implemented in an order different from those illustrated or described here. In addition, the terms "including" and "having" 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 may include other steps or units not clearly listed or inherent to these processes, methods, products or devices.

[0030] In one embodiment, Figure 1 It is a flowchart of a cross-wide-area deterministic transmission method provided by an embodiment of the present invention. This embodiment is applicable to the situation of providing a cross-wide-area end-to-end transmission with a deterministic quality of service. This method can be executed by a cross-wide-area deterministic transmission system. The cross-wide-area deterministic transmission system can be implemented in the form of hardware and / or software, and the cross-wide-area deterministic transmission system can be configured in an electronic device. Exemplarily, the electronic device can be a device such as a terminal or a server.

[0031] Figure 2 It is a structural block diagram of a cross-wide-area deterministic transmission system provided by an embodiment of the present invention. As Figure 2As shown, the deterministic transmission system includes: an end system 210, a network bearer system 220, and a network control system 230; among them, the end system 210 includes: a traffic source end 2101 and a traffic destination end 2102;

[0032] Among them, the network control system 230 is used to generate corresponding configuration information when receiving a traffic transmission request sent by the traffic source end 2101, and send the configuration information to the network bearer system 220; among them, the traffic transmission request carries a traffic arrival curve and a traffic end-to-end delay constraint condition;

[0033] The network bearer system 220 is used to generate a corresponding deterministic transmission channel according to the configuration information, so that the traffic source end 2101 sends traffic to the traffic destination end 2102 through the deterministic transmission channel.

[0034] As Figure 1 shown, the method includes:

[0035] S110. When receiving a traffic transmission request sent by the traffic source end through the network control system, generate corresponding configuration information and send the configuration information to the network bearer system.

[0036] Among them, the traffic transmission request carries a traffic arrival curve and a traffic end-to-end delay constraint condition. In the embodiment, the traffic arrival curve is used to describe the traffic flow model and characterize the traffic characteristics; the traffic end-to-end delay constraint condition is used to represent the upper bound requirement of the traffic delay to ensure that the end-to-end transmission delay of the traffic has an upper bound.

[0037] In the embodiment, the end system includes a traffic source end and a traffic destination end. Among them, the traffic source end refers to the sender of the traffic; the traffic destination end refers to the receiver of the traffic. In the embodiment, both the traffic source end and the traffic destination end belong to the end system, and the end system is located in the local aggregation network, that is, the traffic source end and the traffic destination end are respectively located in two different local aggregation networks.

[0038] In an embodiment, the source end of the service flow sends a service flow transmission request to the network control system. After receiving the service flow transmission request, the network control system determines whether to receive the service flow transmission request, that is, determines whether to admit it, according to the current network conditions (including: network resource utilization, etc.). If the network control system receives the service flow transmission request, it generates corresponding configuration information and sends the configuration information to the network bearer system. The configuration information includes: the target transmission path and the shaping parameters of the edge nodes. The target transmission path refers to the optimal transmission path between the source end of the service flow and the destination end of the service flow; the shaping parameters of the edge nodes refer to the shaping parameters of the edge nodes along the path in the target transmission path. In the actual operation process, the edge nodes have a fine-grained shaping function, that is, the edge nodes can shape the arrival curve of the service flow according to the shaping parameters of the edge nodes calculated by the network control system. It should be noted that only the edge nodes in the cross-wide area deterministic transmission system have the service flow shaping function.

[0039] S120. Through the network bearer system, generate a corresponding deterministic transmission channel according to the configuration information, so that the source end of the service flow sends the service flow to the destination end of the service flow through the deterministic transmission channel.

[0040] The deterministic transmission channel refers to the channel for the source end of the service flow to transmit the service flow to the destination end of the service flow. In the embodiment, the network bearer system forwards the service flow according to the received configuration information, and the edge nodes in the network bearer system shape the service flow according to the shaping parameters of the edge nodes. The local aggregation network in the network bearer system uses the CQF forwarding mechanism to forward the service flow, while the backbone transmission network in the network bearer system uses the SDF forwarding mechanism to forward the service flow.

[0041] The technical solution of this embodiment allocates the target transmission path and the shaping parameters of the edge nodes for each service flow according to the service flow arrival curve and the end-to-end delay constraint conditions of the service flow, so that the network bearer generates a corresponding deterministic transmission channel according to the target transmission path and the shaping parameters of the edge nodes, so that the source end of the service flow transmits the service flow to be transmitted to the destination end of the service flow through the deterministic transmission channel, solves the problems of complex node structure, high complexity of resource allocation and unfavorable large-scale deployment in the prior art, ensures that the transmission delay and jitter between end-to-end have upper bounds, and has the characteristics of wide application range, low complexity of node functions and simple and convenient configuration.

[0042] In one embodiment, Figure 3 is a flowchart of another cross-wide area deterministic transmission method provided by an embodiment of the present invention. This embodiment further describes the cross-wide area deterministic transmission method on the basis of the above embodiment. As Figure 3 shown, the method includes:

[0043] S310. When receiving a service flow transmission request sent by a service flow source end through a network control system, generate corresponding configuration information and send the configuration information to a network bearer system.

[0044] Wherein, the service flow transmission request carries a service flow arrival curve and service flow end-to-end delay constraint conditions.

[0045] S320. Through the network bearer system, generate a corresponding deterministic transmission channel according to the configuration information.

[0046] S330. Through the network bearer system, send a configuration success instruction to the network control system.

[0047] Wherein, the configuration success instruction is used to indicate that the network bearer system has successfully configured the corresponding deterministic transmission channel. In an embodiment, after the network bearer system successfully configures the corresponding deterministic transmission channel, it feeds back a configuration success instruction to the network control system so that the network control system can get a timely response. Wherein, the configuration success instruction can be described by an acknowledgment message (ACK message).

[0048] S340. When receiving the configuration success instruction through the network control system, send a service flow admission instruction to the service flow source end.

[0049] Wherein, the service flow admission instruction is used to trigger the instruction information for the service flow source end to send a service flow to the service flow destination end. In an embodiment, when the network control system receives the configuration success instruction fed back by the network bearer system, the network control system sends a service flow admission instruction to the service flow source end.

[0050] S350. The service flow source end sends a service flow to the service flow destination end through the deterministic transmission channel.

[0051] After the service flow source end receives the service flow admission instruction, the service flow source end starts to send the data of the service flow and sends the data of the service flow to the service flow destination end through the deterministic transmission channel.

[0052] Based on the above embodiment, the technical solution of this embodiment is that when the network bearer system obtains the corresponding deterministic transmission channel according to the configuration information and sends a configuration success instruction to the network control system; when the network control system receives the configuration success instruction, it sends a service flow admission instruction to the service flow source end so that the service flow source end starts to send a service flow to the service flow destination end, realizing that the network control system can timely respond to the service flow source end whether it can send a service flow, thereby improving the transmission efficiency of the service flow.

[0053] In one embodiment, Figure 4It is a flowchart of another cross-wide-area deterministic transmission method provided by an embodiment of the present invention. Based on the above embodiment, this embodiment further explains the generation process and transmission process of configuration information, as well as the generation process of the deterministic transmission channel. In the embodiment, the network control system includes: a TSN controller, an SDF controller, and a joint orchestration scheduler; the network bearer system includes: at least two local aggregation networks and at least one backbone transmission network; wherein, the local aggregation network includes: a local local aggregation network and a peer local aggregation network.

[0054] As Figure 4 shown, the method includes:

[0055] S410. Receive, through the joint orchestration scheduler, a service flow transmission request sent by the source end of the service flow, which carries the service flow arrival curve and the service flow end-to-end delay constraint condition.

[0056] In the embodiment, while the service flow transmission request carries the service flow arrival curve and the service flow end-to-end delay constraint condition, it also carries the information of the service flow source end and the service flow destination end, so that the joint orchestration scheduler determines the peer local aggregation network according to the service flow destination end information. Among them, the service flow source end information may refer to the unique relevant information used to represent the service flow source end. Exemplarily, the service flow source end information may include, but is not limited to: service flow source end identifier, service flow source end IP address, and other relevant information. The service flow destination end information refers to the unique relevant information used to represent the service flow destination end. Exemplarily, the service flow destination end information may include, but is not limited to: service flow destination end identifier, service flow destination end IP address, and other relevant information.

[0057] S420. Obtain the network topology and network resource information of the network bearer system through both the TSN controller and the SDF controller.

[0058] Among them, the network bearer system includes at least two local aggregation networks and at least one backbone transmission network. In the embodiment, the network topology refers to the connection relationship between each node in each local aggregation network; and, the connection relationship between each node in each two backbone transmission networks. The network resource information refers to the network resource utilization situation of each local aggregation network and each backbone transmission network.

[0059] In the embodiment, the TSN controller is respectively connected to the local local aggregation network and the peer local aggregation network, that is, the TSN controller obtains the network topology and network resource information of the local aggregation network in the network bearer system. The SDF controller is connected to the backbone transmission network, that is, the SDF controller obtains the network topology and network resource information of the backbone transmission network in the retention bearer system.

[0060] S430. Generate corresponding target transmission paths and edge node shaping parameters according to the network topology, network resource information, traffic arrival curve, and traffic end-to-end delay constraint conditions through the joint orchestration scheduler.

[0061] In one embodiment, S430 includes S4301 - S4304:

[0062] S4301. Determine a set of feasible paths between the traffic source end and the traffic destination end according to the network topology through the joint orchestration scheduler.

[0063] Among them, the set of feasible paths refers to the set of all feasible paths between the traffic source end and the traffic destination end. In the actual operation process, the set of feasible paths includes at least one feasible path. In the embodiment, the joint orchestration scheduler determines the network topology and uses the depth-first traversal algorithm to enumerate all feasible paths from the traffic source end to the traffic destination end to obtain the corresponding set of feasible paths.

[0064] S4302. Use the network calculus method and the traffic arrival curve to determine the maximum end-to-end delay of the combination of each feasible path and shaping parameters in the set of feasible paths.

[0065] Among them, the combination of path and shaping parameters is obtained by combining each feasible path in the set of feasible paths with the shaping parameters. It should be noted that only the edge nodes in the network bearer system have the traffic shaping function, that is, the number of shaping parameters corresponding to each feasible path needs to satisfy the union between the total number of nodes included in the feasible path and the number of edge nodes. Exemplarily, assume that the total number of nodes included in a feasible path is 6, and the number of edge nodes included in this path is 3, then the corresponding number of shaping parameters is 3.

[0066] In one embodiment, when the types of nodes included in the feasible path are different, the calculation methods of the corresponding maximum end-to-end delay are also different. Specifically, S4302 includes:

[0067] When the node in the feasible path is a switch node, the maximum end-to-end delay is the sum of the maximum end-to-end delay, the time slot length of the CQF transmission mechanism in the local aggregation network, and the maximum link delay;

[0068] When the node in the feasible path is a router node, the maximum end-to-end delay is the sum of the maximum end-to-end delay, the time slot length of the SDF transmission mechanism in the backbone transmission network, and the maximum link delay;

[0069] When the node within the feasible path is a network edge node in the local aggregation network, the maximum end-to-end delay is the sum of the maximum end-to-end delay, the first supremum, and the maximum link delay; where the first supremum is related to the first traffic flow arrival curve; the first traffic flow arrival curve is related to the shaping parameter and the time slot length of the CQF transmission mechanism in the local aggregation network.

[0070] When the node within the feasible path is a network edge node in the backbone transmission network, the maximum end-to-end delay is the sum of the maximum end-to-end delay, the second supremum, and the maximum link delay; where the second supremum is related to the second traffic flow arrival curve; the second traffic flow arrival curve is related to the shaping parameter and the time slot length of the SDF transmission mechanism in the backbone transmission network.

[0071] In the embodiment, when the node within the feasible path is a network edge node in the local aggregation network, assuming the maximum end-to-end delay is denoted as Then the update formula for the maximum end-to-end delay can be: Where, refers to t≥0 and the lower bound of this set; the first supremum refers to that is, take the maximum lower bound in this set; where, is the first traffic flow arrival curve; where, is the shaping parameter; τ m is the time slot length of the CQF transmission mechanism in the m-th local aggregation network; Where, is the maximum bandwidth resource occupied by traffic flow f at node v j .

[0072] In the embodiment, when the node within the feasible path is a network edge node in the backbone transmission network, assuming the maximum end-to-end delay is denoted as Then the calculation formula for the maximum end-to-end delay can be: Where, refers to t≥0 and the lower bound of this set; the second supremum refers to that is, take the maximum lower bound in this set; where, is the second traffic flow arrival curve; where, is the shaping parameter; τ n is the time slot length of the SDF transmission mechanism in the n-th backbone transmission network; Where, is the traffic flow f at node vj The maximum bandwidth resource occupied above.

[0073] S4303. Determine the candidate path and shaping parameter combination according to the maximum end-to-end delay and the end-to-end delay constraint condition of the service flow.

[0074] Among them, the candidate path and shaping parameter combination refers to the path and shaping parameter combination that meet the end-to-end delay constraint condition of the service flow. The candidate path and shaping parameter combination can be one or multiple, and there is no limitation on this. It can be determined according to the actual situation.

[0075] In the embodiment, determine the maximum end-to-end delay corresponding to each path and shaping parameter combination, and compare the maximum end-to-end delay with the end-to-end delay constraint condition of the service flow. If the maximum end-to-end delay meets the end-to-end delay constraint condition of the service flow, then use this path and shaping parameter combination as the candidate path and shaping parameter combination; otherwise, if the maximum end-to-end delay does not meet the end-to-end delay constraint condition of the service flow, then discard this path and shaping parameter combination.

[0076] S4304. Screen and obtain the corresponding target transmission path and edge node shaping parameter according to the pre-configured resource constraint condition and the maximum bandwidth resource corresponding to each candidate path and shaping parameter combination.

[0077] In the embodiment, for each candidate path and shaping parameter combination, check whether it meets the resource constraint condition, that is, determine whether all the service flow loads (i.e., the maximum bandwidth resources) borne by each node in each candidate path meet the resource constraint condition. If it meets the resource constraint condition, then determine it as the target path and shaping parameter combination, and obtain the target transmission path and edge node shaping parameter in this target path and shaping parameter combination.

[0078] S440. Send the target transmission path and edge node shaping parameter to the network bearing system through both the TSN controller and the SDF controller.

[0079] In the embodiment, send the target transmission path and edge node shaping parameter to the local aggregation network in the network bearing system through the TSN controller, and send the target transmission path and edge node shaping parameter to the backbone transmission network in the network bearing system through the SDF controller.

[0080] S450. Generate the corresponding deterministic transmission channel according to the configuration information through the local aggregation network and the backbone transmission network.

[0081] S460. Access the local aggregation network at the source end of the service flow, and transmit the service flow to the backbone transmission network through the deterministic transmission channel.

[0082] Among them, the local aggregation network at the local end refers to the local aggregation network connected to the source end of the service flow, and can also be understood as the local aggregation network where the service flow sending end is located. In the embodiment, the service flow source end transmits the service flow to the backbone transmission network through a deterministic transmission channel.

[0083] S470. Connect to the remote local aggregation network through the backbone transmission network, and transmit the service flow to the service flow destination end through a deterministic transmission channel.

[0084] Among them, the remote local aggregation network refers to the local aggregation network connected to the destination end of the service flow, and can also be understood as the local aggregation network where the service flow receiving end is located. In the embodiment, after the backbone transmission network receives the service flow sent by the service flow source end, the backbone transmission network transmits the service flow to the service flow destination end in the remote local aggregation network through a deterministic transmission channel.

[0085] Based on the above embodiment, the technical solution of this embodiment performs service flow scheduling and network resource allocation based on the network calculus method, solves the problem that traditional deterministic network technologies cannot be adapted to cross-domain scenarios, and at the same time does not require edge nodes to implement cross-domain timing mapping functions, reducing the implementation difficulty of nodes and improving the usability of deployment.

[0086] In one embodiment, Figure 5 is a schematic structural diagram of another cross-wide area deterministic transmission system provided by an embodiment of the present invention. This embodiment further describes the structures of the network control system and the network bearer system on the basis of Figure 2 . As shown in Figure 5 , the network control system 230 includes: a TSN controller 2301, an SDF controller 2302, and a joint orchestration scheduler 2303; the network bearer system 220 includes: at least two local aggregation networks 2201 and at least one backbone transmission network 2202.

[0087] In one embodiment, the network bearer system is further configured to send a configuration success instruction to the network control system;

[0088] The network control system is further configured to send a service flow admission instruction to the service flow source end when receiving the configuration success instruction.

[0089] In one embodiment, the configuration information includes: a target transmission path and edge node shaping parameters;

[0090] The joint orchestration scheduler 2303 is configured to receive a service flow transmission request carrying a service flow arrival curve and a service flow end-to-end delay constraint condition sent by the service flow source end;

[0091] The TSN controller 2301 and the SDF controller 2302 are both used to obtain the network topology and network resource information of the network bearer system;

[0092] The joint orchestration scheduler 2303 is used to generate corresponding target transmission paths and edge node shaping parameters according to the network topology, network resource information, service flow arrival curve, and service flow end-to-end delay constraint conditions;

[0093] The TSN controller 2301 and the SDF controller 2302 are both used to send the target transmission paths and edge node shaping parameters to the network bearer system.

[0094] In one embodiment, generating corresponding target transmission paths and edge node shaping parameters by the joint orchestration scheduler according to the network topology, network resource information, service flow arrival curve, and service flow end-to-end delay constraint conditions includes:

[0095] Determining a set of feasible paths between the service flow source end and the service flow destination end by the joint orchestration scheduler according to the network topology;

[0096] Using the network calculus method and the service flow arrival curve to determine the maximum end-to-end delay of the path and shaping parameter combination corresponding to each feasible path in the set of feasible paths;

[0097] Determining the candidate path and shaping parameter combination according to the maximum end-to-end delay and the service flow end-to-end delay constraint conditions;

[0098] Screening to obtain the corresponding target transmission paths and edge node shaping parameters according to the pre-configured resource constraint conditions and the maximum bandwidth resources corresponding to each candidate path and shaping parameter combination.

[0099] In one embodiment, using the network calculus method and the service flow arrival curve to determine the maximum end-to-end delay of the path and shaping parameter combination corresponding to each feasible path in the set of feasible paths includes:

[0100] When the node in the feasible path is a switch node, the maximum end-to-end delay is the sum of the maximum end-to-end delay, the time slot length of the CQF transmission mechanism in the local aggregation network, and the maximum link delay;

[0101] When the node in the feasible path is a router node, the maximum end-to-end delay is the sum of the maximum end-to-end delay, the time slot length of the SDF transmission mechanism in the backbone transmission network, and the maximum link delay;

[0102] When the node within the feasible path is a network edge node in the local aggregation network, the maximum end-to-end delay is the sum of the maximum end-to-end delay, the first supremum, and the maximum link delay; where the first supremum is related to the first traffic flow arrival curve; the first traffic flow arrival curve is related to the shaping parameter and the time slot length of the CQF transmission mechanism in the local aggregation network.

[0103] When the node within the feasible path is a network edge node in the backbone transmission network, the maximum end-to-end delay is the sum of the maximum end-to-end delay, the second supremum, and the maximum link delay; where the second supremum is related to the second traffic flow arrival curve; the second traffic flow arrival curve is related to the shaping parameter and the time slot length of the SDF transmission mechanism in the backbone transmission network.

[0104] In one embodiment, the network bearing system includes: at least two local aggregation networks and at least one backbone transmission network; where the local aggregation network includes: the local local aggregation network and the peer local aggregation network.

[0105] Through the network bearing system, a corresponding deterministic transmission channel is generated according to the configuration information, so that the traffic flow source end sends the traffic flow to the traffic flow destination end through the deterministic transmission channel, including:

[0106] The local aggregation network and the backbone transmission network are used to generate corresponding deterministic transmission channels according to the configuration information.

[0107] The traffic flow source end is used to access the local local aggregation network and transmit the traffic flow to the backbone transmission network through the deterministic transmission channel.

[0108] The backbone transmission network is used to connect to the peer local aggregation network and transmit the traffic flow to the traffic flow destination end through the deterministic transmission channel.

[0109] In one embodiment, the network bearing system includes: router nodes, switch nodes, and network edge nodes; where the router nodes are located within the backbone transmission network; the switch nodes are located within the local aggregation network; the network edge nodes include: access nodes within the local aggregation network, access nodes within the backbone transmission network, and network access nodes within the local aggregation network.

[0110] Wherein, the traffic flow source end is connected to the access node within the backbone transmission network through the switch node and the access node within the local aggregation network, and the access node within the local aggregation network is connected to the network access node within the peer local aggregation network through the router node; the network access node within the peer local aggregation network is connected to the traffic flow destination end through the switch node and the access node within the local aggregation network.

[0111] The deterministic transmission system across wide areas provided by the embodiments of the present invention can execute the method for deterministic transmission across wide areas provided by any embodiment of the present invention, and has the corresponding functional modules and beneficial effects for executing the method.

[0112] In one embodiment, Figure 6 is a diagram of a deterministic network architecture for end-to-end transmission across wide areas provided by an embodiment of the present invention. As Figure 6 shown, the end-to-end deterministic transmission system across wide areas in this embodiment includes: an end system, a network bearer system, and a network control system. Among them, the network bearer system is the data plane described above, and the network control system is the control plane described above.

[0113] In the embodiment, the service flow starts from the source node (i.e., the source end of the service flow), accesses the local aggregation network, and through the backbone transmission network, connects to the peer local aggregation network, and finally establishes a communication link with the target node (i.e., the destination end of the service flow).

[0114] In the network bearer system, the local aggregation network uses the transmission mechanism of CQF for service flow transmission (the time slot length of CQF is configured as τ m ), where m is the index of the local aggregation network, is the set composed of all local aggregation networks. The backbone transmission network uses the transmission mechanism of SDF (the time slot length of SDF is configured as τ n ) for backbone network service flow transmission, where n is the index of the backbone transmission network, is the set composed of all backbone transmission networks. Network edge nodes (including access nodes of the local aggregation network, ingress-PE nodes of the backbone transmission network, and access joint nodes of the local aggregation network) are deployed with per-flow service flow shaping functions.

[0115] Among them, the end system includes the source end of the service flow {s f} f and the destination end of the service flow {d f} f . The end system supports the relevant specifications of the CQF network end system in the IEEE802.1Qch standard protocol. In the embodiment, the source end of the service flow uses the arrival curve α f (t) to characterize the service flow characteristics. The arrival curve is defined as α f (t) = b f +r f t, where b f is the maximum burst, and r f is the upper bound of the average transmission rate of the service flow.

[0116] In an embodiment, the network bearing system includes multiple local aggregation networks and multiple backbone transmission networks. According to different network locations, the nodes (including router nodes and switch nodes) in the network bearing system can be further subdivided into: switch nodes, router nodes, and network edge nodes.

[0117] Among them, switch nodes These nodes are located within the local aggregation network, are CQF switches, can run the CQF mechanism for deterministic transmission, and support the relevant specifications of the IEEE 802.1Qch standard.

[0118] Backbone network router nodes These nodes are located within the backbone transmission network, are SDF routers, run the SDF forwarding mechanism to achieve long-distance deterministic transmission, and support the relevant forwarding functions defined in DetNet.

[0119] Network edge nodes Network edge nodes include access nodes in the local aggregation network, access nodes in the backbone transmission network, and ingress gateway nodes in the local aggregation network. Among them, the access nodes and ingress gateway nodes located in the local aggregation network have all the functions of the switch nodes within the local aggregation retention area; the access nodes located in the backbone transmission network have all the functions of the backbone network router nodes. At the same time, the network edge nodes have a fine-grained shaping function, that is, the network edge nodes can shape the arrival curve of the traffic flow into α′ f , according to the shaping parameter (i.e., the pre-allocated bandwidth resource) b′ of the network control system f (t) = b′ f +r f t. For any edge node the value of its shaping parameter b′ f is limited, that is Among them, is the set of positive integers, is a pre-given positive integer (depending on the system hardware), and k is a user-defined positive integer value.

[0120] In an embodiment, the network control system is responsible for the resource allocation and traffic flow scheduling of the entire network, including the TSN controller, SDF controller, and joint orchestration scheduler.

[0121] Among them, the TSN controller: Each local aggregation network is equipped with a TSN controller node, which supports the IEEE 802.1Qcc standard, can obtain the resource status information of the corresponding local aggregation network, and can report it to the joint orchestration scheduler. At the same time, the configuration information (such as the target transmission path of the service flow and the shaping parameters of the edge node) sent by the joint orchestration scheduler is downloaded to the corresponding node.

[0122] The SDF controller (i.e., Figure 6 the DetNet controller in

[0123] ): Each backbone transmission network is equipped with an SDF controller node, which can obtain the resource status utilization information of the corresponding backbone transmission network and report it to the joint orchestration scheduler. At the same time, the configuration information (such as the target transmission path of the service flow and the shaping parameters of the edge node) sent by the joint orchestration scheduler is downloaded to the corresponding node. The joint orchestration scheduler: This node is responsible for the global resource allocation and service flow scheduling of the network. The joint orchestration scheduler performs service flow scheduling and network resource allocation based on network calculus. For each service flow decides the following decision variables: (1) the service flow transmission path (2) the shaping parameters of the edge node f and The joint orchestration scheduler downloads the decision information p

[0124] and to the corresponding TSN controller and SDF controller. In the embodiment, when the network control system receives the service flow transmission request sent by the end system, this mechanism is responsible for determining whether to receive the service flow: if yes, it outputs the transmission path

[0125] corresponding to the service flow f and the shaping parameters f + r f t, the end-to-end service flow delay constraint Γ f , the information of the service flow source end s f and the information of the service flow destination end d f . t represents the arrival time of the service flow. The input parameters of this mechanism include: network topology, network resource information, service flow arrival curve, and service flow delay constraint conditions. Among them, the network topology and network resource information are reported by the TSN controller and SDF controller; the service flow arrival curve and service flow delay constraint conditions are reported by the end system (in the end system request message).

[0126] Step 1: The end system requests the service flow f to access the network, and its arrival curve α The joint orchestration scheduler uses a depth-first traversal algorithm to exhaustively search all the service flow source ends s f To the destination of the service flow f The feasible path set is recorded as and Represents the topology of the nth and mth local aggregation networks and backbone transmission networks, where: Represents a collection of nodes, Represents a collection of links.

[0127] Step 3: Targeting the set of feasible paths Each element (i.e., feasible path) p f , traverse all feasible <path-shaping parameter> combinations. Only edge nodes have traffic shaping functions, that is, path p f The number of corresponding integer parameter sets satisfies

[0128] Step 4: For each <path-shaping parameter> combination (i.e. ), using network calculation to calculate the end-to-end delay. During the calculation process, the information that needs to be updated includes α(t) and in, For configuration , the maximum end-to-end delay of the service flow; α(t) is the arrival curve of service flow f, For business flow f at node v j The maximum bandwidth resource occupied by the network.

[0129] The specific calculation method is as follows:

[0130] First, initialize the end-to-end delay to initialization Where m is the index of the local aggregation network where the service flow source is located, v 0 is the source of the business flow. f Each element (node) v in j , do the following:

[0131] If v j is a CQF switch node in the local aggregation network m, then update in, Yes Link The maximum link delay (measured in advance and assumed to be constant).

[0132] If v j is an SDF router node in the backbone transmission network n, then update in, is the link e=(vj , v j+1 ) maximum link delay (pre-measured, assumed to be constant).

[0133] If v j is a network edge node in the local aggregation network m, then update the traffic arrival curve e = (v j , v j+1 ), where is the shaping parameter corresponding to v j in is the min-plus-convolution operator, and can be solved using the rtcminconv function in the Matlab Real-Time Calculus toolbox. At the same time, update and

[0134] If v j is a network edge node in the backbone transmission network n, then update the traffic arrival curve where is the shaping parameter corresponding to v j in and

[0135] Finally, the end-to-end delay corresponding to the <path - shaping parameter> combination (i.e., ) where m is the index of the local aggregation network where the traffic destination end is located. Judge whether it is satisfied. If satisfied, then the combination meets the end-to-end delay constraint requirements. Otherwise, the combination is not a feasible solution.

[0136] Step 5: For each <path - shaping parameter> combination (i.e., ), check whether it meets the resource constraint conditions. The specific checking method is to sequentially check each element v f in p j and perform the following operations:

[0137] For node v j , traverse all the traffic loads it carries Judge whether it holds, where BW e is the link bandwidth of the link e = (v j , v j+1 ).

[0138] If For all vj ∈p f is established, it indicates that the combination meets the resource constraint conditions. Otherwise, the combination is not a feasible solution.

[0139] Step 6: Arbitrarily select a <path - shaping parameter> combination from all <path - shaping parameter> combinations that meet the constraint conditions (simultaneously meeting the end - to - end delay constraint conditions in Step 4 and all resource constraint conditions in Step 5), and output it to the corresponding TSN controller and SDF controller. After the TSN controller and SDF controller return an instruction configuration success instruction, inform the service flow end - system that it can perform service flow transmission operations. If there is no <path - shaping parameter> combination that meets the constraint conditions, inform the service flow end - system to reject the service flow access.

[0140] In one embodiment, Figure 7 is a scenario diagram of cross - wide - area end - to - end deterministic transmission provided by an embodiment of the present invention. As Figure 7 shown, v 0 is the source end of the service flow, v 9 is the destination end of the service flow. The local aggregation network includes: local aggregation network 1 and local aggregation network 2; the backbone transmission network includes: backbone transmission network 1. Specifically, the process of cross - wide - area end - to - end deterministic transmission includes the following steps:

[0141] Step 1: The end - system v 0 submits a service flow admission request to the joint orchestration scheduler, including the service flow arrival curve α f (t), and the service flow end - to - end delay constraint Γ f . The joint orchestration scheduler obtains the current network resource utilization situation through the TSN controller, SDF controller, etc.

[0142] Step 2: The joint orchestration scheduler traverses all feasible paths between v 0 (source end of the service flow) and v 9 (destination end of the service flow), a total of two, including p f =(v 1 , v 2 , v 3 , v 4 , v 7 , v 8 ) and p f =(v 1 , v 2 , v 5 , v 6 , v 7 , v 8 ). Among them, the nodes v 1 , v3 ,v 5 ,v 7 As an edge node, it can perform traffic shaping operations.

[0143] Step 3: The joint scheduling scheduler traverses all <path-shaping parameter> combinations and selects the transmission path p f =(v 1 ,v 2 ,v 3 ,v 4 ,v 7 ,v 8 ). Node v 1 ,v 3 ,v 7 The shaping parameters are

[0144] Step 4: The joint orchestration scheduler informs the TSN controller and SDF controller to transmit relevant configuration information (including the target transmission path p f =(v 1 ,v 2 ,v 3 ,v 4 ,v 7 ,v 8 ) and edge node shaping parameters ). After receiving the configuration information, the TSN controller and SDF controller continue to transmit the configuration information to the corresponding node.

[0145] Step 5: The TSN controller and SDF controller inform the joint orchestration scheduler that the configuration information has been issued and successfully configured. After receiving the successful configuration message, the joint orchestration scheduler sends a message to the end system v 0 and v 9 Send service flow admission signaling.

[0146] Step 6. At this point, the system provides an end-to-end deterministic transmission channel across a wide area. 0 Start sending traffic to v 9 .

[0147] In one embodiment, Figure 8 Schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. Figure 8As shown, a schematic structural diagram of an electronic device 10 that can be used to implement an embodiment of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processors, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or claimed herein.

[0148] As Figure 8 shown, the electronic device 10 includes at least one processor 11, and a memory communicatively connected to the at least one processor 11, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc. The memory stores a computer program executable by the at least one processor. The processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 into the random access memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 can also be stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other through a bus 14. The input / output (I / O) interface 15 is also connected to the bus 14.

[0149] Multiple components in the electronic device 10 are connected to the I / O interface 15, including: an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a magnetic disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0150] The processor 11 can be various general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. The processor 11 executes the various methods and processes described above, such as the deterministic transmission method across a wide area.

[0151] In some embodiments, the method for deterministic transmission across a wide area can be implemented as a computer program tangibly embodied in a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program can be loaded and / or installed onto the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the method for deterministic transmission across a wide area described above can be performed. Alternatively, in other embodiments, the processor 11 can be configured to perform the method for deterministic transmission across a wide area by any other suitable means (e.g., by means of firmware).

[0152] The various embodiments of the systems and techniques described above in this document can be implemented in digital electronic circuitry, integrated circuit systems, field programmable gate arrays (FPGA), application specific integrated circuits (ASIC), application specific standard products (ASSP), systems on a chip (SOC), complex programmable logic devices (CPLD), computer hardware, firmware, software, and / or combinations thereof. These various embodiments can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special-purpose or general-purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit the data and instructions to the storage system, the at least one input device, and the at least one output device.

[0153] The computer programs for implementing the methods of the present invention can be written in any combination of one or more programming languages. These computer programs can be provided to the processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when the computer programs are executed by the processor, the functions / operations specified in the flowcharts and / or block diagrams are implemented. The computer programs can be executed entirely on the machine, partially on the machine, as a stand-alone software package partially on the machine and partially on a remote machine, or entirely on a remote machine or server.

[0154] In the context of the present invention, a computer-readable storage medium can be a tangible medium that can contain or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer-readable storage medium can include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. Alternatively, the computer-readable storage medium can be a machine-readable signal medium. More specific examples of the machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0155] To provide for interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which the user can provide input to the electronic device. Other kinds of devices can also be used to provide for interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0156] The systems and techniques described herein can be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer having a graphical user interface or a web browser through which the user can interact with an implementation of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0157] A computing system may include a client and a server. The client and the server are generally far from each other and usually interact via a communication network. The client-server relationship is created by computer programs running on respective computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or a cloud host, which is a host product in the cloud computing service system, and solves the defects of difficult management and weak business scalability existing in traditional physical hosts and VPS services.

[0158] It should be understood that various forms of processes shown above can be used, steps can be reordered, added or deleted. For example, the steps described in the present invention can be executed in parallel, sequentially or in a different order, as long as the desired results of the technical solution of the present invention can be achieved, and no limitation is made herein.

[0159] The above specific embodiments do not constitute a limitation on the protection scope of the present invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principle of the present invention shall be included within the protection scope of the present invention.

Claims

1. A deterministic transmission method across a wide area, characterized in that, it is executed by a deterministic transmission system across a wide area, and the deterministic transmission system includes: an end system, a network control system, and a network bearer system; wherein, the end system includes: a service flow source end and a service flow destination end; the network control system includes: a joint orchestration scheduler; the method includes: When receiving a service flow transmission request sent by the service flow source end through the network control system, generating corresponding configuration information, and sending the configuration information to the network bearer system; wherein, the service flow transmission request carries a service flow arrival curve and service flow end-to-end delay constraint conditions; the configuration information includes: a target transmission path and edge node shaping parameters; Through the network bearer system, generating a corresponding deterministic transmission channel according to the configuration information, so that the service flow source end sends a service flow to the service flow destination end through the deterministic transmission channel; Wherein, the generating the corresponding configuration information includes: Determining a set of feasible paths between the service flow source end and the service flow destination end according to the network topology of the network bearer system by the joint orchestration scheduler; Using the network calculus method and the service flow arrival curve to determine the maximum end-to-end delay of the path and shaping parameter combination corresponding to each feasible path in the set of feasible paths; Determining a candidate path and shaping parameter combination according to the maximum end-to-end delay and the service flow end-to-end delay constraint conditions; Screening to obtain the corresponding target transmission path and edge node shaping parameters according to the pre-configured resource constraint conditions and the maximum bandwidth resources corresponding to each candidate path and shaping parameter combination.

2. The method according to claim 1, characterized in that, After generating the corresponding deterministic transmission channel according to the configuration information through the network bearer system, it further includes: Sending a configuration success instruction to the network control system through the network bearer system; When receiving the configuration success instruction through the network control system, sending a service flow admission instruction to the service flow source end.

3. The method according to claim 1 or 2, characterized in that, The network control system further includes: a TSN controller and an SDF controller; The receiving the service flow transmission request sent by the service flow source end through the network control system includes: Receiving the service flow transmission request carrying the service flow arrival curve and service flow end-to-end delay constraint conditions sent by the service flow source end through the joint orchestration scheduler; Correspondingly, the generating the corresponding configuration information further includes: Obtaining the network topology and network resource information of the network bearer system through both the TSN controller and the SDF controller; Correspondingly, the sending the configuration information to the network bearer system includes: Sending the target transmission path and the edge node shaping parameters to the network bearer system through both the TSN controller and the SDF controller.

4. The method according to claim 1, characterized in that, Determining the maximum end - to - end delay of the path and shaping parameter combination corresponding to each feasible path in the set of feasible paths by using the network calculus method and the service flow arrival curve includes: When the node in the feasible path is a switch node, the maximum end - to - end delay is the sum of the maximum end - to - end delay, the slot length of the CQF transmission mechanism in the local aggregation network, and the maximum link delay; When the node in the feasible path is a router node, the maximum end - to - end delay is the sum of the maximum end - to - end delay, the slot length of the SDF transmission mechanism in the backbone transmission network, and the maximum link delay; When the node in the feasible path is a network edge node in the local aggregation network, the maximum end - to - end delay is the sum of the maximum end - to - end delay, the first supremum, and the maximum link delay; wherein, the first supremum is related to the first service flow arrival curve; the first service flow arrival curve is related to the shaping parameter and the slot length of the CQF transmission mechanism in the local aggregation network; When the node in the feasible path is a network edge node in the backbone transmission network, the maximum end - to - end delay is the sum of the maximum end - to - end delay, the second supremum, and the maximum link delay; wherein, the second supremum is related to the second service flow arrival curve; the second service flow arrival curve is related to the shaping parameter and the slot length of the SDF transmission mechanism in the backbone transmission network.

5. The method according to claim 1, characterized in that, the network bearing system includes: at least two local aggregation networks and at least one backbone transmission network; wherein, the local aggregation network includes: the local local aggregation network at the local end and the peer - end local aggregation network; generating a corresponding deterministic transmission channel through the network bearing system according to the configuration information, so that the service flow source end sends a service flow to the service flow destination end through the deterministic transmission channel, includes: generating a corresponding deterministic transmission channel through the local aggregation network and the backbone transmission network according to the configuration information; accessing the local local aggregation network at the local end by the service flow source end, and transmitting the service flow to the backbone transmission network through the deterministic transmission channel; connecting the peer - end local aggregation network through the backbone transmission network, and transmitting the service flow to the service flow destination end through the deterministic transmission channel.

6. The method according to claim 1 or 2, characterized in that, the network bearing system includes: router nodes, switch nodes and network edge nodes; wherein, the router nodes are located in the backbone transmission network; the switch nodes are located in the local aggregation network; the network edge nodes include: access nodes in the local aggregation network, access nodes in the backbone transmission network, and network access joints in the local aggregation network; Among them, the source end of the service flow is connected to the access node in the backbone transmission network through the switch node and the access node in the local aggregation network, and the access node in the local aggregation network is connected to the access gateway node in the peer local aggregation network through the router node; the access gateway node in the peer local aggregation network is connected to the destination end of the service flow through the switch node and the access node in the local aggregation network.

7. A deterministic transmission system across wide area, characterized in that, it includes: an end system, a network bearer system and a network control system; among them, the end system includes: a service flow source end and a service flow destination end; the network control system includes: a joint orchestration scheduler; Among them, the network control system is used to generate corresponding configuration information when receiving a service flow transmission request sent by the service flow source end, and send the configuration information to the network bearer system; among them, the service flow transmission request carries a service flow arrival curve and a service flow end-to-end delay constraint condition; the configuration information includes: a target transmission path and edge node shaping parameters; The network bearer system is used to generate a corresponding deterministic transmission channel according to the configuration information, so that the service flow source end sends a service flow to the service flow destination end through the deterministic transmission channel; Among them, the generation of the corresponding configuration information includes: determining a set of feasible paths between the service flow source end and the service flow destination end by the joint orchestration scheduler according to the network topology of the network bearer system; using network calculus and the service flow arrival curve to determine the maximum end-to-end delay of the path and shaping parameter combination corresponding to each feasible path in the set of feasible paths; determining a candidate path and shaping parameter combination according to the maximum end-to-end delay and the service flow end-to-end delay constraint condition; screening to obtain the corresponding target transmission path and edge node shaping parameters according to the pre-configured resource constraint conditions and the maximum bandwidth resources corresponding to each candidate path and shaping parameter combination.

8. An electronic device, characterized in that, the electronic device includes: at least one processor; and a memory communicatively connected to the at least one processor; among them, the memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor, so that the at least one processor can execute the cross-wide area deterministic transmission method according to any one of claims 1-6.

9. A computer-readable storage medium, characterized in that, the computer-readable storage medium stores computer instructions, and the computer instructions are used to enable the processor to implement the cross-wide area deterministic transmission method according to any one of claims 1-6 when executed.

Images