Deterministic transmission method and device based on fusion network, equipment and storage medium

Abstract

The application provides a kind of certainty transmission method, device and equipment based on fusion network and storage medium, it is related to communication technical field, method, comprising: receiving the transmission resource demand of service stream sent by first terminal, transmission delay demand and transmission jitter demand;In the case where the first transmission path of service stream meets transmission delay demand and transmission jitter demand, and the transmission resource on the transmission time slot along the way of first transmission path meets transmission resource demand, service stream is transmitted from first terminal to second terminal;Wherein, service stream is transmitted from first terminal to second terminal specifically includes: service stream is transmitted to the second terminal of first transmission path terminal according to first transmission path, in turn via first cyclic queue forwarding local area network, periodic cyclic queue forwarding wide area network and second cyclic queue forwarding local area network;Wherein, the transmission time slot along the way of first transmission path is associated with the sending time slot of service stream in first terminal.

Description

Technical Field

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

[0002] Among related technologies, the Cyclic Queuing and Forwarding (CQF) mechanism can only provide deterministic quality of service guarantees within a local area network and a small area, and cannot achieve long-distance, large-scale deterministic transmission. While the Cycle Specified Queuing and Forwarding (CSQF) mechanism can guarantee deterministic transmission over a wide area, the lack of clear interfaces between different vendors and the unclear internal implementation of the devices have made ensuring sufficient transmission resources for each service flow during the transmission process in a CQF / CSQF converged network a pressing issue for the industry. Summary of the Invention

[0003] This invention provides a deterministic transmission method, apparatus, device, and storage medium based on a converged network to solve the problem of how to ensure that each service flow has sufficient transmission resources during the transmission process in a converged CQF and CSQF network.

[0004] This invention provides a deterministic transmission method based on a converged network, comprising:

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

[0006] If the first transmission path of the service flow meets the transmission delay requirement and the transmission jitter requirement, and the transmission resources on the transmission time slots along the first transmission path meet the transmission resource requirement, the service flow is transmitted from the first terminal to the second terminal.

[0007] Specifically, the transmission of the service flow from the first terminal to the second terminal includes: the service flow is transmitted sequentially through 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, to the second terminal at the end of the first transmission path.

[0008] The transmission time slots along the first transmission path are associated with the transmission time slots of the service flow at the first terminal.

[0009] According to a deterministic transmission method based on a converged network provided by the present invention, the transmission resource requirements include: a first transmission resource requirement within a local area network via a first circular queue forwarding, a second transmission resource requirement on a first cross-domain link, a third transmission resource requirement within a wide area network via a periodically specific circular queue forwarding, a fourth transmission resource requirement on a second cross-domain link, and a fifth transmission resource requirement within a local area network via a second circular queue forwarding.

[0010] Wherein, the first cross-domain link refers to the transmission link from the first circular queue forwarding local area network to the periodically specific circular queue forwarding wide area network; the second cross-domain link is the transmission link from the periodically specific circular queue forwarding wide area network to the second circular queue forwarding local area network.

[0011] According to a deterministic transmission method based on a converged network provided by the present invention, the first transmission resource requirement includes:

[0012] The sum of the load of any first transmission time slot in the first circular queue forwarding local area network and the data packet load of the service flow is less than or equal to the product of the link bandwidth and time slot length in the first circular queue forwarding local area network.

[0013] Wherein, the first transmission time slot is the transmission time slot of the along-the-way transmission time slot in the first circular queue forwarding local area network.

[0014] According to the deterministic transmission method based on a converged network provided by the present invention, the first transmission resource requirement is specifically as follows:

[0015]

[0016] in,

[0017] Where, ω f For the data packet payload of the business flow, For time slots The load, For link The transmission time slot on the link, where i is the link number. Forward links in the local area network for the first circular queue bandwidth, The first time slot length in the local area network is forwarded to the first circular queue. For the first transmission path P, forward the local area network in the first circular queue. The number of jumps in the middle, For link The transmission time slots on the network.

[0018] According to a deterministic transmission method based on a converged network provided by the present invention, the second transmission resource requirement includes:

[0019] The sum of the load of any second transmission time slot on the first cross-domain link and the data packet load of the service flow is less than or equal to the product of the link bandwidth of the first cross-domain link and the transmission time slot of the first circular queue forwarding local area network.

[0020] Wherein, the second transmission time slot is the transmission time slot of the along-the-way transmission time slot in the first cross-domain link.

[0021] According to the deterministic transmission method based on a converged network provided by the present invention, the second transmission resource requirement is specifically as follows:

[0022]

[0023]

[0024] in, For the first cross-domain link The kth a The second transmission time slot, For link On the transmission time slot, For the first path P in the CQF network The number of jumps in the middle, This represents the minimum gateway processing latency in the first circular queue forwarding section of the local area network. The first time slot length in the local area network is forwarded to the first circular queue. For the first cross-domain link The kth a -1 second transmission time slot, k is the number of consecutive time slots on the first cross-domain link. a This is the sequence number of the second transmission time slot; For the first cross-domain leading time slot The load, ω f For the data packet payload of the data stream, For the first cross-domain link The link bandwidth.

[0025] According to a deterministic transmission method based on a converged network provided by the present invention, the third transmission resource requirement includes:

[0026] The sum of the load of any third transmission time slot in the periodic cyclic queue forwarding wide area network and the data packet load of the service flow is less than or equal to the product of the link bandwidth and time slot length in the periodic cyclic queue forwarding wide area network.

[0027] The third transmission time slot is the transmission time slot of the along-the-way transmission time slot in the periodically specific circular queue forwarding wide area network.

[0028] According to the deterministic transmission method based on a converged network provided by the present invention, the third transmission resource requirement specifically includes:

[0029]

[0030]

[0031]

[0032] Where, ω f For the data packet payload of the data stream, For the first cross-domain link On the transmission time slot, The first time slot length in the local area network is forwarded to the first circular queue. For the first cross-domain link The propagation delay For the first cross-domain link Boot time offset, This represents the number of hops in the first transmission path within the periodically specified circular queue forwarding wide area network. For the periodic circular queue forwarding of the (k-1)th transmission slot in the first link of the wide area network, For the periodic representation of a circular queue forwarding function, the k-th link in the first link of the wide area network... b The third transmission time slot, For periodic, a circular queue is used to forward the j-th element of a wide area network. a Transmission time slots in a link For periodic, a circular queue is used to forward the j-th element of a wide area network. a The first transmission slot of the -1 link, For periodic, a circular queue is used to forward the j-th element of a wide area network. a The kth link b -1 third transmission slot, For periodic, circular queue forwarding in wide area networks The propagation delay For periodic, circular queue forwarding in wide area networks Boot time offset, T csqf The second time slot length of the circular queue forwarding wide area network is specified for the periodicity. For periodic specification of circular queue forwarding of third transmission slots on wide area networks The load, For periodic, circular queue forwarding in wide area networks Link bandwidth, N csqf The number of time slots for business flows to spread in a wide area network during periodic circular queue forwarding.

[0033] According to a deterministic transmission method based on a converged network provided by the present invention, the fourth transmission resource requirement includes:

[0034] The sum of the load of any fourth transmission slot on the second cross-domain link and the data packet load of the service flow is less than or equal to the product of the link bandwidth in the second cross-domain link and the transmission slot in the periodically specific circular queue forwarding wide area network.

[0035] The fourth transmission time slot is the transmission time slot of the along-the-path transmission time slot in the two cross-domain link.

[0036] According to the deterministic transmission method based on a converged network provided by the present invention, the fourth transmission resource requirement specifically includes:

[0037] The fourth transmission resource requirement is specifically as follows:

[0038]

[0039]

[0040] in, T represents the number of hops in the first transmission path within a periodically specific circular queue forwarding wide area network. csqf The second time slot length of the circular queue forwarding wide area network is specified for the periodicity. For link The first transmission slot on, For periodic, circular queue forwarding in wide area networks The propagation delay For periodic, circular queue forwarding in wide area networks Boot time offset, For the kth node on the second cross-domain link c The fourth transmission time slot, For the kth node on the second cross-domain link c -1 fourth transmission time slot, For the second cross-domain link Link bandwidth, For the fourth transmission slot on the second cross-domain link The load, N csqf ω represents the number of time slots used by a service flow to propagate through a periodically specified circular queue forwarding wide area network. f This refers to the packet payload of the data stream.

[0041] According to a deterministic transmission method based on a converged network provided by the present invention, the fifth transmission resource requirement includes:

[0042] The sum of the load of any fifth transmission time slot in the second circular queue forwarding local area network and the data packet load of the service flow is less than or equal to the product of the link bandwidth and the transmission time slot in the second circular queue forwarding local area network.

[0043] The fifth transmission time slot is the transmission time slot along the way in the second circular queue forwarding local area network.

[0044] According to the deterministic transmission method based on a converged network provided by the present invention, the fifth transmission resource requirement specifically includes:

[0045]

[0046]

[0047]

[0048] in, This is the number of hops in the local area network for the first transmission path within the second circular queue. Forward links in the local area network for the second circular queue Link bandwidth, For the first circular queue to forward transmission time slots in the local area network, ω f For the data packet payload of the business flow, Forward the fifth transmission slot on the local area network for the second circular queue. The load, This is the minimum gateway processing latency in the local area network for forwarding in the second circular queue. Forward the k-th link of the first link in the local area network for the second circular queue d The fifth transmission time slot, Forward the k-th link of the first link in the local area network for the second circular queue. d -1 fifth transmission slot, For the first transmission slot on the second cross-domain link, For the second cross-domain link The propagation delay For the second cross-domain link Boot time offset, Forward the j-th node of the local area network to the second circular queue b The k-th link in -1 d The fifth transmission time slot, The number of time slots for the spread of service flows through the local area network's outgoing ports during forwarding in the second circular queue.

[0049] The present invention also provides a deterministic transmission device based on a converged network, comprising:

[0050] The receiving module is used to receive the transmission resource requirements, transmission latency requirements, and transmission jitter requirements of the service stream sent by the first terminal.

[0051] The transmission module is configured to transmit the service flow from the first terminal to the second terminal when the first transmission path of the service flow meets the transmission delay requirements and transmission jitter requirements, and the transmission resources on the transmission time slots along the first transmission path meet the transmission resource requirements.

[0052] Specifically, the transmission of the service flow from the first terminal to the second terminal includes: the service flow is transmitted sequentially through 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, to the second terminal at the end of the first transmission path.

[0053] The transmission time slots along the first transmission path are associated with the transmission time slots of the service flow at the first terminal.

[0054] 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 deterministic transmission method based on a converged network as described above.

[0055] 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 deterministic transmission method based on a converged network as described above.

[0056] The present invention also provides a computer program product, including a computer program that, when executed by a processor, implements the deterministic transmission method based on a converged network as described above.

[0057] The present invention provides a deterministic transmission method, apparatus, device, and storage medium based on converged networks, which integrates CQF and CSQF mechanisms to obtain a CQF-CSQF converged network. By ensuring that the transmission resources on the transmission time slots along the first transmission path of the service flow meet the transmission resource requirements, it effectively guarantees that all service flows accessing the converged network have sufficient transmission resources. At the same time, by ensuring that the first transmission path of the service flow meets the transmission delay and jitter requirements, it can effectively guarantee that the service flows accessing the converged network can be transmitted effectively on the first transmission path. Through the deterministic scheduling scheme of the CQF-CSQF converged network, deterministic transmission across wide areas between CQF networks can be achieved, simplifying network complexity while providing deterministic quality of service guarantees for service flow scheduling. Attached Figure Description

[0058] 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.

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

[0060] Figure 2 A schematic flowchart of a deterministic transmission method based on a converged network provided in an embodiment of this application;

[0061] Figure 3 System transmission diagrams provided for some embodiments of this application;

[0062] Figure 4 This is a schematic diagram of the deterministic transmission device structure based on a converged network as described in the embodiments of this application;

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

[0064] 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.

[0065] In an optional embodiment, the deterministic transmission method based on converged networks described in this application embodiment can be implemented 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 deterministic transmission of service traffic over long distances in the WAN based on the converged network.

[0066] In some embodiments of this application, the cross-domain control and orchestration unit may specifically include: a network information acquisition module, a cross-domain collaboration and orchestration module, a service flow QoS statistics module, and a UI module.

[0067] The network information acquisition module obtains network parameter information from each CQF LAN controller and CSQF network controller, including the time slot load, link bandwidth, time slot length, and upper and lower bounds of CQF gateway processing latency for each intra-domain link. It also maintains information such as propagation latency, link bandwidth, and time slot length for each inter-domain link.

[0068] The cross-domain collaboration and orchestration module may specifically include: a business flow admission submodule, a tag synchronization submodule, a path planning submodule, and a time slot planning submodule;

[0069] The service flow admission submodule is used to determine whether a service flow can be accessed based on end-to-end latency and jitter constraints, as well as the resources of the underlying transmission equipment, such as time slots and bandwidth. Service flows that do not meet the constraints are rejected from access.

[0070] The tag synchronization submodule is used to assign a specific global logical tag to each service flow, serving as its unique identifier. This global tag is fundamental for performing service access control, resource allocation, configuration distribution, and service flow QoS statistics.

[0071] The path planning submodule is used to allocate end-to-end transmission paths for the transmission of service flows, including path scheduling for CQF LAN and path scheduling for CSQF WAN.

[0072] The time slot planning submodule is used to plan reasonable time slot resources for service flows based on the time slot resource usage of the underlying transmission equipment.

[0073] The service flow QoS statistics module is used to collect statistics on end-to-end latency, jitter, and packet loss of service flows.

[0074] The UI module is used to display network resource utilization, service flow QoS information, and service flow admission / rejection status for users or network administrators, and provides the function of modifying service flow transmission paths and time slot resources.

[0075] The southbound interface is responsible for interacting with the CQF LAN controller, CSQF network controller, and terminal devices. It can be implemented using existing southbound interface protocols such as Netconf and Openflow.

[0076] Optionally, the transmission process of service flows in the above network architecture is as follows:

[0077] First, the service flow is generated from the first terminal, then forwarded by the CQF switch in the first CQF local area network, and then enters the CSQF wide area network through the CQF gateway of the first CQF local area network.

[0078] Next, the service flow travels over long distances through the CSQF wide area network to reach the CQF gateway in the second CQF local area network. Within the second CQF local area network, it is forwarded by the CQF gateway and CQF switch before reaching the second terminal, completing the end-to-end transmission process. In other words, the service flow transmission is completed through cross-domain transmission from the first CQF to the CSQF to the second CQF.

[0079] 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.

[0080] In the CQF mechanism, time can be divided into equal-length time slots d. Precise time synchronization is required between all devices implementing CQF. Each device can have two queues at each output port. Within a time slot, while one queue is in the transmission state, the other queue is in the reception state. At the next time slot, the states of the two queues are swapped, thus implementing a circular queue. Data packets received in a 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 packet delay are:

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

[0082] D min = (h-1)×d

[0083] Among them, 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.

[0084] The CQF switch in this embodiment operates the CQF mechanism for deterministic transmission based on converged networks, 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 LAN domain.

[0085] 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 also needs to be able to convert L3 data packets transmitted in the wide area network into L2 data packets, so as to facilitate the delivery of data packets to the second terminal.

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

[0087] 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.

[0088] The CSQF network controller in this embodiment is responsible for collecting network information in the CSQF wide area network, which may include topology, link information, device information, network load information, etc. The CSQF network controller also 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.

[0089] Optionally, the entire CQF and CSQF converged network can use express;

[0090] in, This represents the m-th CQF local area network. All CQF networks are connected via their respective cross-domain links. Connect to CSQF WAN Represents a CQF local area network, where the set Indicates CQF network The devices (including terminal devices, CQF switches, and CQF gateways) in the collection Indicates CQF network The link in the process. Since the CQF gateway needs to perform encapsulation / decapsulation operations, processing latency can be introduced. for The processing latency of the CQF gateway may not be a constant.

[0091] Assumption It is a bounded random variable, and the upper and lower bounds of the random variable are respectively... and

[0092] CSQF Wide Area Network G csqf ={V csqf E csqf}, where set V csqf Represents the set of devices (including CSQF routers), set E csqf Represents a set of links.

[0093] Let τ e Let be the propagation delay of link e. Wherein, link... At that time, τ e =0; otherwise, τ e The bandwidth of link e is not zero. e Let P represent an end-to-end cross-WAN transmission path. A feasible path P has a source node that is the first terminal device of the service flow and an end node that is the second terminal device of the service flow, and the path must pass through two CQF local area networks and one CSQF wide area network.

[0094] In the embodiments of this application For the network CQF slot length, T csqf Let δ be the CSQF slot length in the network Gcsqf. The power-on time offset of link e = (v1, v2) is denoted as δ. e δ represents the difference between the boot time t1 of v1 and the boot time of v2. e = t1-t2. Starting from the power-on time, the time slots are numbered in ascending order as 1, 2, 3, ...

[0095] In the embodiments of this application For path P in the CQF network The number of jumps in the middle, This represents the number of hops in the backbone network.

[0096] All devices within the CQF LAN start working simultaneously, i.e., the link... At that time, δ e =0, all devices within the domain achieve precise clock synchronization and time slot synchronization.

[0097] The data packet size of service flow f is ω f The sending period is T f (Expressed by the number of time slots in the first CQF LAN). The transmission delay requirement f is less than or equal to τ. f The jitter requirement is less than or equal to J. f .

[0098] Figure 2 This is a schematic flowchart of a deterministic transmission method based on a converged network provided in an embodiment of this application, as shown below. Figure 2 As shown, it includes:

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

[0100] 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.

[0101] In this embodiment, the cross-domain control and orchestrator, upon receiving the transmission resource requirements, transmission latency requirements, and transmission jitter requirements of the service flow, can perform admission control of the service flow based on the transmission latency information and network load information provided by the controllers of each network domain, and perform end-to-end path planning for the admitted service flow. Resource reservation for the transmission of the service flow is achieved through configuration distribution.

[0102] Step 220: If the first transmission path of the service flow meets the transmission delay requirement and the transmission jitter requirement, and the transmission resources on the transmission time slots along the first transmission path meet the transmission resource requirement, the service flow is transmitted from the first terminal to the second terminal.

[0103] Specifically, the transmission of the service flow from the first terminal to the second terminal includes: the service flow is transmitted sequentially through 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, to the second terminal at the end of the first transmission path.

[0104] The transmission time slots along the first transmission path are associated with the transmission time slots of the service flow at the first terminal.

[0105] 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.

[0106] 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.

[0107] Specifically, the first transmission path of the service flow satisfies the transmission delay requirement and the transmission jitter requirement. Specifically, this can mean that the maximum end-to-end transmission delay of the first transmission path corresponding to the service flow is less than or equal to the transmission delay requirement, and the maximum end-to-end jitter of the first transmission path is less than or equal to the transmission jitter requirement.

[0108] The method for determining the end-to-end maximum jitter in the embodiments of this application includes:

[0109] 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.

[0110] 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;

[0111] 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.

[0112] 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.

[0113] In this embodiment of the application, the end-to-end maximum transmission delay includes: the first circular queue forwarding local area network maximum delay and the first cross-domain delay, and 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;

[0114] 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.

[0115] Optionally, after determining the first transmission path, the time slot planning module can further select the transmission time slot of the service flow f at the first terminal. Different transmission time slots will result in different transmission time slots along the way. The transmission time slots along the first transmission path can be adjusted by adjusting the different transmission time slots.

[0116] Optionally, if the transmission resources on the transmission time slots along the first transmission path meet the transmission resource requirements, it means that the service flow has sufficient time slot resources to transmit the service flow.

[0117] At this time, the cross-domain controller and orchestrator will allow the access of the service flow and 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 in sequence through the first circular queue forwarding local area network, the periodic specific circular queue forwarding wide area network, and the second circular queue forwarding local area network.

[0118] 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, the transmission resources on the transmission time slots along the first transmission path are not sufficient to meet the transmission resource requirement, or 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 or change the transmission time slot. If all feasible paths or transmission time slots do not meet the conditions, then the access of the service flow will be rejected.

[0119] Optionally, this application proposes a deterministic scheduling scheme for CQF and CSQF converged networks, which enables deterministic transmission across wide areas between CQF networks based on the converged network. By designing end-to-end latency and jitter constraints, as well as transmission resource requirements, it supports end-to-end service flow transmission scheduling, simplifying network complexity while providing deterministic quality of service guarantees for service flow scheduling.

[0120] Optionally, the transmission resource requirements include: a first transmission resource requirement within the local area network, a second transmission resource requirement on the first cross-domain link, a third transmission resource requirement within the wide area network, a fourth transmission resource requirement on the second cross-domain link, and a fifth transmission resource requirement within the local area network.

[0121] Wherein, the first cross-domain link refers to the transmission link from the first circular queue forwarding local area network to the periodically specific circular queue forwarding wide area network; the second cross-domain link is the transmission link from the periodically specific circular queue forwarding wide area network to the second circular queue forwarding local area network.

[0122] Before service flow f is admitted, its first transmission path P needs to be planned, and sufficient transmission resources in the transmission time slots along the path must be ensured. The first transmission path P passes through the first CQF local area network in sequence. CSQF WAN G csqf and the second CQF LAN P can be represented by a combination of links along the route:

[0123]

[0124] The "||" indicates concatenation.

[0125] The first transmission resource requirement includes:

[0126] The sum of the load of any first transmission time slot in the first circular queue forwarding local area network and the data packet load of the service flow is less than or equal to the product of the link bandwidth and time slot length in the first circular queue forwarding local area network.

[0127] Wherein, the first transmission time slot is the transmission time slot of the along-the-way transmission time slot in the first circular queue forwarding local area network.

[0128] exist In the case of intra-link transmission, The transmission time slot on is The transmission time slots of subsequent links within the range are

[0129]

[0130] The total amount of data that needs to be transmitted in time slot c is called the load of time slot c. The load of time slot c is denoted as w. c .exist Internal transmission resource requirements are

[0131]

[0132] Where, ω f For the data packet payload of the business flow, For time slots The load, For link The transmission time slot on the link, where i is the link number. Forward links in the local area network for the first circular queue bandwidth, The first time slot length in the local area network is forwarded to the first circular queue. For the first transmission path P, forward the local area network in the first circular queue. The number of jumps in the middle, For link The transmission time slots on the network.

[0133] Optionally, the second transmission resource requirement includes:

[0134] The sum of the load of any second transmission time slot on the first cross-domain link and the data packet load of the service flow is less than or equal to the product of the link bandwidth of the first cross-domain link and the transmission time slot of the first circular queue forwarding local area network.

[0135] Wherein, the second transmission time slot is the transmission time slot of the along-the-way transmission time slot in the first cross-domain link.

[0136] exist In the case of uplink transmission, in cross-domain links Above all, it is necessary to ensure that transmission resources are sufficient during the diffusion time slots caused by processing delays. It is known that... The transmission on will spread to Each time slot. The transmission time slot on is common A series of consecutive time slots. The method for calculating a time slot is as follows:

[0137]

[0138] exist The transmission resource requirements are

[0139]

[0140] in, For the first cross-domain link The kth a The second transmission time slot, For link On the transmission time slot, For the first path P in the CQF network The number of jumps in the middle, This represents the minimum gateway processing latency in the first circular queue forwarding section of the local area network. The first time slot length in the local area network is forwarded to the first circular queue. For the first cross-domain link The kth a -1 second transmission time slot, k is the number of consecutive time slots on the first cross-domain link. a This is the sequence number of the second transmission time slot; For the first cross-domain leading time slot The load, ω f For the data packet payload of the data stream, For the first cross-domain link The link bandwidth.

[0141] Optionally, the third transmission resource requirement includes:

[0142] The sum of the load of any third transmission time slot in the periodic cyclic queue forwarding wide area network and the data packet load of the service flow is less than or equal to the product of the link bandwidth and time slot length in the periodic cyclic queue forwarding wide area network.

[0143] The third transmission time slot is the transmission time slot of the along-the-way transmission time slot in the periodically specific circular queue forwarding wide area network.

[0144] In G csqf In the case of intra-link transmission, The possible time slots for data packet transmission are as follows: Total N csqf A continuous time slot. The calculation method for the time slots is as follows:

[0145]

[0146] G csqf Inner subsequent links The time slot calculation method is as follows:

[0147]

[0148] In G csqfThe internal transmission resource requirements are:

[0149]

[0150] Where, ω f For the data packet payload of the data stream, For the first cross-domain link On the transmission time slot, The first time slot length in the local area network is forwarded to the first circular queue. For the first cross-domain link The propagation delay For the first cross-domain link Boot time offset, This represents the number of hops in the first transmission path within the periodically specified circular queue forwarding wide area network. For the periodic circular queue forwarding of the (k-1)th transmission slot in the first link of the wide area network, For the periodic representation of a circular queue forwarding function, the k-th link in the first link of the wide area network... b The third transmission time slot, For periodic, a circular queue is used to forward the j-th element of a wide area network. a Transmission time slots in a link For periodic, a circular queue is used to forward the j-th element of a wide area network. a The first transmission slot of the -1 link, For periodic, a circular queue is used to forward the j-th element of a wide area network. a The kth link b -1 third transmission slot, For periodic, circular queue forwarding in wide area networks The propagation delay For periodic, circular queue forwarding in wide area networks Boot time offset, T csqf The second time slot length of the circular queue forwarding wide area network is specified for the periodicity. For periodic specification of circular queue forwarding of third transmission slots on wide area networks The load, For periodic, circular queue forwarding in wide area networks Link bandwidth, N csqf The number of time slots for business flows to spread in a wide area network during periodic circular queue forwarding.

[0151] Optionally, the fourth transmission resource requirement includes:

[0152] The sum of the load of any fourth transmission slot on the second cross-domain link and the data packet load of the service flow is less than or equal to the product of the link bandwidth in the second cross-domain link and the transmission slot in the periodically specific circular queue forwarding wide area network.

[0153] The fourth transmission time slot is the transmission time slot of the along-the-way transmission time slot in the two cross-domain links.

[0154] exist In the case of uplink transmission, in cross-domain links The transmission time slot on is Total N csqf A series of consecutive time slots. The method for calculating time slots is as follows:

[0155]

[0156] exist The transmission resource requirements are

[0157]

[0158] in, T represents the number of hops in the first transmission path within a periodically specific circular queue forwarding wide area network. csqf The second time slot length of the circular queue forwarding wide area network is specified for the periodicity. For link The first transmission slot on, For periodic, circular queue forwarding in wide area networks The propagation delay For periodic, circular queue forwarding in wide area networks Boot time offset, For the kth node on the second cross-domain link c The fourth transmission time slot, For the kth node on the second cross-domain link c -1 fourth transmission time slot, For the second cross-domain link Link bandwidth, For the fourth transmission slot on the second cross-domain link The load, N csqf ω represents the number of time slots used by a service flow to propagate through a periodically specified circular queue forwarding wide area network. f This refers to the packet payload of the data stream.

[0159] Optionally, the fifth transmission resource requirement includes:

[0160] The sum of the load of any fifth transmission time slot in the second circular queue forwarding local area network and the data packet load of the service flow is less than or equal to the product of the link bandwidth and the transmission time slot in the second circular queue forwarding local area network.

[0161] The fifth transmission time slot is the transmission time slot along the way in the second circular queue forwarding local area network.

[0162] exist In the case of intra-link transmission, The transmission time slot on is common A continuous time slot.

[0163] The method for calculating time slots is as follows:

[0164]

[0165] The transmission time slots of subsequent links are

[0166]

[0167] exist Internal transmission resource requirements are

[0168]

[0169] in, This is the number of hops in the local area network for the first transmission path within the second circular queue. Forward links in the local area network for the second circular queue Link bandwidth, For the first circular queue to forward transmission time slots in the local area network, ω f For the data packet payload of the business flow, Forward the fifth transmission slot on the local area network for the second circular queue. The load, This is the minimum gateway processing latency in the local area network for forwarding in the second circular queue. Forward the k-th link of the first link in the local area network for the second circular queue d The fifth transmission time slot, Forward the k-th link of the first link in the local area network for the second circular queue. d -1 fifth transmission slot, For the first transmission slot on the second cross-domain link, For the second cross-domain link The propagation delay For the second cross-domain link Boot time offset, Forward the j-th node of the local area network to the second circular queue b The k-th link in -1 d The fifth transmission time slot, The number of time slots for the spread of service flows through the local area network's outgoing ports during forwarding in the second circular queue.

[0170] In the application embodiments, the transmission resource requirements that the transmission resources on the transmission time slots along the first transmission path need to meet can be effectively analyzed and determined by analyzing the first transmission resource requirements within the local area network, the second transmission resource requirements on the first cross-domain link, the third transmission resource requirements within the wide area network, the fourth transmission resource requirements on the second cross-domain link, and the fifth transmission resource requirements within the local area network. This effectively ensures the effective transmission of service flows and improves the reliability of transmission.

[0171] In an optional embodiment, the method for determining the end-to-end maximum jitter may specifically include:

[0172] Due to the changes in network architecture brought about by converged networks, 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 sequentially passes through the first CQF → CSQF → second CQF.

[0173] In this embodiment of the application, it can be achieved through the first CQF local area network. 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.

[0174] 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...

[0175] In this embodiment of the application, when a service flow that arrives at the CQF gateway in the same CQF timeslot leaves the CQF gateway and arrives at the CSQF router, on the one hand, due to the latency fluctuation of the CQF gateway, and on the other hand, due to the cross-domain clock asynchrony and the lack of established timeslot mapping relationship, the service flow may be spread into multiple consecutive CSQF timeslots for transmission.

[0176] Data packets received in the same CQF time slot, after processing, will be extended 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 slot.

[0177] In this embodiment of the application, the first diffusion information The calculation method is as follows:

[0178]

[0179] in, This is the upper bound of the first processing delay interval, and this upper bound is the maximum value of the interval. This is the lower bound of the first processing delay interval, representing the minimum value of the interval. This is the length of the first time slot in the first CQF local area network.

[0180] Optionally, the data stream may traverse cross-domain links. The data is transmitted to the CSQF router. However, because clock synchronization and time slot mapping are not implemented during the cross-domain transmission phase, the data packets received by the CSQF router can spread up to a maximum of N. csqf Forwarding is performed on each CSQF transmission slot.

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

[0182]

[0183] in, This is the first piece of information to spread. T is the length of the first timeslot of the first CQF local area network. csqf The second time slot length for the periodic circular queue forwarding wide area network.

[0184] Afterwards in G csqf The diffusion will not continue during the transmission process within the device.

[0185] 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.

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

[0187]

[0188] Where, N csqf For the second diffusion information, T csqf The length of the second time slot. These are the maximum and minimum values ​​of the second processing delay interval, respectively. This is the length of the third time slot.

[0189] After that, The diffusion will not continue during the transmission process within the device.

[0190] In summary, the maximum value of end-to-end latency jitter for

[0191]

[0192] Optionally, by fully considering 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, the maximum value of end-to-end delay jitter can be analyzed and determined more accurately.

[0193] In some embodiments of this application, the method for calculating the maximum end-to-end transmission delay is as follows:

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

[0195]

[0196] in, The maximum local area network latency for forwarding in the first circular queue. This represents the first hop count of the first transmission path within 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.

[0197] In an alternative embodiment, it can be To G csqf Cross-domain latency is defined as cross-domain link latency. The propagation delay, i.e.

[0198] 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:

[0199]

[0200] 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, frac 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 virtualized circular queue forwarding wide area network.

[0201] Optionally, the second circular queue forwards local area network traffic. Maximum delay Appeared in the past 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, where m is the first circular queue forwarding local area network and m' is the second circular queue forwarding local area network.

[0202] 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.

[0203]

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

[0205]

[0206] 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.

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

[0208]

[0209] Optionally, by analyzing the second cross-domain delay, the second circular queue forwarding local area network maximum delay, the first cross-domain delay, the first circular queue forwarding local area network maximum delay, and the periodically specified circular queue forwarding wide area network maximum delay, the end-to-end maximum transmission delay can be accurately obtained.

[0210] In one alternative embodiment, Figure 3 This application provides schematic diagrams of system transmission for some embodiments, such as... Figure 3 As shown, it includes:

[0211] S310, CQF LAN on the first terminal side The CQF LAN controller will The CQF slot configuration is as follows and All devices within the network maintain precise clock synchronization. Similarly, the CQF LAN on the second terminal side... The CQF LAN controller will The CQF slot configuration is as follows

[0212] In S320, the CQF LAN controller on the first terminal side obtains the upper bound of the processing latency from the CQF gateway. and the lower realm Acquired from the CQF LAN controller on the second terminal side and

[0213] The S330, CQF LAN controller will collect... and The load status of each time slot on the link;

[0214] S340, 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 And the load status of each time slot on the link.

[0215] The S350 cross-domain controller and orchestrator's network information acquisition module obtains network parameter information from each CQF LAN controller and CSQF network controller, including the time slot load, link bandwidth, time slot length, and upper and lower bounds of CQF gateway processing latency for each intra-domain link. It also maintains information such as propagation latency, link bandwidth, and time slot length for each cross-domain link.

[0216] S360, the first terminal device generates a service flow transmission request f, and the transmission latency requirement of f is less than or equal to τ. f The jitter requirement is less than or equal to J.f The source terminal will demand τ f With J f Uploaded to the business flow access module of the cross-domain controller and orchestrator.

[0217] S370, the path planning module of the cross-domain control and orchestration unit selects a transmission path P, and the time slot planning module selects the transmission time slot f at the source terminal. The calculation methods for end-to-end latency and jitter constraints, as well as transmission resource requirements, are verified based on information such as the time slot load of the network information acquisition module. If both latency and jitter constraints are met, the access of service flow f is allowed, and transmission resources are reserved on path P; if the conditions are not met, the transmission path P or the transmission time slot is changed. If the conditions cannot be met by all feasible paths and the transmission time slots of the second terminal device, then access for f is rejected.

[0218] S380, if service flow f is allowed to access, the service flow admission module informs the tag synchronization module; the tag synchronization module assigns a global logical tag to f and sends the time slot planning and path planning configuration to the CQF LAN controller and CSQF network controller.

[0219] S390, after the service flow f is transmitted, the second terminal device returns the end-to-end latency, jitter, and packet loss of f to the service flow QoS statistics module.

[0220] The deterministic transmission apparatus based on converged networks provided by the present invention will be described below. The deterministic transmission apparatus based on converged networks described below and the deterministic transmission method based on converged networks described above can be referred to in correspondence with each other.

[0221] Figure 4 This is a schematic diagram of the deterministic transmission device structure based on a converged network described in the embodiments of this application, as shown below. Figure 4 As shown, it includes:

[0222] The receiving module 410 is used to receive the transmission resource requirements, transmission delay requirements, and transmission jitter requirements of the service stream sent by the first terminal;

[0223] The transmission module 420 is used to transmit the service flow from the first terminal to the second terminal when the first transmission path of the service flow meets the transmission delay requirement and the transmission jitter requirement, and the transmission resources on the transmission time slots along the first transmission path meet the transmission resource requirement.

[0224] Specifically, the transmission of the service flow from the first terminal to the second terminal includes: the service flow is transmitted sequentially through 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, to the second terminal at the end of the first transmission path.

[0225] The transmission time slots along the first transmission path are associated with the transmission time slots of the service flow at the first terminal.

[0226] Optionally, a deterministic scheduling scheme for CQF and CSQF converged networks is proposed, which enables deterministic transmission across wide areas between CQF networks based on the converged network. By designing end-to-end latency and jitter constraints, as well as transmission resource requirements, it supports end-to-end service flow transmission scheduling, simplifying network complexity while providing deterministic quality of service guarantees for service flow scheduling.

[0227] Figure 5 This is a schematic diagram of the structure of the electronic device provided by the present invention, such as... Figure 5 As shown, the electronic device may include a processor 510, a communications interface 520, a memory 530, and a communication bus 540, wherein the processor 510, the communications interface 520, and the memory 530 communicate with each other via the communication bus 540. The processor 510 can call logical instructions in the memory 530 to execute a deterministic transmission method based on a converged network, the method including: receiving the transmission resource requirements, transmission delay requirements, and transmission jitter requirements of a service flow sent by a first terminal;

[0228] If the first transmission path of the service flow meets the transmission delay requirement and the transmission jitter requirement, and the transmission resources on the transmission time slots along the first transmission path meet the transmission resource requirement, the service flow is transmitted from the first terminal to the second terminal.

[0229] Specifically, the transmission of the service flow from the first terminal to the second terminal includes: the service flow is transmitted sequentially through 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, to the second terminal at the end of the first transmission path.

[0230] The transmission time slots along the first transmission path are associated with the transmission time slots of the service flow at the first terminal.

[0231] Furthermore, the logical instructions in the aforementioned memory 530 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.

[0232] 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 deterministic transmission method based on the converged network provided by the above methods, the method including: receiving the transmission resource requirements, transmission delay requirements and transmission jitter requirements of the service flow sent by a first terminal;

[0233] If the first transmission path of the service flow meets the transmission delay requirement and the transmission jitter requirement, and the transmission resources on the transmission time slots along the first transmission path meet the transmission resource requirement, the service flow is transmitted from the first terminal to the second terminal.

[0234] Specifically, the transmission of the service flow from the first terminal to the second terminal includes: the service flow is transmitted sequentially through 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, to the second terminal at the end of the first transmission path.

[0235] The transmission time slots along the first transmission path are associated with the transmission time slots of the service flow at the first terminal.

[0236] 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 deterministic transmission method based on a converged network provided by the above methods, the method comprising: receiving transmission resource requirements, transmission delay requirements and transmission jitter requirements of a service stream sent by a first terminal;

[0237] If the first transmission path of the service flow meets the transmission delay requirement and the transmission jitter requirement, and the transmission resources on the transmission time slots along the first transmission path meet the transmission resource requirement, the service flow is transmitted from the first terminal to the second terminal.

[0238] Specifically, the transmission of the service flow from the first terminal to the second terminal includes: the service flow is transmitted sequentially through 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, to the second terminal at the end of the first transmission path.

[0239] The transmission time slots along the first transmission path are associated with the transmission time slots of the service flow at the first terminal.

[0240] 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.

[0241] 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.

[0242] 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 deterministic transmission method based on a converged network, characterized in that, include: The transmission resource requirements, transmission latency requirements, and transmission jitter requirements for receiving the service stream sent by the first terminal; If the first transmission path of the service flow meets the transmission delay requirement and the transmission jitter requirement, and the transmission resources on the transmission time slots along the first transmission path meet the transmission resource requirement, the service flow is transmitted from the first terminal to the second terminal. Specifically, the transmission of the service flow from the first terminal to the second terminal includes: the service flow is transmitted sequentially through 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, to the second terminal at the end of the first transmission path. Wherein, the transmission time slots along the first transmission path are associated with the transmission time slots of the service flow at the first terminal; The transmission resource requirements include: the first transmission resource requirements within the local area network forwarded by the first circular queue, the second transmission resource requirements on the first cross-domain link, the third transmission resource requirements within the wide area network forwarded by the periodically specific circular queue, the fourth transmission resource requirements on the second cross-domain link, and the fifth transmission resource requirements within the local area network forwarded by the second circular queue. Wherein, the first cross-domain link refers to the transmission link from the first circular queue forwarding local area network to the periodically specific circular queue forwarding wide area network; the second cross-domain link is the transmission link from the periodically specific circular queue forwarding wide area network to the second circular queue forwarding local area network.

2. The deterministic transmission method based on a converged network according to claim 1, characterized in that, The first transmission resource requirement includes: The sum of the load of any first transmission time slot in the first circular queue forwarding local area network and the data packet load of the service flow is less than or equal to the product of the link bandwidth and time slot length in the first circular queue forwarding local area network. Wherein, the first transmission time slot is the transmission time slot of the along-the-way transmission time slot in the first circular queue forwarding local area network.

3. The deterministic transmission method based on a converged network according to claim 2, characterized in that, The first transmission resource requirement is as follows: in, For the data packet payload of the business flow, For time slots The load, For link On the transmission time slot, Link number, Forward links in the local area network for the first circular queue bandwidth, The first time slot length in the local area network is forwarded to the first circular queue. For the first transmission path P Forwarding local area network in the first circular queue The number of jumps in the middle, For link The transmission time slots on the network.

4. The deterministic transmission method based on a converged network according to claim 1, characterized in that, The second transmission resource requirement includes: The sum of the load of any second transmission time slot on the first cross-domain link and the data packet load of the service flow is less than or equal to the product of the link bandwidth of the first cross-domain link and the transmission time slot of the first circular queue forwarding local area network. Wherein, the second transmission time slot is the transmission time slot of the along-the-way transmission time slot in the first cross-domain link.

5. The deterministic transmission method based on a converged network according to claim 4, characterized in that, The second transmission resource requirement is as follows: in, For the first cross-domain link The first The second transmission time slot, For link On the transmission time slot, For the first path P In CQF network The number of jumps in the middle, This represents the minimum gateway processing latency in the first circular queue forwarding section of the local area network. The first time slot length in the local area network is forwarded to the first circular queue. For the first cross-domain link The first The second transmission time slot, This represents the number of consecutive time slots on the first cross-domain link. This is the sequence number of the second transmission time slot; For the first cross-domain leading time slot The load, For the data packet payload of the data stream, For the first cross-domain link The link bandwidth.

6. The deterministic transmission method based on a converged network according to claim 1, characterized in that, The third transmission resource requirement includes: The sum of the load of any third transmission time slot in the periodic cyclic queue forwarding wide area network and the data packet load of the service flow is less than or equal to the product of the link bandwidth and time slot length in the periodic cyclic queue forwarding wide area network. The third transmission time slot is the transmission time slot of the along-the-way transmission time slot in the periodically specific circular queue forwarding wide area network.

7. The deterministic transmission method based on a converged network according to claim 6, characterized in that, The third transmission resource requirement is specifically as follows: in, For the data packet payload of the data stream, For the first cross-domain link On the transmission time slot, The first time slot length in the local area network is forwarded to the first circular queue. For the first cross-domain link The propagation delay For the first cross-domain link Boot time offset, This represents the number of hops in the first transmission path within the periodically specified circular queue forwarding wide area network. For the periodic specification of the circular queue forwarding in the first link of the wide area network, the first... One transmission time slot, For the periodic specification of the circular queue forwarding in the first link of the wide area network, the first... The third transmission time slot, For the periodic specification of the circular queue forwarding wide area network, the first Transmission time slots in a link =2, 3, …, ; For the periodic specification of the circular queue forwarding wide area network, the first The first transmission slot of the link, For the periodic specification of the circular queue forwarding wide area network, the first The first link The third transmission time slot, For periodic, circular queue forwarding in wide area networks The propagation delay For periodic, circular queue forwarding in wide area networks Boot time offset, The second time slot length of the circular queue forwarding wide area network is specified for the periodicity. For periodic specification of circular queue forwarding of third transmission slots on wide area networks The load, For periodic, circular queue forwarding in wide area networks Link bandwidth, The number of time slots for business flows to spread in a wide area network during periodic circular queue forwarding.

8. The deterministic transmission method based on a converged network according to claim 1, characterized in that, The fourth transmission resource requirement includes: The sum of the load of any fourth transmission slot on the second cross-domain link and the data packet load of the service flow is less than or equal to the product of the link bandwidth in the second cross-domain link and the transmission slot in the periodically specific circular queue forwarding wide area network. The fourth transmission time slot is the transmission time slot of the along-the-way transmission time slot in the two cross-domain links.

9. The deterministic transmission method based on a converged network according to claim 8, characterized in that, The fourth transmission resource requirement is specifically as follows: in, This represents the number of hops in the first transmission path within the periodically specified circular queue forwarding wide area network. The second time slot length of the circular queue forwarding wide area network is specified for the periodicity. For link The first transmission slot on, For periodic, circular queue forwarding in wide area networks The propagation delay For periodic, circular queue forwarding in wide area networks Boot time offset, For the second cross-domain link The fourth transmission time slot, For the second cross-domain link The fourth transmission time slot, For the second cross-domain link Link bandwidth, For the fourth transmission slot on the second cross-domain link The load, This refers to the number of time slots used when a service flow spreads through a periodic, circular queue forwarding network. This refers to the packet payload of the data stream.

10. The deterministic transmission method based on a converged network according to claim 1, characterized in that, The fifth transmission resource requirement includes: The sum of the load of any fifth transmission time slot in the second circular queue forwarding local area network and the data packet load of the service flow is less than or equal to the product of the link bandwidth and the transmission time slot in the second circular queue forwarding local area network. The fifth transmission time slot is the transmission time slot along the way in the second circular queue forwarding local area network.

11. The deterministic transmission method based on a converged network according to claim 10, characterized in that, The fifth transmission resource requirement is specifically as follows: in, This is the number of hops in the local area network for the first transmission path within the second circular queue. Forward links in the local area network for the second circular queue Link bandwidth, Forward transmission time slots in the local area network for the first circular queue. For the data packet payload of the business flow, Forward the fifth transmission slot on the local area network for the second circular queue. The load, This is the minimum gateway processing latency in the local area network for forwarding in the second circular queue. Forward the first link of the local area network in the second circular queue The fifth transmission time slot, Forward the first link of the local area network in the second circular queue The fifth transmission time slot, For the first transmission slot on the second cross-domain link, For the second cross-domain link The propagation delay For the second cross-domain link Boot time offset, Forwarding the second circular queue of the local area network's first... The first in the link The fifth transmission time slot, The number of time slots for the spread of service flows through the local area network's outgoing ports during forwarding in the second circular queue.

12. A deterministic transmission device based on a converged network, characterized in that, include: The receiving module is used to receive the transmission resource requirements, 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 from the first terminal to the second terminal when the first transmission path of the service flow meets the transmission delay requirements and transmission jitter requirements, and the transmission resources on the transmission time slots along the first transmission path meet the transmission resource requirements. Specifically, the transmission of the service flow from the first terminal to the second terminal includes: the service flow is transmitted sequentially through 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, to the second terminal at the end of the first transmission path. Wherein, the transmission time slots along the first transmission path are associated with the transmission time slots of the service flow at the first terminal; The transmission resource requirements include: the first transmission resource requirements within the local area network forwarded by the first circular queue, the second transmission resource requirements on the first cross-domain link, the third transmission resource requirements within the wide area network forwarded by the periodically specific circular queue, the fourth transmission resource requirements on the second cross-domain link, and the fifth transmission resource requirements within the local area network forwarded by the second circular queue. Wherein, the first cross-domain link refers to the transmission link from the first circular queue forwarding local area network to the periodically specific circular queue forwarding wide area network; the second cross-domain link is the transmission link from the periodically specific circular queue forwarding wide area network to the second circular queue forwarding local area network.

13. 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 deterministic transmission method based on a converged network as described in any one of claims 1 to 11.

14. 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 deterministic transmission method based on a converged network as described in any one of claims 1 to 11.

Images