A data transmission method, apparatus, communication node and storage medium

Abstract

Embodiments of the present application disclose a data transmission method and device, a communication node and a storage medium. The method comprises: a first node sending a first message, the first message comprising a first identifier, the first identifier indicating that the message is insensitive to out-of-order.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of communication technology, and in particular to a data transmission method, device, communication node and storage medium. BACKGROUND

[0002] In the future, with more and more data express services, traffic similar to Fast and Secure Protocol (FASP) will be more and more. In the FASP scheme, traffic control is decoupled from network packet loss, and high-speed forwarding of files on the Internet can be realized. There is no linkage with the network side in the FASP scheme, and the network side currently treats all data equally (default to try to maintain order); nowadays, such traffic is increasing, which will challenge network forwarding. Since FASP has a natural fairness problem, how to consider transmission performance while improving fairness between traffic and better achieve network load balancing is a problem that needs to be solved at present. SUMMARY

[0003] To solve the existing technical problems, the embodiments of the present application provide a data transmission method, device, communication node and storage medium.

[0004] To achieve the above purpose, the technical scheme of the embodiments of the present application is as follows:

[0005] In a first aspect, the embodiments of the present application provide a data transmission method, which is applied to a first node, and the method comprises:

[0006] The first node sends a first message, and the first message comprises a first identifier, and the first identifier indicates that the message is insensitive to out-of-order.

[0007] In the above scheme, the first identifier also indicates a service class (TOS), a service level (CoS) or a communication class (TC) of the message; or,

[0008] The first message further comprises a second identifier, and the second identifier indicates a service class (TOS), a service level (CoS) or a communication class (TC) of the message.

[0009] In the above scheme, the service class (TOS), the service level (CoS) or the communication class (TC) of the message is used to indicate that the type of the message is a best effort (BE) type message.

[0010] In the above scheme, before the first node sends the first message, the method further comprises:

[0011] The first node identifies a first message, adds the first identifier in the first message, or adds the first identifier and the second identifier in the first message.

[0012] In the above solution, before the first node sends the first message, the method further comprises:

[0013] The first node sends first information to a third node as a receiving end, and / or the first node receives second information sent by the third node; the first information comprises capability information of the first node, and the second information comprises capability information of the third node; the capability information at least comprises a capability of supporting transmission of out-of-order insensitive messages.

[0014] In a second aspect, an embodiment of the present application further provides a data transmission method, which is applied to a second node, and the method comprises:

[0015] The second node receives a first message.

[0016] When the first message comprises a first identifier, the second node processes the first message according to per-packet load sharing, or transmits the first message by using a backup path; wherein the first identifier indicates that a message is insensitive to out-of-order.

[0017] In the above solution, the first identifier further indicates a service class (TOS), a service level (CoS), or a communication class (TC) of a message; or,

[0018] The first message further comprises a second identifier, and the second identifier indicates a service class (TOS), a service level (CoS), or a communication class (TC) of a message.

[0019] In the above solution, the service class (TOS), the service level (CoS), or the communication class (TC) of the message is used to indicate that a type of a message is a best effort (BE) type message.

[0020] In the above solution, the method further comprises: the second node activates the backup path when a main path is congested.

[0021] In the above solution, the method further comprises: when the first message does not comprise a first identifier, the second node processes the first message according to per-flow load sharing, or transmits the first message by using a main path.

[0022] In the above solution, the method further comprises: the second node determines a discard priority according to the first identifier of the first message, and performs congestion management according to the discard priority.

[0023] In the above scheme, the method further includes: the second node adding a third identifier to the first message according to the discard priority; when the first message includes the first identifier, the value of the third identifier is a first value, which indicates the lowest discard priority or the highest probability that the message will be discarded.

[0024] Thirdly, embodiments of the present invention also provide a data transmission method, the method being applied to a third node, the method comprising:

[0025] The third node receives the first message;

[0026] When the first message includes a first identifier, the third node sorts or reorders the first message according to its message sequence number; the first identifier indicates that the message is not sensitive to out-of-order delivery.

[0027] In the above scheme, the first identifier further indicates the message's Type of Service (TOS), Type of Service (CoS), or Type of Communication (TC); or,

[0028] The first message also includes a second identifier, which indicates the message’s category of service (TOS), service level (CoS), or communication category (TC).

[0029] In the above scheme, the service category (TOS), service level (CoS), or communication category (TC) of the message is used to indicate that the message type is a best-effort (BE) type message.

[0030] In the above scheme, the method further includes: the third node determining the sequence number of the lost message and initiating a retransmission request for the lost message.

[0031] Fourthly, embodiments of the present invention also provide a data transmission device, the device being applied to a first node, the device comprising: a first communication unit for sending a first message, the first message including a first identifier, the first identifier indicating that the message is not sensitive to out-of-order delivery.

[0032] Fifthly, embodiments of the present invention also provide a data transmission device, the device being applied to a second node, the device comprising: a second communication unit and a second processing unit; wherein,

[0033] The second communication unit is used to receive the first message;

[0034] The second processing unit is configured to process the first message according to packet-by-packet load balancing when the first message includes a first identifier, or to transmit the first message using an alternative path; wherein the first identifier indicates that the message is not sensitive to out-of-order delivery.

[0035] Sixthly, embodiments of the present invention also provide a data transmission apparatus, the apparatus being applied to a third node, the apparatus comprising: a third communication unit and a second processing unit; wherein,

[0036] The third communication unit is used to receive the first message;

[0037] The third processing unit is configured to sort or reorder the first message according to its message sequence number when the first message includes a first identifier.

[0038] In a seventh aspect, embodiments of the present invention also provide a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the data transmission method described in the first, second, or third aspects of the embodiments of the present invention.

[0039] Eighthly, embodiments of the present invention also provide a communication node, 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 steps of the data transmission method described in the first, second, or third aspects of the embodiments of the present invention.

[0040] In a ninth aspect, embodiments of the present invention also provide a computer program product, including computer program instructions that cause a computer device to perform the steps of the data transmission method described in the first, second, or third aspects of the embodiments of the present invention.

[0041] The data transmission method, apparatus, communication node, and storage medium provided in this invention embodiment transmit a first message through a first node. The first message includes a first identifier, which indicates that the message is not sensitive to out-of-order delivery. A second node receives the first message. When the first message includes the first identifier, the second node processes the first message according to packet-by-packet load balancing, or transmits the first message using an alternative path. The first identifier indicates that the message is not sensitive to out-of-order delivery. A third node receives the first message. When the first message includes the first identifier, the third node sorts or reorders the first message according to its sequence number. By adopting the technical solution of this invention embodiment, for messages that are not sensitive to out-of-order delivery, or messages that do not require strict order preservation, a first identifier is added to the message (denoted as the first message) to indicate that the message is not sensitive to out-of-order delivery, or that strict order preservation is not required. Subsequently, other nodes receive these packets carrying the first identifier and perform special processing (such as no longer trying to transmit in order, performing packet-by-packet load balancing or backup path switching, etc.) to make up for the fairness of traffic, and help solve the problem of unbalanced load in the network and improve data transmission efficiency. Attached Figure Description

[0042] Figure 1 Flowchart of the data transmission method of the embodiment of the present application Figure One ;

[0043] Figure 2 Format of the message in the data transmission method of the embodiment of the present application

[0044] Figure 3 Flowchart of the data transmission method of the embodiment of the present application Figure Two ;

[0045] Figure 4a and Figure 4b Process of the message in the data transmission method of the embodiment of the present application

[0046] Figure 5a Flowchart of the data transmission method of the embodiment of the present application

[0047] Figure 5b Flowchart of the data transmission method of the embodiment of the present application

[0048] Figure 6 Flowchart of the data transmission method of the embodiment of the present application Figure Three ;

[0049] Figure 7 Flowchart of the data transmission method of the embodiment of the present application

[0050] Figure 8 Composition structure of the data transmission device of the embodiment of the present application Figure One ;

[0051] Figure 9 Composition structure of the data transmission device of the embodiment of the present application Figure Two ;

[0052] Figure 10 Composition structure of the data transmission device of the embodiment of the present application Figure Three ;

[0053] Figure 11 Hardware composition structure of the communication node of the embodiment of the present application. DETAILED DESCRIPTION

[0054] The present application will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0055] The technical solutions of the embodiments of the present application can be applied to various communication systems, for example, a Global System of Mobile communication (GSM) system, a Long Term Evolution (LTE) system, or a 5G system, and the like. Optionally, the 5G system or 5G network can also be referred to as a New Radio (NR) system or NR network.

[0056] For example, the communication system to which the embodiments of the present application are applied can include a network device and a terminal device (also referred to as a terminal, a communication terminal, and the like); the network device can be a device that communicates with the terminal device. The network device can provide communication coverage for a certain area and can communicate with terminals located in the area. Optionally, the network device can be a base station in various communication systems, for example, an Evolutional Node B (eNB) in an LTE system, and for example, a base station (gNB) in a 5G system or an NR system.

[0057] It should be understood that the devices with communication functions in the network / system in the embodiments of the present application can be referred to as communication devices. The communication devices can include network devices and terminals with communication functions, and the network devices and terminal devices can be the specific devices described above, which will not be described here again; the communication devices can also include other devices in the communication system, for example, network controllers, mobile management entities, and other network entities, which are not limited in the embodiments of the present application.

[0058] It should be understood that the terms "system" and "network" are often used interchangeably in the present application. The term "and / or" in the present application is only used to describe the association relationship of the associated objects, which means that there can be three relationships, for example, A and / or B, which can represent the three cases of A alone, A and B together, and B alone. In addition, the character " / " in the present application generally represents an "or" relationship between the front and rear associated objects.

[0059] The terms "first", "second", and the like in the specification and claims of the present application are used to distinguish similar objects, and do not necessarily mean a specific order or sequence. It should be understood that the data thus used can be interchanged under appropriate circumstances, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion, for example, a process, method, system, product, or device including a series of steps or units does not necessarily have to be limited to those steps or units clearly listed, but can include other steps or units not clearly listed or inherent to the process, method, product, or device.

[0060] Before the embodiments of the present application are described in detail, the data transmission technology of the prior art solution is briefly described first.

[0061] With the development of new Internet scenarios and technologies such as high-definition video, cloud computing, big data, artificial intelligence, and large models, users often need to transmit a large amount of data in a wide area network. The wide area network environment is full of uncertainties, micro-burst congestion, and operator traffic shaping strategies, which result in a packet loss rate of up to one in a thousand in long-distance transmission. The traditional congestion control algorithm uses packet loss as a congestion signal and cannot fill the bandwidth under a packet loss rate of one in a thousand.

[0062] In the design goal of the Transmission Control Protocol (TCP), the transport layer is decoupled from the application layer, that is, the same TCP is used to carry all applications, which greatly improves the universality of TCP / IP, but the performance is not excellent, especially in the large file transmission scenario. In order to adapt to all businesses, TCP provides strict sequential forwarding, which is important for businesses that need quick response, but some applications do not need it, such as large file message forwarding.

[0063] The concept of FASP (such as Aspera software) is to decouple packet loss and flow control. The core technology lies in the design of the retransmission mechanism, which uses NACK (feedback of missing messages) and TCP uses feedback of received messages.

[0064] The main content of the FASP retransmission and flow control mechanism includes:

[0065] Premise: the receiving end continuously measures RTT N , RTT P . The former is used to perceive network congestion, and the latter adds the processing delay of the sending end (that is, both network delay and end-side delay of the sending end are considered).

[0066] Retransmission: once the receiving end finds a missing packet, the receiving end does not immediately request retransmission, but waits for an RTT P time, and then requests retransmission. If it has not been received, it waits for an RTT P and requests again until the missing message is received.

[0067] In terms of flow control, a RTT NFASP needs to be more aggressive than TCP (TCP packet loss triggers a larger speed reduction) to obtain greater throughput, and there is a natural fairness problem.

[0068] There is no linkage in the FASP scheme with the network side, and the network side currently treats all data equally (default to try to maintain order) ; nowadays, such traffic is increasing, which will challenge network forwarding.

[0069] At least based on this, the following embodiments of the application are proposed.

[0070] The embodiment of the application provides a data transmission method. Figure 1 The flow of the data transmission method of the embodiment of the application is shown in Figure One ; as shown in Figure 1 , the method comprises the following steps.

[0071] Step 101: the first node sends a first message, wherein the first message comprises a first identifier, and the first identifier indicates that the message is insensitive to disorder.

[0072] In the embodiment, the first node is a sending end. In the data transmission system of the embodiment of the application, a message can be sent by the first node, forwarded through one or more second nodes, and arrive at a third node. In some optional embodiments, the first node can be referred to as a source node or the like; the third node can be referred to as a target (or destination) node or the like. The second node can be referred to as an entry node, a head node, a tunnel source node, an intermediate node, a forwarding node, a routing node, an exit node, a tail node, a tunnel target (or destination) node or the like.

[0073] In the embodiment, considering that there can be a lot of traffic or messages with weak real-time performance in the network, therefore, for the messages insensitive to disorder or the messages not needing strict order maintenance, a first identifier is added in the message (referred to as a first message), so as to indicate that the message is insensitive to disorder or not needing strict order maintenance through the first identifier. Then, other nodes receive the messages carrying the first identifier and perform special processing (for example, no longer try to maintain order transmission and the like), so as to make up for the fairness problem of the traffic, and be beneficial to solving the problem of unbalanced load in the network and improving the data transmission efficiency.

[0074] In some alternative embodiments, the first identifier also represents a service type (TOS), a service class (CoS), or a traffic class (TC) of the packet; or the first packet further comprises a second identifier representing a service type (TOS), a service class (CoS), or a traffic class (TC) of the packet.

[0075] In some alternative embodiments, the service type (TOS), the service class (CoS), or the traffic class (TC) of the packet is used to represent that the packet is a BE type packet.

[0076] In the embodiment, the BE type packet can be represented by the service type, the service class, or the traffic class of the packet. As an implementation, the first identifier representing the packet insensitive to out-of-order and the identifier representing the BE type packet can be combined to use a single identifier, which is the first identifier. The single identifier (i.e., the first identifier) can represent that the packet is insensitive to out-of-order on one hand, and represent the service type, the service class, or the traffic class on the other hand. As another implementation, the first identifier representing the packet insensitive to out-of-order and the identifier representing the BE type packet can be separately set, i.e., the first identifier is used to represent that the packet is insensitive to out-of-order, and the second identifier is used to represent the service type, the service class, or the traffic class. For example, 000 is used to represent the second identifier in the packet header, and a special bit is used to represent the first identifier. The first identifier and the second identifier can respectively occupy the bit positions in the packet header. Figure 2 Taking the IP packet header format shown in the table as an example, the flags field has three bit positions, the feature bit0 is a reserved bit and must be 0, bit1 represents whether the packet can be fragmented, 0 represents that the packet can be fragmented, and 1 represents that the packet cannot be fragmented, and bit2 represents whether the packet is the last fragment, 0 represents the last fragment, and 1 represents that there are still fragments behind. In the example, bit0 of the flags field is used to represent the first identifier, representing that strict in-order is not required or the packet is insensitive to out-of-order; for example, bit0 is set to 1 to represent that strict in-order is not required or the packet is insensitive to out-of-order. As another example, a special UDP destination port number is used to represent the first identifier.

[0077] In some alternative embodiments, before the first node sends the first packet, the method further comprises: the first node identifying the first packet, adding the first identifier in the first packet, or adding the first identifier and the second identifier in the first packet.

[0078] In the embodiment, the first node can identify the message based on the application layer information, identify whether the message is sensitive to out-of-order or whether the message needs strict in-order, and add the first identifier in the first message or add the first identifier and the second identifier in the first message according to the identification result.

[0079] In some optional embodiments of the application, before the first node sends the first message, the method further comprises: the first node sending first information to a third node as a receiving end, and / or the first node receiving second information sent by the third node; the first information comprises capability information of the first node, and the second information comprises capability information of the third node; the capability information at least comprises the capability of supporting out-of-order insensitive message transmission.

[0080] In the embodiment, when the first node needs to send data (such as a large file), the sending end and the receiving end establish a relevant connection, that is, the first node and the third node establish a relevant connection, and the capability information is exchanged between the first node and the third node, so that it is confirmed that both sides support the capability of out-of-order insensitive message transmission. It should be noted that both sides (the first node and the third node) need to support FASP or similar mechanisms to start the relevant capability.

[0081] Based on the above embodiment, the embodiment of the application provides a data transmission method. Figure 3 The flow of the data transmission method of the embodiment of the application is shown in FIG. 2. Figure Two As shown in FIG. 2, the method comprises the following steps. Figure 3

[0082] Step 201: The second node receives a first message.

[0083] Step 202: When the first message comprises a first identifier, the second node processes the first message according to packet load sharing or transmits the first message by using a backup path; wherein the first identifier indicates that the message is insensitive to out-of-order.

[0084] In the embodiment, the second node as an intermediate node can receive the first message sent by the first node or the first message sent by another second node.

[0085] ​In the embodiment, the first message received by the second node can be a message insensitive to message reordering. In this case, the first node adds a first identifier to the first message by identifying the first message. In other alternative embodiments, the first message can also be a message sensitive to message reordering. In this case, the first message does not include the first identifier. After receiving the first message, the second node identifies that the first message carries the first identifier, and triggers the second node to use special processing, i.e., processing the first message according to per-packet load sharing, or transmitting the first message using a backup path.

[0086] In some alternative embodiments, the first identifier also represents a service class (TOS), a service level (CoS), or a traffic class (TC) of the message; or the first message further includes a second identifier representing a service class (TOS), a service level (CoS), or a traffic class (TC) of the message.

[0087] In some alternative embodiments, the service class (TOS), the service level (CoS), or the traffic class (TC) of the message is used to represent that the type of the message is a best effort (BE) type message.

[0088] In the embodiment, the BE type message can be represented by a service class, a service level, or a traffic class of the message. As an implementation, the first identifier representing insensitivity to reordering and the identifier representing the BE type can be combined to use a single identifier. The single identifier (i.e., the first identifier) can represent that the message is insensitive to reordering and represent the service class, the service level, or the traffic class. As another implementation, the first identifier representing insensitivity to reordering and the identifier representing the BE type can be separately set, i.e., the first identifier is used to represent that the message is insensitive to reordering, and the second identifier is used to represent the service class, the service level, or the traffic class. For example, 000 is used to represent the second identifier in the message header, and a special bit is used to represent the first identifier. The first identifier and the second identifier can respectively occupy bit positions in the message header. Figure 2 Taking the IP message header format shown in the table as an example, the flags field has three bit positions. The feature bit0 is a reserved bit and must be 0. Bit1 represents whether the message can be fragmented, 0 representing that the message can be fragmented and 1 representing that the message cannot be fragmented. Bit2 represents whether the message is the last fragment, 0 representing the last fragment and 1 representing that there are still subsequent fragments. In this example, bit0 of the flags field is used to represent the first identifier, representing that strict ordering is not required or the message is insensitive to reordering. For example, bit0 is set to 1 to represent that strict ordering is not required or the message is insensitive to reordering. As another example, a special UDP destination port number is used to represent the first identifier.

[0089] In some alternative embodiments, the method further includes: the second node activating the backup path when the primary path is congested.

[0090] In this embodiment, after receiving the first message carrying the first identifier, if the primary path is congested, the second node activates the backup path and uses the backup path to transmit the first message.

[0091] In some optional embodiments of the present invention, the method further includes: when the first message does not include the first identifier, the second node processes the first message according to flow-by-flow load balancing, or transmits the first message using the main path.

[0092] In this embodiment, when the first message does not carry the first identifier, it indicates that the first message is sensitive to out-of-order delivery or requires strict order preservation. The second node then processes the first message using conventional methods, either by load balancing or by transmitting the first message via the main path.

[0093] Figure 4a and Figure 4b This is a schematic diagram of the message processing process in the data transmission method of this invention. Figure 4a For load balancing (LB) forwarding scenarios, when a packet arrives at the forwarding device (such as a second node) and a decision is made regarding the outgoing interface, if an equivalent path or link exists, it is determined whether the packet carries a first identifier. If it carries a first identifier, it indicates that the packet is not sensitive to out-of-order delivery or does not require strict ordering, and can be routed according to per-packet load balancing. If the packet does not carry a first identifier, it indicates that the packet is sensitive to out-of-order delivery or requires strict ordering, and needs to be routed according to per-flow load balancing.

[0094] For details, please refer to Figure 5a As shown, packets arriving at node R3 may include, for example, P2, P3, and P5, while packets arriving at node R4 may include P1, P4, and P6. Using a flow-by-flow load balancing approach, packets arriving at node R3 and those arriving at node R4 are transmitted on different links. This ensures that packets are not out of order, but may result in poor load balancing.

[0095] Reference Figure 5b As shown, the packets arriving at node R3 also include P2, P3, and P5, and the packets arriving at node R4 also include P1, P4, and P6. Therefore, using packet-by-packet load balancing, distributing load according to data packets, may result in the following... Figure 5bIn the case that the messages of different destination nodes shown are transmitted on the same link, for example, P1, P3 and P5 are transmitted through link A (Link A) and P2, P4 and P6 are transmitted through link B (Link B), the message disorder may occur, for example, R1 node transmits P1 through link A (Link A) first and transmits P2 through link B (Link B) first, if the quality of link A is poor, P4 has been transmitted after P2 is transmitted, and even the case that R2 node receives P4 first and then receives P1, so the message disorder occurs.

[0096] Therefore, for the message carrying the first identifier, the packet-by-packet load sharing (packet-by-packet load balancing) is performed, and the message disorder may occur as Figure 5b If the message does not carry the first identifier, it means that the message is sensitive to disorder or needs to be strictly ordered, and the flow-by-flow load sharing is still performed as Figure 5a to ensure that the message is not disordered.

[0097] Figure 4b For the scenario of policy traffic engineering (TTE, Tactical Traffic Engineering) forwarding. In the scenario, when the message reaches the forwarding device (such as the second node) and the interface is determined, the backup path activated by TTE is determined, whether the message carries the first identifier is determined, if the first identifier is carried, it means that the message is not sensitive to disorder or does not need to be strictly ordered, and the message can be forwarded according to the backup path activated by TTE, in this case, different messages of the same flow may be transmitted on different paths, which may cause the message disorder; if the message does not carry the first identifier, it means that the message is sensitive to disorder or needs to be strictly ordered, and the message is continued to be forwarded according to the main path to ensure that the message is not disordered.

[0098] In some optional embodiments of the present application, the method further comprises: the second node determines the discard priority according to the first identifier of the first message, and performs congestion management according to the discard priority.

[0099] In the conventional implementation, there are three discard priorities, which are marked as red, yellow and green respectively; among them, the discard probability of green is the highest, the discard probability of yellow is the second, and the discard probability of red is the lowest. In the embodiments of the present application, the discard priority is determined according to the first identifier of the first message, and the discard priority associated with the first identifier can be the discard priority with the highest discard probability.

[0100] As an example, on the basis of the three existing discard priorities, a color corresponding to the discard priority can be added, for example, blue, indicating the discard priority with the highest discard probability, and the packet with the discard priority marked with blue is the packet with the highest discard probability or the packet most likely to be discarded.

[0101] As another example, on the basis of the three existing discard priorities, the discard priority corresponding to the first mark in the embodiment of the application is adjusted to green, indicating the discard priority with the highest discard probability, and the packet with the discard priority marked with green is the packet with the highest discard probability or the packet most likely to be discarded; the traditional green and yellow discard priorities are unified as the yellow discard priority, and the three discard priorities are still maintained in general.

[0102] In some optional embodiments, the method further comprises: adding, by the second node, a third mark to the first packet according to the discard priority; when the first packet comprises the first mark, the third mark has a first value, and the first value indicates the lowest discard priority or indicates the highest probability of packet discard.

[0103] In the first embodiment described above, i.e., the case of four discard priorities, the third mark being set to the first value can indicate the blue discard priority, i.e., the discard priority with the highest discard probability. In the second embodiment described above, i.e., the case of three discard priorities, the third mark being set to the first value can indicate the green discard priority, i.e., the discard priority with the highest discard probability.

[0104] In the embodiment, the second node performs congestion avoidance according to the value (such as the first value or the color color) of the third mark in the first packet. For example, if congestion occurs, the packet with the third mark set to the first value can be discarded appropriately to avoid congestion.

[0105] In some optional embodiments, the method further comprises: mapping, by the second node, the quality of service (QoS) priority of the first packet to a service class; and performing congestion management according to the service class. In other optional embodiments, the second node further maps the service class to the QoS priority, so that subsequent nodes can provide corresponding quality of service according to the QoS priority.

[0106] In the embodiment, different messages can correspond to different QoS priorities, for example, a Virtual Local Area Network (VLAN) message uses 802.1p, an IP message uses DSCP, a Multi-Protocol Label Switching (MPLS) message uses EXP or CoS (Class of Service). In order to ensure the quality of service of different messages, when the message enters the second node, the second node needs to uniformly map the QoS priority carried by the message to the service class (or also called scheduling priority PHB) in the device, and determine the discard priority (or also called color Color) according to the first identifier carried by the message. In the device, the congestion is managed according to the service class of the message, and the congestion is avoided according to the color of the message; when the message exits the device, the internal service class and color need to be mapped to the QoS priority, so that the subsequent network device can provide corresponding quality of service according to the QoS priority.

[0107] Based on the above embodiment, the embodiment of the application provides a data transmission method. Figure 6 As shown in FIG. 1, the method comprises the following steps. Figure Three Figure 6 Step 301: A third node receives a first message.

[0108] Step 302: When the first message comprises a first identifier, the third node sorts or reorders the first message according to a message sequence number of the first message; the first identifier indicates that the message is insensitive to out-of-order.

[0109] In the embodiment, the third node is a receiving end node, and receives the first message sent by the second node. In the case that the first message carries the first identifier, the second node can use per-packet load sharing processing or use a backup path for transmission when processing the first message; therefore, the first message received by the third node can be out of order. Therefore, after receiving the first message carrying the first identifier, the third node sorts or reorders the first message according to the message sequence number.

[0110] In some optional embodiments, the first identifier further indicates a service class (TOS), a service level (CoS) or a communication class (TC) of the message; or the first message further comprises a second identifier, and the second identifier indicates the service class (TOS), the service level (CoS) or the communication class (TC) of the message.

[0111]

[0112] ​​In some alternative embodiments, the message’s category of service (TOS), service level (CoS), or communication category (TC) is used to indicate that the message type is a best-effort (BE) type message.

[0113] In this embodiment, BE type messages can be represented by the service category, service level, or communication category of the message. As one implementation, the first identifier indicating insensitivity to out-of-order delivery and the identifier indicating the BE type can be combined into a single identifier. This single identifier (i.e., the first identifier) ​​can indicate both that the message is insensitivity to out-of-order delivery and that the service category, service level, or communication category is present. As another implementation, the first identifier indicating insensitivity to out-of-order delivery and the identifier indicating the BE type can be set separately. That is, the first identifier indicates that the message is insensitivity to out-of-order delivery, and the second identifier indicates the service category, service level, or communication category. For example, 000 can be used to represent the second identifier in the message header, and a special bit can be used to represent the first identifier. The first identifier and the second identifier can each occupy a bit in the message header. Figure 2 Taking the IP header format shown as an example, the flags field has three bits. Bit 0 is a reserved bit and must be 0; bit 1 indicates whether fragmentation is allowed (0 for fragmentation, 1 for fragmentation not allowed); bit 2 indicates whether this is the last fragment (0 for the last fragment, 1 for more fragments). In this example, bit 0 of the flags field can be used to identify the first flag, indicating that strict ordering is not required, or the packet is not sensitive to out-of-order delivery; for example, bit 0 being 1 indicates that strict ordering is not required, or the packet is not sensitive to out-of-order delivery. As another example, a special UDP destination port number can be used to represent the first flag.

[0114] In some optional embodiments of the present invention, before the third node receives the first message, the method further includes: the third node receiving first information sent by the first node as the sending end, and / or the third node sending second information to the first node; the first information includes capability information of the first node, and the second information includes capability information of the third node; the capability information includes at least the capability to support out-of-order insensitive message transmission.

[0115] In this embodiment, when the first node needs to send data (such as a large file), the sending and receiving ends establish a connection, that is, the first node and the third node establish a connection. By exchanging capability information between the first and third nodes, it is confirmed that both parties support the ability to transmit out-of-order insensitive messages. It should be noted that both parties (the first node and the third node) need to support FASP and / or similar mechanisms to activate the relevant capabilities.

[0116] In some optional embodiments of the present application, the method further comprises: the third node determining the packet sequence number of the lost packet, and initiating a retransmission request for the lost packet.

[0117] Figure 7 Figure 1 is a schematic diagram of an interaction flow of a data transmission method according to an embodiment of the present application. As shown in the figure, the method comprises the following steps: Figure 7

[0118] Step 401: the first node as the sender and the third node as the receiver exchange capability information, which at least includes the capability of supporting out-of-order insensitive packet transmission.

[0119] Here, the first node sends the capability information of the first node to the third node, and the third node sends the capability information of the third node to the first node, so as to confirm that both sides support the capability of out-of-order insensitive packet transmission. It should be noted that both the first node and the third node need to support FASP or similar mechanism to start the related capability.

[0120] Step 402: the first node adds a first identifier to the first packet, and sends the first packet; the first identifier indicates that the packet is insensitive to out-of-order.

[0121] Here, in some optional embodiments, the first identifier also indicates the service class (TOS), service level (CoS) or communication class (TC) of the packet. In other optional embodiments, the first node can also add a second identifier to the first packet, which also indicates the service class (TOS), service level (CoS) or communication class (TC) of the packet.

[0122] Here, for example, when the first node determines that there is a data express service to transmit a large file, the first node starts the UDP protocol, and sends the UDP packet (i.e. the first packet) of the large file at the negotiated rate or the pre-configured rate; wherein the packet carries a sequence number for identifying the order of the packet.

[0123] Step 403: the second node receives the first packet; if the first packet carries the first identifier, the first packet is processed according to the per-packet load sharing, or the first packet is transmitted by using a backup path; wherein the first identifier indicates that the packet is insensitive to out-of-order.

[0124] Here, the first packet received by the second node can be a packet insensitive to out-of-order or a packet sensitive to out-of-order. Then the second node identifies the first packet, and determines that the packet is insensitive to out-of-order when the first packet carries the first identifier, so as to trigger the second node to use special processing, i.e. to process the first packet according to the per-packet load sharing, or to transmit the first packet by using a backup path.​

[0125] In other optional embodiments, when the first message does not carry the first identifier, it indicates that the first message is sensitive to out-of-order or needs strict in-order. The second node processes the first message in a conventional manner, i.e., in accordance with per-flow load balancing, or transmits the first message using the primary path.

[0126] It should be noted that the present example and the figure take one second node as an example for illustration, and in actual application, there can be multiple second nodes, each of which can be processed in the manner of step 403, which will not be described herein.

[0127] Step 404: The third node receives the first message, and when the first message includes the first identifier, sorts or reorders the first message in accordance with the message sequence number of the first message.

[0128] Here, the third node is a receiving end node that receives the first message sent by the second node. When the first message carries the first identifier, the second node can use per-packet load balancing processing or use a backup path for transmission in the process of processing the first message. Then, the first message received by the third node can be out of order. After the third node receives the first message carrying the first identifier, the third node sorts or reorders the first message in accordance with the message sequence number.

[0129] In other optional embodiments, the method further includes: the third node determining the message sequence number of the lost message, and initiating a retransmission request for the lost message.

[0130] By using the technical solution of the embodiments of the present application, in the first aspect, the message insensitive to out-of-order is identified (the first identifier is added) to make the second node perform special processing on the message carrying the first identifier, such as no longer attempting in-order transmission, performing per-packet load balancing or backup path switching, or marking a specific discard priority, which is relatively more likely to be dropped, to compensate for the fairness problem of the flow. In the second aspect, according to the conventional per-flow load balancing processing, the elephant flow sometimes enters the same link, which can cause unbalanced load. By using the technical solution of the embodiments of the present application, the per-packet load balancing is triggered for the message carrying the first identifier, which can to some extent alleviate the problem of the elephant flow being unable to be separated and unbalanced load. In the third aspect, according to the conventional mechanism, the TTE is started in the network, the path of the flow needs to be adjusted, the out-of-order can cause poor application experience, or the TTE is not enabled, which can cause local congestion of the network, and there can be bandwidth remaining in other links. By using the technical solution of the embodiments of the present application, the backup link switching can be used for the message carrying the first identifier, which can to some extent not cause the above problems.

[0131] Based on the above-mentioned embodiments, the embodiments of the present application further provide a data transmission device, which is applied to a first node. Figure 8 The composition structure of the data transmission device of the embodiments of the present application is shown in Figure One Figure 8 The device comprises a first communication unit 11, which is used for sending a first message, wherein the first message comprises a first identifier, and the first identifier indicates that the message is not sensitive to out-of-order.

[0132] In some optional embodiments of the present application, the first identifier further indicates a service type (TOS, Type of Service), a service level (CoS, Class of Service) or a traffic type (TC, Traffic Class) of the message; or the first message further comprises a second identifier, which indicates the service type (TOS), the service level (CoS) or the traffic type (TC) of the message.

[0133] In some optional embodiments of the present application, the service type (TOS), the service level (CoS) or the traffic type (TC) of the message is used to indicate that the type of the message is a best effort (BE) type message.

[0134] In some optional embodiments of the present application, the device further comprises a first processing unit 12, which is used for identifying the first message, adding the first identifier in the first message, or adding the first identifier and the second identifier in the first message.

[0135] In some optional embodiments of the present application, the first communication unit 11 is further used for sending first information to a third node as a receiving end, and / or the first node receives second information sent by the third node; the first information comprises capability information of the first node, and the second information comprises capability information of the third node; the capability information at least comprises the capability of supporting the transmission of the out-of-order insensitive message.

[0136] In the embodiments of the present application, the first processing unit 12 in the device can be realized by a central processing unit (CPU), a digital signal processor (DSP), a microcontroller unit (MCU) or a programmable gate array (FPGA) in actual application; and the first communication unit 11 in the device can be realized by a communication module (including a basic communication suite, an operating system, a communication module, a standardized interface and a protocol, etc.) and a transceiving antenna in actual application. ​

[0137] The embodiment of the present application also provides a data transmission device, which is applied to a second node. Figure 9 The composition structure of the data transmission device of the embodiment of the present application is shown in the figure Figure Two As shown in the figure Figure 9 The device comprises a second communication unit 21 and a second processing unit 22.

[0138] The second communication unit 21 is configured to receive a first packet.

[0139] The second processing unit 22 is configured to process the first packet according to per-packet load sharing when the first packet comprises a first identifier, or transmit the first packet by using a backup path; wherein the first identifier indicates that the packet is insensitive to out-of-order.

[0140] In some optional embodiments of the present application, the first identifier further indicates a service class (TOS, Type of Service), a service level (CoS, Class of Service) or a communication class (TC, Traffic Class) of the packet; or the first packet further comprises a second identifier, which indicates a service class (TOS), a service level (CoS) or a communication class (TC) of the packet.

[0141] In some optional embodiments of the present application, the service class (TOS), the service level (CoS) or the communication class (TC) of the packet is used to indicate that the type of the packet is a best effort (BE) type packet.

[0142] In some optional embodiments of the present application, the second processing unit 22 is further configured to activate the backup path when the main path is congested.

[0143] In some optional embodiments of the present application, the second processing unit 22 is further configured to process the first packet according to per-flow load sharing or transmit the first packet by using a main path when the first packet does not comprise a first identifier.

[0144] In some optional embodiments of the present application, the second processing unit 22 is further configured to determine a discard priority according to the first identifier of the first packet, and perform congestion management according to the discard priority.

[0145] In some optional embodiments of the present application, the second processing unit 22 is further configured to add a third identifier in the first packet according to the discard priority; when the first packet comprises the first identifier, the third identifier takes a first value, and the first value indicates the lowest discard priority or indicates the highest probability of packet discard.

[0146] In the embodiment of the present application, the second processing unit 22 in the device can be implemented by a CPU, a DSP, an MCU or an FPGA in practical application; and the second communication unit 21 in the device can be implemented by a communication module (including a basic communication suite, an operating system, a communication module, a standardized interface and a protocol, etc.) and a transceiving antenna in practical application.

[0147] The embodiment of the present application further provides a data transmission device, which is applied to a third node. Figure 10 The composition structure of the data transmission device in the embodiment of the present application is shown in Fig. 3. Figure Three As shown in Fig. 3, the device comprises a third communication unit 31 and a third processing unit 32. Figure 10

[0148] The third communication unit 31 is configured to receive a first packet.

[0149] The third processing unit 32 is configured to sort or re-sort the first packet according to a packet sequence number of the first packet when the first packet comprises a first identifier.

[0150] In some optional embodiments of the present application, the first identifier further represents a service class (TOS, Type of Service), a service level (CoS, Class of Service) or a communication class (TC, Traffic Class) of the packet; or the first packet further comprises a second identifier, and the second identifier represents the service class (TOS), the service level (CoS) or the communication class (TC) of the packet.

[0151] In some optional embodiments of the present application, the service class (TOS), the service level (CoS) or the communication class (TC) of the packet is used to represent that the type of the packet is a best effort (BE) type packet.

[0152] In some optional embodiments of the present application, the third processing unit 32 is further configured to determine a packet sequence number of a lost packet and initiate a retransmission request for the lost packet.

[0153] In the embodiment of the present application, the third processing unit 32 in the device can be implemented by a CPU, a DSP, an MCU or an FPGA in practical application; and the third communication unit 31 in the device can be implemented by a communication module (including a basic communication suite, an operating system, a communication module, a standardized interface and a protocol, etc.) and a transceiving antenna in practical application.

[0154] ​It should be noted that the data transmission apparatus provided by the above embodiments is only taken as an example for the division of the above program modules when performing data transmission, and in actual application, the above processing can be completed by different program modules according to needs, that is, the internal structure of the apparatus is divided into different program modules to complete all or part of the above processing. In addition, the data transmission apparatus and the data transmission method provided by the above embodiments belong to the same concept, and the specific implementation process is shown in the method embodiments, which will not be repeated here.

[0155] The embodiment of the present application further provides a communication node, which is the first node, the second node or the third node. Figure 11 The schematic diagram of the hardware composition structure of the communication node of the embodiment of the present application is shown in Figure 11 The communication node comprises a memory 42, a processor 41 and a computer program stored in the memory 42 and capable of running on the processor 41, and the processor 41 implements the steps of the data transmission method applied to the first node, the second node or the third node of the embodiment of the present application when executing the program.

[0156] Optionally, the communication node can further comprise at least one network interface 43. Wherein, each component in the communication node is coupled together through a bus system 44. It can be understood that the bus system 44 is used to realize the connection communication between the components. The bus system 44 comprises a data bus, a power supply bus, a control bus and a state signal bus. However, in order to clearly illustrate, all kinds of buses are marked as the bus system 44 in Figure 11 .

[0157] It can be understood that the memory 42 can be a volatile memory or a non-volatile memory, and can also include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a ferromagnetic random access memory (FRAM), a flash memory, a magnetic surface memory, an optical disc, or a compact disc read-only memory (CD-ROM). The magnetic surface memory can be a disk memory or a tape memory. The volatile memory can be a random access memory (RAM) used as an external cache. By way of example but not limitation, many forms of RAM can be used, such as static random access memory (SRAM), synchronous static random access memory (SSRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), sync link dynamic random access memory (SLDRAM), and direct rambus random access memory (DRRAM).The memory 42 described in the embodiments of the present application is intended to include, but not limited to, these and any other suitable type of memory.

[0158] The method disclosed in the embodiments of the present application can be applied in the processor 41 or implemented by the processor 41. The processor 41 can be an integrated circuit chip having a processing capability of signals. In the implementation process, each step of the above method can be completed by the integrated logic circuit of hardware in the processor 41 or the instruction in the form of software. The processor 41 described above can be a general processor, a DSP, or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, etc. The processor 41 can implement or execute the disclosed methods, steps and logic block diagrams in the embodiments of the present application. The general processor can be a microprocessor or any conventional processor, etc. In combination with the steps of the method disclosed in the embodiments of the present application, the execution can be directly completed by the hardware decoding processor or by the combination of hardware and software modules in the decoding processor. The software module can be located in the storage medium, which is located in the memory 42. The processor 41 reads the information in the memory 42 and combines the hardware to complete the steps of the above method.

[0159] In the exemplary embodiments, the communication node can be implemented by one or more Application Specific Integrated Circuit (ASIC), DSP, Programmable Logic Device (PLD), Complex Programmable Logic Device (CPLD), FPGA, general-purpose processor, controller, MCU, microprocessor (Microprocessor), or other electronic elements, for executing the above method.

[0160] In the exemplary embodiments, the embodiments of the present application also provide a computer readable storage medium, such as the memory 42 including a computer program, which can be executed by the processor 41 of the communication node to complete the steps of the above method. The computer readable storage medium can be FRAM, ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface memory, optical disc, or CD-ROM, etc. The computer readable storage medium can also be various devices including one or any combination of the above storage medium.

[0161] The computer readable storage medium provided by the embodiments of the present application has a computer program stored thereon, which is executed by the processor to implement the steps of the data transmission method applied to the first node, the second node or the third node in the embodiments of the present application.

[0162] The embodiment of the present application further provides a computer program product, comprising a computer program, which can be executed by a communication node (such as the processor 41 of the communication node) to complete the steps of any of the preceding data transmission methods.

[0163] The methods disclosed in the several method embodiments provided by the present application can be combined arbitrarily without conflict to obtain new method embodiments.

[0164] The features disclosed in the several product embodiments provided by the present application can be combined arbitrarily without conflict to obtain new product embodiments.

[0165] The features disclosed in the several method or device embodiments provided by the present application can be combined arbitrarily without conflict to obtain new method embodiments or device embodiments.

[0166] In the several embodiments provided by the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are only schematic. For example, the division of the units is only a logical function division, and there can be another division manner in actual implementation, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the various components shown or discussed can be indirect coupling or communication connection through some interface, device or unit, and can be electrical, mechanical or other forms.

[0167] The units described as separate components can or can not be physically separate, and the components shown as units can or can not be physical units, that is, they can be located in one place, or distributed on a plurality of network units; some or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.

[0168] In addition, each functional unit in each embodiment of the present application 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 realized in the form of hardware, or in the form of hardware plus software functional unit.

[0169] Those skilled in the art can understand that all or part of the steps of the above-mentioned method embodiments can be completed by program instruction related hardware, and the foregoing program can be stored in a computer readable storage medium, and the program is executed to perform the steps of the above-mentioned method embodiments; and the foregoing storage medium includes mobile storage equipment, ROM, RAM, magnetic disc or optical disc and various storage program codes.

[0170] Alternatively, the above-mentioned integrated unit of the present application, if realized in the form of a software function module and sold or used as an independent product, can also be stored in a computer-readable storage medium. Based on such an understanding, the technical solutions of the embodiments of the present application can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute all or part of the methods described in the embodiments of the present application. The aforementioned storage medium includes: mobile storage devices, ROM, RAM, magnetic disks or optical disks, and various media that can store program codes.

[0171] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto, any person skilled in the art can easily think of changes or replacements within the technical range disclosed by the present application, which should be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A data transmission method, characterized by, The method is applied to a first node, and the method comprises: The first node sends a first packet, and the first packet comprises a first identifier, which indicates that the packet is insensitive to out-of-order. The first identifier also indicates a service type TOS, a service level CoS, or a communication type TC of the packet; or the first packet further comprises a second identifier, which indicates a service type TOS, a service level CoS, or a communication type TC of the packet. The service type TOS, the service level CoS, or the communication type TC of the packet is used to indicate that the type of the packet is a best effort (BE) type packet.

2. The method of claim 1, wherein, Before the first node sends the first packet, the method further comprises: The first node identifies the first packet, adds the first identifier in the first packet, or adds the first identifier and the second identifier in the first packet.

3. The method of claim 1, wherein, Before the first node sends the first packet, the method further comprises: The first node sends first information to a third node as a receiving end, and / or the first node receives second information sent by the third node; the first information comprises capability information of the first node, and the second information comprises capability information of the third node; the capability information at least comprises a capability of supporting transmission of an out-of-order insensitive packet.

4. A data transmission method, characterized by, The method is applied to a second node, and the method comprises: The second node receives a first packet; When the first packet comprises a first identifier, the second node processes the first packet according to per-packet load sharing, or transmits the first packet by using a backup path; wherein the first identifier indicates that the packet is insensitive to out-of-order. The first identifier also indicates a service type TOS, a service level CoS, or a communication type TC of the packet; or the first packet further comprises a second identifier, which indicates a service type TOS, a service level CoS, or a communication type TC of the packet. The service type TOS, the service level CoS, or the communication type TC of the packet is used to indicate that the type of the packet is a best effort (BE) type packet.

5. The method of claim 4, wherein, The method further comprises: The second node activates the backup path when a main path is congested.

6. The method of claim 4, wherein, The method further comprises: When the first packet does not comprise a first identifier, the second node processes the first packet according to per-flow load sharing, or transmits the first packet by using a main path.

7. The method of claim 4, wherein, The method further comprises: The second node determines a discard priority according to the first identifier of the first packet, and performs congestion management according to the discard priority.

8. The method of claim 7, wherein, The method further comprises: The second node adds a third identifier in the first packet according to the discard priority; when the first packet comprises the first identifier, the third identifier takes a first value, and the first value indicates that the discard priority is the lowest or indicates that the probability of packet discard is the highest.

9. A data transmission method, characterized by, The method is applied to a third node, and the method comprises: The third node receives a first packet; When the first message comprises a first identifier, the third node sorts or re-sorts the first message according to a message sequence number of the first message; the first identifier indicates that the message is insensitive to out-of-order. The first identifier further indicates a service type TOS, a service level CoS or a communication type TC of the message; or the first message further comprises a second identifier, the second identifier indicating the service type TOS, the service level CoS or the communication type TC of the message. The service type TOS, the service level CoS or the communication type TC of the message is used to indicate that the type of the message is a best effort BE type message.

10. The method of claim 9, wherein, The method further comprises: The third node determines a message sequence number of the lost message and initiates a retransmission request for the lost message.

11. A data transmission apparatus, characterized by comprising: The device is applied to a first node and comprises a first communication unit configured to send a first message, the first message comprising a first identifier, the first identifier indicating that the message is insensitive to out-of-order; the first identifier further indicating a service type TOS, a service level CoS or a communication type TC of the message; or the first message further comprising a second identifier, the second identifier indicating the service type TOS, the service level CoS or the communication type TC of the message; the service type TOS, the service level CoS or the communication type TC of the message being used to indicate that the type of the message is a best effort BE type message.

12. A data transmission apparatus, characterized by comprising: The device is applied to a second node and comprises a second communication unit and a second processing unit; wherein The second communication unit is configured to receive a first message; The second processing unit is configured to, when the first message comprises a first identifier, process the first message according to per-packet load sharing or transmit the first message by using a backup path; wherein the first identifier indicates that the message is insensitive to out-of-order; the first identifier further indicates a service type TOS, a service level CoS or a communication type TC of the message; or the first message further comprises a second identifier, the second identifier indicating the service type TOS, the service level CoS or the communication type TC of the message; the service type TOS, the service level CoS or the communication type TC of the message being used to indicate that the type of the message is a best effort BE type message.

13. A data transmission apparatus, characterized by comprising: The device is applied to a third node and comprises a third communication unit and a third processing unit; wherein The third communication unit is configured to receive a first message; The third processing unit is configured to, when the first message comprises a first identifier, sort or re-sort the first message according to a message sequence number of the first message; the first identifier indicating that the message is insensitive to out-of-order; the first identifier further indicating a service type TOS, a service level CoS or a communication type TC of the message; or the first message further comprising a second identifier, the second identifier indicating the service type TOS, the service level CoS or the communication type TC of the message; the service type TOS, the service level CoS or the communication type TC of the message being used to indicate that the type of the message is a best effort BE type message.

14. A computer-readable storage medium having stored thereon a computer program, characterized in that, the program, when executed by the processor, implements the steps of the method of any one of claims 1 to 3; or the program, when executed by the processor, implements the steps of the method of any one of claims 4 to 8; or the program, when executed by the processor, implements the steps of the method of any one of claims 9 to 10.

15. A communication node comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, the program, when executed by the processor, implements the steps of the method of any one of claims 1 to 3; or the program, when executed by the processor, implements the steps of the method of any one of claims 4 to 8; or the program, when executed by the processor, implements the steps of the method of any one of claims 9 to 10.

16. A computer program product, characterised in that, the computer program instructions cause the computer device to perform the steps of the method of any one of claims 1 to 3; or the computer program instructions cause the communication device to perform the steps of the method of any one of claims 4 to 8; or the computer program instructions cause the communication device to perform the steps of the method of any one of claims 9 to 10.

Images