Transmission method and apparatus, electronic device, and storage medium

Abstract

The application provides a transmission method and device, electronic equipment and storage medium, and relates to the technical field of communication. The method comprises the following steps: receiving a transmission delay requirement and a transmission jitter requirement of a service flow sent by a first terminal; in the case that an end-to-end maximum transmission delay of a first transmission path corresponding to the service flow is less than the transmission delay requirement, and an end-to-end maximum jitter of the first transmission path is less than the transmission jitter requirement, the service flow is sequentially forwarded by a first cyclic queue, a periodic cyclic queue and a second cyclic queue in a local area network, and is transmitted to a second terminal at the end of the first transmission path.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a transmission method, apparatus, electronic device, and storage medium. Background Technology

[0002] Cyclic Queuing and Forwarding (CQF) is a traffic management technique used in computer networks to optimize network performance and traffic distribution. Specifically, it divides network traffic into different priorities and service levels, and queues and schedules traffic according to these priorities to achieve efficient use of network resources, increased transmission rates, and reduced latency and packet loss. Current CQF technology only operates in local area network (LAN) scenarios and cannot achieve end-to-end deterministic transmission across wide areas. This problem is also known as the "local area information silo problem." Achieving end-to-end, wide-area deterministic transmission between CQF networks remains to be studied. Summary of the Invention

[0003] This invention provides a transmission method, apparatus, electronic device, and storage medium to address the shortcomings of existing technologies in achieving end-to-end, wide-area deterministic transmission between CQF networks.

[0004] This invention provides a transmission method, comprising:

[0005] The transmission latency and jitter requirements for receiving the service stream sent by the first terminal;

[0006] If the maximum end-to-end transmission delay of the first transmission path corresponding to the service flow is less than the transmission delay requirement, and the maximum end-to-end jitter of the first transmission path is less than the transmission jitter requirement, the service flow is transmitted to the second terminal at the end of the first transmission path via the first circular queue forwarding local area network, the periodically specific circular queue forwarding wide area network, and the second circular queue forwarding local area network in sequence according to the first transmission path.

[0007] According to a transmission method provided by the present invention, the method for determining the end-to-end maximum jitter includes:

[0008] Based on the first processing delay interval of the circular queue forwarding gateway in the first circular queue forwarding local area network and the first time slot length of the first circular queue forwarding local area network, the first diffusion information is determined; the first diffusion information is the number of transmission time slots in which the service flow diffuses in the first circular queue forwarding local area network.

[0009] Based on the first diffusion information, the first time slot length, and the second time slot length of the periodically specific circular queue forwarding wide area network, the second diffusion information is determined; the second diffusion information is the number of transmission time slots in which the service flow diffuses in the periodically specific circular queue forwarding wide area network.

[0010] Based on the second diffusion information, the second time slot length, the second processing delay interval of the circular queue forwarding gateway in the second circular queue forwarding local area network, and the third time slot length of the second circular queue forwarding local area network, the third diffusion information is determined; the third diffusion information is the number of transmission time slots in which the service flow diffuses in the second circular queue forwarding local area network.

[0011] The end-to-end maximum jitter is determined based on the first time slot length, the third diffusion information, and the third time slot length.

[0012] According to a transmission method provided by the present invention, the calculation method of the first diffusion information is specifically as follows:

[0013]

[0014] in, and These are the maximum and minimum values ​​of the first processing delay interval, respectively. The first time slot length of the local area network is used for forwarding in the first circular queue. This is the first piece of information to spread.

[0015] According to a transmission method provided by the present invention, the calculation method of the second diffusion information is specifically as follows:

[0016]

[0017] in, As the first diffused information, T csqf For the second time slot length of the periodic circular queue forwarding wide area network, N csqf This is the second diffusion information.

[0018] According to a transmission method provided by the present invention, the calculation method of the third diffusion information is specifically as follows:

[0019]

[0020] in, and These are the maximum and minimum values ​​of the second processing delay interval, respectively. The length of the third time slot, This is the third type of information disseminated.

[0021] According to a transmission method provided by the present invention, the end-to-end maximum transmission delay includes: a first circular queue forwarding local area network maximum delay, a first cross-domain delay, and a periodically specified circular queue forwarding wide area network maximum delay, a second cross-domain delay, and a second circular queue forwarding local area network maximum delay;

[0022] Wherein, the first cross-domain delay is the cross-domain delay from the first circular queue forwarding local area network to the periodically specific circular queue forwarding wide area network, and the second cross-domain delay is the cross-domain delay from the periodically specific circular queue forwarding wide area network to the second circular queue forwarding local area network.

[0023] According to a transmission method provided by the present invention, the method for calculating the maximum latency of the first circular queue forwarding local area network includes:

[0024] The maximum latency of the first circular queue forwarding local area network is determined based on the maximum value of the first processing latency interval, the length of the first time slot, and the first hop count of the first transmission path in the first circular queue forwarding local area network.

[0025] According to a transmission method provided by the present invention, the method for calculating the maximum latency of the first circular queue forwarding local area network is as follows:

[0026]

[0027] in, The maximum local area network latency for forwarding in the first circular queue. This is the first hop number. The maximum value of the first processing delay interval. The first time slot length for forwarding local area networks in the first circular queue.

[0028] According to a transmission method provided by the present invention, the method for calculating the maximum latency of a wide area network via a periodically specific circular queue forwarding method includes:

[0029] Based on the second time slot length, the second hop count of the first transmission path in the periodically specific circular queue forwarding wide area network, and the time slot deviation between adjacent router links in the periodically specific circular queue forwarding wide area network, the maximum latency of the periodically specific circular queue forwarding wide area network is determined.

[0030] The time slot deviation value is obtained based on the difference between the start time of the upstream router node time slot and the start time of the downstream router node time slot in the adjacent router link.

[0031] According to a transmission method provided by the present invention, the method for calculating the maximum latency of a wide area network using a periodically specific circular queue forwarding method is as follows:

[0032]

[0033] in, To specify the maximum latency of a circular queue forwarding over a wide area network, T is the second hop number. csqf The length of the second time slot. To specify the time slot offset between adjacent router links in a wide area network for periodic circular queue forwarding, For periodic, specific circular queue forwarding of link e in a wide area network i The propagation delay For periodic, specific circular queue forwarding of link e in a wide area network i-1 The propagation delay is given by frac, which is a fractional part function, indicating that the fractional part is taken, and i is the link number of the first transmission path in the periodic cyclic queue forwarding wide area network.

[0034] According to a transmission method provided by the present invention, the method for calculating the maximum latency of a second circular queue forwarding local area network includes:

[0035] The maximum latency of the second circular queue forwarding local area network is determined based on the second processing delay interval of the circular queue forwarding gateway in the second circular queue forwarding local area network, the third time slot length of the second circular queue forwarding local area network, and the third hop count of the first transmission path in the second circular queue forwarding local area network.

[0036] According to a transmission method provided by the present invention, the method for calculating the maximum latency of the second circular queue forwarding local area network is as follows:

[0037]

[0038] in, The maximum local area network latency for forwarding the second circular queue. This is the maximum value of the second processing delay interval. For the third hop number, Let m be the length of the third time slot, m be the first circular queue forwarding local area network, and m' be the second circular queue forwarding local area network.

[0039] The present invention also provides a transmission device, comprising:

[0040] The receiving module is used to receive the transmission latency requirements and transmission jitter requirements of the service stream sent by the first terminal;

[0041] The transmission module is configured to transmit the service flow to the second terminal at the end of the first transmission path, in sequence via a first circular queue forwarding local area network, a periodically specific circular queue forwarding wide area network, and a second circular queue forwarding local area network, when the end-to-end maximum transmission delay of the first transmission path corresponding to the service flow is less than the transmission delay requirement and the end-to-end maximum jitter of the first transmission path is less than the transmission jitter requirement.

[0042] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the transmission method as described above.

[0043] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the transmission method as described above.

[0044] The present invention also provides a computer program product, including a computer program that, when executed by a processor, implements the transmission method as described above.

[0045] The transmission method, apparatus, electronic device, and storage medium provided by this invention propose a cross-domain networking scheme for CQF and Cycle Specified Queuing and Forwarding (CSQF) wide-area networks. This scheme enables deterministic transmission across wide areas between different CQF networks. By analyzing the end-to-end maximum jitter and maximum latency without cross-domain time slot mapping and clock synchronization, this scheme simplifies networking complexity while providing deterministic quality of service (QoS) guarantees for service flow scheduling. Attached Figure Description

[0046] To more clearly illustrate the technical solutions in this invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0047] Figure 1 This is a schematic diagram of the cross-domain networking architecture provided in the embodiments of this application;

[0048] Figure 2 This is a schematic diagram of the transmission method provided in the embodiments of this application;

[0049] Figure 3 This is a schematic diagram of the transmission from CQF local area network to CSQF wide area network in an embodiment of this application;

[0050] Figure 4 This is a schematic diagram illustrating the maximum transmission delay within the local area network of the first ring queue forwarding in this embodiment of the application.

[0051] Figure 5 This is a schematic diagram illustrating the maximum transmission delay of a periodically specific circular queue forwarding wide area network as described in the embodiments of this application;

[0052] Figure 6 This is a schematic diagram of the transmission device structure provided in the embodiments of this application;

[0053] Figure 7 This is a schematic diagram of the structure of the electronic device provided by the present invention. Detailed Implementation

[0054] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this invention. All other embodiments obtained by those skilled in the art based on the embodiments of this invention without creative effort are within the scope of protection of this invention.

[0055] To achieve deterministic transmission over long distances and wide areas, the CSQF (Continuous Confidentiality Queuing) mechanism was proposed. In CSQF, time is divided into equal-length time slots. Unlike CQF (Concurrent Confidentiality Queuing), CSQF only requires frequency synchronization between devices. It uses time slot mapping to specify hop-by-hop transmission time slots to guarantee bounded transmission delay and jitter, significantly increasing the scalability of the CSQF mechanism. The CSQF mechanism can guarantee an upper bound of 2T for end-to-end transmission delay jitter of data packets. csqf Although the CSQF mechanism solves the problem of deterministic transmission over long distances and wide areas, it is still difficult to combine the CSQF mechanism with the CQF mechanism.

[0056] In an optional embodiment, in the CQF mechanism, time is divided into equal-length time slots d. Precise time synchronization is required between all devices implementing CQF. Each device has two queues at each output port. Within a time slot, one queue is in the transmission state, and the other is in the reception state. In the next time slot, the states of the two queues are swapped, creating a circular queue. This means that a data packet received in a certain time slot c will be forwarded in time slot (c+1). Simultaneously, CQF requires that data packets sent by an upstream node in time slot c must be received by the adjacent downstream node within the same time slot (i.e., c). Under the CQF mechanism, the upper and lower bounds of the data packet delay are:

[0057] D max = (h+1)×d

[0058] Dmin = (h-1)×d

[0059] Where D max and D min These are the upper and lower bounds of the delay, respectively, where h represents the number of hops and d represents the period length.

[0060] The transmission method described in this application embodiment can be used in a cross-domain networking architecture of CQF and CSQF. Figure 1 This is a schematic diagram of the cross-domain networking architecture provided in the embodiments of this application, such as... Figure 1 As shown, the network includes a first CQF local area network (LAN) domain 11, a CSQF wide area network (WAN) domain 12, a second CQF LAN domain 13, and a cross-domain control and orchestration unit 14. The transmission equipment in the first CQF LAN domain 11 includes a first terminal 111, a CQF switch 112, and a CQF gateway 113; the control equipment includes a CQF LAN controller 114. The transmission equipment in the CSQF WAN domain 12 includes a CSQF router 121; the control equipment includes a CSQF network controller 122. The second CQF LAN domain 13 includes a second terminal 131, a CQF switch 112, and a CQF gateway 113; the control equipment includes a CQF LAN controller 114. The cross-domain control and orchestration unit 14 is responsible for network information collection, service flow access control, label synchronization, cross-domain path planning, and network resource allocation. The transmission devices in the first CQF LAN domain 11 and the second CQF LAN domain 13 both implement the CQF transmission mechanism to achieve the aggregation of service traffic; the transmission devices in the CSQF WAN domain 12 all implement the CSQF transmission mechanism to achieve long-distance deterministic transmission of service traffic in the WAN.

[0061] The service flow transmission process in the above network architecture is as follows: ① The service flow originates from the first terminal, is forwarded by the CQF switch within the first CQF local area network, and then enters the CSQF wide area network via the CQF gateway of the first CQF local area network; ② After long-distance transmission through the CSQF wide area network, it reaches the CQF gateway of the second CQF local area network; ③ Within the second CQF local area network, after being forwarded by the CQF gateway and CQF switch, it reaches the second terminal, completing the end-to-end transmission process. In summary, the service flow transmission will be completed through cross-domain transmission from the first CQF to the CSQF to the second CQF.

[0062] In this embodiment, the terminal is responsible for generating and receiving data packets, with the first terminal responsible for generating the data packets and the second terminal responsible for receiving them. Furthermore, the terminal device needs to support the relevant specifications for the CQF mechanism in the IEEE 802.1Qch standard.

[0063] The CQF switch in this embodiment operates the CQF mechanism for deterministic transmission, supporting the relevant specifications for CQF switching systems in the IEEE 802.1Qch standard. Furthermore, it maintains precise clock synchronization with CQF gateways within the same CQF local area network.

[0064] The CQF gateway in this application embodiment needs to support the CQF transmission mechanism and be able to convert L2 data packets in the local area network into L3 data packets in the wide area network to identify the service flow so that the wide area network device can identify and transmit it; similarly, it needs to be able to convert L3 data packets transmitted in the wide area network into L2 data packets so that the data packets can be delivered to the target terminal.

[0065] The CSQF router in this application embodiment runs the CSQF forwarding mechanism to achieve long-distance deterministic transmission and supports the DetNet draft-chen-detnet-sr-based-bounded-latency-01.

[0066] In this embodiment, the CQF LAN controller is responsible for collecting network information within the network domain, including topology, link information, device information, network load information, etc., and supports functions such as CQF transmission slot length configuration, intra-domain service flow transmission path planning, and intra-domain service flow transmission delay and jitter calculation.

[0067] In this embodiment, the CSQF network controller is responsible for collecting network information within the wide area network, including topology, link information, device information, network load information, etc. It supports functions such as CSQF transmission slot length configuration, label planning required by the CSQF mechanism, intra-domain service flow transmission path planning, and intra-domain service flow transmission delay and jitter calculation.

[0068] The cross-domain networking architecture in this application embodiment can be used It means that, among them This represents the m-th CQF local area network. All CQF networks are connected via their respective cross-domain links. Connect to CSQF WAN G csqf CQF Local Area Network The set Indicates CQF network The devices (including terminal devices, CQF switches, and CQF gateways) in the collection Indicates CQF network Links in CSQF wide area network G. csqf ={V csqf E csqf}, where set V csqf Represents the set of devices (including CSQF routers), set E csqfRepresents a set of links.

[0069] make For the network CQF slot length, T csqf For network G csqf The CSQF time slot length. Let τ e Let be the propagation delay of link e. Wherein, link... At that time, τ e =0. Otherwise, τ e Not zero.

[0070] Figure 2 This is a schematic diagram of the transmission method provided in the embodiments of this application, such as... Figure 2 As shown, it includes:

[0071] Step 210: Receive the transmission latency requirements and transmission jitter requirements of the service stream sent by the first terminal;

[0072] Optionally, when the first terminal generates a service flow transmission requirement, the first terminal will upload the service flow transmission latency requirement and transmission jitter requirement to the cross-domain control and orchestration unit.

[0073] In this embodiment, the cross-domain control and orchestrator is responsible for performing admission control of service flows based on the transmission latency information and network load information provided by the controllers of each network domain, and for performing end-to-end path planning for the admitted service flows. Resource reservation for service flow transmission is achieved through configuration distribution.

[0074] Step 220: If the maximum end-to-end transmission delay of the first transmission path corresponding to the service flow is less than the transmission delay requirement, and the maximum end-to-end jitter of the first transmission path is less than the transmission jitter requirement, the service flow is transmitted to the second terminal at the end of the first transmission path via the first circular queue forwarding local area network, the periodically specific circular queue forwarding wide area network, and the second circular queue forwarding local area network according to the first transmission path.

[0075] After receiving the transmission latency and jitter requirements of the service flow sent by the first terminal, the cross-domain controller and orchestrator will select a first transmission path P for the service flow in the cross-domain networking architecture described above.

[0076] In this embodiment of the application, the first transmission path P corresponding to the service flow can specifically be an end-to-end cross-WAN transmission path in the above-mentioned cross-domain networking architecture, where the source node is the first terminal generating the service flow, and the end node is the destination terminal of the service flow, i.e., the second terminal, and it must pass through two CQF local area networks and one CSQF wide area network. Let For the first transmission path P in the CQF network The number of jumps in the middle, This represents the number of hops in the CSQF network for the first transmission path P.

[0077] After determining the first transmission path P, the end-to-end maximum transmission delay and end-to-end maximum jitter of the first transmission path P can be further analyzed.

[0078] If the maximum end-to-end transmission delay of the first transmission path corresponding to the service flow is less than the transmission delay requirement, and the maximum end-to-end jitter of the first transmission path is less than the transmission jitter requirement, then the cross-domain control and orchestration unit will allow the service flow to access, and will reserve transmission resources on the first transmission path P. The service flow will be transmitted to the second terminal at the end of the first transmission path according to the first transmission path, sequentially via the first circular queue forwarding local area network, the periodically specific circular queue forwarding wide area network, and the second circular queue forwarding local area network.

[0079] If the maximum end-to-end transmission delay of the first transmission path corresponding to the service flow is greater than or equal to the transmission delay requirement, and the maximum end-to-end jitter of the first transmission path is greater than or equal to the transmission jitter requirement, then the cross-domain controller and orchestrator will change the transmission path. If all feasible paths do not meet the conditions, the access of the service flow will be rejected.

[0080] Optionally, a cross-domain networking scheme for CQF and CSQF is proposed, which can realize deterministic transmission across wide areas between different CQF networks. By analyzing the end-to-end maximum jitter and maximum latency without cross-domain time slot mapping and clock synchronization, deterministic quality of service guarantees can be provided for the scheduling of service flows while simplifying the networking complexity.

[0081] Optionally, the method for determining the end-to-end maximum jitter includes:

[0082] Based on the first processing delay interval of the circular queue forwarding gateway in the first circular queue forwarding local area network and the first time slot length of the first circular queue forwarding local area network, the first diffusion information is determined; the first diffusion information is the number of transmission time slots in which the service flow diffuses in the first circular queue forwarding local area network.

[0083] Based on the first diffusion information, the first time slot length, and the second time slot length of the periodically specific circular queue forwarding wide area network, the second diffusion information is determined; the second diffusion information is the number of transmission time slots in which the service flow diffuses in the periodically specific circular queue forwarding wide area network.

[0084] Based on the second diffusion information, the second time slot length, the second processing delay interval of the circular queue forwarding gateway in the second circular queue forwarding local area network, and the third time slot length of the second circular queue forwarding local area network, the third diffusion information is determined; the third diffusion information is the number of transmission time slots in which the service flow diffuses in the second circular queue forwarding local area network.

[0085] The end-to-end maximum jitter is determined based on the first time slot length, the third diffusion information, and the third time slot length.

[0086] Optionally, due to changes in network architecture, unlike the original CQF and CSQF mechanisms, the maximum jitter of the service flow transmission may be amplified during cross-domain transmission after the end-to-end transmission passes through the first CQF → CSQF → second CQF.

[0087] In this embodiment of the application, the first CQF local area network is used respectively. To CSQF WAN G csqf and CSQF wide area network G csqf To the other end of the second CQF LAN We analyze the jitter dispersion of two cross-domain transmissions to determine the maximum jitter at the end.

[0088] In the application embodiment, the first processing delay interval of the circular queue forwarding gateway in the first circular queue forwarding local area network is: The upper and lower bounds of this delay interval are respectively and The first time slot length of the first circular queue forwarding local area network is...

[0089] In this embodiment, when a service flow arriving at the CQF gateway in the same CQF timeslot leaves the CQF gateway and arrives at the CSQF router, it may be spread across multiple consecutive CSQF timeslots for transmission due to two factors: firstly, the CQF gateway handles latency fluctuations; and secondly, the cross-domain clocks are not synchronized and no timeslot mapping relationship is established. Figure 3 This is a schematic diagram of the transmission from CQF LAN to CSQF WAN in an embodiment of this application, as shown below. Figure 3 As shown, for The fastest data packet received by gateway v1 in time slot x is the one received at the beginning of time slot x and processed with minimal delay. The fastest data packets to be processed are those received close to the end of time slot x, and those processed after the maximum delay. Only data packets that can be processed at this time slot x. Therefore, the processing of data packets received in time slot x will extend to a length of... Within this time period. Ultimately, at the CQF gateway's outgoing port, these packets will be distributed to... Forwarding is performed on each CQF transmission time slot.

[0090] Optionally, the first diffusion information The calculation method is as follows:

[0091]

[0092] in, This is the upper bound of the first processing delay interval, i.e., the maximum value of the interval. This is the lower bound of the first processing delay interval, i.e., the minimum value of the interval. This is the length of the first time slot in the first CQF local area network.

[0093] Optionally, the data stream passes through a cross-domain link. The data is transmitted to the CSQF router. Because cross-domain transmission lacks clock synchronization and time slot mapping, the maximum number of packets received by the CSQF router can spread to N. csqf Forwarding is performed on each CSQF transmission slot.

[0094] Second diffusion information N csqf The calculation method is as follows

[0095]

[0096] in, As the first diffused information, T csqf The second time slot length for the periodic circular queue forwarding wide area network.

[0097] Afterwards in G csqf The transmission within will not continue to spread.

[0098] Optionally, with the first CQF local area network To G csqf Similarly, in cross-domain transmission, the second CQF local area network Second processing delay of CQF gateway The upper and lower bounds are respectively and The maximum data packet size could potentially expand to Forwarding occurs within each CQF time slot.

[0099] Third diffusion information The calculation method is as follows:

[0100]

[0101] in, These are the maximum and minimum values ​​of the second processing delay interval, respectively. The length of the third time slot. This is the third type of information disseminated.

[0102] After that The transmission within will not continue to spread.

[0103] In summary, the maximum value of end-to-end delay jitter for

[0104]

[0105] Optionally, the jitter dispersion of cross-domain transmissions from the first CQF LAN to the CSQF WAN and from the CSQF WAN to the second CQF LAN is fully considered, thus obtaining the maximum value of end-to-end delay jitter with relatively accurate analysis.

[0106] Optionally, the end-to-end maximum transmission delay includes: a first circular queue forwarding local area network maximum delay, a first cross-domain delay, and a periodically specified circular queue forwarding wide area network maximum delay, a second cross-domain delay, and a second circular queue forwarding local area network maximum delay;

[0107] Wherein, the first cross-domain delay is the cross-domain delay from the first circular queue forwarding local area network to the periodically specific circular queue forwarding wide area network, and the second cross-domain delay is the cross-domain delay from the periodically specific circular queue forwarding wide area network to the second circular queue forwarding local area network.

[0108] Optionally, Figure 4 This is a schematic diagram illustrating the maximum transmission delay within the local area network for the first ring queue forwarding in this embodiment of the application, as shown below. Figure 4 As shown, the signal arrives at the start of time slot y of the first terminal v1, and is only forwarded out near the end of time slot y+4 of the CQF gateway v3, thus leaving.

[0109] Data packets are forwarded in the first circular queue on the local area network. Maximum transmission delay The calculation method is as follows:

[0110]

[0111] in, The maximum local area network latency for forwarding in the first circular queue. This represents the first hop number of the first transmission path in the first circular queue forwarding local area network. The maximum value of the first processing delay interval. The first time slot length for forwarding local area networks in the first circular queue.

[0112] Optionally, To G csqf Cross-domain latency is defined as cross-domain link latency. The propagation delay, i.e.

[0113] Optionally, the method for calculating the maximum latency of the periodically specific circular queue forwarding wide area network includes:

[0114] Based on the second time slot length, the second hop count of the first transmission path in the periodically specific circular queue forwarding wide area network, and the time slot deviation between adjacent router links in the periodically specific circular queue forwarding wide area network, the maximum latency of the periodically specific circular queue forwarding wide area network is determined.

[0115] The time slot deviation value is obtained based on the difference between the start time of the upstream router node time slot and the start time of the downstream router node time slot in the adjacent router link.

[0116] Figure 5 This is a schematic diagram illustrating the maximum transmission delay of a periodically specific circular queue forwarding WAN as described in the embodiments of this application, such as... Figure 5 As shown, the first CSQF router on the transmission path (i.e. Figure 5 The start time of slot x in v1 arrives at the last CSQF router on the approach path (i.e., Figure 5 The CSQF WAN is only forwarded at the end of time slot z+6 (v3) and leaves the CSQF WAN. Because CSQF routers only need to achieve frequency synchronization, each link maintains the CSQF time slot offset between adjacent routers, such as... Figure 5 The deviation value of link e1 is It is defined as the start time of the upstream node time slot of link e1 minus the start time of the downstream node time slot, and the deviation value must be greater than or equal to 0.

[0117] Optionally, the first transmission path P is in G csqf The path inside is The first circular queue forwards the maximum local area network latency. The calculation method is as follows:

[0118]

[0119] in, To specify the maximum latency of a circular queue forwarding over a wide area network, T is the second hop number. csqf The length of the second time slot. To specify the time slot offset between adjacent router links in a wide area network for periodic circular queue forwarding, For periodic, specific circular queue forwarding of link e in a wide area network i The propagation delay For periodic, specific circular queue forwarding of link e in a wide area network i-1 The propagation delay is given by frac, which is a fractional part function, indicating that the fractional part is taken, and i is the link number of the first transmission path in the periodic cyclic queue forwarding wide area network.

[0120] Optionally, a periodic circular queue forwarding wide area network G is used. csqf Forwarding to the second circular queue on the local area network Cross-domain latency is defined as cross-domain link latency. The propagation delay, i.e.

[0121] Optionally, the method for calculating the maximum latency of the second circular queue forwarding local area network includes:

[0122] The maximum latency of the second circular queue forwarding local area network is determined based on the second processing delay interval of the circular queue forwarding gateway in the second circular queue forwarding local area network, the third time slot length of the second circular queue forwarding local area network, and the third hop count of the first transmission path in the second circular queue forwarding local area network.

[0123] Optionally, the second circular queue forwards local area network traffic. Maximum delay Appeared in the passing After the maximum processing delay, the data packet arrives at the CQF gateway's output port at the start of the second CQF time slot.

[0124] The second loop queue forwards the maximum local area network latency. The calculation method is as follows:

[0125]

[0126] in, The maximum local area network latency for forwarding the second circular queue. This is the maximum value of the second processing delay interval. For the third hop number, Let m be the length of the third time slot, m be the first circular queue forwarding local area network, and m' be the second circular queue forwarding local area network.

[0127] After calculating the maximum latency for each stage, the maximum end-to-end latency is:

[0128]

[0129] Optionally, by performing phased maximum latency analysis, namely analyzing the maximum latency of the first circular queue forwarding in the local area network and the first cross-domain latency respectively, and periodically specifying the maximum latency of the circular queue forwarding in the wide area network, the second cross-domain latency, and the second circular queue forwarding in the local area network, the accurate end-to-end maximum transmission latency can be finally obtained.

[0130] In an optional embodiment, the first CQF local area network The CQF LAN controller will The CQF slot configuration is as follows and All devices within the system maintain precise clock synchronization. Furthermore, the controller obtains an upper bound on processing latency from the CQF gateway. and the lower realm Similarly, the second CQF LAN The CQF LAN controller will The CQF slot configuration is as follows Get and

[0131] CSQF WAN G csqf The CSQF network controller will G csqf The CSQF time slot configuration is T csqf .right Controller maintenance time slot deviation value

[0132] The cross-domain controller and orchestrator obtains network parameter information from each CQF LAN controller and CSQF network controller, and maintains the propagation delay information of each cross-domain link.

[0133] The source terminal generates a service flow transmission requirement f, and the transmission latency requirement of f is less than τ. f The jitter requirement is less than J. f The source terminal will demand τ f With J f Upload to the cross-domain controller and orchestrator.

[0134] The cross-domain controller and orchestrator selects a transmission path P, and according to... as well as The calculation formula yields the end-to-end maximum transmission delay and maximum jitter for path P. If the following conditions are met... and If the conditions are not met, the service flow f is allowed to access the network, and transmission resources are reserved on path P; if the conditions are not met, the transmission path P is changed; if all feasible paths fail to meet the conditions, the access of f is rejected.

[0135] The transmission device provided by the present invention will be described below. The transmission device described below can be referred to in correspondence with the transmission method described above.

[0136] Figure 6 This is a schematic diagram of the transmission device structure provided in the embodiments of this application, such as... Figure 6 As shown, it includes:

[0137] The receiving module 610 is used to receive the transmission delay requirements and transmission jitter requirements of the service stream sent by the first terminal;

[0138] The transmission module 620 is used to transmit the service flow to the second terminal at the end of the first transmission path, in sequence via the first circular queue forwarding local area network, the periodically specific circular queue forwarding wide area network, and the second circular queue forwarding local area network, when the end-to-end maximum transmission delay of the first transmission path corresponding to the service flow is less than the transmission delay requirement and the end-to-end maximum jitter of the first transmission path is less than the transmission jitter requirement.

[0139] Optionally, the device is further used for:

[0140] The first diffusion information is determined based on the first processing delay interval of the circular queue forwarding gateway in the first circular queue forwarding local area network and the first time slot length of the first circular queue forwarding local area network.

[0141] Based on the first diffusion information, the first time slot length, and the second time slot length of the periodically specific circular queue forwarding wide area network, the second diffusion information is determined;

[0142] The third diffusion information is determined based on the second diffusion information, the second time slot length, the second processing delay interval of the circular queue forwarding gateway in the second circular queue forwarding local area network, and the third time slot length of the second circular queue forwarding local area network.

[0143] The end-to-end maximum jitter is determined based on the first time slot length, the third diffusion information, and the third time slot length.

[0144] Optionally, the end-to-end maximum transmission delay includes: a first circular queue forwarding local area network maximum delay, a first cross-domain delay, and a periodically specified circular queue forwarding wide area network maximum delay, a second cross-domain delay, and a second circular queue forwarding local area network maximum delay;

[0145] Wherein, the first cross-domain delay is the cross-domain delay from the first circular queue forwarding local area network to the periodically specific circular queue forwarding wide area network, and the second cross-domain delay is the cross-domain delay from the periodically specific circular queue forwarding wide area network to the second circular queue forwarding local area network.

[0146] Optionally, the device is further used for:

[0147] The maximum latency of the first circular queue forwarding local area network is determined based on the maximum value of the first processing latency interval, the length of the first time slot, and the first hop count of the first transmission path in the first circular queue forwarding local area network.

[0148] Optionally, the device is further used for:

[0149] Based on the second time slot length, the second hop count of the first transmission path in the periodically specific circular queue forwarding wide area network, and the time slot deviation between adjacent router links in the periodically specific circular queue forwarding wide area network, the maximum latency of the periodically specific circular queue forwarding wide area network is determined.

[0150] The time slot deviation value is obtained based on the difference between the start time of the upstream router node time slot and the start time of the downstream router node time slot in the adjacent router link.

[0151] Optionally, the device is further used for:

[0152] The maximum latency of the second circular queue forwarding local area network is determined based on the second processing delay interval of the circular queue forwarding gateway in the second circular queue forwarding local area network, the third time slot length of the second circular queue forwarding local area network, and the third hop count of the first transmission path in the second circular queue forwarding local area network.

[0153] Optionally, a cross-domain networking scheme for CQF and CSQF is proposed, which can realize deterministic transmission across wide areas between different CQF networks. By analyzing the end-to-end maximum jitter and maximum latency without cross-domain time slot mapping and clock synchronization, deterministic quality of service guarantees can be provided for the scheduling of service flows while simplifying the networking complexity.

[0154] Figure 7 This is a schematic diagram of the structure of the electronic device provided by the present invention, such as... Figure 7 As shown, the electronic device may include a processor 710, a communications interface 720, a memory 730, and a communication bus 740, wherein the processor 710, the communications interface 720, and the memory 730 communicate with each other via the communication bus 740. The processor 710 can call logical instructions in the memory 730 to execute a transmission method, which includes receiving the transmission delay requirements and transmission jitter requirements of the service stream sent by the first terminal.

[0155] If the maximum end-to-end transmission delay of the first transmission path corresponding to the service flow is less than the transmission delay requirement, and the maximum end-to-end jitter of the first transmission path is less than the transmission jitter requirement, the service flow is transmitted to the second terminal at the end of the first transmission path via the first circular queue forwarding local area network, the periodically specific circular queue forwarding wide area network, and the second circular queue forwarding local area network in sequence according to the first transmission path.

[0156] Furthermore, the logical instructions in the aforementioned memory 730 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, essentially, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0157] On the other hand, the present invention also provides a computer program product, the computer program product including a computer program, the computer program being stored on a non-transitory computer-readable storage medium, and when the computer program is executed by a processor, the computer is able to execute the transmission method provided by the above methods, the method including: receiving the transmission delay requirements and transmission jitter requirements of the service stream sent by the first terminal;

[0158] If the maximum end-to-end transmission delay of the first transmission path corresponding to the service flow is less than the transmission delay requirement, and the maximum end-to-end jitter of the first transmission path is less than the transmission jitter requirement, the service flow is transmitted to the second terminal at the end of the first transmission path via the first circular queue forwarding local area network, the periodically specific circular queue forwarding wide area network, and the second circular queue forwarding local area network in sequence according to the first transmission path.

[0159] In another aspect, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, is implemented to perform the transmission methods provided by the above methods, the method comprising: receiving transmission delay requirements and transmission jitter requirements of a service stream sent by a first terminal;

[0160] If the maximum end-to-end transmission delay of the first transmission path corresponding to the service flow is less than the transmission delay requirement, and the maximum end-to-end jitter of the first transmission path is less than the transmission jitter requirement, the service flow is transmitted to the second terminal at the end of the first transmission path via the first circular queue forwarding local area network, the periodically specific circular queue forwarding wide area network, and the second circular queue forwarding local area network in sequence according to the first transmission path.

[0161] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0162] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0163] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A transmission method, characterized in that, include: The transmission latency and jitter requirements for receiving the service stream sent by the first terminal; If the maximum end-to-end transmission delay of the first transmission path corresponding to the service flow is less than the transmission delay requirement, and the maximum end-to-end jitter of the first transmission path is less than the transmission jitter requirement, the service flow is transmitted to the second terminal at the end of the first transmission path via the first circular queue forwarding local area network, the periodically specific circular queue forwarding wide area network, and the second circular queue forwarding local area network in sequence according to the first transmission path. The end-to-end maximum jitter is determined based on the first timeslot length of the first circular queue forwarding local area network, the third diffusion information, and the third timeslot length of the second circular queue forwarding local area network; the third diffusion information is the number of transmission timeslots that the service flow diffuses in the second circular queue forwarding local area network.

2. The transmission method according to claim 1, characterized in that, The method for determining the end-to-end maximum jitter includes: Based on the first processing delay interval of the circular queue forwarding gateway in the first circular queue forwarding local area network and the first time slot length of the first circular queue forwarding local area network, the first diffusion information is determined. The first diffusion information is the number of transmission time slots in which the service flow diffuses in the first circular queue forwarding local area network. Based on the first diffusion information, the first time slot length, and the second time slot length of the periodically specific circular queue forwarding wide area network, the second diffusion information is determined. The second diffusion information is the number of transmission time slots that the service flow diffuses in the periodically specific circular queue forwarding wide area network. The third diffusion information is determined based on the second diffusion information, the second time slot length, the second processing delay interval of the circular queue forwarding gateway in the second circular queue forwarding local area network, and the third time slot length of the second circular queue forwarding local area network. The end-to-end maximum jitter is determined based on the first time slot length, the third diffusion information, and the third time slot length.

3. The transmission method according to claim 2, characterized in that, The calculation method for the first diffusion information is as follows: in, and These are the maximum and minimum values ​​of the first processing delay interval, respectively. The first time slot length of the local area network is used for forwarding in the first circular queue. This is the first piece of information to spread.

4. The transmission method according to claim 3, characterized in that, The calculation method for the second diffusion information is as follows: in, This is the first piece of information to spread. The second time slot length of the circular queue forwarding wide area network is specified for the periodicity. This is the second diffusion information.

5. The transmission method according to claim 4, characterized in that, The calculation method for the third diffusion information is as follows: in, and These are the maximum and minimum values ​​of the second processing delay interval, respectively. The length of the third time slot, This is the third type of information disseminated.

6. The transmission method according to claim 2, characterized in that, The end-to-end maximum transmission delay includes: the first circular queue forwarding local area network maximum delay, the first cross-domain delay, the periodically specified circular queue forwarding wide area network maximum delay, the second cross-domain delay, and the second circular queue forwarding local area network maximum delay; Wherein, the first cross-domain delay is the cross-domain delay from the first circular queue forwarding local area network to the periodically specific circular queue forwarding wide area network, and the second cross-domain delay is the cross-domain delay from the periodically specific circular queue forwarding wide area network to the second circular queue forwarding local area network.

7. The transmission method according to claim 6, characterized in that, The method for calculating the maximum latency of the first circular queue forwarding local area network includes: The maximum latency of the first circular queue forwarding local area network is determined based on the maximum value of the first processing latency interval, the length of the first time slot, and the first hop count of the first transmission path in the first circular queue forwarding local area network.

8. The transmission method according to claim 7, characterized in that, The method for calculating the maximum latency of the first circular queue forwarding in the local area network is as follows: in, The maximum local area network latency for forwarding in the first circular queue. This is the first hop number. The maximum value of the first processing delay interval. The first time slot length for forwarding local area networks in the first circular queue.

9. The transmission method according to claim 6, characterized in that, The method for calculating the maximum latency of a periodically specific circular queue forwarding wide area network includes: Based on the second time slot length, the second hop count of the first transmission path in the periodically specific circular queue forwarding wide area network, and the time slot deviation between adjacent router links in the periodically specific circular queue forwarding wide area network, the maximum latency of the periodically specific circular queue forwarding wide area network is determined. The time slot deviation value is obtained based on the difference between the start time of the upstream router node time slot and the start time of the downstream router node time slot in the adjacent router link.

10. The transmission method according to claim 9, characterized in that, The method for calculating the maximum latency of the periodically specific circular queue forwarding wide area network is as follows: in, To specify the maximum latency of a circular queue forwarding over a wide area network, This is the second hop number. The length of the second time slot. To specify the time slot offset between adjacent router links in a wide area network for periodic circular queue forwarding, For periodic, circular queue forwarding in wide area networks The propagation delay For periodic, circular queue forwarding in wide area networks The propagation delay This is a decimal part function, indicating that the decimal part is taken. The link number of the first transmission path in the periodic circular queue forwarding wide area network.

11. The transmission method according to claim 6, characterized in that, The method for calculating the maximum latency of the second circular queue forwarding local area network includes: The maximum delay of the second circular queue forwarding local area network is determined based on the second processing delay interval of the circular queue forwarding gateway in the second circular queue forwarding local area network, the third time slot length of the second circular queue forwarding local area network, and the third hop count of the first transmission path in the second circular queue forwarding local area network.

12. The transmission method according to claim 11, characterized in that, The method for calculating the maximum latency of the second circular queue forwarding in the local area network is as follows: in, The maximum local area network latency for forwarding the second circular queue. This is the maximum value of the second processing delay interval. For the third hop number, The length of the third time slot, m Forward local network traffic for the first circular queue. m' Forward local network traffic for the second circular queue.

13. A transmission device, characterized in that, include: The receiving module is used to receive the transmission latency requirements and transmission jitter requirements of the service stream sent by the first terminal; The transmission module is configured to transmit the service flow to the second terminal at the end of the first transmission path, in sequence via a first circular queue forwarding local area network, a periodically specific circular queue forwarding wide area network, and a second circular queue forwarding local area network, when the end-to-end maximum transmission delay of the first transmission path corresponding to the service flow is less than the transmission delay requirement and the end-to-end maximum jitter of the first transmission path is less than the transmission jitter requirement. The end-to-end maximum jitter is determined based on the first timeslot length of the first circular queue forwarding local area network, the third diffusion information, and the third timeslot length of the second circular queue forwarding local area network; the third diffusion information is the number of transmission timeslots that the service flow diffuses in the second circular queue forwarding local area network.

14. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the transmission method as described in any one of claims 1 to 12.

15. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the transmission method as described in any one of claims 1 to 12.

Images