A data transmission method, device and storage medium

Abstract

This invention discloses a data transmission method, apparatus, and storage medium. The method includes: aggregating at least one first service flow to obtain a second service flow; each of the at least one first service flow has the same path in a first network and has the same quality of service guarantee requirements; and sending the second service flow.

Description

Technical Field

[0001] This invention relates to the field of networking, and more particularly to a data transmission method, apparatus, communication device, and storage medium. Background Technology

[0002] In specific scenarios of future fifth-generation (B5G) and sixth-generation (6G) mobile communications, such as industrial control, telemedicine, and holographic communication, stringent deterministic service capabilities are required, which traditional IP forwarding cannot meet. Therefore, Deterministic Internet Protocol (DIP) networks are an important development trend for future networks, and the aforementioned requirements place new demands on packet scheduling in DIP networks. Summary of the Invention

[0003] In view of this, the main objective of the present invention is to provide a data transmission method, apparatus, communication device, and storage medium.

[0004] To achieve the above objectives, the technical solution of the present invention is implemented as follows:

[0005] This invention provides a data transmission method applied to a first communication node, the method comprising:

[0006] At least one first service flow is aggregated to obtain a second service flow; each of the at least one first service flow has the same path in the first network and has the same quality of service guarantee requirements.

[0007] Send the second service flow.

[0008] The method in the above scheme further includes:

[0009] Send a bandwidth request; the bandwidth request is used to request the allocation of reserved bandwidth for the second service flow;

[0010] The bandwidth reservation shall be one of the following:

[0011] The first sum of the bandwidth of each of the at least one first service flows;

[0012] The first sum of the preset multiple.

[0013] In the above scheme, the number of reserved bandwidths includes: one or more;

[0014] The method further includes:

[0015] When the number of reserved bandwidth is one, the reserved bandwidth for the corresponding DIP is evenly distributed into multiple cycles according to the bandwidth parameters of the reserved bandwidth;

[0016] When there are multiple reserved bandwidths, they are allocated to multiple cycles respectively.

[0017] In the above scheme, the step of aggregating at least one first service flow to obtain a second service flow includes:

[0018] Traffic shaping is performed on each of the at least one first service flow; the traffic shaping is performed based on the bandwidth requirements of each first service flow.

[0019] Based on the time it takes for each first service flow to complete message shaping in its corresponding shaping queue, the at least one first service flow is arranged to obtain the second service flow.

[0020] The orchestration representation targets the integer queue corresponding to each first service flow, and sequentially enters the queue corresponding to the second service flow according to the preparation time for dequeueing of the messages corresponding to each first service flow.

[0021] The method in the above scheme further includes:

[0022] The second service flow is traffic shaped according to the rate of the at least one first service flow.

[0023] In the above scheme, sending the second service stream includes:

[0024] By using a packet-by-packet polling method, the packets in the second service flow are made to enter the egress queue corresponding to at least three cycles.

[0025] Based on the byte count method, the packets in the second business flow are made to enter the egress queue corresponding to at least three cycles on average;

[0026] Based on the preset weights for the egress queues corresponding to the at least three cycles, packets in the second service flow are entered into at least three egress cycle queues in a weighted polling manner or a weighted polling manner based on the number of bytes.

[0027] This invention provides a data transmission method applied to a second communication node, the method comprising:

[0028] Receive a second service flow from a first communication node; the second service flow includes: at least one first service flow that converges along the same path, and the at least one first service flow has the same quality of service guarantee requirements.

[0029] This invention provides a data transmission device, the device comprising:

[0030] The processing module is used to aggregate at least one first service flow to obtain a second service flow; each of the at least one first service flow has the same path in the first network and has the same quality of service guarantee requirements.

[0031] The sending module is used to send the second service flow.

[0032] In the above scheme, the sending module is further configured to send a bandwidth request; the bandwidth request is used to request the allocation of reserved bandwidth for the second service flow;

[0033] The bandwidth reservation shall be one of the following:

[0034] The first sum of the bandwidth of each of the at least one first service flows;

[0035] The first sum of the preset multiple.

[0036] In the above scheme, the number of reserved bandwidths includes: one or more;

[0037] The processing module is also used to, when the number of reserved bandwidths is one, evenly distribute the reserved bandwidth for the corresponding DIP into multiple cycles according to the bandwidth parameters of the reserved bandwidth;

[0038] When there are multiple reserved bandwidths, they are allocated to multiple cycles respectively.

[0039] In the above scheme, the processing module is used to perform traffic shaping on each of the at least one first service flow; the traffic shaping is performed based on the bandwidth requirements of each first service flow;

[0040] Based on the time it takes for each first service flow to complete message shaping in its corresponding shaping queue, the at least one first service flow is arranged to obtain the second service flow.

[0041] The orchestration representation targets the integer queue corresponding to each first service flow, and sequentially enters the queue corresponding to the second service flow according to the preparation time for dequeueing of the messages corresponding to each first service flow.

[0042] In the above scheme, the processing module is further configured to perform traffic shaping on the second service flow according to the rate of the at least one first service flow.

[0043] In the above scheme, the sending module is used to make the packets in the second service flow enter the egress queue corresponding to at least three cycles in a packet-by-packet polling manner;

[0044] Based on the byte count method, the packets in the second business flow are averaged into the egress queue corresponding to at least three cycles.

[0045] Based on the preset weights for the egress queues corresponding to the at least three cycles, packets in the second service flow are entered into at least three egress cycle queues in a weighted polling manner or a weighted polling manner based on the number of bytes.

[0046] This invention provides a data transmission device, the device comprising:

[0047] A receiving module is configured to receive a second service flow from a first communication node; the second service flow includes at least one first service flow that converges along the same path, and the at least one first service flow has the same quality of service guarantee requirements.

[0048] This invention provides a data transmission apparatus, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the steps of any of the data transmission methods described above for the first communication node side; or...

[0049] When the processor executes the program, it implements any of the steps of the data transmission method described above on the second communication node side.

[0050] This invention also provides a computer-readable storage medium storing a computer program thereon, which, when executed by a processor, implements the steps of any one of the data transmission methods described above on the first communication node side; or,

[0051] When the computer program is executed by the processor, it implements the steps of any one of the data transmission methods described above on the second communication node side.

[0052] The present invention provides a data transmission method, apparatus, and storage medium. The method includes: a first communication node aggregating at least one first service flow to obtain a second service flow; each of the at least one first service flow has the same path in a first network and has the same quality of service (QoS) requirements; sending the second service flow; correspondingly, a second communication node receiving the second service flow from the first communication node; the second service flow includes: at least one first service flow aggregating along the same path, and the at least one first service flow has the same QoS requirements; thus, the state of each flow is minimized at the intermediate node (i.e., the second communication node). Attached Figure Description

[0053] Figure 1 This is a schematic diagram illustrating the relationship between an existing IP scheduling mechanism and a DIP scheduling mechanism.

[0054] Figure 2 This is a schematic diagram of a CQF scheduling method;

[0055] Figure 3 This is a diagram illustrating the forwarding latency effect of a CQF (Concurrent Quality Forwarding) system.

[0056] Figure 4 This is a schematic diagram of a DIP mechanism;

[0057] Figure 5 A flowchart illustrating a data transmission method provided in an embodiment of the present invention;

[0058] Figure 6 A flowchart illustrating another data transmission method provided in an embodiment of the present invention;

[0059] Figure 7 A schematic diagram illustrating a resource reservation method provided in an embodiment of the present invention;

[0060] Figure 8 A schematic diagram of flow shaping provided in an embodiment of the present invention;

[0061] Figure 9 This is a schematic diagram of a message interleaving arrangement provided in an embodiment of the present invention;

[0062] Figure 10 This is a schematic diagram of the structure of a data transmission device provided in an embodiment of the present invention;

[0063] Figure 11 This is a schematic diagram of another data transmission device provided in an embodiment of the present invention;

[0064] Figure 12 This is a schematic diagram of the structure of a communication device provided in an embodiment of the present invention. Detailed Implementation

[0065] The present invention will be further described in detail below with reference to the embodiments. First, the relevant technologies will be described.

[0066] As mentioned above, DIP networks represent a significant future trend in network development. Traditional IP packets, based on statistical multiplexing and a best-effort approach, cannot guarantee performance in terms of Service Level Agreement (SLA) metrics such as latency, bandwidth, and packet loss. For specific scenarios in BG5 / 6G, stringent deterministic service capability requirements are introduced, which traditional IP forwarding cannot meet. For example, telemedicine requires end-to-end latency of less than 50ms and jitter of less than 200us; in smart grid scenarios, to ensure the accuracy of relay protection, the one-way time difference needs to be less than 200us and jitter less than 50us.

[0067] Among related technologies, Time Sensitive Networking (TSN) technology, standardized by the Institute of Electrical and Electronics Engineers (IEEE), provides a series of standards for congestion control and queue scheduling. However, it is designed for Ethernet local area networks, and some prerequisites such as time synchronization and flow identification are not practical on large networks. Scalability and maintainability are the biggest challenges to the determinism of Layer 3 (L3) networks.

[0068] To address this, a DIP-based approach based on periodic scheduling has been proposed in related technologies, aiming to provide determinism for large-scale backbone networks. However, it lacks practical deployment experience and presents some issues regarding ease of maintenance. For example, Figure 1 Based on existing IP scheduling techniques and TSN-related mechanisms, a DIP mechanism is proposed.

[0069] To explain the DIP mechanism in existing technologies, we will first describe Cyclic Queuing and Forwarding (CQF) in related technologies. CQF is a queue management method applied to deterministic networks in related technologies.

[0070] CQF inherits the concept of Time Aware Shaper (TAS) gating and introduces a circular queue mechanism for processing data streams with stringent latency requirements (critical streams). Figure 2The diagram illustrates the CQF scheduling method. For example, two queues, queue 2 and queue 3, are used. Queues 2 and 3 alternately open and close; that is, when queue 2 is open to transmit data, queue 3 is closed and receives data, and then queue 3 opens to transmit data while queue 2 closes and receives data. In this mechanism, frames of the Critical stream are sent in segments (or cycles), as shown by the white frames in the diagram. These frames must arrive within a defined time window and enter a specific queue (queue 2 or queue 4 in the diagram). Within the same time window, queue 3 or queue 5 needs to complete its transmission for the entire mechanism to function correctly. If link latency and processing latency are negligible relative to the cycle length, then for a specific deterministic network, this mechanism can use two buffers (e.g., only queues 2 and 3 in the diagram). Otherwise, this mechanism requires more queues. If all devices in the network support CQF, then critical flow packets can enter a cycle at the network edge node, and then remain for approximately one cycle at each intermediate node. Thus, critical flow packets can be deterministically forwarded, reaching the peer network edge node within a fixed cycle. In the CQF mechanism, from the perspective of each packet, the dwell time per hop is approximately one cycle (the shortest is close to 0, the longest is close to two cycles). However, from the perspective of the overall CQF system, the overall latency of a set of packets entering a cycle at each node is one cycle. This can be combined with... Figure 3 As shown, Figure 3 This is a schematic diagram illustrating the forwarding latency effect of CQF.

[0071] The above solution has the following problems: it requires time synchronization of all devices in the network, and the distance between two nodes cannot be too long (i.e., it requires short link latency).

[0072] The following explains the DIP scheduling scheme in related technologies. Regarding DIP scheduling, instead of assuming network-wide time synchronization, it assumes network-wide frequency synchronization, and that all networks support the DIP scheduling mechanism. Because fiber optic latency cannot be ignored in large-scale, long-distance networks, more queues are set up, for example, three queues. Unlike the one-transmit-one-receive rotation queues in CQF, this uses two time cycles to ensure that all packets in one cycle are received before transmission. That is, the three queues work in a loop, for example, the red, green, and yellow cycles, and their corresponding queue settings are as follows:

[0073] Red cycle: queue1 sending status, queue2 receiving status, queue3 receiving status;

[0074] Green cycle: queue1 receiving state, queue2 sending state, queue3 receiving state;

[0075] Yellow cycle: queue1 receiving state, queue2 receiving state, queue3 sending state;

[0076] And so it goes.

[0077] In application, the message enters a cycle at the network edge node, and then stays for about two cycles at each intermediate node. Thus, the Critical flow messages can be forwarded deterministically and reach the peer network edge node in a fixed cycle.

[0078] like Figure 4 As shown, Figure 4 This describes the control plane and data plane control flow in the DIP mechanism. In the DIP mechanism, on one hand, the data plane supports the aggregation of critical flows. That is, after different critical flows enter a DIP node, if the outgoing interface and outgoing period are the same, then different critical flows at that node are delayed for approximately 2T (assuming T represents one period) before being sent to the next hop. The DIP node only needs to process the label / destination address to find the outgoing interface and process the period mapping table to match the appropriate outgoing period; it does not need to identify each critical flow individually. Each critical flow should comply with relevant traffic bandwidth limitations, such as... Figure 4 Due to the limitations of the formula, for a Critical flow (i.e., flowi in the diagram), the amount of data sent should be the sum of the traffic corresponding to its reserved bandwidth and the burst traffic. The sender's deterministic requests can be submitted to the network through the User Network Interface (UNI). The network should also provide an Operation, Administration, and Maintenance (OAM) toolset to provide performance monitoring for deterministic functions. On the other hand, at the control plane, aggregated resource reservations are supported.

[0079] In related technologies, a common resource reservation protocol—Resource Reservation Protocol (RSVP)—(TE) is provided as a resource reservation method. This method is considered to require the state of each critical flow and needs to maintain soft state, making it unsuitable for large-scale DIP network scenarios. In the traditional resource reservation mechanism, the head node sends a path message to the tail node to probe resource status. After receiving the message, the tail node sends back a resource reservation confirmation (Resv) message to complete the resource reservation, and optionally carries the allocated path label (in the case of Multi-Protocol Label Switching (MPLS) scenarios). This scheme requires refreshing the soft state while reserving bandwidth, for example, every 30 or 90 seconds. Failure to refresh the soft state within the timeout period may result in the release of the reserved resources.

[0080] Compared to the current RSVP-TE mechanism, DIP networks introduce a new mechanism that aims to overcome soft states and reduce the state maintained by intermediate nodes. Specifically, intermediate nodes do not need to maintain the flow ID for each flow; they only need to maintain a time window that displays the bandwidth reservation status of the node's links over the next K periods. However, this time window is also aggregated based on the requirements of each critical flow, and the intermediate node's reservation is constantly updated. If each period is 10µs, the update frequency is very high. From the perspective of Internet design principles, intermediate nodes should not need to be aware of the resource status of each service flow.

[0081] In summary, it is not recommended that intermediate nodes be aware of the specific status of each deterministic business flow (a type of critical flow that requires resource reservation), whether in the control plane or the data plane. However, the current mechanism still requires the transmission of the status of each deterministic business flow in the control plane.

[0082] Based on this, the method provided in this embodiment of the invention involves a first communication node aggregating at least one first service flow to obtain a second service flow; each of the at least one first service flow has the same path in the first network and has the same quality of service (QoS) guarantee requirements; the second service flow is then sent; correspondingly, a second communication node receives the second service flow from the first communication node; the second service flow includes at least one first service flow aggregating along the same path, and the at least one first service flow has the same QoS guarantee requirements.

[0083] The present invention will be further described in detail below with reference to the embodiments.

[0084] Figure 5This is a flowchart illustrating a data transmission method provided in an embodiment of the present invention; as shown below. Figure 5 As shown, the method is applied to a first communication node, which can be an operator's edge node (PE, provider edge). The data transmission method includes:

[0085] Step 501: At least one first service flow is aggregated to obtain a second service flow; each of the at least one first service flow has the same path in the first network and has the same quality of service guarantee requirements.

[0086] Step 502: Send the second service flow.

[0087] The first network refers to a deterministic network, namely a DIP network.

[0088] The first service flow is a data flow with stringent latency requirements in the DIP network (referred to as a Critical flow).

[0089] Having the same quality of service (QoS) assurance requirements can include having the same low latency requirements. For example, both services are required to have latency below a certain threshold, such as less than 2.5ms or less than 3ms. It should be noted that even if two services have different latency requirements (e.g., one requires less than 2.8ms and the other requires less than 2.5ms), they are still considered to have the same low latency requirements, i.e., the same QoS assurance requirements.

[0090] In one embodiment, the method further includes:

[0091] Send a bandwidth request; the bandwidth request is used to request the allocation of reserved bandwidth for the second service flow;

[0092] The bandwidth reservation shall be one of the following:

[0093] The first sum of the bandwidth of each of the at least one first service flows;

[0094] The first sum of the preset multiple.

[0095] Here, when the first communication node requests resource reservation from the second communication node, the first communication node considers future scenarios and appropriately reserves more resources, that is, the bandwidth reservation is the first sum of a preset multiple. In other words, the method provided by the embodiments of the present invention allows for an appropriate over-allocation of reserved bandwidth.

[0096] In one embodiment, the number of reserved bandwidths includes one or more.

[0097] When the number of reserved bandwidth is one, the reserved bandwidth for the corresponding DIP is evenly distributed into multiple cycles according to the bandwidth parameters of the reserved bandwidth;

[0098] When there are multiple reserved bandwidths, they are allocated to multiple cycles respectively.

[0099] In one embodiment, the step of aggregating at least one service flow with the same path to obtain a second service flow includes:

[0100] Traffic shaping (also known as pacing) is performed on each of the at least one first service flow; the traffic shaping is performed based on the bandwidth requirements of each first service flow;

[0101] Based on the time it takes for each first service flow to complete message shaping in its corresponding shaping queue, the at least one first service flow is arranged to obtain the second service flow.

[0102] The orchestration representation targets the integer queue corresponding to each first service flow, and sequentially enters the queue corresponding to the second service flow according to the preparation time for dequeueing of the messages corresponding to each first service flow.

[0103] The message refers to the first service flow after traffic shaping;

[0104] The shaping queue refers to the queue that performs traffic shaping on the first service flow;

[0105] The preparation time for the message to leave the queue for the first service flow can be the time when the first service flow completes message shaping.

[0106] In one embodiment, the method further includes:

[0107] The second service flow is traffic shaped according to the rate of the at least one first service flow.

[0108] Specifically, after obtaining the aggregated second service flow, the aggregated second service flow can be further pacingd according to the sum of the rates of these first service flows (specifically, the sum of the flow rates of the packets in the first service flows).

[0109] In one embodiment, sending the second service stream includes:

[0110] By using a packet-by-packet polling method, the packets in the second service flow are made to enter the egress queue corresponding to at least three cycles.

[0111] Based on the byte count method, the packets in the second business flow are averaged into the egress queue corresponding to at least three cycles.

[0112] Based on the preset weights for the egress queues corresponding to the at least three cycles, packets in the second service flow are entered into at least three egress cycle queues in a weighted polling manner or a weighted polling manner based on the number of bytes.

[0113] Here, the packet-by-packet polling method means that packets in the second service flow are sequentially and cyclically entered into the egress queue corresponding to the at least three cycles.

[0114] The method of counting by byte count indicates that the packets are averaged according to the size of the packets in the second service flow and then enter the exit queues corresponding to the at least three cycles.

[0115] Here, each of the at least three cycles can correspond to a different egress queue, and different egress queues are pre-set with different weights. These weights are used to determine the proportion of incoming packets. For example, if the weight ratio of queue 1, queue 2, and queue 3 is 1:1:2, then the traffic can be considered to be divided into four equal parts, with one part of the traffic entering queue 1, one part entering queue 2, and two parts entering queue 3. This division can also be done by dividing according to packets, or by taking into account the packet size and dividing according to the number of bytes sent in the stream.

[0116] Accordingly, embodiments of the present invention provide another data transmission method. Figure 6 This is a flowchart illustrating a data transmission method provided in an embodiment of the present invention; as shown below. Figure 6 As shown, the data transmission method is applied to a second communication node, which can be an intermediate node of the operator (denoted as P node). The method includes:

[0117] Step 601: Receive a second service flow from the first communication node; the second service flow includes: at least one first service flow that converges along the same path.

[0118] In practical applications, the second communication node can communicate with one or more first communication nodes;

[0119] Within the same ingress PE (a type of first communication node), business flows destined for other egress PEs will converge into other flows and enter specific paths.

[0120] If multiple converged flows (i.e. multiple second service flows) have the same egress PE, then the multiple converged flows will be scheduled to at least three queues (usually three or four queues) on the same link. In order to distribute these converged flows as evenly as possible to at least three queues, each converged flow (interleaved traffic) can be polled per packet (RR, round-robin) or distributed to at least three queues in an even manner according to the number of bytes.

[0121] The method further includes:

[0122] Step 602: Send the second service flow to the corresponding next-hop P node (an intermediate node).

[0123] In one embodiment, the method further includes:

[0124] Receive a bandwidth request from a first communication node; the bandwidth request is used to request the allocation of reserved bandwidth for the second service flow;

[0125] Reserved bandwidth for the second service flow.

[0126] In one embodiment, receiving the second service stream includes:

[0127] The second service flow is forwarded according to the DIP periodic mapping mechanism.

[0128] The method provided in this invention, applied to a DIP network, enables resource reservation. The method involves aggregating (interleaving and orchestrating) service flows with the same path at the PE (i.e., the first communication node) on the data plane. The interleaved and orchestrated traffic is forwarded as a single aggregated flow in the DIP network, and its reserved bandwidth supports appropriate over-provisioning to avoid excessive resource reservation modifications. This over-provisioning of bandwidth does not result in significant resource waste, as resources not used by critical traffic can be allocated to best-effort (BE) traffic. Furthermore, these interleaved and orchestrated flows can occupy bandwidth evenly across several cycles at the PE, avoiding congestion in some cycles and idle traffic in others.

[0129] This invention provides a method for resource reservation. The method includes:

[0130] The service flow from the ingress edge node (PE) to the egress PE (equivalent to the first service flow mentioned above) is shaped flow by flow (i.e., each service flow is shaped separately); specifically, based on the destination address of each service flow, service flows with the same destination address are aggregated in an interleaving arrangement to obtain the aggregated flow (equivalent to the second service flow mentioned above).

[0131] The converged flow appears as a single flow, entering the network through an RSVP-based session maintained by the peer, thereby reducing the number of service flows in the network. In this way, intermediate nodes (i.e., P nodes) are not aware of the entry and exit of each service, only the change in reserved bandwidth, and do not affect the operation of the forwarding plane.

[0132] Figure 7 This is a schematic diagram of another data transmission method provided in an embodiment of the present invention; as shown. Figure 7 As shown, each ingress PE receives the first service flow sent by each client. For the first service flow received by each ingress PE, it aggregates the same path and has the same quality of service guarantee requirements in the first network (i.e., deterministic network) to obtain the second service flow, and then sends it to the intermediate node (P), which then sends it to the egress PE.

[0133] The aggregation is performed in an interleaving arrangement manner, specifically: each of the at least one first service flow is subjected to traffic shaping; the at least one first service flow is arranged according to the time when the shaping queue corresponding to each first service flow completes the packet shaping, to obtain the second service flow; the arrangement means that for the shaping queue corresponding to each first service flow, according to the time when the packet of each first service flow is ready to be dequeued, the packets are sequentially entered into the queue corresponding to the second service flow.

[0134] Table 1 is a comparative diagram of the current PE scheduling scheme for DIP and the PE scheduling scheme for DIP provided in the embodiments of the present invention.

[0135]

[0136]

[0137] Table 1

[0138] The following describes the specific flow of the control plane in the communication method provided in the embodiments of the present invention.

[0139] Deterministic tunnels or segment routing (SR) policies can be built between edge nodes of a deterministic network, either through business-driven approaches or pre-configured.

[0140] If multiple deterministic service flows (equivalent to the first service flow mentioned above) have the same path in the deterministic network (i.e., the head node and tail node in the network are the same and are all deterministic services), then these deterministic service flows will be aggregated (for example, through interleaving and orchestration).

[0141] In some embodiments, such as after the relevant tunnel or SR policy is established, the packets of the aggregated deterministic service flow (equivalent to the packets of the second service flow mentioned above) can be encapsulated in a new MPLS label header (pushed into the MPLS label stack) or a new IPv6 header (generating a new IPv6 packet header, with the original packet as the payload).

[0142] After aggregation, deterministic service flows will request a total bandwidth reservation value in the network, for example, through the RSVP protocol. This total bandwidth reservation value can be the sum of the bandwidth of the services before aggregation, or the sum of the bandwidth of the service flows before aggregation plus an additional bandwidth reservation amount, for example, this additional bandwidth reservation amount is 10% of the previous sum.

[0143] During network operation, new deterministic service flows may enter the network, while old deterministic service flows may leave. This changes the total bandwidth of the corresponding aggregated service flows. With traditional RSVP, this would immediately trigger a bandwidth reservation update. However, in the method of this embodiment, if the bandwidth reservation is within a certain threshold range (e.g., 10% more reserved as mentioned earlier), the updated bandwidth reservation value will not be immediately sent to the network for updating. Instead, it can wait until the RSVP soft state is refreshed before updating the reserved resource value in the network. However, if the bandwidth reservation exceeds a certain threshold (which can be preset by network management or developers), an immediate update will be triggered.

[0144] This avoids frequent RSVP status updates; it is particularly suitable for scenarios where deterministic service flows may not require much bandwidth, but are numerous and generate and terminate service flows frequently.

[0145] When announcing resource reservation status via RSVP, because the service flow may enter multiple cycles on the data plane, in one possible implementation, RSVP reserved bandwidth needs to be set to three, corresponding to the three cycles respectively; or RSVP reserved bandwidth is set to one, but the RSVP bandwidth parameter has an identifier (flag) indicating that the corresponding bandwidth is reserved for DIP traffic and is evenly distributed in the three cycles.

[0146] The following describes the specific flow of the data plane in the communication method provided in the embodiments of the present invention.

[0147] At the edge nodes of a deterministic network, traffic shaping (also known as pacing) is performed on deterministic service flows to ensure that the packets corresponding to those flows are distributed as evenly as possible. The flow-by-flow shaping process is as follows: Figure 8 As shown.

[0148] If the paths of deterministic service flows (equivalent to the first service flow mentioned above) are consistent within the deterministic network (such as the DIP network mentioned above) (i.e., the head and tail nodes in the network are consistent and both are deterministic services), then these deterministic service flows will be interleaved and orchestrated. The interleaving and orchestration method is as follows: Figure 9As shown, during the business flow pacing process, once it is determined that the business flow messages have completed pacing, they enter a large queue in the order of completion time, thus realizing message interleaving and arrangement.

[0149] In one embodiment, the packets of the aggregated deterministic service flow (equivalent to the second service flow) can be further traffic shaped according to the rate of traffic of the packets corresponding to the deterministic service flow.

[0150] The converged deterministic business flows appear as a single business within the deterministic network until they leave the deterministic network.

[0151] For packets of deterministic services after aggregation, they can be evenly scheduled to the three egress period queues. For example, the interleaved traffic can be evenly distributed into the three queues by polling packets one by one or by counting bytes, or it can be scheduled to the three egress period queues according to a certain weight.

[0152] Figure 10 This is a schematic diagram of the structure of a data transmission device provided in an embodiment of the present invention; as shown below. Figure 10 As shown, the device is applied to a first communication node, and the device includes:

[0153] The processing module is used to aggregate at least one first service flow to obtain a second service flow; each of the at least one first service flow has the same path in the first network and has the same quality of service guarantee requirements.

[0154] The sending module is used to send the second service flow.

[0155] Specifically, the sending module is further configured to send a bandwidth request; the bandwidth request is used to request the allocation of reserved bandwidth for the second service flow;

[0156] The bandwidth reservation shall be one of the following:

[0157] The first sum of the bandwidth of each of the at least one first service flows;

[0158] The first sum of the preset multiple.

[0159] Specifically, the number of reserved bandwidths includes: one or more;

[0160] The processing module is used to, when the number of reserved bandwidths is one, evenly distribute the reserved bandwidth for the corresponding DIP into multiple cycles according to the bandwidth parameters of the reserved bandwidth;

[0161] When there are multiple reserved bandwidths, they are allocated to multiple cycles respectively.

[0162] Specifically, the processing module is configured to perform traffic shaping on each of the at least one first service flow; the traffic shaping is performed based on the bandwidth requirements of each first service flow.

[0163] Based on the time it takes for each first service flow to complete message shaping in its corresponding shaping queue, the at least one first service flow is arranged to obtain the second service flow.

[0164] The orchestration representation targets the integer queue corresponding to each first service flow, and sequentially enters the queue corresponding to the second service flow according to the preparation time for dequeueing of the messages corresponding to each first service flow.

[0165] Specifically, the processing module is further configured to perform traffic shaping on the second service flow according to the rate of the at least one first service flow.

[0166] Specifically, the sending module is used to send packets in the second service flow into the egress queue corresponding to at least three cycles in a polling manner.

[0167] Based on the byte count method, the packets in the second business flow are made to enter the egress queue corresponding to at least three cycles on average;

[0168] Based on the preset weights for the egress queues corresponding to the at least three cycles, packets in the second service flow are entered into at least three egress cycle queues in a weighted polling manner or a weighted polling manner based on the number of bytes.

[0169] It should be noted that the data transmission device provided in the above embodiments is only illustrated by the division of the above program modules when implementing the corresponding data transmission method. In actual applications, the above processing can be assigned to different program modules as needed, that is, the internal structure of the server can be divided into different program modules to complete all or part of the processing described above. In addition, the device and the corresponding method embodiments provided in the above embodiments belong to the same concept, and their specific implementation process can be found in the method embodiments, which will not be repeated here.

[0170] Figure 11 This is a schematic diagram of another data transmission device provided in an embodiment of the present invention; as shown below. Figure 11 As shown, the device is applied to a second communication node, and the device includes:

[0171] A receiving module is configured to receive a second service flow from a first communication node; the second service flow includes at least one first service flow that converges along the same path, and the at least one first service flow has the same quality of service guarantee requirements.

[0172] Specifically, the device may further include a forwarding module for forwarding the converged second service flow, such as sending the second service flow to the corresponding next-hop P node (an intermediate node).

[0173] It should be noted that the data transmission device provided in the above embodiments is only illustrated by the division of the above program modules when implementing the corresponding data transmission method. In actual applications, the above processing can be assigned to different program modules as needed, that is, the internal structure of the server can be divided into different program modules to complete all or part of the processing described above. In addition, the device and the corresponding method embodiments provided in the above embodiments belong to the same concept, and their specific implementation process can be found in the method embodiments, which will not be repeated here.

[0174] Figure 12 This is a schematic diagram of the structure of a communication device provided in an embodiment of the present invention, such as... Figure 12 As shown, the communication device 120 includes: a processor 1201 and a memory 1202 for storing computer programs capable of running on the processor;

[0175] When the communication device is applied to the first communication node, when the processor 1201 is used to run the computer program, it performs the following: aggregating at least one first service flow to obtain a second service flow; each of the at least one first service flow has the same path in the first network and has the same quality of service guarantee requirements; and sending the second service flow.

[0176] When the processor runs the computer program, it implements the corresponding processes of the first communication node in the various methods of the embodiments of the present invention. For the sake of brevity, these processes will not be described in detail here.

[0177] When the communication device is applied to the second communication node, the processor 1201, when running the computer program, performs the following: receiving a second service flow from the first communication node; the second service flow includes: at least one first service flow that converges along the same path, and the at least one first service flow has the same quality of service guarantee requirements.

[0178] When the processor runs the computer program, it implements the corresponding processes of the second communication node in the various methods of the embodiments of the present invention. For the sake of brevity, these will not be described in detail here.

[0179] In practical applications, the communication device 120 may further include at least one network interface 1203. The various components of the communication device 120 are coupled together via a bus system 1204. It is understood that the bus system 1204 is used to implement communication between these components. In addition to a data bus, the bus system 1204 also includes a power bus, a control bus, and a status signal bus. However, for clarity, in... Figure 12 All buses are labeled as bus system 1204. The number of processors 1201 can be at least one. Network interface 1203 is used for wired or wireless communication between communication device 120 and other devices.

[0180] The memory 1202 in this embodiment of the invention is used to store various types of data to support the operation of the communication device 120.

[0181] The methods disclosed in the above embodiments of the present invention can be applied to processor 1201, or implemented by processor 1201. Processor 1201 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the integrated logic circuit of the hardware in processor 1201 or by instructions in the form of software. The processor 1201 may be a general-purpose processor, a digital signal processor (DSP), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Processor 1201 can implement or execute the methods, steps and logic block diagrams disclosed in the embodiments of the present invention. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed in the embodiments of the present invention can be directly manifested as being executed by a hardware decoding processor, or being executed by a combination of hardware and software modules in the decoding processor. The software modules may be located in a storage medium, which is located in memory 1202. Processor 1201 reads the information in memory 1202 and completes the steps of the aforementioned method in conjunction with its hardware.

[0182] In an exemplary embodiment, the communication device 120 may be implemented by one or more application-specific integrated circuits (ASICs), DSPs, programmable logic devices (PLDs), complex programmable logic devices (CPLDs), field-programmable gate arrays (FPGAs), general-purpose processors, controllers, microcontrollers (MCUs), microprocessors, or other electronic components to perform the aforementioned method.

[0183] This invention also provides a computer-readable storage medium having a computer program stored thereon;

[0184] When the stored computer program is applied to the first communication node, the computer program, when executed by the processor, performs the following: aggregating at least one first service flow to obtain a second service flow; each of the at least one first service flow has the same path in the first network and has the same quality of service guarantee requirements; and sending the second service flow.

[0185] The computer program, when run by the processor, implements the corresponding processes implemented by the first communication node in the various methods of the embodiments of the present invention. For the sake of brevity, these will not be described in detail here.

[0186] When the stored computer program is applied to the second communication node, the computer program, when executed by the processor, performs the following: receiving a second service flow from the first communication node; the second service flow includes: at least one first service flow that converges along the same path, and the at least one first service flow has the same quality of service guarantee requirements.

[0187] The computer program, when run by the processor, implements the corresponding processes implemented by the second communication node in the various methods of the embodiments of the present invention. For the sake of brevity, these will not be described in detail here.

[0188] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. The device embodiments described above are merely illustrative. For example, the division of units is only a logical functional division, and in actual implementation, there may be other division methods, such as: multiple units or components can be combined, or integrated into another system, or some features can be ignored or not executed. In addition, the coupling, direct coupling, or communication connection between the various components shown or discussed can be through some interfaces, and the indirect coupling or communication connection between devices or units can be electrical, mechanical, or other forms.

[0189] The units described above 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 units may be selected to achieve the purpose of this embodiment according to actual needs.

[0190] In addition, in the various embodiments of the present invention, each functional unit can be integrated into one processing unit, or each unit can be a separate unit, or two or more units can be integrated into one unit; the integrated unit can be implemented in hardware or in the form of hardware plus software functional units.

[0191] Those skilled in the art will understand that all or part of the steps of the above method embodiments can be implemented by hardware related to program instructions. The aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it performs the steps of the above method embodiments. The aforementioned storage medium includes various media capable of storing program code, such as mobile storage devices, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0192] Alternatively, if the integrated units of this invention are implemented as software functional modules and sold or used as independent products, they can also be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the embodiments of this invention, or the parts that contribute to the prior art, 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 methods described in the various embodiments of this invention. The aforementioned storage medium includes various media capable of storing program code, such as mobile storage devices, ROM, RAM, magnetic disks, or optical disks.

[0193] It should be noted that terms such as "first" and "second" are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0194] Furthermore, the technical solutions described in the embodiments of this application can be combined arbitrarily without conflict.

[0195] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A data transmission method, characterized in that, Applied to a first communication node, the method includes: At least one first service flow is aggregated to obtain a second service flow; each of the at least one first service flow has the same path in the first network and has the same quality of service guarantee requirements; the first network is a deterministic Internet Protocol (DIP) network; the first service flow is a data flow with stringent latency requirements in the DIP network. The second service flow is sent by polling packets one by one, or by counting bytes, or by weighted polling based on the number of bytes; The step of aggregating at least one first service flow to obtain a second service flow includes: Traffic shaping is performed on each of the at least one first service flow; the traffic shaping is performed based on the bandwidth requirements of each first service flow. Based on the time it takes for each first service flow to complete message shaping in its corresponding shaping queue, the at least one first service flow is arranged to obtain the second service flow. The orchestration representation targets the integer queue corresponding to each first service flow, and sequentially enters the queue corresponding to the second service flow according to the preparation time for dequeueing of the messages corresponding to each first service flow.

2. The method according to claim 1, characterized in that, The method further includes: Send a bandwidth request; the bandwidth request is used to request the allocation of reserved bandwidth for the second service flow; The bandwidth reservation shall be one of the following: The first sum of the bandwidth of each of the at least one first service flows; The first sum of the preset multiple.

3. The method according to claim 2, characterized in that, The number of reserved bandwidths includes: one or more; The method further includes: When the number of reserved bandwidth is one, the reserved bandwidth for the corresponding Deterministic Internet Protocol (DIP) is evenly distributed into multiple cycles according to the bandwidth parameters of the reserved bandwidth. When there are multiple reserved bandwidths, they are allocated to multiple cycles respectively.

4. The method according to claim 1, characterized in that, The method further includes: The second service flow is traffic shaped according to the rate of the at least one first service flow.

5. The method according to claim 2, characterized in that, Sending the second service stream includes at least one of the following: By using a packet-by-packet polling method, the packets in the second service flow are made to enter the egress queue corresponding to at least three cycles. Based on the byte count method, the packets in the second business flow are made to enter the egress queue corresponding to at least three cycles on average; Based on the preset weights for the egress queues corresponding to the at least three cycles, packets in the second service flow are entered into at least three egress cycle queues in a weighted polling manner or a weighted polling manner based on the number of bytes.

6. A data transmission method, characterized in that, Applied to a second communication node, the method includes: The second service flow is received from the first communication node using a method of packet-by-packet polling, byte-count counting, or weighted polling, or weighted polling based on byte count. The second service flow includes at least one first service flow along the same path in the converged first network, and these at least one first service flow have the same quality of service (QoS) guarantee requirements. The first network is a DIP network. The first service flow is a data flow with stringent latency requirements in the DIP network. The at least one first service flow along the same path in the converged first network includes: the first communication node performing traffic shaping on each of the at least one first service flow; the traffic shaping is performed based on the bandwidth requirements of each first service flow; the at least one first service flow is orchestrated according to the time it takes for the shaping queue corresponding to each first service flow to complete packet shaping, resulting in the second service flow; the orchestration represents, for each first service flow's corresponding shaping queue, the packets of each first service flow sequentially enter the queue corresponding to the second service flow according to their dequeue preparation time.

7. A data transmission device, characterized in that, The device includes: The processing module is used to aggregate at least one first service flow to obtain a second service flow; each of the at least one first service flow has the same path in a first network and has the same quality of service guarantee requirements; the first network is a DIP network; the first service flow is a data flow with stringent latency requirements in the DIP network. The sending module is used to send the second service flow by polling packets one by one, counting bytes, or using a weighted method, or by polling packets one by one or counting bytes with weights. The processing module is configured to perform traffic shaping on each of the at least one first service flow; the traffic shaping is performed based on the bandwidth requirements of each first service flow; and the at least one first service flow is orchestrated according to the time when the shaping queue corresponding to each first service flow completes packet shaping to obtain the second service flow; the orchestration represents that, for the shaping queue corresponding to each first service flow, the packets of each first service flow are sequentially entered into the queue corresponding to the second service flow according to the time when they are ready to be dequeued.

8. A data transmission device, characterized in that, The device includes: The receiving module is configured to receive a second service flow from a first communication node using a method of packet-by-packet polling, byte-count counting, or weighted polling, or weighted polling based on byte count. The second service flow includes at least one first service flow along the same path in a converged first network, and the at least one first service flow has the same quality of service (QoS) guarantee requirements. The first network is a DIP network. The at least one first service flow along the same path in the converged first network includes: the first communication node performing traffic shaping on each of the at least one first service flow; the traffic shaping is performed based on the bandwidth requirements of each first service flow; and the at least one first service flow is orchestrated according to the time it takes for the shaping queue corresponding to each first service flow to complete packet shaping, resulting in the second service flow. The orchestration represents, for each first service flow's corresponding shaping queue, the packets of each first service flow sequentially entering the queue corresponding to the second service flow according to their dequeue preparation time.

9. A communication 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 steps of the method according to any one of claims 1 to 5; Alternatively, the processor may execute the steps of the method of claim 6 when executing the program.

10. A 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 steps of the method according to any one of claims 1 to 5; or... When the computer program is executed by a processor, it implements the steps of the method of claim 6.

Images