Data transmission method and apparatus for wide-area deterministic networks

Abstract

The application provides a data transmission method and device of a wide-area deterministic network. A first service device reports a network access request to a scheduling device. If the scheduling device determines that a current service flow has been registered according to the network access request, the scheduling device obtains all feasible transmission configurations of the current service flow according to the network access request, generates a first signaling and a second signaling, and respectively sends the first signaling and the second signaling to the first service device and a network forwarding device. The first service device obtains a target transmission configuration in response to the first signaling, and transmits the current service flow from the first service device to a second service device through the deterministic forwarding of the network forwarding device according to the target transmission configuration. The interaction among the first service device, the scheduling device and the network forwarding device realizes the end-to-end deterministic forwarding of the current service flow, overcomes the disadvantages of traditional deterministic networks, optimizes network performance and efficiency, reduces computational complexity while ensuring performance, and provides network support for time-sensitive scene applications.

Description

Technical Field

[0001] This application relates to the field of deterministic network technology, and more particularly to a data transmission method and apparatus for wide-area deterministic networks. Background Technology

[0002] The demand and application scenarios for deterministic networks mainly come from two aspects: First, there is a need for a unified industrial network bus standard that is compatible with Ethernet standards, enabling the co-transmission of latency-sensitive traffic and traditional Internet traffic (best-effort forwarding traffic) on the same network, thereby reducing network deployment complexity and cost. Second, deterministic services are carried on wide area networks. For example, enterprise services of industrial digitalization enterprises have put forward more stringent requirements in terms of latency, jitter, and reliability. Increasingly, applications such as autonomous driving, remote surgery, and holographic communication are used to achieve machine-to-machine communication across wide area networks, which puts forward strict and clear requirements on the upper and lower limits of transmission latency, requiring the network to support end-to-end deterministic transmission.

[0003] In view of this, traditional deterministic network transmission and scheduling mechanisms face many challenges. For example, firstly, single-path transmission methods suffer from low resource utilization and low network efficiency; while multi-path transmission lacks suitable scheduling algorithms. Secondly, some scheduling mechanisms employ methods based on column generation and branch-and-bound, but these methods have high computational complexity. Thirdly, some scheduling mechanisms use heuristic and greedy methods, which reduce computational complexity but cannot guarantee performance, thus failing to support the needs of some highly reliable and time-sensitive applications such as remote driving, remote surgery, and remote industrial control.

[0004] It is evident that with the evolution of network technology, the requirement for networks to provide deterministic services has become inevitable. Furthermore, deterministic networks can also address the shortcomings of Internet Quality of Service (QoS) and meet the application's need for deterministic guarantees. Summary of the Invention

[0005] This application provides a data transmission method and apparatus for wide-area deterministic networks, which overcomes the drawbacks of traditional deterministic networks in the prior art and realizes a data transmission solution for wide-area deterministic networks through the interaction between scheduling devices, network forwarding devices, and service devices.

[0006] In a first aspect, this application provides a data transmission method for a wide-area deterministic network, applied to a scheduling device, the method comprising:

[0007] Receive a network access request for the current service flow reported by the first service device, and determine whether the current service flow of the first service device has been registered based on the network access request;

[0008] If so, obtain all possible transmission configurations corresponding to the current service flow according to the network access request, and generate a first signaling and a second signaling, wherein the first signaling includes the access permission of the current service flow and all possible transmission configurations;

[0009] The first signaling and the second signaling are respectively sent to the first service device and the network forwarding device, so that the first service device responds to the first signaling to obtain the target transmission configuration, and transmits the current service flow from the first service device to the second service device through the deterministic forwarding of the network forwarding device according to the target transmission configuration.

[0010] In one possible design, determining whether the current service flow of the first service device has been registered based on the network access request includes:

[0011] Determine whether the current business flow has been registered based on the business flow identifier information of the current business flow;

[0012] The network access request carries the service flow identification information.

[0013] In one possible design, obtaining all feasible transmission configurations corresponding to the current service flow based on the network admission request includes:

[0014] Based on the identification information of the first service device and the identification information of the second service device, a depth-first traversal algorithm is used to obtain all feasible transmission paths between the first service device and the second service device.

[0015] The link time slots for each feasible transmission path are calculated one by one using different transmission start times to obtain the transmission configuration combination corresponding to each transmission path;

[0016] Filter out transmission configuration combinations that exceed the maximum allowable delay in the transmission configuration combinations corresponding to each transmission path to obtain all feasible transmission configurations;

[0017] The network access request further includes the identification information of the first service device, the identification information of the second service device, the service flow arrival time information, the load information, the transmission cycle information, and the maximum allowed delay.

[0018] In one possible design, sending the first signaling to the first service device includes:

[0019] The lease costs and parameters of all links corresponding to all feasible transmission configurations are sent to the first service device.

[0020] The first signaling also includes the lease costs and parameters of all links corresponding to all possible transmission configurations.

[0021] In one possible design, the number of the first service devices is one or more, and the number of the network forwarding devices is one or more.

[0022] Secondly, this application provides a data transmission method for a wide-area deterministic network, applied to a first service device, the method comprising:

[0023] The network access request for the current service flow is reported to the scheduling device, so that the scheduling device can determine whether the current service flow of the first service device has been registered based on the network access request;

[0024] If so, receive the first signaling issued by the scheduling device and respond to the first signaling to obtain the target transmission configuration. The first signaling includes the access permission of the current service flow and all possible transmission configurations.

[0025] According to the target transmission configuration, the current service flow is transmitted from the first service device to the second service device via deterministic forwarding through the network forwarding device.

[0026] In one possible design, reporting the network access request for the current service flow to the scheduling device includes:

[0027] The network access request, carrying the service flow identification information of the current service flow, the identification information of the first service device, the identification information of the second service device, the service flow arrival time information, the load information, the transmission period information, and the maximum allowable delay, is reported to the scheduling device.

[0028] In one possible design, obtaining the target transmission configuration in response to the first signaling includes:

[0029] In response to the first signaling, a random countdown timer is started. After the random countdown timer ends, the time slot load of all links corresponding to each feasible transmission configuration is obtained through network measurement.

[0030] The user utility value corresponding to each feasible transmission configuration is obtained based on the time slot load of all the links;

[0031] A first feasible transmission configuration and a second feasible transmission configuration are obtained based on each user utility value and each feasible transmission configuration, wherein the first feasible transmission configuration is the feasible transmission configuration corresponding to the minimum user utility value, and the second feasible transmission configuration is the feasible transmission configuration corresponding to the maximum user utility value;

[0032] If the first feasible transmission configuration and the second feasible transmission configuration are different, the current transmission configuration is updated according to the first feasible transmission configuration and the second feasible transmission configuration, and the updated current transmission configuration is determined as the target transmission configuration.

[0033] In one possible design, updating the current transmission configuration based on the first feasible transmission configuration and the second feasible transmission configuration includes:

[0034] Obtain the service flow transmission ratio of the current service flow on all feasible transmission configurations to obtain the current transmission configuration, which refers to the transmission configuration that randomly uses all feasible configurations to transmit the current service flow.

[0035] The minimum service flow transmission ratio of the current transmission configuration is updated according to the service flow transmission ratio corresponding to the first feasible transmission configuration.

[0036] The maximum service flow transmission ratio of the current transmission configuration is updated according to the service flow transmission ratio corresponding to the second feasible transmission configuration.

[0037] In one possible design, obtaining the user utility value corresponding to each feasible transmission configuration based on the time slot load of all links includes:

[0038] Based on the time slot load of all links, the lease cost of all links corresponding to all feasible transmission configurations, and parameters, obtain the user utility value corresponding to each feasible transmission configuration;

[0039] The first signaling also includes the lease costs and parameters of all links corresponding to all possible transmission configurations.

[0040] In one possible design, the number of the first service devices is one or more, and the number of the network forwarding devices is one or more.

[0041] Thirdly, this application provides a data transmission method for a wide-area deterministic network, applied to a network forwarding device, the method comprising:

[0042] The system receives a second signaling message from the scheduling device, which instructs the network forwarding device to allow the forwarding of the current service flow.

[0043] In response to the second signaling, the current service flow is transmitted from the first service device to the second device via deterministic forwarding;

[0044] Among them, deterministic forwarding implements the deterministic forwarding standard.

[0045] In one possible design, the number of the first service devices is one or more, and the number of the network forwarding devices is one or more.

[0046] Fourthly, this application provides a data transmission apparatus for a wide-area deterministic network, applied to a scheduling device, the apparatus comprising:

[0047] The receiving and judging module is used to receive the network access request for the current service flow reported by the first service device, and judge whether the current service flow of the first service device has been registered based on the network access request.

[0048] If so, the configuration module is used to obtain all possible transmission configurations corresponding to the current service flow according to the network access request, and generate a first signaling and a second signaling, wherein the first signaling includes the access permission of the current service flow and the all possible transmission configurations;

[0049] The delivery module is used to deliver the first signaling and the second signaling to the first service device and the network forwarding device respectively, so that the first service device responds to the first signaling to obtain the target transmission configuration, and transmits the current service flow from the first service device to the second service device via the deterministic forwarding of the network forwarding device according to the target transmission configuration.

[0050] Fifthly, this application provides a data transmission apparatus for a wide-area deterministic network, applied to a first service device, the apparatus comprising:

[0051] The reporting module is used to report the network access request of the current service flow to the scheduling device, so that the scheduling device can determine whether the current service flow of the first service device has been registered based on the network access request;

[0052] The receiving and iterating module, if so, is used to receive the first signaling issued by the scheduling device and respond to the first signaling to obtain the target transmission configuration, wherein the first signaling includes the access permission of the current service flow and all kinds of feasible transmission configurations;

[0053] The transmission module is used to transmit the current service flow via deterministic forwarding of the network forwarding device according to the target transmission configuration.

[0054] Sixthly, this application provides a data transmission apparatus for a wide-area deterministic network, applied to a network forwarding device, the apparatus comprising:

[0055] The receiving module is used to receive a second signaling sent by the scheduling device, the second signaling being used to instruct the network forwarding device to allow the forwarding of the current service flow;

[0056] The forwarding module is used to transmit the current service flow from the first service device to the second service device through deterministic forwarding in response to the second signaling;

[0057] In a seventh aspect, this application provides an electronic device, including: a processor, and a memory communicatively connected to the processor;

[0058] The memory stores computer-executed instructions;

[0059] The processor executes computer execution instructions stored in the memory to implement any of the data transmission methods for wide-area deterministic networks provided in the first aspect, the second aspect, or the third aspect.

[0060] Eighthly, this application provides a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, are used to implement any of the data transmission methods provided in the first aspect, the second aspect, or the third aspect for a wide-area deterministic network.

[0061] Ninthly, this application provides a computer program product including computer execution instructions, which, when executed by a processor, are used to implement any of the data transmission methods provided in the first aspect, the second aspect, or the third aspect for a wide-area deterministic network.

[0062] This application provides a data transmission method and apparatus for a wide-area deterministic network. A first service device reports a network access request for the current service flow to a scheduling device. The scheduling device determines whether the current service flow has been registered based on the received network access request. If so, the scheduling device obtains all feasible transmission configurations corresponding to the current service flow based on the network access request and generates a first signaling and a second signaling. The first signaling includes the access permission for the current service flow and all feasible transmission configurations. The scheduling device then sends the first signaling and the second signaling to the first service device and the network forwarding device, respectively. The first service device responds to the first signaling to obtain the target transmission configuration and transmits the current service flow from the first service device to the second service device via deterministic forwarding through the network forwarding device according to the target transmission configuration. Based on the collaborative interaction between the first service device, the scheduling device, and the network forwarding device, end-to-end deterministic forwarding of the current service flow from the first service device to the second service device is achieved. This overcomes the drawbacks of traditional deterministic networks in the prior art, optimizes network performance and efficiency, reduces computational complexity while ensuring performance, and provides network support for applications in high-reliability, time-sensitive scenarios. Attached Figure Description

[0063] Figure 1 A schematic diagram of a system architecture provided for an embodiment of this application;

[0064] Figure 2 A flowchart illustrating a data transmission method for a wide-area deterministic network provided in an embodiment of this application;

[0065] Figure 3 A flowchart illustrating another data transmission method for a wide-area deterministic network provided in an embodiment of this application;

[0066] Figure 4 A flowchart illustrating another data transmission method for a wide-area deterministic network provided in an embodiment of this application;

[0067] Figure 5 A schematic diagram of cooperative interaction in a wide-area deterministic network provided for an embodiment of this application;

[0068] Figure 6 A schematic diagram of a data transmission device for a wide-area deterministic network provided in an embodiment of this application;

[0069] Figure 7 A schematic diagram of the structure of a data transmission device for another wide-area deterministic network provided in an embodiment of this application;

[0070] Figure 8 A schematic diagram of the structure of a data transmission device for a wide-area deterministic network provided in an embodiment of this application;

[0071] Figure 9 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application;

[0072] Figure 10 This is a schematic diagram of the structure of another electronic device provided in an embodiment of this application;

[0073] Figure 11 This is a schematic diagram of the structure of another electronic device provided in an embodiment of this application. Detailed Implementation

[0074] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numbers in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with this application. Rather, they are merely examples of methods and apparatus consistent with some aspects of this application as detailed in the appended claims.

[0075] The terms “first,” “second,” “third,” “fourth,” etc. (if present) in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a particular order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented, for example, in orders other than those illustrated or described herein. Furthermore, the terms “comprising” and “having,” and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0076] The demand and application scenarios for deterministic networks primarily stem from two aspects: first, the need for a unified industrial network bus standard compatible with Ethernet standards; and second, the carrying of deterministic services over wide area networks (WANs). The former, to integrate IT (Information Technology) and OT (Operation Technology) networks, requires a unified deterministic transmission standard based on Ethernet, enabling the co-transmission of latency-sensitive traffic and traditional internet traffic (best-effort forwarding traffic), thereby reducing network deployment complexity and cost. The latter arises from the development of the internet and the digital transformation of industries, exemplified by the Industrial Internet, which has led to more enterprises migrating their businesses to the cloud. These businesses place stricter demands on latency, jitter, and reliability. Furthermore, the surge in machine-to-machine communication traffic across WANs, along with emerging applications such as autonomous driving, remote surgery, and holographic communication, places stringent and explicit requirements on the upper and lower limits of transmission latency, demanding that networks support end-to-end deterministic transmission. Therefore, future network technology evolution, while requiring massive connectivity, also necessitates networks with deterministic service capabilities. Furthermore, deterministic networks can address the shortcomings of Internet Quality of Service (QoS) policies and meet the application's demand for deterministic guarantees. Research on deterministic networks has become an important direction for the development of network technology research.

[0077] However, traditional deterministic network transmission and scheduling mechanisms face many challenges. For example, firstly, single-path transmission methods suffer from low resource utilization and low network efficiency, while multi-path transmission lacks suitable scheduling algorithms. Secondly, some scheduling mechanisms employ methods based on column generation and branch-and-bound, but these methods have high computational complexity. Thirdly, some scheduling mechanisms use heuristic and greedy methods, which reduce computational complexity but cannot guarantee performance, thus failing to support the needs of some highly reliable and time-sensitive applications such as remote driving, remote surgery, and remote industrial control.

[0078] In view of this, this application provides a data transmission method and apparatus for a wide-area deterministic network. The inventive concept of the data transmission method for a wide-area deterministic network provided in this application lies in: achieving end-to-end deterministic forwarding of the current service flow from the first service device to the second service device based on the collaborative interaction between the first service device, the scheduling device, and the network forwarding device. There can be multiple first service devices, thereby enabling parallel transmission of the current service flow of each first service device. This optimizes network performance and efficiency, reduces computational complexity while ensuring performance, provides network support for applications in highly reliable, time-sensitive scenarios, and overcomes the drawbacks of traditional deterministic networks in the prior art.

[0079] Figure 1 This is a schematic diagram of a system architecture provided for an embodiment of this application. Figure 1 As shown, the first service device 10 can request network access from the scheduling device, for example, by sending a network access request for the current service flow, to obtain end-to-end deterministic network services with bounded latency and jitter from the network. The first service device 10 serves as the source of the current service flow. In some embodiments, there can be multiple first service devices 10 to facilitate the segmentation of the service flow. Each first service device is responsible for a segmented current service flow that it is responsible for. Each first service device executes the wide-area deterministic network data transmission method provided in this application embodiment, enabling the service flow to achieve parallel data transmission along multiple paths from the first service device 10 to the second service device 40, ensuring low latency.

[0080] The scheduling device 20 is responsible for determining whether the current service flow of the first service device 10 has been registered. If so, it performs resource scheduling to complete the data transmission method for the wide-area deterministic network provided in this embodiment; otherwise, it terminates the process. The scheduling device 20 can be responsible for global network resource monitoring to ensure network performance.

[0081] The network forwarding device can respond to the scheduling of the scheduling device 20 and perform time-slot-based deterministic service flow forwarding according to deterministic network forwarding standards (such as DIP, SDF, etc.). That is, deterministic forwarding is implemented by implementing deterministic forwarding standards to provide end-to-end deterministic network services for service flows with bounded latency and jitter from the first service device 10 to the second service device 40. The second service device 40 is the destination of the service flow. The second service device 40 can locally splice together the current service flows transmitted from multiple paths in sequence to restore the original service flow before it was segmented.

[0082] It should be noted that, Figure 1The architecture shown illustrates a single first service device. However, this embodiment does not limit the number of first service devices; deployment depends on actual operating conditions. The number of network forwarding devices 30 can also be multiple, for example... Figure 1 The example shown consists of three devices: network forwarding device 31, network forwarding device 32, and network forwarding device 33.

[0083] In addition, the first business device can be any terminal such as a computer, laptop, smartphone, smartwatch, remote surgery workstation, or vehicle. Figure 1 The first business device is illustrated using a computer as an example. The scheduling device 20 can be a server, server cluster, computer, or other similar equipment. Figure 1 The example shown is a server. The number and type of the second service device 40 are not limited in this embodiment. Figure 1 The example shown is a server. Furthermore, the network forwarding device is a forwarding device that can support deterministic network forwarding standards to provide end-to-end deterministic network services; this application embodiment does not limit the type of forwarding device.

[0084] It should be noted that the above system architecture is merely illustrative, and the data transmission method and apparatus for wide-area deterministic networks provided in the embodiments of this application include, but are not limited to, the above system architecture.

[0085] Figure 2 This is a flowchart illustrating a data transmission method for a wide-area deterministic network provided in an embodiment of this application. Figure 2 As shown in the embodiments of this application, the data transmission method for a wide-area deterministic network includes:

[0086] S101: The first service device reports the network access request for the current service flow to the scheduling device.

[0087] Accordingly, the scheduling device receives the network access request for the current service flow reported by the first service device.

[0088] The number of primary service devices can be multiple, allowing for the segmentation of service flows. The service flow segmented for each primary service device becomes the current service flow. Conversely, if there is only one primary service device, the service flow is not segmented, and the current service flow is the entire service flow.

[0089] Each first service device reports its own network access request to the scheduling device. The network access request may include the service flow identifier information of the current service flow, the identifier information of the first service device, the identifier information of the second service device, the service flow arrival time information, load information, transmission period information, and the maximum allowed latency. That is, each first service device reports a network access request carrying the service flow identifier information of the current service flow, the identifier information of the first service device, the identifier information of the second service device, the service flow arrival time information, load information, transmission period information, and the maximum allowed latency to the scheduling device.

[0090] S102: The scheduling device determines whether the current service flow of the first service device has been registered based on the network access request.

[0091] After receiving the network access request reported by each first service device, the scheduling device determines whether the current service flow of each first service device has been registered based on the network access request. If yes, step S103 is executed to perform resource scheduling; otherwise, step S109 is executed, which ends the data transmission method of the wide area deterministic network provided in this application embodiment.

[0092] The network access request may include the service flow identifier information of the current service flow. The scheduling device can determine whether the current service flow of the first service device has been registered based on the network access request. This can be done by determining whether the service corresponding to the current service flow has been filed with the scheduling device based on the service flow identifier information. If it has, then it has been registered; otherwise, it has not been registered.

[0093] S103: The scheduling device obtains all feasible transmission configurations corresponding to the current service flow based on the network access request.

[0094] The scheduling equipment collects global network information and targets each primary service device, i.e., the service flow source. The second business equipment is also the destination of the business flow. Business flow arrival time Exhaustively enumerate all feasible resource allocation methods, that is, obtain all feasible transmission configurations corresponding to the current service flow, denoted as Σ. d In order to perform resource scheduling.

[0095] In one possible design, step S103 could be implemented as follows: Figure 3 As shown. Figure 3 This is a flowchart illustrating another data transmission method for a wide-area deterministic network provided in an embodiment of this application. Figure 3 As shown, the embodiments of this application include:

[0096] S201: Based on the identification information of the first service device and the identification information of the second service device, the scheduling device uses a depth-first traversal algorithm to obtain all feasible transmission paths between the first service device and the second service device.

[0097] Based on the identification information of the first service device and the identification information of the second service device, a depth-first traversal algorithm is used to enumerate all data from the first service device. To the second business equipment The feasible paths, that is, all feasible transmission paths, are denoted as .

[0098] S202: The scheduling device calculates the link time slots of each feasible transmission path one by one using different transmission start times, and obtains the transmission configuration combination corresponding to each transmission path.

[0099] For any path, let be denoted as Using different transmission start times The occupied link time slots are calculated one by one to obtain the transmission configuration combination corresponding to each transmission path.

[0100] Specifically, the transmission configuration combination corresponding to each transmission path is denoted as Σ. d , can be represented as in, To adopt the transmission path Transmission start time The combination of resources is represented as:

[0101]

[0102] Where, Φ e (c k ) is the time slot mapping function defined in the Deterministic Mechanism SDF and DIP.

[0103] S203: The scheduling device filters out transmission configuration combinations that exceed the maximum allowable delay in the transmission configuration combinations corresponding to each transmission path, and obtains all feasible transmission configurations.

[0104] Eliminate each transmission configuration combination corresponding to each transmission path one by one. For resource configuration combinations that exceed the maximum allowable latency, the remaining transmission paths will be used to determine all feasible transmission configuration combinations.

[0105] Where, for ∑ d′ Each feasible transmission configuration There is a pair (P′, τ) S A unique identifier, P′∈P d It corresponds to the path, τ′∈T dIt is a time slot for revelation transmission.

[0106] At this point, the scheduling device obtains all feasible transmission configurations corresponding to the current service flow of each first service device through the network access request, and further executes step S104.

[0107] S104: The scheduling device generates the first signaling and the second signaling.

[0108] The first signaling includes the access permission for the current traffic flow and all possible transmission configurations, while the second signaling is used to instruct the network forwarding device to allow the forwarding of the current traffic flow.

[0109] S105: The dispatching equipment sends the first signaling to the first service equipment.

[0110] Accordingly, the first service device receives the first signaling issued by the scheduling device.

[0111] The scheduling equipment sends the admission signal, i.e., the admission permission, for the current service flow to each primary service device. Simultaneously, it calculates the lease cost (α) for all links corresponding to all feasible transmission configurations. e ) and parameters (γ) e It was also distributed to the corresponding primary business devices.

[0112] S106: The scheduling device sends a second signaling message to the network forwarding device.

[0113] Accordingly, the network forwarding device receives the second signaling issued by the scheduling device.

[0114] S107: The first service device responds to the first signaling and obtains the target transmission configuration.

[0115] After receiving the first signaling from the scheduling device, each primary service device responds to the first signaling and performs an iterative scheduling process to obtain the final target transmission configuration for the current service flow. It is understood that if the first signaling is not received, service transmission is not permitted, and the primary service device leaves the network.

[0116] In one possible design, step S107 could be implemented as follows: Figure 4 As shown, Figure 4 This is a flowchart illustrating another data transmission method for a wide-area deterministic network provided in an embodiment of this application. Figure 4 As shown, the embodiments of this application include:

[0117] S301: The first service device responds to the first signaling and starts a random countdown timer. After the random countdown timer ends, it obtains the time slot load of all links corresponding to each feasible transmission configuration through network measurement.

[0118] Each first service device can respond to the received first signaling by starting a random countdown timer, with the timer value following a Poisson distribution. After the random countdown timer stops, each first service device initiates a network measurement process based on in-band network telemetry (INT) to measure all feasible configurations ∑ d′ The time slot load of all links (ω) e,τ′ ).

[0119] S302: Obtain the user utility value corresponding to each feasible transmission configuration based on the time slot load of all links.

[0120] For example, based on the time slot load of all links, the lease cost of all links corresponding to all feasible transmission configurations, and parameters, obtain the user utility value corresponding to each feasible transmission configuration.

[0121] Specifically, calculate |∑ d′ The user utility value corresponding to the feasible configuration is shown in the following formula (1):

[0122]

[0123] Among them, if If it contains resources (e,τ′), then otherwise, Thus, |∑ d′ | User utility values ​​corresponding to each feasible configuration.

[0124] S303: Obtain the first feasible transport configuration and the second feasible transport configuration based on each user utility value and each feasible transport configuration.

[0125] The first feasible transmission configuration is the feasible transmission configuration corresponding to the minimum user utility value, and the second feasible transmission configuration is the feasible transmission configuration corresponding to the maximum user utility value.

[0126] Find the feasible configuration that minimizes user utility value. First feasible transport configuration obtained The feasible configuration that maximizes user utility value That is, to obtain the second feasible transmission configuration.

[0127] in, p′ min , A flag for the first feasible transmission configuration;

[0128] p′ max , A flag configured for the second feasible transmission.

[0129] S304: If the first feasible transmission configuration and the second feasible transmission configuration are different, the current transmission configuration is updated according to the first feasible transmission configuration and the second feasible transmission configuration, and the updated current transmission configuration is determined as the target transmission configuration.

[0130] Specifically, if Update the current transmission configuration according to the first feasible transmission configuration and the second feasible transmission configuration. Set the updated current transport configuration as the target transport configuration.

[0131] Optionally, possible implementations of updating the current transmission configuration based on the first feasible transmission configuration and the second feasible transmission configuration include:

[0132] First, obtain the transmission ratio of the current service flow across all feasible transmission configurations to obtain the current transmission configuration. The current transmission configuration refers to the transmission configuration that randomly uses all feasible configurations to transmit the current service flow, denoted as . in For the first business equipment in configuration The proportion of upstream transmission traffic. Therefore... and

[0133] Then, the minimum service flow transmission ratio of the current transmission configuration is updated according to the service flow transmission ratio corresponding to the first feasible transmission configuration, and the maximum service flow transmission ratio of the current transmission configuration is updated according to the service flow transmission ratio corresponding to the second feasible transmission configuration. For example, the minimum service flow transmission ratio of the current transmission configuration is updated to the sum of the service flow transmission ratio corresponding to the first feasible transmission configuration and a preset transmission ratio range, and the maximum service flow transmission ratio of the current transmission configuration is updated to the difference between the service flow transmission ratio corresponding to the second feasible transmission configuration and the preset transmission ratio range. The remaining service flow transmission ratios of the current transmission configuration remain unchanged, thus updating the current transmission configuration. Optionally, the preset transmission ratio range can be, for example, 0.01, and can be set by the user in actual operating conditions.

[0134] At this point, the first service device completes the scheduling iteration and obtains the target transmission configuration.

[0135] S108: The first service device transmits the current service flow from the first service device to the second service device via deterministic forwarding of the network forwarding device according to the target transmission configuration.

[0136] Meanwhile, S109: The network forwarding device responds to the second signaling and transmits the current service flow from the first service device to the second device through deterministic forwarding.

[0137] S1010: End data transmission method.

[0138] As described above, based on the collaborative interaction between the first service device, the scheduling device, and the network forwarding device, end-to-end deterministic forwarding of the current service flow from the first service device to the second service device can be achieved. Specifically, each first service device can segment the service flow to obtain its own current service flow, and each first service device performs parallel scheduling iterations, allowing the current service flow to be transmitted in parallel from its corresponding first service device to the second service device. End-to-end deterministic forwarding is achieved under the deterministic forwarding of the network forwarding device, overcoming the drawbacks of traditional deterministic networks in existing technologies, optimizing network performance and efficiency, reducing computational complexity while ensuring performance, and providing network support for applications in high-reliability, time-sensitive scenarios.

[0139] The following is Figure 5 Taking this as an example, the collaborative interaction between the first service device, the scheduling device, and the network forwarding device will be explained. Figure 5 This is a schematic diagram illustrating the cooperative interaction of a wide-area deterministic network, provided as an embodiment of this application. For example... Figure 5 As shown, there are two first-level service devices, namely service device A and service device B, which serve as the source of the service flow. A second-level service device serves as the destination of the service flow. In addition, three network forwarding devices are deployed: network forwarding device A, network forwarding device B, and network forwarding device C.

[0140] like Figure 5 As shown, firstly, two service devices, service device A and service device B, send network access requests to the scheduling device (see signaling ① in the diagram). This signaling ① includes service flow identification information, service flow arrival time information, source and destination identification information, load information, transmission period information, and maximum allowed latency. Then, the scheduling device determines whether the two service flows have already registered based on the relevant information in the network access requests. If they have registered, it exhaustively searches all possible resource configuration combinations for the two service flows. and Furthermore, the scheduling equipment will send signaling ② (including access permission and all feasible configuration information) All lease costs α involving links e Parameter γ eThe data is sent to service flow d1 (originating from service device A) and service flow d2 (originating from service device B). Simultaneously, the scheduling device informs network forwarding devices A, B, and C via signaling ③ that they can perform deterministic forwarding of service flow d1 (originating from service device A) and service flow d2 (originating from service device B). Service device A (service flow d1) and service device B (service flow d2) simultaneously begin their respective scheduling iteration processes to obtain their respective target transmission configurations. Then, according to their respective target transmission configurations, under the deterministic forwarding of network forwarding devices A, B, and C, service flow d1 is transmitted from service device A to the second service device (service device C), and service flow d2 is also transmitted from service device B to the second service device. Since service flow d1 and service flow d2 are obtained by segmenting service flows to achieve parallel transmission along multiple paths, the second service device will locally concatenate service flows d1 and d2 from different paths in sequence to reconstruct the original service flows.

[0141] Figure 6 This application provides a schematic diagram of a data transmission device for a wide-area deterministic network, which is applied to a scheduling device. Figure 6 As shown, this application embodiment provides a data transmission apparatus 400 for a wide-area deterministic network, including:

[0142] The receiving and judging module 401 is used to receive the network access request for the current service flow reported by the first service device, and judge whether the current service flow of the first service device has been registered based on the network access request.

[0143] Configuration module 402, if so, is used to obtain all possible transmission configurations corresponding to the current service flow according to the network access request, and generate first signaling and second signaling, wherein the first signaling includes the access permission of the current service flow and all possible transmission configurations;

[0144] The sending module 403 is used to send the first signaling and the second signaling to the first service device and the network forwarding device respectively, so that the first service device responds to the first signaling to obtain the target transmission configuration, and transmits the current service flow from the first service device to the second service device through the deterministic forwarding of the network forwarding device according to the target transmission configuration.

[0145] In one possible design, the receiving and judging module 401 is used for:

[0146] Determine whether the current business flow has been registered based on the business flow identifier information of the current business flow;

[0147] Among them, the network access request carries service flow identification information.

[0148] In one possible design, configuration module 402 is used for:

[0149] Based on the identification information of the first service device and the identification information of the second service device, a depth-first traversal algorithm is used to obtain all feasible transmission paths between the first service device and the second service device.

[0150] By using different transmission start times, the link time slots of each feasible transmission path are calculated one by one to obtain the transmission configuration combination corresponding to each transmission path;

[0151] Filter out transmission configuration combinations that exceed the maximum allowable delay in each transmission path to obtain all feasible transmission configurations;

[0152] The network access request also includes the identification information of the first service device, the identification information of the second service device, the service flow arrival time information, the load information, the transmission cycle information, and the maximum allowed latency.

[0153] In one possible design, the sending module 403 is also used to: send the lease costs and parameters of all links corresponding to all feasible transmission configurations to the first service device;

[0154] The first signaling also includes the lease costs and parameters of all links corresponding to all feasible transmission configurations.

[0155] In one possible design, the number of first service devices is one or more, and the number of network forwarding devices is one or more.

[0156] The data transmission apparatus for wide-area deterministic networks provided in this application embodiment can execute the corresponding steps of the data transmission method for wide-area deterministic networks on the scheduling device side in the above method embodiment. Its implementation principle and technical effect are similar, and will not be repeated here.

[0157] Figure 7 This is a schematic diagram of another data transmission device for a wide-area deterministic network provided in an embodiment of this application. This data transmission device is applied to a first service device, such as... Figure 7 As shown in the embodiment of this application, the data transmission apparatus 500 for a wide-area deterministic network includes:

[0158] The reporting module 501 is used to report the network access request of the current service flow to the scheduling device, so that the scheduling device can determine whether the current service flow of the first service device has been registered based on the network access request;

[0159] The receiving and iterating module 502, if so, is used to receive the first signaling issued by the scheduling device and respond to the first signaling to obtain the target transmission configuration. The first signaling includes the access permission of the current service flow and all kinds of feasible transmission configurations.

[0160] The transmission module 503 is used to transmit the current service flow via deterministic forwarding of the network forwarding device according to the target transmission configuration.

[0161] In one possible design, the reporting module 501 is used for:

[0162] The network access request, carrying the current service flow identification information, the identification information of the first service device, the identification information of the second service device, the service flow arrival time information, the load information, the transmission cycle information, and the maximum allowable delay, is reported to the scheduling device.

[0163] In one possible design, the receiving and iterating module 502 is used for:

[0164] In response to the first signaling, a random countdown timer is started. After the random countdown timer ends, the time slot load of all links corresponding to each feasible transmission configuration is obtained through network measurement.

[0165] Obtain the user utility value corresponding to each feasible transmission configuration based on the time slot load of all links;

[0166] A first feasible transmission configuration and a second feasible transmission configuration are obtained based on each user utility value and each feasible transmission configuration. The first feasible transmission configuration is the feasible transmission configuration corresponding to the minimum user utility value, and the second feasible transmission configuration is the feasible transmission configuration corresponding to the maximum user utility value.

[0167] If the first feasible transmission configuration and the second feasible transmission configuration are different, the current transmission configuration is updated according to the first feasible transmission configuration and the second feasible transmission configuration, and the updated current transmission configuration is determined as the target transmission configuration.

[0168] In one possible design, the receiving and iterating module 502 is also used for:

[0169] Obtain the service flow transmission ratio of the current service flow on all feasible transmission configurations to obtain the current transmission configuration. The current transmission configuration refers to the transmission configuration that randomly uses all feasible configurations to transmit the current service flow.

[0170] Update the minimum service flow transmission ratio of the current transmission configuration according to the service flow transmission ratio corresponding to the first feasible transmission configuration;

[0171] Update the maximum service flow transmission ratio of the current transmission configuration according to the service flow transmission ratio corresponding to the second feasible transmission configuration.

[0172] In one possible design, the receiving and iterating module 502 is also used for:

[0173] Based on the time slot load of all links, the lease cost of all links corresponding to all feasible transmission configurations, and parameters, obtain the user utility value corresponding to each feasible transmission configuration;

[0174] The first signaling also includes the lease costs and parameters of all links corresponding to all feasible transmission configurations.

[0175] In one possible design, the number of first service devices is one or more, and the number of network forwarding devices is one or more.

[0176] The data transmission apparatus for a wide-area deterministic network provided in this application embodiment can execute the corresponding steps of the data transmission method for a wide-area deterministic network on the first service equipment side in the above method embodiment. Its implementation principle and technical effect are similar, and will not be repeated here.

[0177] Figure 8 This is a schematic diagram of another data transmission apparatus for a wide-area deterministic network provided in an embodiment of this application. This data transmission apparatus is applied to a network forwarding device, such as... Figure 8 As shown in the embodiment of this application, the data transmission apparatus 600 for a wide-area deterministic network includes:

[0178] The receiving module 601 is used to receive the second signaling issued by the scheduling device. The second signaling is used to instruct the network forwarding device to allow the forwarding of the current service flow.

[0179] The forwarding module 602 is used to respond to the second signaling by transmitting the current service flow from the first service device to the second service device through deterministic forwarding.

[0180] The data transmission apparatus for wide-area deterministic networks provided in this application embodiment can execute the corresponding steps of the data transmission method for wide-area deterministic networks on the network forwarding device side in the above method embodiment. Its implementation principle and technical effect are similar, and will not be repeated here.

[0181] Figure 9 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Figure 9 As shown, the electronic device 700 may include a processor 701 and a memory 702 communicatively connected to the processor 701.

[0182] The memory 702 is used to store programs. Specifically, the program may include program code, which includes computer-executable instructions.

[0183] The memory 702 may include high-speed RAM memory, and may also include non-volatile memory, such as at least one disk storage device.

[0184] The processor 701 is used to execute computer execution instructions stored in the memory 702 to implement the data transmission method of the wide-area deterministic network on the scheduling device side described above.

[0185] The processor 701 may be a central processing unit (CPU), an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of this application.

[0186] Optionally, the memory 702 can be either standalone or integrated with the processor 701. When the memory 702 is a device independent of the processor 701, the electronic device 700 may further include:

[0187] Bus 703 is used to connect processor 701 and memory 702. The bus can be an industry standard architecture (ISA) bus, a peripheral component (PCI) bus, or an extended industry standard architecture (EISA) bus, etc. Buses can be categorized as address buses, data buses, control buses, etc., but this does not mean there is only one bus or one type of bus.

[0188] Optionally, in a specific implementation, if the memory 702 and the processor 701 are integrated on a single chip, the memory 702 and the processor 701 can communicate through an internal interface.

[0189] Figure 10 This is a schematic diagram of the structure of another electronic device provided in an embodiment of this application. For example... Figure 10 As shown, the electronic device 800 may include a processor 801 and a memory 802 communicatively connected to the processor 801.

[0190] The memory 802 is used to store programs. Specifically, the program may include program code, which includes computer-executable instructions.

[0191] The memory 802 may include high-speed RAM memory, and may also include non-volatile memory, such as at least one disk storage device.

[0192] The processor 801 is used to execute computer execution instructions stored in the memory 802 to implement the data transmission method of the wide area deterministic network on the first service device side.

[0193] The processor 801 may be a central processing unit (CPU), an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of this application.

[0194] Optionally, the memory 802 can be either standalone or integrated with the processor 801. When the memory 802 is a device independent of the processor 801, the electronic device 800 may further include:

[0195] Bus 803 is used to connect processor 801 and memory 802. The bus can be an industry standard architecture (ISA) bus, a peripheral component (PCI) bus, or an extended industry standard architecture (EISA) bus, etc. Buses can be categorized as address buses, data buses, control buses, etc., but this does not mean there is only one bus or one type of bus.

[0196] Optionally, in a specific implementation, if the memory 802 and the processor 801 are integrated on a single chip, the memory 802 and the processor 801 can communicate through an internal interface.

[0197] Figure 11 This is a schematic diagram of the structure of another electronic device provided in an embodiment of this application. For example... Figure 11 As shown, the electronic device 900 may include a processor 901 and a memory 902 communicatively connected to the processor 901.

[0198] The memory 902 is used to store programs. Specifically, the program may include program code, which includes computer-executable instructions.

[0199] The memory 902 may include high-speed RAM memory, and may also include non-volatile memory, such as at least one disk storage device.

[0200] The processor 901 is used to execute computer execution instructions stored in the memory 902 to implement the data transmission method of the wide area deterministic network on the network forwarding device side described above.

[0201] The processor 901 may be a central processing unit (CPU), an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of this application.

[0202] Optionally, the memory 902 can be either standalone or integrated with the processor 901. When the memory 902 is a device independent of the processor 901, the electronic device 900 may further include:

[0203] Bus 903 is used to connect processor 901 and memory 902. The bus can be an industry standard architecture (ISA) bus, a peripheral component (PCI) bus, or an extended industry standard architecture (EISA) bus, etc. Buses can be categorized as address buses, data buses, control buses, etc., but this does not mean there is only one bus or one type of bus.

[0204] Optionally, in a specific implementation, if the memory 902 and the processor 901 are integrated on a single chip, the memory 902 and the processor 901 can communicate through an internal interface.

[0205] This application also provides a computer-readable storage medium, which may include various media capable of storing program code, such as a USB flash drive, a portable hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk. Specifically, the computer-readable storage medium stores computer-executable instructions, which are used in the methods described in the above embodiments.

[0206] This application also provides a computer program product, including computer execution instructions that, when executed by a processor, implement the methods described above.

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

[0208] It should be understood that this application is not limited to the precise structure described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from its scope. The scope of this application is limited only by the appended claims.

Claims

1. A data transmission method for a wide-area deterministic network, characterized in that, The method, applied to a scheduling device, includes: Receive a network access request for the current service flow reported by the first service device, and determine whether the current service flow of the first service device has been registered based on the service flow identifier information of the current service flow in the network access request; If so, based on the identification information of the first service device and the identification information of the second service device, a depth-first traversal algorithm is used to obtain all feasible transmission paths between the first service device and the second service device. By using different transmission start times, the link time slots of each feasible transmission path are calculated one by one to obtain the transmission configuration combination corresponding to each transmission path; Filter out transmission configuration combinations that exceed the maximum allowable delay in the transmission configuration combinations corresponding to each transmission path to obtain all feasible transmission configurations corresponding to the current service flow, and generate a first signaling and a second signaling, wherein the first signaling includes the admission permission of the current service flow and all feasible transmission configurations. The first signaling is sent to the first service device, and the second signaling is sent to the network forwarding device, so that the first service device responds to the first signaling to obtain the target transmission configuration, and transmits the current service flow from the first service device to the second service device via the deterministic forwarding of the network forwarding device according to the target transmission configuration; The network access request includes the service flow identification information, the identification information of the first service device, the identification information of the second service device, the service flow arrival time information, the load information, the transmission period information, and the maximum allowed delay.

2. The data transmission method according to claim 1, characterized in that, Sending the first signaling to the first service device includes: The lease costs and parameters of all links corresponding to all feasible transmission configurations are sent to the first service device. The first signaling also includes the lease costs and parameters of all links corresponding to all possible transmission configurations.

3. The data transmission method according to claim 2, characterized in that, The number of the first service devices is one or more, and the number of the network forwarding devices is one or more.

4. A data transmission method for a wide-area deterministic network, characterized in that, The method, applied to a first service device, includes: The network access request carrying the current service flow identification information, the identification information of the first service device, the identification information of the second service device, the service flow arrival time information, load information, transmission cycle information, and the maximum allowable delay is reported to the scheduling device. The scheduling device determines whether the current service flow of the first service device has been registered based on the service flow identification information. If it has been registered, it uses a depth-first traversal algorithm to obtain all feasible transmission paths between the first service device and the second service device based on the identification information of the first service device and the identification information of the second service device. It also calculates the link time slot of each feasible transmission path one by one using different transmission start times to obtain the transmission configuration combination corresponding to each transmission path. Finally, it filters out the transmission configuration combinations that exceed the maximum allowable delay in the transmission configuration combinations corresponding to each transmission path to obtain all feasible transmission configurations corresponding to the current service flow. The first signaling and the second signaling are then generated. The first signaling includes the access permission of the current service flow and all feasible transmission configurations. If so, receive the first signaling issued by the scheduling device and respond to the first signaling to obtain the target transmission configuration; According to the target transmission configuration, the current service flow is transmitted from the first service device to the second service device via deterministic forwarding through the network forwarding device.

5. The data transmission method according to claim 4, characterized in that, The step of obtaining the target transmission configuration in response to the first signaling includes: In response to the first signaling, a random countdown timer is started. After the random countdown timer ends, the time slot load of all links corresponding to each feasible transmission configuration is obtained through network measurement. The user utility value corresponding to each feasible transmission configuration is obtained based on the time slot load of all the links; A first feasible transmission configuration and a second feasible transmission configuration are obtained based on each user utility value and each feasible transmission configuration, wherein the first feasible transmission configuration is the feasible transmission configuration corresponding to the minimum user utility value, and the second feasible transmission configuration is the feasible transmission configuration corresponding to the maximum user utility value; If the first feasible transmission configuration and the second feasible transmission configuration are different, the current transmission configuration is updated according to the first feasible transmission configuration and the second feasible transmission configuration, and the updated current transmission configuration is determined as the target transmission configuration.

6. The data transmission method according to claim 5, characterized in that, The step of updating the current transmission configuration based on the first feasible transmission configuration and the second feasible transmission configuration includes: Obtain the service flow transmission ratio of the current service flow on all feasible transmission configurations to obtain the current transmission configuration, which refers to the transmission configuration that randomly uses all feasible configurations to transmit the current service flow. The minimum service flow transmission ratio of the current transmission configuration is updated according to the service flow transmission ratio corresponding to the first feasible transmission configuration. The maximum service flow transmission ratio of the current transmission configuration is updated according to the service flow transmission ratio corresponding to the second feasible transmission configuration.

7. The data transmission method according to claim 5, characterized in that, The step of obtaining the user utility value corresponding to each feasible transmission configuration based on the time slot load of all links includes: Based on the time slot load of all links, the lease cost of all links corresponding to all feasible transmission configurations, and parameters, obtain the user utility value corresponding to each feasible transmission configuration; The first signaling also includes the lease costs and parameters of all links corresponding to all possible transmission configurations.

8. The data transmission method according to any one of claims 4-7, characterized in that, The number of the first service devices is one or more, and the number of the network forwarding devices is one or more.

9. A data transmission method for a wide-area deterministic network, characterized in that, The method, applied to network forwarding devices, includes: The system receives a second signaling message from the scheduling device, which instructs the network forwarding device to allow the forwarding of the current service flow. In response to the second signaling, the current service flow transmitted by the first service device based on the target transmission configuration is deterministically forwarded according to the preset deterministic forwarding standard, so as to transmit the current service flow from the first service device to the second device. The second signaling is generated and issued by the scheduling device after performing the following steps: receiving a network access request reported by the first service device, which includes service flow identification information, first service device identification information, second service device identification information, service flow arrival time information, load information, transmission period information, and maximum allowable delay. It is determined that the current service flow has been registered based on the service flow identification information; Based on the identification information of the first service device and the second service device, a depth-first traversal algorithm is used to obtain all feasible transmission paths; For each feasible transmission path, link time slots are calculated using different transmission start times to obtain the transmission configuration combination for each path; Transmission configuration combinations that exceed the maximum allowable delay are filtered out to obtain all feasible transmission configurations, and a first signaling and a second signaling containing an access permission and all feasible transmission configurations are generated so that the first service device can receive the first signaling.

10. The data transmission method according to claim 9, characterized in that, The number of the first service devices is one or more, and the number of the network forwarding devices is one or more.

11. A data transmission apparatus for a wide-area deterministic network, characterized in that, The device, applied to a scheduling equipment, includes: The receiving and judging module is used to receive the service flow identifier information of the current service flow in the network access request of the current service flow reported by the first service device, and judge whether the current service flow of the first service device has been registered according to the network access request. If so, the configuration module is configured to: obtain all feasible transmission paths between the first service device and the second service device based on the identification information of the first service device and the identification information of the second service device using a depth-first traversal algorithm; calculate the link time slot of each feasible transmission path one by one using different transmission start times to obtain the transmission configuration combination corresponding to each transmission path; filter out the transmission configuration combinations that exceed the maximum allowable delay in the transmission configuration combinations corresponding to each transmission path to obtain all feasible transmission configurations corresponding to the current service flow, and generate a first signaling and a second signaling, wherein the first signaling includes the access permission of the current service flow and all feasible transmission configurations; The delivery module is used to deliver the first signaling to the first service device and the second signaling to the network forwarding device, so that the first service device responds to the first signaling to obtain the target transmission configuration, and transmits the current service flow from the first service device to the second service device via deterministic forwarding of the network forwarding device according to the target transmission configuration; wherein, the network admission request includes the service flow identification information, the identification information of the first service device, the identification information of the second service device, the service flow arrival time information, the load information, the transmission period information, and the maximum allowed delay.

12. A data transmission apparatus for a wide-area deterministic network, characterized in that, The apparatus, applied to a first service device, comprises: The reporting module is used to report a network access request carrying the current service flow identification information, the identification information of the first service device, the identification information of the second service device, the service flow arrival time information, load information, transmission period information, and the maximum allowable delay to the scheduling device. The scheduling device then determines whether the current service flow of the first service device has been registered based on the service flow identification information. If registered, it uses a depth-first traversal algorithm to obtain all feasible transmission paths between the first and second service devices based on the identification information of the first and second service devices. It also calculates the link time slots for each feasible transmission path using different transmission start times to obtain the transmission configuration combination corresponding to each transmission path. Finally, it filters out transmission configuration combinations that exceed the maximum allowable delay from the transmission configuration combinations corresponding to each transmission path, obtaining all feasible transmission configurations corresponding to the current service flow. A first signaling and a second signaling are then generated. The first signaling includes the access permission for the current service flow and all feasible transmission configurations. The receiving and iterating module, if so, is used to receive the first signaling issued by the scheduling device and respond to the first signaling to obtain the target transmission configuration; A transmission module is configured to transmit the current service flow from the first service device to the second service device via a network forwarding device according to the target transmission configuration.

13. A data transmission apparatus for a wide-area deterministic network, characterized in that, The device, applied to a network forwarding device, includes: The receiving module is used to receive a second signaling sent by the scheduling device, the second signaling being used to instruct the network forwarding device to allow the forwarding of the current service flow; The forwarding module is used to respond to the second signaling and perform deterministic forwarding on the current service flow transmitted by the first service device based on the target transmission configuration according to the preset deterministic forwarding standard, so as to transmit the current service flow from the first service device to the second device. The second signaling is generated and issued by the scheduling device after performing the following steps: Receive network access requests reported by the first service device, which include service flow identification information, first service device identification information, second service device identification information, service flow arrival time information, load information, transmission period information, and maximum allowable latency; It is determined that the current service flow has been registered based on the service flow identification information; Based on the identification information of the first service device and the second service device, a depth-first traversal algorithm is used to obtain all feasible transmission paths; For each feasible transmission path, link time slots are calculated using different transmission start times to obtain the transmission configuration combination for each path; Transmission configuration combinations that exceed the maximum allowable delay are filtered out to obtain all feasible transmission configurations, and a first signaling and a second signaling containing an access permission and all feasible transmission configurations are generated so that the first service device can receive the first signaling.

14. An electronic device, characterized in that, include: A processor, and a memory communicatively connected to the processor; The memory stores computer-executed instructions; The processor executes computer execution instructions stored in the memory to implement the data transmission method for a wide-area deterministic network as described in any one of claims 1-3, or any one of claims 4-8, or 9 or 10.

15. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the data transmission method for a wide-area deterministic network as described in any one of claims 1-3, or any one of claims 4-8, or 9 or 10.

16. A computer program product comprising computer-executable instructions, which, when executed by a processor, are used to implement a data transmission method for a wide-area deterministic network as described in any one of claims 1-3, or any one of claims 4-8, or 9 or 10.

Images