WO2024001733A1

WO2024001733A1 - Packet transmission method, apparatus, and system

Info

Publication number: WO2024001733A1
Application number: PCT/CN2023/099596
Authority: WO
Inventors: 杨帆; 周天然; 耿雪松; 常晓东; 陈爽
Original assignee: 华为技术有限公司
Priority date: 2022-06-30
Filing date: 2023-06-12
Publication date: 2024-01-04
Also published as: CN117336253A

Abstract

A packet transmission method, apparatus, and system, relating to the technical field of networks. The method comprises: a first network node in a first deterministic network acquires a first packet, and forwards the first packet according to first type indication information and first bounded latency information (BLI) carried in the first packet. The first type indication information is used for indicating the type of the first BLI, and the first BLI is used for ensuring end-to-end deterministic latency of the first packet in the first deterministic network. According to the packet transmission scheme in the present application, the end-to-end deterministic latency of the first packet in the first deterministic network can be ensured.

Description

Message transmission method, device and system

This application requires a Chinese patent application with an application date of June 30, 2022, an application number of 202210771414.9, and an application title of "A message processing method, equipment and system", and the application date is September 30, 2022 , the priority of the Chinese patent application with application number 202211216213.9 and the application title "Message Transmission Method, Device and System", the entire contents of these two patent applications are incorporated by reference in this application.

Technical field

The present application relates to the field of network technology, and in particular to a message transmission method, device and system.

Background technique

In the industrial Internet scenario, automation control services place deterministic requirements on the end-to-end delay of the network. Therefore, a message transmission method is needed to ensure the certainty of the end-to-end delay of automated control services in the network.

Contents of the invention

This application provides a message transmission method, device and system that can ensure the certainty of the end-to-end delay of the message in the deterministic network (that is, guarantee the end-to-end certainty of the message in the deterministic network). extension). The technical solution of this application is as follows:

In a first aspect, a message transmission method is provided, which is applied to a first network node in a first deterministic network. The method includes: the first network node obtains a first message, and the first message carries a first type indication. information and the first bounded delay information, the first type indication information is used to indicate the type of the first bounded delay information, and the first bounded delay information is used to ensure the first message in the first deterministic network End-to-end deterministic delay; the first network node forwards the first message according to the first type indication information and the first bounded delay information. The first message is a service message of the first service flow.

The technical solution provided by this application carries the first bounded delay information and the first type of indication information used to indicate the first bounded delay information in the first message transmitted in the first deterministic network to assist The network node in the first deterministic network forwards the first message, ensuring the end-to-end deterministic delay of the first message in the first deterministic network.

Optionally, the first bounded delay information includes time resource information or service requirement information. The time resource information is used to indicate resources in the network node for transmitting the first message. The service requirement information is used to indicate the service requirement of the first message. The time resource information is bottom resource information or abstract resource information. The bottom resource information directly indicates the resource in the network node that transmits the first message. There is a mapping relationship between the abstract resource information and the bottom resource information. The abstract resource information passes through this mapping. The relationship indirectly directly indicates the resource in the network node that transmits the first message.

Optionally, the time resource information includes at least one of the following: queue indication information, cycle indication information, time slot indication information, and priority information. The queue indication information is used to indicate the queue in the network node for transmitting the first message. The period indication information is used to indicate the cycle period of transmitting the first message in the network node. The time slot indication information is used to indicate the time slot in which the first message is transmitted in the network node. The priority information is used to indicate the priority of the first message and thereby indicate the queue corresponding to the priority.

Optionally, the service requirement information includes at least one of the following: delay requirement information, jitter requirement information, and deadline requirement information. The delay requirement information is used to indicate the delay requirement of the first message. The jitter requirement information is used to indicate the first service Stream jitter requirements. The deadline requirement information is used to indicate the deadline requirement of the first message.

Optionally, the delay requirement information includes at least one of the following: end-to-end delay requirement information and local delay requirement information. The end-to-end delay requirement information is used to indicate the end-to-end delay requirement of the first message in the first deterministic network. The local delay requirement information corresponds to at least one network node in the first deterministic network, and the local delay requirement information is used to indicate the delay requirement of the first message in the corresponding network node.

Optionally, the jitter requirement information includes at least one of the following: end-to-end jitter requirement information, local jitter requirement information. The end-to-end jitter requirement information is used to indicate the end-to-end jitter requirement of the first service flow in the first deterministic network. The local jitter requirement information corresponds to at least one network node in the first deterministic network, and the local delay requirement information is used to indicate the jitter requirement of the first service flow in the corresponding network node. The first message is a service message of the first service flow.

Optionally, the deadline requirement information includes at least one of the following: end-to-end deadline requirement information, local deadline requirement information. The end-to-end deadline requirement information is used to indicate the deadline requirement for the first packet to leave the first deterministic network. The local deadline requirement information corresponds to the network node, and the local deadline requirement information is used to indicate the deadline requirement for the first message to leave the corresponding network node.

Optionally, the first network node forwards the first message according to the first type indication information and the first bounded delay information, including:

The first network node determines the type of the first bounded delay information according to the first type indication information; the first network node determines the type of the first bounded delay information according to the first bounded delay information and the type of the first bounded delay information. A first resource used to transmit the first message; the first network node forwards the first message through the first resource. For example, the first network node determines based on the first type indication information that the first bounded delay information includes time resource information, and the time resource information is abstract resource information, and the first network node determines the first bounded delay information based on the time resource information and the local mapping relationship. One resource. For another example, the first network node determines that the first bounded delay information includes service requirement information according to the first type indication information, the first network node determines the resources in the first network node that satisfy the service requirement information, and the first network node determines the resources in the first network node that satisfy the service requirement information. The first resource is determined among the resources of the business requirement information.

In the technical solution provided by this application, the first network node determines the first resource in the first network node for transmitting the first message based on the first type indication information and the first bounded delay information, and forwards the first message through the first resource. One packet helps ensure the end-to-end deterministic delay of the first packet in the first deterministic network.

Optionally, the first message also carries second bounded delay information and second type indication information. The second type indication information is used to indicate the type of the second bounded delay information. The second bounded delay information is In order to ensure the end-to-end deterministic delay of the first message in the first deterministic network, the second type indication information and the second bounded delay information are used by the second network node to forward the first message, and the second network The node is in the first deterministic network. Wherein, the second network node is an upstream node of the first network node, or the second network node is a downstream node of the first network node.

Optionally, the type of the second bounded delay information is different from the type of the first bounded delay information. For example, the first bounded delay information is time resource information, and the second bounded delay information is service requirement information. For another example, the first bounded delay information is queue indication information, and the second bounded delay information is cycle indication information.

Optionally, the first network node is an entry node of the first deterministic network, and the first network node obtains the first message, including: the first network node receives the second message; the first network node receives the control sent by the controller. message, the control message includes the first type indication information and the first bounded delay information; the first network node generates the first message according to the second message, the first type indication information and the first bounded delay information. arts. For example, the first network node adds the first type indication information and the first bounded delay information to the second message to obtain the first message. The second message is a service message of the first service flow.

In the technical solution provided by this application, the entry node of the first deterministic network, based on the received second message and control message, Generate a first message carrying the first type indication information and the first bounded delay information, so that a network node (for example, a first network node) in the first deterministic network can use the first bounded delay information and the first type The instruction information forwards the first message, ensuring the end-to-end deterministic delay of the first message in the first deterministic network.

Optionally, before the first network node receives the control message sent by the controller, the method further includes: the first network node sends capability information of the first network node to the controller, and the controller is configured to determine the first network node based on the capability information. Type indication information and first bounded delay information.

Optionally, the first network node is an entry node of the first deterministic network, and the first network node obtains the first message, including: the first network node receives the second message, and the second message comes from the second deterministic network. , the second message carries the target bounded delay information; the first network node obtains the first type indication information and the first bounded delay information according to the target bounded delay information; the first network node obtains the first type indication information and the first bounded delay information according to the second message and the first bounded delay information. A type of indication information and first bounded delay information are used to generate a first message. For example, the first network node adds the first type indication information and the first bounded delay information to the second message to obtain the first message.

In the technical solution provided by this application, the entry node of the first deterministic network generates a first type indication information and a first bounded delay based on the received second message and the target bounded delay information carried in the second message. The first message of the delay information facilitates the network node (for example, the first network node) in the first deterministic network to forward the first message according to the first bounded delay information and the first type indication information, ensuring that the first message is End-to-end deterministic delay in the first deterministic network.

Optionally, the first message is an Internet Protocol version 6 (IPv6) message, and the first type indication information and the first bounded delay information are both located in the IPv6 extension header of the first message.

Optionally, the IPv6 extension header includes any one of the following: hop by hop header (HBH), destination options header (destination options header, DOH), segment routing header (segment routing header, SRH). The hop-by-hop header is also called the hop-by-hop options header (HBH).

Optionally, the IPv6 extension header is HBH or DOH, and the first type indication information and the first bounded delay information are both located in the option field of the IPv6 extension header.

Optionally, the IPv6 extension header is an SRH. The SRH includes a segment list. The first type indication information and the first bounded delay information are both located in the segment list.

Optionally, the segment list includes a first segment identifier (SID), and the first type indication information and the first bounded delay information are both located in the parameters (arguments) field of the first SID.

Optionally, the IPv6 extension header is an SRH. The SRH includes a type-length-value (TLV) field. The first type indication information and the first bounded delay information are both located in the TLV field.

Optionally, the SRH also includes a segment list. The segment list includes a first SID. The first bounded delay information and the first SID both correspond to the first network node. The type of the first SID is a target type. The target type The TLV field indicating the SRH carries bounded delay information corresponding to the first SID.

Optionally, the TLV field carries multiple type indication information and multiple bounded delay information. The multiple type indication information corresponds to the multiple bounded delay information. Each type indication information is used to indicate the correspondence. The type of bounded delay information, the plurality of bounded delay information includes the first bounded delay information, the plurality of type indication information includes the first type indication information; the segment list includes a plurality of SIDs, the plurality of The SID has a one-to-one correspondence with a plurality of network nodes along the way of the first message. The plurality of bounded delay information has a one-to-one correspondence with a plurality of network nodes along the way of the first message. The number of the plurality of bounded delay information does not vary. Greater than the number of the multiple SIDs, the type of the SID corresponding to the bounded delay information among the multiple SIDs is the target type. That is to say, the plurality of SIDs correspond to multiple network nodes along the first message, and the plurality of bounded delay information corresponds to all of the plurality of network nodes. Or a partial one-to-one correspondence, whereby the plurality of bounded delay information corresponds to all or part of the plurality of SIDs, and the type of the SID corresponding to the bounded delay information among the plurality of SIDs is the target type.

Optionally, the segment list includes multiple SIDs, the multiple SIDs correspond to multiple network nodes along the first message, and the first bounded delay information corresponds to the multiple network nodes. The multiple SIDs correspond to the multiple network nodes along the first message. The types are all target types.

Optionally, the first network node is the egress node of the first deterministic network, the first message is a segment routing internet protocol version 6 (SRv6) message, and the SRH of the first message is It includes a segment list and a TLV field. The segment list includes multiple SIDs. The multiple SIDs correspond to multiple network nodes along the first message. The first type indication information and the first bounded delay information are both located in the segment list. In the TLV field, the first bounded delay information only corresponds to the first network node, and the type of the SID corresponding only to the first network node among the plurality of SIDs is the target type. For example, the first message carries a bounded delay information, and the bounded delay information only corresponds to the egress node of the first deterministic network.

Optionally, the first packet also carries slice indication information, and the slice indication information is located in the IPv6 extension header of the first packet.

In the technical solution provided by this application, the first packet carries slice indication information, first bounded delay information and first type indication information used to indicate the first bounded delay information. The network in the first deterministic network The node forwards the first message according to the slice indication information, the first bounded delay information and the first type indication information, ensuring the end-to-end deterministic delay of the first message in the first deterministic network, and ensuring determines the deterministic delay of the first packet within the network slice indicated by the slice indication information.

Optionally, the slice indication information and the first bounded delay information are located in the same IPv6 extension header of the first packet; or,

The slice indication information and the first bounded delay information are located in different IPv6 extension headers of the first message. The first type indication information and the first bounded delay information are located in the same IPv6 extension header of the first message. For example, the slice indication information is located in the HBH of the first packet, and the first type indication information and the first bounded delay information are both located in the SRH of the first packet.

Optionally, the first message is a multiprotocol label switching (MPLS) message, and the first type indication information and the first bounded delay information are located in the MPLS extension header (EH) of the first message. )middle.

In a second aspect, a message transmission method is provided. The method includes: the controller receives capability information of a first network node, and the first network node is in a first deterministic network; and the controller obtains the first type of information based on the capability information. Indication information and first bounded delay information. The first type of indication information is used to indicate the type of the first bounded delay information. The first bounded delay information is used to ensure packets carrying the first bounded delay information. End-to-end deterministic delay in the first deterministic network; the controller sends a control message to the first network node, where the control message includes first type indication information and first bounded delay information. For example, the controller generates a control message according to the first type indication information and the first bounded delay information, and then sends the control message to the first network node. Optionally, the first network node is an entry node of the first deterministic network.

In the technical solution provided by this application, the controller determines the first type indication information and the first bounded delay information based on the capability information of the first network node, and sends the first type indication information and the first bounded delay information to the first network node. The control message of the delay information can facilitate the first network node to forward the service message carrying the first type of indication information and the first bounded delay information, ensuring the end-to-end delivery of the service message in the first deterministic network Deterministic delay.

Optionally, the first bounded delay information includes time resource information or service requirement information.

Optionally, the time resource information includes at least one of the following: queue indication information, cycle indication information, time slot indication information, and priority information.

Optionally, the service requirement information includes at least one of the following: delay requirement information, jitter requirement information, and deadline requirement information.

Optionally, the delay requirement information includes at least one of the following: end-to-end delay requirement information and local delay requirement information.

Optionally, the jitter requirement information includes at least one of the following: end-to-end jitter requirement information, local jitter requirement information.

Optionally, the deadline requirement information includes at least one of the following: end-to-end deadline requirement information, local deadline requirement information.

Optionally, the controller receives capability information of the first network node, including: the controller receives capability information of multiple network nodes, the multiple network nodes are in the first deterministic network, and the multiple network nodes include the first network node; correspondingly, the controller obtains the first type indication information and the first bounded delay information according to the capability information, including: the controller obtains at least one bounded delay information and at least one type according to the capability information of the plurality of network nodes. Indication information, the at least one bounded delay information corresponds to the at least one type indication information, each type indication information is used to indicate the type of the corresponding bounded delay information, the at least one bounded delay information includes a third Bounded delay information, the at least one type indication information includes first type indication information, and the control message includes the at least one bounded delay information and the at least one type indication information.

In the technical solution provided by this application, the controller obtains at least one bounded delay information and at least one type indication information based on the capability information of multiple network nodes, and sends the at least one bounded delay information to the entry node of the first deterministic network. After receiving the control message, the entry node of the first deterministic network can generate a control message carrying the at least one type indication information and the at least one bounded information based on the control message. The first message of the delay information facilitates the network node in the first deterministic network to forward the first message according to the at least one bounded delay information and the at least one type indication information, ensuring that the first message is processed in the first deterministic End-to-end deterministic delay in the network.

Optionally, the at least one bounded delay information also includes second bounded delay information, and the at least one type indication information also includes second type indication information, and the second type indication information is used to indicate the second bounded delay. The type of information, the second bounded delay information is used to ensure the end-to-end deterministic delay of the packet carrying the second bounded delay information in the first deterministic network, the type of the second bounded delay information It is different from the first bounded delay information type.

Optionally, the second bounded delay information and the first bounded delay information are arranged in sequence in the control message, and the second type indication information and the first type indication information are arranged in sequence in the control message. The arrangement order of the second type indication information and the first type indication information is the same as the arrangement order of the second bounded delay information and the first bounded delay information.

Optionally, the control message includes a first TLV field and a second TLV field arranged in sequence, the first type indication information and the first bounded delay information are located in the first TLV field, the second type indication information and the second The bounded delay information is located in the second TLV field. In this way, the second bounded delay information and the first bounded delay information are arranged in sequence.

Optionally, the control message includes an information stack, which includes a first information item and a second information item arranged in sequence. The first information item includes the first type indication information and the first bounded delay information, and the second information item includes the first type indication information and the first bounded delay information. The information items include second type indication information and second bounded delay information. In this way, the second bounded delay information and the first bounded delay information are arranged in sequence.

In a third aspect, a message transmission device is provided, including various modules for executing the method provided in the above-mentioned first aspect or any optional manner of the first aspect.

A fourth aspect provides a message transmission device, including various modules for executing the method provided in the above-mentioned second aspect or any optional manner of the second aspect.

The modules in the above third aspect or the fourth aspect can be implemented based on software, hardware, or a combination of software and hardware, and the modules can be arbitrarily combined or divided based on specific implementation.

In a fifth aspect, a message transmission device is provided, including a memory and a processor; the memory is used to store a computer program; the processor is used to execute the computer program stored in the memory so that the message transmission device executes the above-mentioned The method provided by one aspect or any optional method of the first aspect.

In a sixth aspect, a message transmission device is provided, including a memory and a processor; the memory is used to store a computer program; the processor is used to execute the computer program stored in the memory so that the message transmission device performs the above-mentioned step The method provided by the second aspect or any alternative method of the second aspect.

In a seventh aspect, a message transmission system is provided. The message transmission system includes a plurality of network nodes, and at least one network node among the plurality of network nodes includes a message as provided in the third aspect or the fifth aspect. transmission device.

Optionally, the message transmission system further includes a controller, and the controller includes the message transmission device provided in the fourth aspect or the sixth aspect.

In an eighth aspect, a computer-readable storage medium is provided. A computer program is stored in the computer-readable storage medium. When the computer program is executed, the above-mentioned first aspect or any optional method of the first aspect is implemented. The method provided, or, implement the method provided by the above second aspect or any optional manner of the second aspect.

In a ninth aspect, a computer program product is provided. The computer program product includes a program or code. When the program or code is executed, the method provided by the above-mentioned first aspect or any optional method of the first aspect is implemented. Alternatively, implement the method provided in the above second aspect or any optional manner of the second aspect.

In a tenth aspect, a chip is provided. The chip includes programmable logic circuits and/or program instructions. When the chip is run, it is used to implement the method provided by the above-mentioned first aspect or any optional method of the first aspect, Alternatively, implement the method provided in the above second aspect or any optional manner of the second aspect.

The beneficial effects brought by the technical solution provided by this application are:

Description of drawings

Figure 1 is a schematic diagram of a message transmission system provided by an embodiment of the present application;

Figure 2 is a schematic diagram of another message transmission system provided by an embodiment of the present application;

Figure 3 is a schematic diagram of a BLI data field provided by an embodiment of the present application;

Figure 4 is a schematic diagram of an option field provided by an embodiment of the present application;

Figure 5 is a schematic diagram of a first message provided by an embodiment of the present application;

Figure 6 is a schematic diagram of an MPLS EH provided by an embodiment of the present application;

Figure 7 is a schematic diagram of another first message provided by an embodiment of the present application;

Figure 8 is a schematic diagram of yet another first message provided by an embodiment of the present application;

Figure 9 is a schematic diagram of an SRH provided by an embodiment of the present application;

Figure 10 is a schematic diagram of another SRH provided by an embodiment of the present application;

Figure 11 is a schematic diagram of yet another SRH provided by an embodiment of the present application;

Figure 12 is a schematic diagram of another SRH provided by the embodiment of the present application;

Figure 13 is a flow chart of a message transmission method provided by an embodiment of the present application;

Figure 14 is a schematic diagram of yet another first message provided by an embodiment of the present application;

Figure 15 is a flow chart of another message transmission method provided by an embodiment of the present application;

Figure 16 is a schematic diagram of message transmission provided by an embodiment of the present application;

Figure 17 is another schematic diagram of message transmission provided by the embodiment of the present application;

Figure 18 is a schematic diagram of a message transmission device provided by an embodiment of the present application;

Figure 19 is a schematic diagram of another message transmission device provided by an embodiment of the present application;

Figure 20 is a schematic diagram of yet another message transmission device provided by an embodiment of the present application;

Figure 21 is a schematic diagram of yet another message transmission device provided by an embodiment of the present application.

Detailed ways

The embodiments of the present application will be further described below in conjunction with the accompanying drawings.

In the industrial Internet scenario, automation control services, especially precise motion control services, place deterministic requirements on the end-to-end delay of the network. For example, the International Electrotechnical Commission (IEC)/Institute of Electrical and Electronics Engineers (IEEE) 60802 Industrial Automation Use Case Document and IEC Manufacturing Traffic Type Document define requirements for business transmission assurance: Deadline, delay, bandwidth. These requirements are used to ensure the certainty of the end-to-end delay of services in the network, or that the end-to-end delay is bounded (that is, the end-to-end delay is less than the delay threshold).

IEEE time-sensitive network (TSN) technology and Internet Engineering Task Force (IETF) deterministic networking (DetNet) technology are both committed to developing business forwarding from "best effort" ( "best-effort (BE)" is upgraded to "on-time, accurate, and fast", and is a network technology that controls and reduces the end-to-end delay of services. IEEE TSN technology is an Ethernet technology developed by the TSN group in the IEEE 802.1 working group, which allows time synchronization and low-latency services through the 802 network. IETF DetNet technology is a network technology developed by the IETF DetNet working group. IETF DetNet technology focuses on implementing deterministic paths on Layer 2 bridging and Layer 3 routing segments. These deterministic paths can provide delay, packet loss, jitter, etc. The worst-case limit is used to provide end-to-end deterministic delay (that is, to ensure the certainty of end-to-end delay). The goal of the DetNet working group is to extend deterministic network technology to wide area networks through Internet protocol (IP) technology and multi-protocol label switching (MPLS) technology.

IEEE TSN technology and IETF DetNet technology are both network technologies developed to ensure the end-to-end deterministic delay of services. However, during the service forwarding process, a message transmission scheme that can be applied to deterministic networks is needed to forward services with deterministic requirements to ensure the end-to-end deterministic delay of these services in deterministic networks.

This application provides a message transmission scheme. The message transmitted in a deterministic network carries bounded delay information and type indication information used to indicate the type of the bounded delay information to assist in the deterministic network. The network node forwards the message, ensuring the end-to-end deterministic delay of the message in the deterministic network. For example, the first network node in the first deterministic network obtains the first message carrying the first type indication information and the first bounded delay information, and forwards the first message according to the first type indication information and the first bounded delay information. A message, the first type indication information is used to indicate the type of the first bounded delay information, and the first bounded delay information is used to ensure the end-to-end deterministic time of the first message in the first deterministic network. delay, thereby ensuring the end-to-end deterministic delay of the first message in the first deterministic network. The first deterministic network is TSN, and it can also be other deterministic networks that may be developed in the future to ensure delay. That is to say, the message transmission solution provided by this application can be applied to deterministic networks that have been developed, and can also be applied to deterministic networks that may be developed in the future.

The technical solutions of this application are introduced below. First, the application scenarios of the embodiments of this application are introduced.

The application scenario of the embodiments of the present application provides a message transmission system, which includes multiple network nodes connected by communication. Network nodes can be physical nodes or logical nodes. Physical nodes are network devices such as switches or routers. Logical nodes are functional modules in network equipment. For example, logical nodes are virtual switches, virtual routers, etc. deployed in network equipment.

In this embodiment of the present application, the message transmission system includes at least one deterministic network (DetNet). The deterministic network is a TSN or other DetNet used to ensure delay. When the message transmission system includes multiple deterministic networks: the multiple deterministic networks are deterministic networks based on the same deterministic technology, for example, the multiple deterministic networks are all TSN; or, the multiple deterministic networks The network includes deterministic networks based on different deterministic technologies. For example, some of the multiple deterministic networks are TSN, and other deterministic networks are other DetNets used to ensure delay. Optionally, each deterministic network is a communication network such as a data center network (DCN), metropolitan area network, wide area network or campus network. In addition, the data plane of each deterministic network is IPv6 or MPLS, and the IPv6 can be SRv6 or other IPv6. Each deterministic network includes at least one network node in the message transmission system, and each deterministic network includes edge network nodes and may also include core network nodes. The edge network node is, for example, a provider edge (PE) device, and the core network node is, for example, a provider (P) device.

Optionally, the message transmission system also includes at least one controller, each controller is connected to at least one network node in the message transmission system, and each controller is used to control the network node connected to the controller. In one implementation, the message transmission system includes a deterministic network and a controller. The controller is located within the deterministic network or outside the deterministic network. The controller communicates with network nodes in the deterministic network. Communication connection. In another implementation, the message transmission system includes multiple deterministic networks and a controller. The controller is located outside the multiple deterministic networks. The controller communicates with network nodes in the multiple deterministic networks. connect. In another implementation, the message transmission system includes multiple deterministic networks and multiple controllers. The multiple controllers include inter-domain controllers and multiple intra-domain controllers. The multiple intra-domain controllers correspond to each other one by one. Located in the multiple deterministic networks, each intra-domain controller communicates with the network nodes in the deterministic network where it is located to control the network nodes in the deterministic network where it is located; the inter-domain controller communicates with the multiple deterministic networks. The intra-domain controller communicates and connects to control network nodes in the deterministic network through the intra-domain controller. Among them, the controller integrates functions such as network management, business control, and network analysis. The controller can be integrated into the network device or independent of the network device. For example, the controller is a functional module deployed in a server, or a server, or a server cluster composed of several servers, or a cloud computing service center. When the message transmission system includes multiple controllers, all or part of the multiple controllers may be deployed in one server.

In this embodiment of the present application, the deterministic network includes a transmission path, and the transmission path includes multiple network nodes. According to the transmission direction, the network nodes on the transmission path include an ingress node, an egress node, and at least one intermediate (transit) node located between the ingress node and the egress node. Depending on the length of the transmission path, the number of intermediate nodes is different, or the transmission path only includes entry nodes and exit nodes, but not intermediate nodes. The names of network nodes, entry nodes, intermediate nodes, exit nodes, transmission paths, etc. in this application are only exemplary. In some implementation scenarios, network nodes are also called network devices, forwarding nodes, forwarding devices, gateway nodes, Gateway equipment, routing nodes, routing equipment, etc. The entry node is also called an entry device, a head node, a head node device, a first node, a first node device, etc. Intermediate nodes are also called transit nodes, transit devices, intermediate devices, etc. The egress node is also called an egress device, an end node, a tail node device, etc.; the transmission path is also called a forwarding path, a communication path, a communication tunnel, etc. For example, the transmission path is segment routing traffic engineering. SR-TE) tunnel, resource reservation protocol-traffic engineering (RSVP-TE) tunnel based on traffic engineering extensions, segment routing (SR) tunnel, or Internet Protocol version 6 segment routing (internet protocol version 6 segment routing, SRv6) tunnel, etc.

As an example, FIG. 1 shows a schematic diagram of a message transmission system provided by an embodiment of the present application. The message transmission system includes a deterministic network 1 and a controller 300 . The controller 300 is located outside the deterministic network 1 . The deterministic network 1 includes network nodes 101 to 103, and the controller 300 is communicatively connected to the network nodes 101 to 103. The network nodes 101 to 103 are all network nodes that support the network protocol corresponding to the deterministic network 1. For example, the deterministic network 1 is TSN, and the network nodes 101 to 103 are all network nodes that support the TSN protocol (for example, they are called TSN nodes). Deterministic network 1 may also include network nodes that do not support the network protocol corresponding to deterministic network 1, such as the left side of network node 101, between network node 101 and network node 102, between network node 102 and network node 103, and between network nodes 101 and 102. To the right of node 103, etc., there may be network nodes that do not support the network protocol corresponding to the deterministic network 1. These network nodes are not shown in Figure 1 for the sake of simplicity. Furthermore, the data plane of deterministic network 1 can be IPv6 or MPLS. For example, deterministic network 1 is IPv6 DetNet, SRv6 DetNet, MPLS DetNet, TSN over IPv6 DetNet (TSN based on IPv6 DetNet), TSN over SRv6 DetNet (TSN based on SRv6 DetNet), TSN over MPLS DetNet (based on MPLS DetNet) TSN). For a certain business flow, the transmission path S1 of the business flow in the deterministic network 1 is 101->102->103, then the network node 101 is the entry node, the network node 102 is the intermediate node, and the network node 103 is the exit node. Both the network node 101 and the network node 103 may be PE devices, and the network node 102 may be a P device.

Figure 1 illustrates an example in which a message transmission system includes a deterministic network and a controller, and the controller is located outside the deterministic network. In other embodiments, the controller is located within the deterministic network. In addition, the message transmission system provided by this application may also include multiple deterministic networks. The following takes the message transmission system including two deterministic networks as an example.

As another example, FIG. 2 shows a schematic diagram of another message transmission system provided by an embodiment of the present application. On the basis of Figure 1, the message transmission system shown in Figure 2 also includes a deterministic network 2, and the controller 300 is located outside the deterministic network 2. For a description of deterministic network 1, please refer to the relevant parts of Figure 1. Here we mainly introduce deterministic network 2. The deterministic network 2 includes network nodes 201-202. The controller 300 is also communicatively connected with the network nodes 201-202, and the network node 202 is communicatively connected with the network node 101 in the deterministic network 1. Among them, the network nodes 201 to 202 are all network nodes that support the network protocol corresponding to the deterministic network 2. For example, deterministic network 2 is TSN, and network nodes 201 to 202 are all TSN nodes. Deterministic network 2 may also include network nodes that do not support the network protocol corresponding to deterministic network 2, such as the left side of network node 201, the area between network node 201 and network node 202, the right side of network node 202, etc. There may be network nodes that do not support the network protocol. The network nodes of the network protocol corresponding to the deterministic network 2 are not shown in Figure 2 for the sake of simplicity. For example, deterministic network 2 is IPv6 DetNet, SRv6 DetNet, MPLS DetNet, TSN over IPv6 DetNet, TSN over SRv6 DetNet, TSN over MPLS DetNet. For a certain business flow, the transmission path S2 of the business flow in the deterministic network 2 is 201->202, then the network node 201 is the entry node and the network node 202 is the exit node.

Figure 2 illustrates the direct connection between deterministic network 1 and deterministic network 2 as an example. In practical applications, other network devices or network systems may be deployed between deterministic network 1 and deterministic network 2. The embodiments of this application are This is not limited.

The message transmission systems shown in Figures 1 and 2 are only examples and are not used to limit the technical solutions of the embodiments of the present application. During the implementation process, the number of network nodes, the number of controllers, the number of deterministic networks and the relationship between deterministic networks in the message transmission system can be configured as needed. The deterministic network in the embodiment of this application may also be called a deterministic network domain, a deterministic transmission domain, a deterministic management domain, etc. The embodiment of the present application adopts a deterministic network (such as a deterministic network The message transmitted in 1) carries bounded delay information and type indication information used to indicate the type of the bounded delay information to assist the network node in the deterministic network 1 to forward the message to ensure that the message is The end-to-end deterministic delay in the deterministic network 1 (that is, the deterministic delay from the time the packet enters the deterministic network 1 to the time it leaves the deterministic network 1). It should be noted that, unless otherwise specified, the network nodes mentioned in this application refer to network nodes in a deterministic network that support relevant deterministic network protocols and comply with relevant deterministic network standards.

The above is an introduction to the application scenarios of this application. The following is an introduction to the bounded latency information (bounded latency information, BLI) described in the embodiments of this application and the type indication information used to indicate the bounded latency information.

Bounded delay information refers to information used to ensure the end-to-end deterministic delay of packets in a deterministic network. In other words: information used to ensure bounded end-to-end delay of packets in deterministic networks. This bounded delay information can also ensure the end-to-end deterministic jitter of packets in a deterministic network. The bounded delay information and the type indication information used to indicate the bounded delay information may be carried in the service message to assist the network node in the deterministic network in forwarding the service message.

In the following, the service message carrying the bounded delay information and the type indication information used to indicate the bounded delay information is the first message. The first message belongs to the first service flow. The bounded delay information and the type indication information are The type indication information is used by the network node in the first deterministic network to forward the first message as an example.

In this embodiment of the present application, the bounded delay information is time resource information or service requirement information. The time resource information is used to indicate resources in the network node for transmitting the first message, and the time resource information may be a time resource identification (ID). The service requirement information is used to indicate the service requirement of the first message. The time resource information is bottom resource information or abstract resource information. The bottom resource information directly indicates the resource in the network node that transmits the first message. There is a mapping relationship between the abstract resource information and the bottom resource information. The abstract resource information passes through this mapping. The relationship indirectly directly indicates the resource in the network node that transmits the first message.

In an optional embodiment, the time resource information includes at least one of the following: queue indication information, period indication information, time slot indication information, and priority information. The queue indication information is used to indicate the queue in the network node for transmitting the first message. The queue indication information is information such as a queue identifier and a queue number. The cycle indication information is used to indicate a cycle (cycle) period for transmitting the first message in the network node, and the cycle indication information is information such as a cycle identifier and a cycle number. The time slot indication information is used to indicate the time slot in which the first message is transmitted in the network node. The time slot indication information is information such as a time slot identifier, a time slot number, and so on. The priority information is used to indicate the priority of the first message and thereby indicate the queue corresponding to the priority in the network node. The priority information may be quality of service (QoS) priority information, differentiated services code point (DSCP) priority information, type of service (ToS) priority information or 802.1p Priority information. The priority indicated by this priority information can be QoS priority, DSCP priority, ToS priority information or 802.1p priority. Among them, the queue indication information is the resource indication information used in the queue-based scheduling mechanism, the period indication information is the resource indication information used in the circular queuing mechanism, and the time slot indication information is the resource indication information used in the time slot-based scheduling mechanism.

In an optional embodiment, the service requirement information includes at least one of the following: delay requirement information, jitter requirement information, and deadline requirement information. The delay requirement information is used to indicate the delay requirement of the first message. The jitter requirement information is used for the jitter requirement of the first service flow. The jitter is also called delay variation or delay variation. The deadline requirement information is used to indicate the deadline requirement of the first message. In some embodiments, the delay requirement information is also referred to as delay budget (delay budget) information, the jitter requirement information is also referred to as jitter budget (jitter budget) information, and the deadline requirement The information is also called deadline budget information.

In an optional embodiment, the delay requirement information includes at least one of the following: end-to-end delay requirement information and local delay delay requirement information. The jitter requirement information includes at least one of the following: end-to-end jitter requirement information, local jitter delay requirement information. The deadline requirement information includes at least one of the following: end-to-end deadline requirement information, local deadline requirement information. The end-to-end delay requirement information is used to indicate the end-to-end delay requirement of the first message in the first deterministic network. The end-to-end delay of the first message in the first deterministic network needs to be equal to the end-to-end delay requirement. End-to-end delay required by the information. The local delay requirement information corresponds to at least one network node. The local delay requirement information is used to indicate the delay requirement of the first message in the corresponding network node, and the transmission delay of the first message in the corresponding network node. It cannot be greater than the local delay required by the local delay requirement information. The end-to-end jitter requirement information is used to indicate the end-to-end jitter requirement of the first service flow in the first deterministic network. The end-to-end jitter of the first service flow in the first deterministic network needs to be equal to the end-to-end jitter. End-to-end jitter of request information requirements. The local jitter requirement information corresponds to at least one network node. The local jitter requirement information is used to indicate the jitter requirement of the first service flow in the corresponding network node. The jitter of the first service flow in the corresponding network node cannot be greater than the local time. Local jitter required for delay request information. The end-to-end deadline requirement information is used to indicate the deadline requirement for the first packet to leave the first deterministic network, and the first packet needs to leave the first deterministic network within the deadline required by the end-to-end deadline requirement information, The deadline for the first packet to leave the first deterministic network is the birth timestamp of the first packet (packet birth timestamp) plus the end-to-end delay of the first packet in the first deterministic network. The local deadline requirement information corresponds to the network node. The local deadline requirement information is used to indicate the deadline requirement for the first message to leave the corresponding network node. The first message needs to leave within the deadline required by the local deadline requirement information. The corresponding network node. In some embodiments, the end-to-end delay requirement information is also called end-to-end delay budget (end to end delay budget) information, and the local delay requirement information is also called local delay budget (local delay budget) Information, end-to-end jitter requirement information is also called end-to-end jitter budget (end to end jitter budget) information, local jitter requirement information is also called local jitter budget (local jitter budget) information, end-to-end deadline requirement The information is also called end-to-end deadline budget information, and the local deadline requirement information is also called local deadline budget information.

In this embodiment of the present application, time resource information and service requirement information are two different types of bounded delay information. Time resource information and service requirement information can be two major categories of bounded delay information. Queue indication information, period indication information, time slot indication information and priority information are four different types of time resource information, and these four types of information are four subcategories of time resource information. End-to-end delay requirement information, local delay requirement information, end-to-end jitter requirement information, local jitter requirement information, end-to-end deadline requirement information and local deadline requirement information are six different types of business requirement information. The six types of information are six subcategories of business requirement information. Among them, different types of bounded delay information can be indicated by different type indication information, so that network nodes can distinguish different bounded delay information. As an example, bounded delay information and type indication information used to indicate the type of the bounded delay information are shown in Table 1 below.

Table 1

Referring to Table 1, it can be seen that queue indication information, period indication information, time slot indication information and priority information all belong to time resource information, and type indication information "1" is used to indicate queue indication information (or to indicate bounded delay information) The type of the indication information is queue indication information); the type indication information "2" is used to indicate the period indication information (or the type used to indicate the bounded delay information is the period indication information); the type indication information "3" is used to indicate the time slot Indication information (or used to indicate that the type of bounded delay information is slot indication information); type indication information "4" is used to indicate priority information (or used to indicate that the type of bounded delay information is priority information), the others are the same and will not be described here.

The time resource information described above is all bottom resource information. This bottom resource information indicates the bottom resources of the network node. For example, the queue indication information is used to indicate the queue in the network node, and the period indication information is used to indicate the cycle period of the network node. The slot indication information is used to indicate the time slot in the network node, and the priority information is used to indicate the priority of the message and thereby indicate the queue corresponding to the priority in the network node. The time resource information in the embodiments of this application can also be abstract information of these underlying resource information. For example, the above-mentioned underlying resource information is abstracted to obtain the abstract resource information corresponding to the above-mentioned underlying resource information, and the underlying resource information and abstract resources are established. Mapping relationship between information, network nodes can locally store the mapping relationship between underlying resource information and abstract resource information. In the process of actually forwarding service messages, the network node determines the corresponding underlying resource information based on the abstract resource information and local mapping relationships carried in the service message. The network node determines the network node used to forward the service message based on the underlying resource information. The underlying resource and forwards the service message through the underlying resource. Abstract the underlying resource information, establish the mapping relationship between the underlying resource information and the abstract resource information, and carry the abstract resource information in the business packets. This design can realize the data plane parameters carried by the business packets (such as abstract resource information). ) is decoupled from the underlying implementation technology of the network node, making it more adaptable to the underlying mechanism, and the underlying parameters of the network node (such as underlying resource information) do not need to be exposed to the data plane, resulting in higher security.

The bounded delay information described above is only an example of this application. The bounded delay information may also be other information used to ensure the end-to-end deterministic delay of messages in a deterministic network. For example, the bounded delay information can also be delay compensation information. The delay compensation information is used to instruct the network node to perform delay compensation on the message carrying the delay compensation information to ensure that the message is End-to-end deterministic latency in deterministic networks. For example, the delay compensation information includes local delay compensation (local delay compensation) information. Delay compensation information belongs to business requirement information, and delay compensation information is used in multipath transmission scenarios. For example, a certain service flow is carried through at least two paths, and the delays of the at least two paths are different. In order to ensure the end-to-end deterministic delay of the service flow, the service flow can be delayed on at least one path. Compensation is made so that the end-to-end deterministic delays of packets transmitted through the at least two paths in a certain service flow are equal or the difference is small.

For convenience of description, the type indication information used to indicate the type of bounded delay information is called type indication information corresponding to the bounded delay information. The following takes the first message as an example to introduce the bounded delay information and the type index corresponding to the bounded delay information. Indicates how information is carried in service packets.

In this embodiment of the present application, the first packet carries at least one bounded delay information and at least one type indication information. The at least one bounded delay information corresponds to the at least one type indication information. Each type indication information Used to indicate the type of corresponding bounded delay information, the at least one bounded delay information and the at least one type indication information are used to assist the network node in the first deterministic network to forward the first message. Wherein, the at least one bounded delay information corresponds to at least one network node in the first deterministic network, each network node corresponds to all or part of the at least one bounded delay information, and each network node corresponds to each network node according to the at least one bounded delay information. The first message is forwarded with bounded delay information and type indication information corresponding to each network node. In one embodiment, the first message carries a bounded delay information and a type indication information. The bounded delay information corresponds to multiple network nodes in the first deterministic network. The multiple network nodes are all based on the The first message is forwarded with bounded delay information and indication information of this type. In another embodiment, the first message carries a bounded delay information and a type indication information. The bounded delay information corresponds to a network node (such as an egress node) in the first deterministic network. The network node Forward the first message according to the bounded delay information and the type indication information. In yet another embodiment, the first message carries a plurality of bounded delay information and a plurality of type indication information, and the plurality of bounded delay information corresponds to a plurality of network nodes in the first deterministic network. Each network node among the plurality of network nodes forwards the first message according to bounded delay information and type indication information corresponding to each network node. In yet another embodiment, the first message carries a plurality of bounded delay information and a plurality of type indication information, and the plurality of bounded delay information is related to each network node in the first deterministic network. Corresponding to the nodes, each network node forwards the first message in combination with the local policy according to the plurality of bounded delay information and the plurality of type indication information. In yet another embodiment, the first message carries a plurality of bounded delay information and a plurality of type indication information, and the plurality of bounded delay information corresponds to one network node in the first deterministic network, and the one network node According to the plurality of bounded delay information and the plurality of type indication information, the first message is forwarded in combination with the local policy. In an embodiment in which the first message carries multiple bounded delay information, the multiple bounded delay information are of the same type. For example, the multiple bounded delay information are all period indication information. Or, at least two of the plurality of bounded delay information are of different types; for example, some of the plurality of bounded delay information are time resource information, and others are service requirement information; and then For example, some of the plurality of bounded delay information are queue indication information, others are period indication information, and still others are delay requirement information.

The first message is an IPv6 message. The first message includes an IPv6 extension header. The bounded delay information and the type indication information corresponding to the bounded delay information are both located in the IPv6 extension header. For example, the IPv6 extension header includes the following Any one: HBH, DOH, SRH. Or, the first message is an MPLS message, and the bounded delay information and the type indication information corresponding to the bounded delay information are both located in the MPLS extension header of the first message. That is, the bounded delay information and the type indication information corresponding to the bounded delay information are carried in the HBH, DOH, SRH or MPLS extension header.

Optionally, a BLI data field is extended in the HBH, DOH or MPLS extension header, and the BLI data field carries bounded delay information and type indication information corresponding to the bounded delay information. The segment list or TLV field of the SRH carries bounded delay information and type indication information corresponding to the bounded delay information. Therefore, this application includes multiple implementation methods for carrying bounded delay information and type indication information corresponding to the bounded delay information in the first message. The various implementation methods are introduced below. Before that, the BLI data field provided by the embodiment of this application is first introduced.

The BLI data field provided by the embodiment of the present application includes at least one BLI data space (space), and each BLI data space is used to carry bounded delay information and type indication information corresponding to the bounded delay information. For example, each BLI data space includes a type indication subspace and a BLI subspace. The BLI subspace is used to carry bounded delay information, and the type indication subspace is used to carry type indication information corresponding to the bounded delay information. Optionally, each BLI data space also includes the format (format) subspace, the format subspace is used to carry the format of the corresponding bounded delay information, and the formats of different bounded delay information are different. For example, the time resource information, delay requirement information, and jitter requirement information are 16-bit unsigned numbers (16 bit unsigned integer), 32-bit unsigned numbers (32 bit unsigned integer), or 64-bit unsigned numbers (32 bit unsigned integer) , the deadline requirement information is a network time protocol (NTP) 32-bit timestamp, an NTP 64-bit timestamp, a precision time protocol (PTP) 64-bit timestamp, or a PTP 80-bit time. stamp. The first BLI data space (the BLI data space located at the starting position of the BLI data field) may also include a flags subspace, which is used to indicate whether there are more BLI data spaces after the first BLI data space. BLI data space. The flag subspace includes multiple flag bits. The number of the multiple flag bits indicates the maximum number of BLI data spaces that the BLI data field can include. The value of each flag bit is 0 or 1. The value of the multiple flag bits is The number of flag bits that are 1 indicates the number of BLI data spaces actually included in the BLI data field.

By way of example, FIG. 3 is a schematic diagram of a BLI data field provided by an embodiment of the present application. The BLI data field includes m BLI data spaces, m≥1, and m is an integer. The BLI data space includes a type indication subspace, a format subspace, a BLI subspace and a reserved subspace. The BLI data space 1 also includes a flag subspace. The flag subspace is used to indicate that the BLI data field includes the m BLIs. data space. In each BLI data space: the BLI subspace is used to carry bounded delay information, the type indication subspace is used to carry the type indication information corresponding to the bounded delay information, and the format subspace is used to carry the bounded delay information. The format of the message. When m>1, the m pieces of bounded delay information carried by the BLI data field are of the same type, or at least two of the m pieces of bounded delay information are of different types.

The following describes the implementation method of carrying bounded delay information and type indication information in the first message.

The first implementation method: the first message is an IPv6 message, and the first message includes an HBH. The HBH includes an option field. The bounded delay information and the type indication information corresponding to the bounded delay information are both located in the option field. middle. For example, the option field includes a BLI data field, and the bounded delay information and the type indication information corresponding to the bounded delay information are both located in the BLI data field.

By way of example, FIG. 4 is a schematic diagram of an option field provided by an embodiment of the present application. The option field includes an option type (option type) subfield, an option data length (option data length) subfield, and a BLI data field (the BLI data field is a subfield in the option field). The option type subfield is used to indicate the type of the option field. The highest three bits of the option type subfield are 001. During the process of the network node processing the message including the option field, if the network node cannot recognize the option type, the The network node skips this option field, and the network node can change the value of the option type subfield during processing of the option field. The option data length subfield is used to indicate the length of the BLI data field.

By way of example, FIG. 5 is a schematic diagram of a first message provided by an embodiment of the present application. The first message is an IPv6 message. The first message includes a payload, a user datagram protocol (UDP) header, other IPv6 extension headers, HBH, IPv6 header, and media access control (media). access control (MAC) header and Ethernet header (ETH). The HBH includes the option fields shown in Figure 3. This option field carries m bounded delay information and m type indication information. The m bounded delay information corresponds to each network node along the first message. Each network node responds to the m bounded delay information. The delay information and the m type indication information are combined with the local policy to forward the first message.

The second implementation method: the first message is an IPv6 message, and the first message includes a DOH. The DOH includes an option field. The bounded delay information and the type indication information corresponding to the bounded delay information are both located in the option field. middle. For example, the option field includes a BLI data field, and the bounded delay information and the type indication information corresponding to the bounded delay information are both located in the BLI data field.

The structure of this option field can be referred to Figure 3. In the second implementation, the option field is located in the DOH of the first message, the m bounded delay information carried by the option field corresponds to at least one network node along the first message, and the m The bounded delay information corresponds to each network node in the at least one network node, and each network node forwards the first message according to the m bounded delay information and the m type indication information in combination with a local policy. Wherein, the at least one network node is in the first deterministic network, and the at least one network node all hits the destination address carried by the DOH. For example, the at least one network node includes an egress node of the first deterministic network.

The third implementation method: the first message is an MPLS message, and the first message includes an MPLS extension header (EH). The bounded delay information and the type indication information corresponding to the bounded delay information are both located in MPLS EH.

In an optional embodiment, MPLS EH includes a BLI data field, and bounded delay information and type indication information corresponding to the bounded delay information are both located in the BLI data field. By way of example, FIG. 6 is a schematic diagram of an MPLS EH provided by an embodiment of the present application. The MPLS EH includes a next header (NH) field, a header extension length (HLEN) field, a reserved field and a BLI data field. The NH field is used to indicate the type of EH following this MPLS EH. The HLEN field is used to indicate the length of the BLI data field.

In an optional embodiment, the first message is an MPLS message, and the first message includes an EH stack. The EH stack includes multiple MPLS EHs, and the multiple MPLS EHs are related to multiple MPLS EHs along the way of the first message. There is a one-to-one correspondence between network nodes, and each MPLS EH carries at least one bounded delay information and type indication information corresponding to the at least one bounded delay information. The first message may also include an MPLS label stack (lable stack). The MPLS label stack includes multiple MPLS labels, and the multiple MPLS labels correspond to multiple network nodes along the first message. For example, the multiple MPLS EHs correspond to the multiple MPLS labels one-to-one, and the multiple network nodes are all in the first deterministic network. By way of example, FIG. 7 is a schematic diagram of another first message provided by an embodiment of the present application. The first message is an MPLS message, and the first message includes an MPLS payload, an EH stack, a common header of PAH (CH), a bottom label of the stack (BoS), and an MPLS label stack. PAH is post-stack MNA header in English and stack MNA header in Chinese. MNA is MPLS network actions in English and MPLS network actions in Chinese. The EH stack includes n MPLS EHs, and the structure of each MPLS EH is shown in Figure 6. The n MPLS EHs correspond one-to-one to the n network nodes along the first message, and each of the n network nodes processes the first message according to the corresponding MPLS EH. Figure 7 takes the n MPLS EHs each including m BLI data spaces as an example. Therefore, each of the n MPLS EHs carries m bounded delay information and m type indication information. In other embodiments, , at least two MPLS EHs among the n MPLS EHs carry different amounts of bounded delay information.

In another optional embodiment, the first message includes an MPLS EH used to carry bounded delay information, and the MPLS EH is connected to a network node along the first message (such as the egress node of the first deterministic network) Correspondingly, the MPLS EH carries at least one bounded delay information and type indication information corresponding to the at least one bounded delay information. By way of example, FIG. 8 is a schematic diagram of yet another first message provided by an embodiment of the present application. The first message is an MPLS message. The first message includes an MPLS payload, MPLS EH, UDP header, IPv6 header, MAC header and ETH. The structure of the MPLS EH is shown in Figure 6. The MPLS EH is different from the first Corresponding to the egress node of the deterministic network, the egress node processes the first message according to the MPLS EH.

The fourth implementation method: the first message is an SRv6 message, the first message includes an SRH, the SRH includes a segment list, the bounded delay information and the type indication information corresponding to the bounded delay information are both in the segment list.

Optionally, the segment list includes multiple SIDs, each SID includes a location (locator) field and a function (function) Field and parameter (argument) fields, the bounded delay information and the type indication information corresponding to the bounded delay information are located in the parameter field of the SID. For example, the first message carries at least one bounded delay information and at least one type indication information. The at least one bounded delay information corresponds to the at least one type indication information. The at least one bounded delay information is one-to-one. One correspondence is located in the parameter field of at least one SID, and each type indication information and its corresponding bounded delay information are located in the same parameter field. The plurality of SIDs are in one-to-one correspondence with a plurality of network nodes along the route of the first message. Therefore, the at least one bounded delay information is in a one-to-one correspondence with at least one of the plurality of network nodes.

As an example, the parameter field of each SID carries a bounded delay information and a type indication information. Figure 9 is a schematic diagram of an SRH provided by an embodiment of the present application. The SRH includes the following fields: next header, header extension length, routing type, remaining segment (segment left, SL), last entry, flags, tag, < Segment List[1], Segment List[2]...Segment List[n]> and optional TLV. Each segment list in segment list [1], segment list [2]...segment list [n] is a SID. The parameter field of each segment list in segment list [1], segment list [2]...segment list [n] includes a bounded delay information and a type indication information. The parameter field in each segment list The type indication information is used to indicate the type of bounded delay information in the parameter field. The SRH shown in Figure 9 carries n bounded delay information and n type indication information, n≥1, and n is an integer. When n>1, the n pieces of bounded delay information are of the same type, or at least two of the n pieces of bounded delay information are of different types. Optionally, when the types of the n bounded delay information are the same, the types of the n bounded delay information may be preconfigured types, and the above n SIDs may not carry type indication information. This document The application examples do not limit this.

The fifth implementation method: the first message is an SRv6 message, and the first message includes an SRH. The SRH includes a TLV field. The bounded delay information and the type indication information corresponding to the bounded delay information are both located in the TLV field. middle.

The TLV field carries at least one bounded delay information and at least one type indication information, and the at least one bounded delay information corresponds to at least one network node in the first deterministic network. For example, the at least one bounded delay information corresponds to the at least one network node, or each network node in the at least one network node corresponds to all the bounded delay information in the at least one bounded delay information. correspond. The SRH also includes a segment list. The segment list includes a plurality of SIDs. The plurality of SIDs correspond one-to-one to a plurality of network nodes along the first message, and the plurality of network nodes are in the first deterministic network. Wherein, the number of the at least one bounded delay information is not greater than the number of the multiple SIDs, and the type of the SID corresponding to the bounded delay information among the multiple SIDs is the target type (corresponding to the SID and bounded delay information of the same network node). Delay information corresponding), the target type indicates that the above TLV field includes bounded delay information corresponding to the corresponding SID. For example, the target type is END.BLI, that is, the SID corresponding to the bounded delay information is END.BLI SID. Optionally, the type of the SID that does not correspond to bounded delay information among the multiple SIDs is END or END.X. That is, the type of the SID that does not correspond to bounded delay information is END SID or END.X SID. END SID is the destination node (endpoint) SID, which identifies a certain destination node in the network. END.X SID is the endpoint SID of the three-layer cross-connection, which identifies a certain link in the network.

In an optional embodiment, the SRH includes a segment list and a TLV field. The segment list includes multiple SIDs. The multiple SIDs correspond to multiple network nodes along the first message. The TLV field carries multiple bounded Delay information and multiple types of indication information. The multiple bounded delay information corresponds to the multiple types of indication information. The multiple bounded delay information corresponds to multiple network nodes along the first message. Correspondingly, the number of the plurality of type indication information is not greater than the number of the plurality of SIDs, and the type of the SID corresponding to the bounded delay information among the plurality of SIDs is the target type. Figure 10 is a schematic diagram of another SRH provided by an embodiment of the present application. The SRH includes the following fields: next header, header extension length, routing type, remaining segments, last entry, flag, label, <segment list[1], segment list[2]...segment list[n]> and TLV. Segment list[1], Segment list[2]... Each segment list in segment list [n] is a SID. The TLV field includes the following subfields: type, length, remaining BLI, reservation, and <BLI list[1], BLI list[2]...BLI list[m]>. The type subfield is used to indicate the type of the TLV field. The length subfield is used to indicate the length of the data field of the TLV field. The remaining BLI field indicates the number of unprocessed BLI lists remaining before reaching the destination node. The BLI list [ 1], BLI list [2]...BLI list [m]. Each BLI list is used to carry a bounded delay information and a type indication information. The type indication information in each BLI list is used to indicate the The type of bounded delay information in the BLI list. The SRH shown in Figure 10 carries n SIDs, m bounded delay information and m type indication information, n≥m≥1, and n and m are both integers, and the n SIDs correspond to bounded delay information. The SID is the SID and the SID is END.BLI. When m>1, the m pieces of bounded delay information are of the same type, or at least two of the m pieces of bounded delay information are of different types. Optionally, when the m pieces of bounded delay information are of the same type, the BLI list may not carry type indication information, and the type of the m pieces of bounded delay information may be indicated through the type subfield in the TLV field. , the embodiment of the present application does not limit this. Figure 10 is just an example. When the amount of bounded delay information carried by the SRH is less than the number of SIDs carried by the SRH (for example, the SRH carries n SIDs), n BLIs can also be set in the TLV field of the SRH. List, the n BLI lists correspond to the n SIDs one-to-one, and the n SIDs are all END.BLI SIDs. The content of part of the BLI lists in the n BLI lists is set to empty. This is not the case in the embodiment of the present application. Make limitations.

In another optional embodiment, the SRH includes a segment list and a TLV field. The segment list includes multiple SIDs. The multiple SIDs correspond to multiple network nodes along the first message. The TLV field carries a bounded Delay information and a type indication information, the bounded delay information corresponds to the plurality of network nodes, the types of the plurality of SIDs are target types, and each network node in the plurality of network nodes is based on the one The first message is processed using the boundary delay information and the type indication information. Figure 11 is a schematic diagram of yet another SRH provided by an embodiment of the present application. The SRH includes the following fields: next header, header extension length, routing type, remaining segments, last entry, flag, label, <segment list[1], segment list[2]...segment list[n]> and TLV. Each segment list in segment list [1], segment list [2]...segment list [n] is a SID. The TLV field includes the following subfields: type, length, reservation, type indication, and BLI. The type subfield is used to indicate the type of the TLV field. The length subfield is used to indicate the length of the data field of the TLV field. The BLI subfield is used to carry bounded delay information. The type subfield is used to carry the type. Indication information, this type of indication information is used to indicate the type of the bounded delay information. The SRH shown in Figure 11 carries n SIDs, a bounded delay information and a type indication information. n is an integer greater than or equal to 1. The bounded delay information corresponds to the n SIDs. The n The SIDs are all END.BLI SIDs. In some embodiments, the TLV field may not include a type indication subfield, and the type of bounded delay information may be indicated through the type subfield in the TLV field. In other embodiments, the BLI field shown in Figure 3 is extended in the TLV field to carry multiple bounded delay information and multiple type indication information, so that the BLI field corresponds to the n SIDs, and the multiple The network node corresponding to each SID in the SID processes the first message according to the plurality of bounded delay information and the plurality of type indication information, which is not limited in the embodiment of the present application.

In another optional embodiment, the SRH includes a segment list and a TLV field. The segment list includes multiple SIDs. The multiple SIDs correspond to multiple network nodes along the first message. The TLV field carries a bounded Delay information and a type indication information, the bounded delay information corresponds to the last network node among the plurality of network nodes (for example, the egress node of the first deterministic network), and the last SID among the plurality of SIDs The type is the target type. Figure 12 is a schematic diagram of another SRH provided by the embodiment of the present application. The structure of this SRH is the same as that of the SRH shown in Figure 11. The difference is that the SRH shown in Figure 12 carries n SIDs, a bounded delay information and a type indication information. The bounded delay information corresponds to the last SID among the n SIDs, and the last SID is the END.BLI SID. In some embodiments, the TLV field in the SRH shown in Figure 12 may not include a type indication subfield, and the type of bounded delay information may be indicated through the type subfield in the TLV field. In other embodiments, the BLI field shown in Figure 3 is extended in the TLV field to carry multiple bounded delay information and multiple type indication information, so that the BLI field corresponds to the last SID, and the last SID The corresponding network node processes the first message according to the plurality of bounded delay information and the plurality of type indication information, which is not limited in the embodiments of the present application.

The following describes embodiments of the message transmission method of the present application.

Please refer to Figure 13, which shows a flow chart of a message transmission method provided by an embodiment of the present application. The message transmission method is applied to the first network node in the first deterministic network. The first network node is an entry node, an intermediate node or an exit node of the first deterministic network. For example, the first deterministic network is the deterministic network 1 in Figure 1 or Figure 2, and the first network node is any one of the network nodes 101 to 103. As shown in Figure 13, the method includes the following steps S301 to S302.

S301. The first network node obtains the first message. The first message carries the first type of indication information and the first bounded delay information. The first type of indication information is used to indicate the type of the first bounded delay information. A bounded delay information is used to ensure the end-to-end deterministic delay of the first message in the first deterministic network.

The first packet carries the first type indication information and the first bounded delay information, and the first type indication information and the first bounded delay information are used by the first network node to forward the first packet. The first type indication information and the first bounded delay information can also be used by other network nodes in the first deterministic network to forward the first message, which is not limited in the embodiments of the present application.

The first bounded delay information includes time resource information or service requirement information. The first bounded delay information may be one bounded delay information; or, the first bounded delay information may include multiple bounded delay information, and the multiple bounded delay information may be of different types. In an example, the first bounded delay information is any bounded delay information in Table 1. In another example, the first bounded delay information includes at least two bounded delay information in Table 1.

In an optional embodiment, the first message is an IPv6 message, and the first type indication information and the first bounded delay information are both located in the IPv6 extension header of the first message. The IPv6 extension header includes HBH, DOH, Any one of SRH. Alternatively, the first message is an MPLS message, and the first type indication information and the first bounded delay information are both located in the MPLS extension header of the first message. In an example, the first message is an IPv6 message as shown in Figure 5. The HBH of the first message carries m bounded delay information and m type indication information. The first bounded delay information includes the m Bounded delay information, the first type indication information includes the m type indication information, the first type indication information and the first bounded delay information are used for multiple network nodes along the first message to forward the first message , these multiple network nodes are all in the first deterministic network. In another example, the first message is an MPLS message as shown in Figure 8. The MPLS EH of the first message carries m bounded delay information and m type indication information. The first bounded delay information includes The m pieces of bounded delay information and the first type indication information include the m pieces of type indication information. The first type indication information and the first bounded delay information are used by the egress node of the first deterministic network to forward the first message. . In another example, the first message is an SRv6 message (an IPv6 message). The first message includes an SRH as shown in Figure 11. The SRH carries a bounded delay information and a type indication information. The SRH One bounded delay information is the first bounded delay information, the one type indication information is the first type indication information, and the first type indication information and the first bounded delay information are used for multiple points along the first message. The network node forwards the first message, and the multiple network nodes are all in the first deterministic network. In another example, the first message is an SRv6 message, and the first message includes an SRH as shown in Figure 12. The SRH carries a bounded delay information and a type indication information. The bounded delay information is The first bounded delay information, the class The type indication information is the first type indication information, and the first type indication information and the first bounded delay information are used for the egress node of the first deterministic network to forward the first message.

In an optional embodiment, the first packet also carries second bounded delay information and second type indication information. The second type indication information is used to indicate the type of the second bounded delay information. The second bounded delay information The delay information is used to ensure the end-to-end deterministic delay of the first message in the first deterministic network, and the second type indication information and the second bounded delay information are used by the second network node to forward the first message, The second network node is in the first deterministic network. Wherein, the second bounded delay information is one bounded delay information, or the second bounded delay information includes multiple bounded delay information. When the second bounded delay information includes a plurality of bounded delay information, the types of the plurality of bounded delay information are different. Optionally, the type of the second bounded delay information is different from the type of the first bounded delay information. In an example, the second bounded delay information and the first bounded delay information are any two bounded delay information in Table 1, and the type of the second bounded delay information is the same as the first bounded delay information. There are different types of information. For example, the first bounded delay information is queue indication information, and the second bounded delay information is cycle indication information. In another example, the first bounded delay information includes at least two bounded delay information in Table 1, the second bounded delay information includes at least two bounded delay information in Table 1, and the second bounded delay information includes at least two bounded delay information in Table 1. The type of the at least one bounded delay information included in the bounded delay information is different from the type of the at least one bounded delay information included in the first bounded delay information. For example, the first bounded delay information includes queue indication information and period indication information, and the second bounded delay information includes queue indication information and time slot indication information. In other embodiments, the type of the second bounded delay information and the type of the first bounded delay information may be the same. When the first packet carries the second bounded delay information and the second type indication information, and the first packet is an IPv6 packet, the second type indication information and the second bounded delay information are also located in the first packet. in the IPv6 extension header of the packet, and the first bounded delay information and the second bounded delay information are located in the same IPv6 extension header of the first packet, or the first bounded delay information and the second bounded delay information are in the same IPv6 extension header of the first packet. The delay information is located in different IPv6 extension headers of the first packet. When the first packet carries the second bounded delay information and the second type indication information, and the first packet is an MPLS packet, the second type indication information and the second bounded delay information are also located in the first packet. in the MPLS extension header of the document.

In an optional embodiment, the first message carries a plurality of bounded delay information and a plurality of type indication information. The plurality of bounded delay information corresponds to the plurality of type indication information in a one-to-one correspondence. Each type of indication information Used to indicate the type of corresponding bounded delay information. The plurality of bounded delay information are used to ensure the end-to-end deterministic delay of the first message in the first deterministic network. The plurality of bounded delay information are of the same type, or at least two of the plurality of bounded delay information are of different types. The plurality of bounded delay information includes first bounded delay information and second bounded delay information. Correspondingly, the plurality of type indication information includes first type indication information and second type indication information. When the first message is an IPv6 message, the plurality of bounded delay information and the plurality of type indication information are located in the IPv6 extension header of the first message. When the first message is an MPLS message, the plurality of bounded delay information and the plurality of type indication information are located in the MPLS extension header of the first message. In an example, the first message is an MPLS message as shown in Figure 7. The first message includes n MPLS EHs. Each MPLS EH carries m bounded delay information and m type indication information. The first The bounded delay information and the second bounded delay information are the bounded delay information carried by any two MPLS EHs among the n MPLS EHs, and the first type indication information and the second type indication information are the bounded delay information carried by any two of the n MPLS EHs. Type indication information carried by MPLS EH. For example, MPLS EH1 carries first bounded delay information and first type indication information, and MPLS EH2 carries second bounded delay information and second type indication information. In another example, the first message is an SRv6 message, and the first message includes an SRH as shown in Figure 9. The SRH carries n bounded delay information and n type indication information. The first bounded delay The information and the second bounded delay information are any two bounded delay information among the n bounded delay information. The first type indication information and the first bounded delay information are located in the same parameter field. The second The type indication information and the second bounded delay information are located in the same parameter field. For example, the first bounded delay message The information is bounded delay information 1, the first type indication information is type indication information 1; the second bounded delay information is bounded delay information 2, and the second type indication information is type indication information 2. In another example, the first message is an SRv6 message, and the first message includes an SRH as shown in Figure 10. The SRH includes m BLI lists, and each BLI list is used to carry a bounded delay information and a The type indication information, the first bounded delay information and the second bounded delay information are the bounded delay information carried by any two BLI lists among the m BLI lists, the first type indication information and the second type indication The information is the type indication information carried by any two BLI lists. For example, the first bounded delay information and the first type indication information are carried in the BLI list [1], and the second bounded delay information and the second type indication information are carried in the BLI list [2].

In an optional embodiment, the first message is an IPv6 message, and the first message also carries slice indication information. The slice indication information is located in the IPv6 extension header of the first message. For example, the slice indication information is located in the first IPv6 extension header. in the HBH, DOH or SRH of the message. The slice indication information indicates a network slice used to forward the first packet, and the slice indication information may be a slice identifier (identifier, ID). Wherein, the slice indication information and the first bounded delay information are located in the same IPv6 extension header of the first message. Alternatively, the slice indication information and the first bounded delay information are located in different IPv6 extension headers of the first message. For example, the first bounded delay information is located in the SRH, and the slice indication information is located in the HBH. Figure 14 is a schematic diagram of yet another first message provided by an embodiment of the present application. The first message is an SRv6 message, and the first message includes a payload, SRH, HBH and IPv6 header. The structure of the SRH is the same as Figure 9. The SRH carries m bounded delay information. The first bounded delay information is any bounded delay information among the m bounded delay information. The slice ID is located in the HBH. HBH includes the following fields: next header, header extension length, flag, slice ID and reservation. The IPv6 header includes the following fields: version field, traffic class, flow label, payload length, next header, hop limit, source ) address, destination address. In this embodiment of the present application, the slice indication information is carried in the HBH of the first message. Each network node along the first route can determine the corresponding network slice based on the slice indication information, and then forward the first message through the network slice. For example, the network nodes along the first packet forward the first packet according to the slice indication information, the bounded delay information, and the type indication information used to indicate the bounded delay information. This not only ensures that the first packet The end-to-end deterministic delay of the first message in the first deterministic network can also be guaranteed to ensure the deterministic delay of the first message in the network slice indicated by the slice indication information.

In this embodiment of the present application, the first network node is an entry node, an intermediate node or an exit node of the first deterministic network. When the first network node is an intermediate node or an egress node of the first deterministic network, the first network node receives the first message from a previous hop node of the first network node, and the previous hop node is in the first deterministic network. middle. When the first network node is an entry node of the first deterministic network, the first network node generates the first message. The following of S301 mainly introduces the implementation plan for the first network node to obtain the first message when the first network node is the entry node of the first deterministic network.

The first network node receives the second message from the previous hop node of the first network node, and the first network node obtains the first type indication information and the first bounded delay information, and the first network node receives the second message according to the second message. , the first type indication information and the first bounded delay information generate a first message, and the upper hop node is located outside the first deterministic network. Optionally, the first network node also obtains the second type indication information and the second bounded delay information. The first network node obtains the second type indication information and the second bounded delay information according to the second message, the first type indication information, the first bounded delay information, and the second bounded delay information. The type indication information and the second bounded delay information generate the first message. In a specific embodiment, the first network node obtains a plurality of type indication information and a plurality of bounded delay information. The plurality of type indication information corresponds to the plurality of bounded delay information. The plurality of type indication information includes: The first type of indication information and the second type of indication information, the plurality of bounded delay information include the first bounded delay information and the second bounded delay information, the first network node according to the second message, the plurality of bounded delay information The type indication information and the plurality of bounded delay information generate a first message.

In one embodiment, the first network node receives a control message sent by the controller. The control message includes first type indication information and first bounded delay information. The first network node obtains the first time delay from the control message. Type indication information and first bounded delay information. Optionally, the control message includes multiple types of indication information and multiple bounded delay information. The multiple types of indication information correspond to the multiple bounded delay information. Each type of indication information is used to indicate The corresponding type of bounded delay information, the plurality of bounded delay information includes the first bounded delay information, the plurality of type indication information includes the first type indication information, and the first network node obtains the first bounded delay information from the control message. Obtain the plurality of type indication information and the plurality of bounded delay information. Wherein, the plurality of bounded delay information are arranged in sequence in the control message, and the plurality of type indication information are arranged in the order in which the plurality of bounded delay information is arranged. In one example, the control message includes multiple TLV fields arranged in sequence, the multiple bounded delay information is located in the multiple TLV fields in one-to-one correspondence, and each type indication information has its corresponding bounded delay information. Located in the same TLV field. In another example, the control message includes an information stack. The information stack includes multiple information items arranged in sequence. The multiple bounded delay information is included in the multiple information items in one-to-one correspondence. Each type indicates The information and its corresponding bounded delay information are included in the same information item. Wherein, the plurality of bounded delay information corresponds to a plurality of network nodes along the first service flow, the plurality of network nodes are all in the first deterministic network, and the first message belongs to the first service flow. Each TLV field in the plurality of TLV fields may also include a node identifier to indicate the network node corresponding to the bounded delay information carried by each TLV field. Each information item among the plurality of information items may further include a node identifier to indicate the network node corresponding to the bounded delay information included in each information item. The node identifier may be the SID of the node, or other indication information used to identify the network node.

Optionally, before the first network node receives the control message sent by the controller, the first network node sends the capability information of the first network node to the controller, and the controller determines the first type of indication information based on the capability information of the first network node. and the first bounded delay information. In one example, the first bounded delay information is underlying resource information, the capability information of the first network node includes the underlying resource information of the first network node, and the controller obtains the capability information of the first network node from the capability information of the first network node. For the underlying resource information, the controller determines the underlying resource information of the first network node as the first bounded delay information and generates first type indication information for indicating the type of the first bounded delay information. In another example, the first bounded delay information is abstract resource information, the capability information of the first network node includes underlying resource information of the first network node, and the controller generates the first bounded delay information based on the underlying resource information of the first network node. delay information (that is, abstract resource information) and first type indication information, and establish a mapping relationship between underlying resource information and abstract resource information. In another example, the first bounded delay information is service requirement information, the capability information of the first network node includes the service requirement information of the first service flow, and the controller obtains the first service flow from the capability information of the first network node. The controller determines the service requirement information of the first service flow as the first bounded delay information and generates first type indication information for indicating the type of the first bounded delay information. Optionally, before the first deterministic network transmits the first service flow, each network node in the first deterministic network sends capability information of each network node to the controller, and the controller The information determines bounded delay information and type indication information used to indicate the bounded delay information.

In another embodiment, the second packet comes from the second deterministic network, and the second packet carries target bounded delay information. The target bounded delay information is used to ensure that the second packet travels in the second deterministic network. End-to-end deterministic latency. For example, as shown in Figure 2, the first deterministic network is deterministic network 1, and the second deterministic network is deterministic network 2. The target bounded delay information is used to ensure the end-to-end arrival of the second message in deterministic network 2. End deterministic delay. The first network node may obtain the first type indication information and the first bounded delay information according to the target bounded delay information carried in the second message. Optionally, the first network node obtains a plurality of type indication information and a plurality of bounded delay information according to the target bounded delay information, and the plurality of type indication information is related to the plurality of bounded delay information. There is a one-to-one correspondence between the bounded delay information, and each type indication information is used to indicate the type of the corresponding bounded delay information. The plurality of bounded delay information includes the first bounded delay information. The plurality of type indication information The information includes first type indication information. For example, the first network node stores an association relationship between the target bounded delay information and the plurality of bounded delay information (for example, it is called a first association relationship). A mapping relationship is used to obtain the multiple bounded delay information. The first association relationship is configured in the first network node through the command line, or it can be configured on the controller and sent to the first network node by the controller, or it can be generated by the controller and sent to of the first network node.

S302. The first network node forwards the first message according to the first type indication information and the first bounded delay information.

The first network node determines the type of the first bounded delay information based on the first type indication information. The first network node determines the type of the first bounded delay information used in the first network node based on the first bounded delay information and the type of the first bounded delay information. Regarding the first resource for transmitting the first message, the first network node forwards the first message through the first resource. The first resource may be a queue, cycle, or time slot.

In an optional embodiment, the first network node determines that the first bounded delay information includes time resource information based on the first type indication information, and the first network node determines the first resource based on the time resource information. As an example, the time resource information included in the first bounded delay information is underlying resource information. The first network node determines the underlying resource indicated by the time resource information. The first network node determines the underlying resource indicated by the time resource information. First resource. For example, the time resource information is queue indication information, and the first network node determines the queue indicated by the queue indication information as the first resource. For another example, the time resource information includes queue indication information and cycle indication information. The first network node determines the queue indicated by the queue indication information (assumed to be queue 1), and the first network node determines the cycle period indicated by the cycle indication information. (Assuming cycle period 1), the first network node determines queue 1 or cycle period 1 as the first resource in combination with the local policy. As another example, the time resource information included in the first bounded delay information is abstract information of the underlying resource information (abstract resource information for short), and the first network node is based on the local mapping relationship between the time resource information and the first network node. Identify the first resource. The local mapping relationship includes a mapping relationship between underlying resource information and abstract resource information. The first network node determines the underlying resource information corresponding to the time resource information based on the time resource information (that is, abstract resource information) and the local mapping relationship, The first network node determines the underlying resource indicated by the underlying resource information, and the first network node determines the first resource among the underlying resources indicated by the underlying resource information. For example. The time resource information (that is, abstract resource information) included in the first bounded delay information is resource ID1. The first network node determines that the underlying resource information corresponding to the resource ID1 is queue ID1 according to the resource ID1 and the local mapping relationship. The first network node determines that the underlying resource information corresponding to the resource ID1 is queue ID1. The network node determines the queue indicated by queue ID1 as the first resource. For another example, the time resource information included in the first bounded delay information is resource ID2, and the first network node determines that the underlying resource information corresponding to the resource ID2 includes queue ID1 and cycle ID1 according to the resource ID2 and the local mapping relationship. The node determines the queue indicated by queue ID1 (assumed to be queue 1), and determines the cycle period indicated by period ID1 (assumed to be cycle cycle 1). The first network node determines queue 1 or cycle period 1 as the first in combination with the local policy. resource.

In another optional embodiment, the first network node determines that the first bounded delay information includes service requirement information according to the first type indication information, and the first network node determines that the service requirement is met in the first network node according to the service requirement information. information resources, and then determine the first resource among these resources that meet the information requirements of the business. For example, the first network node determines the queue and/or cycle period and/or time slot in the first network node that satisfies the service requirement information based on the service requirement information. The first network node combines the local policy and determines the queue and/or cycle period and/or time slot in the first network node when the service requirement information is satisfied. The first resource is determined in the queue and/or cycle period and/or time slot. As an example, the information resources in the first network node that meet the service requirements include queue 1, cycle period 1 and time slot 1. If the first network node adopts a layer (layer1, L1) scheduling strategy for service scheduling, the first network node Determine time slot 1 as the first resource; if the first network node adopts the two-layer (layer2, L2) scheduling strategy or the three-layer (layer3, L3) The scheduling policy performs service scheduling, and the first network node determines queue 1 or cycle period 1 as the first resource.

In an optional embodiment, the first packet also carries slice indication information, and the first network node forwards the first packet according to the first type indication information, the first bounded delay information and the slice indication information. For example, the first network node determines the network slice according to the slice indication information, and determines the first network slice for transmitting the first message in the network slice according to the first type indication information and the first bounded delay information. One resource. In this embodiment, the bounded delay information and the slice indication information are combined to locate the resources used to transmit the first message on the network slice, which not only ensures the end-to-end arrival of the first message in the first deterministic network It also ensures the deterministic delay of the first message within the network slice indicated by the slice indication information. Moreover, in this embodiment, one network slice can be associated with multiple bounded delay resources (resources indicated by bounded delay information, such as queues), so that multiple service level agreements (service level agreements) can be planned within one network slice. service level agreement (SLA) level is used to differentiate services and provide a more flexible SLA guarantee strategy.

In an optional embodiment, the first network node is an egress node of the first deterministic network, and the first network node forwards the first message after stripping off bounded delay information and type indication information carried in the first message. In one example, the first packet is an IPv6 packet, and the first network node strips off the IPv6 extension header of the first packet, thereby stripping off the bounded delay information and type indication information carried by the IPv6 extension header. In another example, the first message is an MPLS message, and the first network node strips off the MPLS extension header of the first message, thereby stripping off the bounded delay information and type indication information carried in the MPLS extension header.

To sum up, according to the message transmission method provided by the embodiment of the present application, the first network node in the first deterministic network obtains the first message carrying the first type indication information and the first bounded delay information, and according to The first type indication information and the first bounded delay information forward the first message. The first type of indication information is used to indicate the type of the first bounded delay information, and the first bounded delay information is used to ensure the end-to-end deterministic delay of the first message in the first deterministic network. Therefore, this application assists the first deterministic network by carrying bounded delay information and type indication information for indicating the type of the bounded delay information in the first message transmitted in the first deterministic network. The network node forwards the first message, ensuring the end-to-end deterministic delay of the first message in the first deterministic network. The technical solutions provided by the embodiments of this application can be applied to various network scenarios such as IPv6 DetNet, SRv6 DetNet, MPLS DetNet, TSN over IPv6 DetNet, TSN over SRv6 DetNet, TSN over MPLS DetNet, etc.

Please refer to Figure 15, which shows a flow chart of another message transmission method provided by an embodiment of the present application. This message transmission method applies to the controller. As shown in Figure 15, the method includes the following steps S501 to S503.

S501. The controller receives capability information of the first network node, and the first network node is in the first deterministic network.

The first network node sends the capability information of the first network node to the controller through the interior gateway protocol (interior gateway protocol, IGP) or the border gateway protocol link-state (BGP-LS). Correspondingly, the control The server receives the capability information of the first network node through IGP or BGP-LS.

Wherein, the capability information of the first network node is used to indicate the first network node's processing capability of the first service flow, and the capability information of the first network node includes the underlying resources of the first network node that can be used to transmit the first service flow. information. As an example, the capability information of the first network node includes at least one of queue indication information, cycle indication information, time slot indication information and priority information, the queue indication information is used to indicate that the first network node can be used for transmission The queue of the first service flow, the period indication information is used to indicate the cycle period in the first network node that can be used to transmit the first service flow, and the time slot indication information is used to indicate that the first network node can be used to transmit the first service flow. The time slot of the service flow, the priority information is used to indicate the priority queue in the first network node that can be used to transmit the first service flow.

In an optional embodiment, the capability information of the first network node also includes service requirement information of the first service flow, and the service requirement information includes at least one of the following: delay requirement information, jitter requirement information, and deadline requirement information. The delay requirement information includes at least one of the following: end-to-end delay requirement information and local delay requirement information. The jitter requirement information includes at least one of the following: end-to-end jitter requirement information, local jitter requirement information. The deadline requirement information includes at least one of the following: end-to-end deadline requirement information, local deadline requirement information. The capability information of the first network node may also include other information. The embodiments of this application do not limit the specific content of the capability information of the first network node.

In an optional embodiment, the first deterministic network includes multiple network nodes, the multiple network nodes include the first network node, and each network node in the multiple network nodes sends a message to the controller through IGP or BGP-LS. Correspondingly, the controller receives the capability information of each network node in the plurality of network nodes through IGP or BGP-LS. The capability information of each network node includes information on underlying resources in each network node that can be used to transmit the first service flow, and may also include service requirement information of the first service flow.

S502. The controller obtains the first type indication information and the first bounded delay information according to the capability information of the first network node. The first type indication information is used to indicate the type of the first bounded delay information. The first bounded delay information is used to indicate the type of the first bounded delay information. The delay information is used to ensure the end-to-end deterministic delay of the packet carrying the first bounded delay information in the first deterministic network.

The first bounded delay information includes time resource information or business requirement information. The time resource information is used to indicate resources in the network node for transmitting the first service flow. The service requirement information is used to indicate the service requirement of the first service flow. The time resource information is bottom resource information or abstract information of bottom resource information (referred to as abstract resource information for short). The bottom resource information directly indicates the resource transmitting the first service flow in the network node. There is a relationship between the abstract resource information and the bottom resource information. There is a mapping relationship, and the abstract resource information indirectly indicates the resources in the network node for transmitting the first service flow through the mapping relationship.

In one embodiment, the first bounded delay information includes time resource information, and the time resource information is bottom layer resource information, and the capability information of the first network node includes the bottom layer of the first network node that can be used to transmit the first service flow. Resource information (referred to as the underlying resource information of the first network node), the controller determines the first bounded delay information and the first type indication information based on the underlying resource information of the first network node. In one example, the underlying resource information of the first network node includes at least one of queue indication information, period indication information, time slot indication information and priority information, and the controller uses the queue indication information, the period indication information, the time slot indication information and the priority information. At least one of the slot indication information and the priority information is determined as the first bounded delay information, and the controller generates first type indication information indicating the type of the first bounded delay information.

In another embodiment, the first bounded delay information includes time resource information, and the time resource information is abstract resource information. The capability information of the first network node includes underlying resource information of the first network node. The underlying resource information of a network node is abstracted to obtain abstract resource information. The controller determines the abstract resource information as the first bounded delay information, and the controller generates a third parameter indicating the type of the first bounded delay information. A type of indication information. In this embodiment, the controller can also establish a mapping relationship between the underlying resource information and the abstract resource information, and send the mapping relationship to the first network node for use by the first network node in forwarding the first service flow.

In an optional embodiment, the controller acquires at least one bounded delay information and at least one type indication information based on the capability information of multiple network nodes in the first deterministic network, and the at least one bounded delay information is consistent with the at least one type indication information. There is a one-to-one correspondence between a type of indication information. Each type of indication information is used to indicate the type of corresponding bounded delay information. Each bounded delay information is used to ensure that the packet carrying each bounded delay information is An end-to-end deterministic delay in a deterministic network, the at least one bounded delay information includes first bounded delay information, and the at least one type indication information includes first type indication information. Wherein, the capability information of each network node includes the underlying resources in each network node that can be used to transmit the first service flow. information (the information on the underlying resources in each network node that can be used to transmit the first service flow is referred to as the underlying resource information of each network node), the controller determines the at least one based on the underlying resource information of the multiple network nodes. bounded delay information, and generating at least one type indication information used to indicate the at least one bounded delay information. In one example, the at least one bounded delay information corresponds to all network nodes along the first service flow, and the at least one bounded delay information is used to assist all network nodes along the first service flow in forwarding the first service flow. In another example, the at least one bounded delay information corresponds to an egress node of the first deterministic network, and the at least one bounded delay information is used to assist all network nodes along the first service flow in forwarding the first service flow. In another example, the at least one bounded delay information corresponds to at least one network node along the first service flow, and each bounded delay information is used to assist the corresponding network node in forwarding the first service flow. For example, the at least one bounded delay information is a plurality of bounded delay information, the plurality of bounded delay information is hop-by-hop auxiliary forwarding information, and each bounded delay information is used to assist the first service flow along the way. The one-hop network node forwards the first service flow.

When the at least one bounded delay information is a plurality of bounded delay information, the plurality of bounded delay information are of the same type, or at least two of the plurality of bounded delay information are bounded delays. There are different types of information. By way of example, the at least one bounded delay information also includes second bounded delay information, and the type of the second bounded delay information is different from the type of the first bounded delay information. For example, the first bounded delay information is queue indication information, and the second bounded delay information is cycle indication information. For another example, the first bounded delay information is queue indication information, and the second bounded delay information is abstract resource information.

As an example, the at least one bounded delay information is a plurality of bounded delay information, and the bounded delay information is abstract resource information. The controller abstracts the underlying resource information of each network node among the multiple network nodes to obtain abstract resource information corresponding to the underlying resource information of each network node. The controller determines the abstract resource information as a bounded delay. Information, the controller can obtain multiple bounded delay information. For example, the plurality of network nodes include network nodes 101 to 103. The underlying resource information used by network node 101 to transmit the first business flow is queue ID1, and the underlying resource information used by network node 102 to transmit the first business flow is cycle ID1. , the underlying resource information used by the network node 103 to transmit the first service flow is time slot ID1. The controller abstracts queue ID1 as resource ID11, abstracts cycle ID1 as resource ID12, and abstracts time slot ID1 as resource ID13. Resource ID11, Resource ID12 and resource ID13 are both boundary delay information. In this example, the controller establishes a mapping relationship between queue ID1 and resource ID11 (for example, called mapping relationship 1), and sends mapping relationship 1 to the network node 101, so that the network node 101 forwards the first service carrying the resource ID11. Determine underlying resource information when streaming. The controller establishes a mapping relationship between cycle ID1 and resource ID12 (for example, called mapping relationship 2), and sends mapping relationship 2 to the network node 102, so that the network node 102 can determine the underlying resource information when forwarding the first service flow carrying resource ID12. . The controller establishes a mapping relationship between the time slot ID1 and the resource ID13 (for example, called mapping relationship 3), and sends the mapping relationship 3 to the network node 103, so that the network node 103 can determine the underlying resources when forwarding the first service flow carrying the resource ID13. information.

Taking the at least one bounded delay information as bounded delay information and the bounded delay information as abstract resource information as an example. The controller abstracts the underlying resource information of multiple network nodes and obtains abstract resource information corresponding to the underlying resource information of multiple network nodes, that is, bounded delay information. For example, the plurality of network nodes include network nodes 101 to 103. The underlying resource information used by network node 101 to transmit the first business flow is queue ID1, and the underlying resource information used by network node 102 to transmit the first business flow is cycle ID1. , the underlying resource information used by the network node 103 to transmit the first service flow is time slot ID1. The controller abstracts queue ID1, cycle ID1 and time slot ID1 into resource ID1, which is the bounded delay information. In this example, the controller establishes the mapping relationship between queue ID1, cycle ID1, time slot ID1 and resource ID1, and sends the mapping relationship to the network node 101 ~ network node 103 for forwarding by the network node 101 ~ network node 103 Determine the underlying resource information when carrying the first service flow of resource ID1.

S503. The controller sends a control message to the first network node, where the control message includes the first type indication information and the first bounded delay information.

The controller first generates a control message and then sends the control message to the first network node. For example, the controller sends a control message to the first network node through network protocols such as path computation element communication protocol (PCEP) and border gateway protocol (BGP).

In this embodiment of the present application, the control message includes the first type indication information and the first bounded delay information to instruct the first network node to process the first service according to the first type indication information and the first bounded delay information. flow. Optionally, the control message also includes second type indication information and second bounded delay information. The second bounded delay information and the first bounded delay information are arranged in order in the control message. The second type of indication information and the first type of indication information are arranged sequentially in the control message. The order of the second type of indication information and the first type of indication information is consistent with the second bounded delay information and the first bounded delay information. are sorted in the same order. In one example, the control message includes a first TLV field and a second TLV field arranged in sequence, the first type indication information and the first bounded delay information are located in the first TLV field, the second type indication information and the first bounded delay information are located in the first TLV field. The second bounded delay information is located in the second TLV field. In another example, the control message includes an information stack, the information stack includes a first information item and a second information item arranged in sequence, and the first information item includes first type indication information and first bounded delay information, The second information item includes second type indication information and second bounded delay information.

In an optional embodiment, the control message includes a plurality of bounded delay information and a plurality of type indication information, the plurality of bounded delay information corresponds to the plurality of type indication information, and the plurality of bounded delay information corresponds to the plurality of type indication information. The delay information includes first bounded delay information and second bounded delay information, and the multiple types of indication information include first type indication information and second type indication information. The plurality of bounded delay information are arranged in sequence in the control message, the plurality of type indication information are arranged in sequence in the control message, and the arrangement order of the plurality of type indication information is consistent with the plurality of bounded delay information. The information is arranged in the same order. In one example, the control message includes multiple TLV fields arranged in sequence, the multiple bounded delay information is located in the multiple TLV fields in one-to-one correspondence, and each type indication information has its corresponding bounded delay information. Located in the same TLV field, optionally, the multiple bounded delay information corresponds to multiple network nodes in the first deterministic network, and each TLV field also includes a node identifier to indicate that each The network node corresponding to the bounded delay information carried by the TLV field. In another example, the control message includes an information stack. The information stack includes multiple information items arranged in sequence. The multiple bounded delay information is included in the multiple information items in one-to-one correspondence. Each type indicates The information and its corresponding bounded delay information are included in the same information item. Optionally, the multiple bounded delay information corresponds to multiple network nodes in the first deterministic network. Each information item also includes A node identifier to indicate the network node corresponding to the bounded delay information included in each information item.

It should be noted that S503 takes the first network node being the entry node of the first deterministic network as an example. The actual meaning of S503 is: the controller sends a control message to the entry node of the first deterministic network.

To sum up, according to the message transmission method provided by the embodiment of the present application, the controller generates control including the first type indication information and the first bounded delay information according to the capability information of the first network node in the first deterministic network. message, and sends the control message to the first network node, so that the first network node can obtain the service message carrying the first type indication information and the first bounded delay information according to the control message (for example, the first message message), and then forwards the service message according to the first type indication information and the first bounded delay information, thereby ensuring the end-to-end deterministic delay of the service message in the first deterministic network.

In order to facilitate understanding of the technical solutions of the present application, the following actual network scenarios introduce the technical solutions of the embodiments of the present application.

Figure 16 is a schematic diagram of message transmission provided by an embodiment of the present application. Figure 16 shows a diagram from network node 101 to network node 105 transmits the first service flow description. Network nodes 101 to 105 are all in the first deterministic network. Network node 101 is the entry node of the first deterministic network. Network node 105 is the exit node of the first deterministic network. Basic slices are deployed in the first deterministic network. , Network Slice 1 and Network Slice 2. Figure 16 takes as an example that the packet of the first service flow carries a slice ID and a plurality of bounded delay information, and the plurality of bounded delay information corresponds to a plurality of network nodes along the packet.

After the network node 101 receives the message 1, the network node 101 encapsulates the IPv6 header, HBH and SRH in the message 1 to obtain the message 2. HBH carries slice ID1. SRH includes an SL field and a segment list. The segment list includes 4 SIDs that correspond to network nodes 102 to 105. The parameter (args) field of each SID carries a bounded delay information and is used to indicate the bounded delay. Type indication information of the type of extension information (the type indication information is not shown in the figure for simplicity), and the value of the SL field indicates the number of remaining unprocessed SIDs arriving at the destination node. For example, network node 102 corresponds to SID102, network node 103 corresponds to SID103, network node 104 corresponds to SID104, and network node 105 corresponds to SID105 (for simplicity in the figure, SID102 is represented as "102", SID103 is represented as "103", and SID104 is represented as "104", SID105 is represented as "105"), the parameter field of SID102 carries queue ID1 and type indication information used to indicate the type of queue ID1, and the parameter field of SID103 carries cycle ID1 and type indication used to indicate the type of cycle ID1 Information, the parameter field of SID104 carries time slot ID1 and type indication information used to indicate the type of time slot ID1, and the parameter field of SID105 carries local delay information and type indication information used to indicate the type of the local delay information. The IPv6 header includes an IPv6 source address (SA) field and an IPv6 destination address (DA) field. The IPv6SA field is used to carry IPv6SA, and the IPv6 DA field is used to carry IPv6 DA. The IPv6 SA of message 2 is SID101 (the SID corresponding to network node 101, briefly represented as "101" in the figure), and the IPv6 DA of message 2 is SID102. The network node 101 forwards the message 2 to the network node 102 through the network slice 1 according to the slice ID1.

After the network node 102 receives message 2, the network node 102 executes the instruction corresponding to SID102. The network node 102 decrements the value of the SL field of message 2 by 1 and modifies the IPv6 DA of message 2 to SID103 to obtain message 3. The network node 102 determines the queue 1 indicated by the queue ID 1 in the queue corresponding to the network slice 1 based on the slice ID 1 and the queue ID 1 carried by the SID 102. The network node 102 forwards the message 3 to the network node 103 through the queue 1.

After the network node 103 receives message 3, the network node 103 executes the instruction corresponding to SID103. The network node 103 decrements the value of the SL field of message 3 by 1 and modifies the IPv6 DA of message 3 to SID104 to obtain message 4. The network node 103 determines the cycle period 1 indicated by the cycle ID1 in the cycle period corresponding to the network slice 1 based on the slice ID1 and the cycle ID1 carried by the SID103. The network node 103 forwards the message 4 to the network node 104 through the cycle period 1.

After the network node 104 receives message 4, the network node 104 executes the instruction corresponding to SID104. The network node 104 decrements the value of the SL field of message 4 by 1 and modifies the IPv6 DA of message 4 to SID105 to obtain message 5. The network node 104 determines the time slot 1 indicated by the time slot ID1 in the time slot corresponding to the network slice 1 based on the time slot ID1 carried by the slice ID1 and the SID104. The network node 104 forwards the message 5 to the network node 105 through the time slot 1.

After the network node 105 receives the message 5, the network node 105 executes the instruction corresponding to the SID 105. The network node 105 strips off the IPv6 header, HBH and SRH of the message 5 to obtain the message 1. Based on the local delay information carried by the slice ID1 and SID105, the network node 105 determines the resources that meet the delay requirements indicated by the local delay information among the resources corresponding to the network slice 1. The network node 105 determines the resources that meet the delay requirements indicated by the local delay information. Delay required resource forwarding packet 1.

Figure 17 is another schematic diagram of message transmission provided by an embodiment of the present application. Figure 17 illustrates the transmission of the first service flow from the network node 101 to the network node 105 as an example. Network nodes 101 to 105 are all in the first deterministic network, and network node 101 is the entry node of the first deterministic network, and the network node 105 is the exit node of the first deterministic network. The first deterministic network is deployed with basic slice, network slice 1 and network slice 2. Figure 16 takes as an example that the packet of the first service flow carries a slice ID and a bounded delay information, and the bounded delay information is abstract resource information.

Referring to Figure 17, after the network node 101 receives the message 1, the network node 101 encapsulates the IPv6 header, HBH and SRH in the message 1 to obtain the message 2. HBH carries slice ID1. SRH includes an SL field, a segment list and a TLV field. The segment list includes 4 SIDs that correspond to network nodes 102 to 105. The types of the 4 SIDs are all END.BLI. The TLV field carries resource ID 1 and for Type indication information indicating the type of resource ID1 (the type indication information is not shown in the figure for simplicity), resource ID1 is abstract resource information, and the value of the SL field indicates the number of unprocessed SIDs remaining at the destination node. The IPv6 header includes the IPv6SA field and the IPv6 DA field. The IPv6SA field is used to carry IPv6SA, and the IPv6 DA field is used to carry IPv6 DA. The IPv6 SA of message 2 is SID101, and the IPv6 DA is SID102. The network node 101 forwards the message 2 to the network node 102 through the network slice 1 according to the slice ID1.

After the network node 102 receives message 2, the network node 102 executes the instruction corresponding to SID102. The network node 102 decrements the value of the SL field of message 2 by 1 and modifies the IPv6 DA of message 2 to SID103 to obtain message 3. The network node 102 determines the underlying resource information (assumed to be queue ID1) corresponding to the resource ID1 on the network node 102 based on the resource ID1 and the local mapping relationship. The network node 102 determines the queue in the queue corresponding to the network slice 1 based on the slice ID1 and the queue ID1. Queue 1 indicated by ID1, network node 102 forwards message 3 to network node 103 through queue 1.

After the network node 103 receives message 3, the network node 103 executes the instruction corresponding to SID103. The network node 103 decrements the value of the SL field of message 3 by 1 and modifies the IPv6 DA of message 3 to SID104 to obtain message 4. The network node 103 determines the underlying resource information (assumed to be cycle ID1) corresponding to the resource ID1 on the network node 103 based on the resource ID1 and the local mapping relationship. The network node 103 determines the underlying resource information corresponding to the network slice 1 based on the slice ID1 and the cycle ID1. In the cycle period 1 indicated by the cycle ID1, the network node 103 forwards the message 4 to the network node 104 through the cycle period 1.

After the network node 104 receives message 4, the network node 104 executes the instruction corresponding to SID104. The network node 104 decrements the value of the SL field of message 4 by 1 and modifies the IPv6 DA of message 4 to SID105 to obtain message 5. The network node 104 determines the underlying resource information (assumed to be timeslot ID1) corresponding to the resource ID1 on the network node 104 based on the resource ID1 and the local mapping relationship. The network node 104 determines the timeslot corresponding to the network slice 1 based on the slice ID1 and the timeslot ID1. The network node 104 determines the time slot 1 indicated by the time slot ID1, and the network node 104 forwards the message 5 to the network node 105 through the time slot 1.

After the network node 105 receives the message 5, the network node 105 executes the instruction corresponding to the SID 105. The network node 105 strips off the IPv6 header, HBH and SRH of the message 5 to obtain the message 1. The network node 105 determines the underlying resource information (assumed to be priority information 1) corresponding to the resource ID1 on the network node 105 based on the resource ID1 and the local mapping relationship. The network node 105 determines the underlying resource information corresponding to the network slice 1 based on the slice ID1 and priority information 1. A queue with priority 1 (priority indicated by priority information 1) is determined in the queue, and the network node 105 forwards message 1 through the queue with priority 1.

The above is an introduction to the method embodiments of the present application. The following describes device embodiments of the present application. The device of the present application can be used to perform the method of the present application. For details not disclosed in the device embodiment, please refer to the method embodiment.

Figure 18 is a schematic diagram of a message transmission device 1800 provided by an embodiment of the present application. The message transmission device 1800 is applied to the first network node in the first deterministic network. For example, the message transmission device 1800 is the first network node or a functional component in the first network node. Referring to Figure 18, the message transmission device 1800 includes a processing module 1810 and a sending module 1820.

The processing module 1810 is used to obtain the first message, which carries the first type indication information and the first bounded delay information. information, the first type indication information is used to indicate the type of the first bounded delay information, and the first bounded delay information is used to ensure the end-to-end deterministic delay of the first message in the first deterministic network. For the functional implementation of the processing module 1810, please refer to the relevant description in S301 above.

The sending module 1820 is configured to forward the first message according to the first type indication information and the first bounded delay information. For the functional implementation of the sending module 1820, please refer to the relevant description in S302 above.

Optionally, the delay requirement information includes at least one of the following: end-to-end delay requirement information, local delay requirement information; the jitter requirement information includes at least one of the following: end-to-end jitter requirement information, local jitter requirement information; cutoff The deadline requirement information includes at least one of the following: end-to-end deadline requirement information, local deadline requirement information.

Optionally, the sending module 1820 is configured to: determine the type of the first bounded delay information according to the first type indication information;

Determine a first resource in the first network node for transmitting the first message according to the first bounded delay information and the type of the first bounded delay information; and forward the first message through the first resource.

Optionally, the first message also carries second bounded delay information and second type indication information. The second type indication information is used to indicate the type of the second bounded delay information. The second bounded delay information is In order to ensure the end-to-end deterministic delay of the first message in the first deterministic network, the second type indication information and the second bounded delay information are used by the second network node to forward the first message, and the second network The node is in the first deterministic network.

Optionally, the type of the second bounded delay information is different from the type of the first bounded delay information.

Optionally, the first network node is the entry node of the first deterministic network. The processing module 1810 is configured to: receive the second message; receive the control message sent by the controller, where the control message includes the first type of indication information. and the first bounded delay information; and generate the first message according to the second message, the first type indication information and the first bounded delay information.

Optionally, the sending module 1820 is also configured to send the capability information of the first network node to the controller, where the capability information of the first network node includes the first type indication information and the first bounded delay information.

Optionally, the first network node is the entry node of the first deterministic network, and the processing module 1810 is configured to: receive the second message, the second message comes from the second deterministic network, and the second message carries the target bounded Delay information; obtain the first type indication information and the first bounded delay information according to the target bounded delay information; generate the first report according to the second message, the first type indication information and the first bounded delay information. arts.

Optionally, the first message is an IPv6 message, and the first type indication information and the first bounded delay information are both located in the IPv6 extension header of the first message.

Optionally, the IPv6 extension header includes any one of the following: HBH, DOH, or SRH.

Optionally, the IPv6 extension header is an SRH. The SRH includes a segment list. The first type indication information and the first bounded delay information are both located in the segment list. For example, the segment list includes a first SID, and both the first type indication information and the first bounded delay information are located in the parameter field of the first SID.

Optionally, the IPv6 extension header is an SRH. The SRH includes a TLV field. The first type indication information and the first bounded delay information are both located in the TLV field. The SRH also includes a segment list, the segment list includes a first SID, the first bounded delay information and the first SID both correspond to the first network node, and the type of the first SID is a target type.

In one example, the TLV field carries multiple type indication information and multiple bounded delay information. The multiple type indication information and the multiple bounded delay information correspond to one-to-one, and each type indication information is used to indicate the corresponding The type of bounded delay information, the plurality of bounded delay information includes the first bounded delay information, the plurality of type indication information includes the first type indication information; the segment list includes a plurality of SIDs, the plurality of The SID has a one-to-one correspondence with multiple network nodes along the way of the first message. The multiple bounded delay information has a one-to-one correspondence with the multiple network nodes along the way of the first message. The number of the multiple bounded delay information Not greater than the number of the multiple SIDs, the type of the SID corresponding to the bounded delay information among the multiple SIDs is the target type.

In another example, the segment list includes multiple SIDs, the multiple SIDs correspond to multiple network nodes along the first message, the first bounded delay information corresponds to the multiple network nodes, and the multiple SIDs correspond to the multiple network nodes along the first message. The types of SIDs are all target types.

Optionally, the first network node is an egress node of the first deterministic network, the first message is an SRv6 message, the SRH of the first message includes a segment list and a TLV field, and the segment list includes multiple SIDs. Each SID corresponds to multiple network nodes along the first packet. The first type indication information and the first bounded delay information are both located in the TLV field. The first bounded delay information only corresponds to the first network node. , only the type of the SID corresponding to the first network node among the plurality of SIDs is the target type.

Optionally, the slicing indication information and the first bounded delay information are located in the same IPv6 extension header of the first message; or,

The slice indication information and the first bounded delay information are located in different IPv6 extension headers of the first message.

Optionally, the first message is an MPLS message, and the first type indication information and the first bounded delay information are located in the MPLS extension header of the first message.

To sum up, the message transmission device provided by the embodiment of the present application carries the first bounded delay information and the first type indication used to indicate the type of the first bounded delay information in the first message. The information assists the network node in the first deterministic network to forward the first message, ensuring the end-to-end deterministic delay of the first message in the first deterministic network.

Figure 19 is a schematic diagram of another message transmission device 1900 provided by an embodiment of the present application. The message transmission device 1900 is applied to the controller. For example, the message transmission device 1900 is the controller or a functional component in the controller. Referring to Figure 19, the message transmission device 1900 includes: a receiving module 1910, a processing module 1920 and a sending module 1930.

The receiving module 1910 is configured to receive capability information of the first network node, where the first network node is in the first deterministic network. For the functional implementation of the receiving module 1910, please refer to the relevant description in S501 above.

The processing module 1920 is configured to obtain the first type indication information and the first bounded delay information according to the capability information of the first network node. The first type indication information is used to indicate the type of the first bounded delay information. The first bounded delay information is The bounded delay information is used to ensure the end-to-end deterministic delay of the packet carrying the first bounded delay information in the first deterministic network. For the functional implementation of the processing module 1920, please refer to the relevant description in S502 above.

The sending module 1930 is configured to send a control message to the first network node, where the control message includes first type indication information and first bounded delay information. For the functional implementation of the sending module 1930, please refer to the description in S503 above.

Optionally, the time resource information includes at least one of the following: queue indication information, cycle indication information, and time slot indication information. information, priority information.

Optionally, the receiving module 1910 is configured to receive capability information of multiple network nodes, the multiple network nodes are in the first deterministic network, and the multiple network nodes include the first network node;

The processing module 1920 is configured to obtain at least one bounded delay information and at least one type indication information according to the capability information of the plurality of network nodes. The at least one bounded delay information corresponds to the at least one type indication information. Each time The type indication information is used to indicate the type of the corresponding bounded delay information, the at least one bounded delay information includes the first bounded delay information, and the at least one type indication information includes the first type indication information, wherein, the The control message includes the at least one bounded delay information and the at least one type indication information.

Optionally, the at least one bounded delay information also includes second bounded delay information, and the at least one type indication information also includes second type indication information, and the second type indication information is used to indicate the second bounded delay. The type of information. The second bounded delay information is used to ensure the end-to-end deterministic delay of the packet carrying the second bounded delay information in the first deterministic network. The second bounded delay information The type is different from the type of the first bounded delay information.

Optionally, the second bounded delay information and the first bounded delay information are arranged in order in the control message, the second type indication information and the first type indication information are arranged in order in the control message, and the second type indication information is arranged in order in the control message. The arrangement order of the type indication information and the first type indication information is the same as the arrangement order of the second bounded delay information and the first bounded delay information.

Optionally, the control message includes a first TLV field and a second TLV field arranged in sequence, the first type indication information and the first bounded delay information are located in the first TLV field, the second type indication information and the first bounded delay information are located in the first TLV field. The second bounded delay information is located in the second TLV field.

Optionally, the control message includes an information stack. The information stack includes a first information item and a second information item arranged in sequence. The first information item includes the first type indication information and the first bounded delay information. The second information item includes second type indication information and second bounded delay information.

To sum up, embodiments of the present application provide a message transmission device, which obtains the first bounded delay information and the type used to indicate the first bounded delay information according to the capability information of the first network node. The first type of indication information, and sends a control message including the first type of indication information and the first bounded delay information to the first network node, so that the first network node can obtain the first type of indication based on the control message information and the first bounded delay information of the service message (for example, the first message), and then forward the service message according to the first type indication information and the first bounded delay information, ensuring that the service message is End-to-end deterministic delay in a deterministic network.

The message transmission device provided by the embodiment of the present application can also be implemented using an application-specific integrated circuit (ASIC) or a programmable logic device (PLD). The above-mentioned PLD can be a complex programmable logical device (CPLD), a field-programmable gate array (FPGA), a general array logic (GAL) or any combination thereof. The methods provided by the above method embodiments can also be implemented through software. When the above method embodiments are implemented through software, When providing a message transmission method, each module in the above message transmission device can also be a software module.

Please refer to FIG. 20 , which shows a schematic diagram of yet another message transmission device 2000 provided by an embodiment of the present application. The message transmission device 2000 is a network node or a functional component in a network node. The message transmission device 2000 includes a main control board 2010, an interface board 2030 and an interface board 2040. In the case of multiple interface boards, a switching network board (not shown in Figure 20) is also included. The switching network board is used to complete data exchange between interface boards (interface boards are also called line cards or service boards).

The main control board 2010 is used to complete functions such as system management, equipment maintenance, and protocol processing. The interface board 2030 and the interface board 2040 are used to provide various service interfaces (for example, POS interface, GE interface, ATM interface, etc.) and implement packet forwarding. There are three main types of functional units on the main control board 2010: system management control unit, system clock unit and system maintenance unit. The main control board 2010, the interface board 2030 and the interface board 2040 are connected to the system backplane through a system bus to achieve intercommunication. The interface board 2030 includes one or more processors 2031. The processor 2031 is used to control and manage the interface board 2030 and communicate with the central processor 2012 on the main control board 2010 . The memory 2032 on the interface board 2030 is used to store capability information, bounded delay information, etc. The interface board 2030 includes one or more network interfaces 2033 for receiving and sending messages. The specific implementation will not be described again here. As shown in Figure 20, the main control board 2010 also includes a memory 2014. The memory 2014 is used to store system management information, protocols, etc., which is not limited in the embodiment of the present application.

As shown in Figure 20, this embodiment includes multiple interface boards and adopts a distributed forwarding mechanism. Under this mechanism, the operations on the interface board 2040 are basically similar to the operations on the interface board 2030. For example, the interface board 2040 includes one or more network interfaces 2043 for receiving and sending messages, a memory 2042 for storing capability information and bounded delay information, and a processor 2041 for interfacing with the interface board. 2040 performs control management and communicates with the central processor 2012 on the main control board 2010. For the sake of simplicity, the interface board 2040 will not be described in detail here.

The processor 2031 in the interface board 2030 and/or the processor 2041 in the interface board 2040 in Figure 20 can be dedicated hardware or chips, such as a network processor or an application-specific integrated circuit to implement the above functions. This implementation method is generally The forwarding plane is processed by dedicated hardware or chips. In other embodiments, the processor 2031 in the interface board 2030 and/or the processor 2041 in the interface board 2040 can also be a general-purpose processor, such as a central processing unit (CPU).

In addition, it should be pointed out that there may be one or more main control boards, and when there are multiple main control boards, they can include the main main control board and the backup main control board. There may be one or more interface boards. The stronger the data processing capability of the network node, the more interface boards are provided. In the case of multiple interface boards, the multiple interface boards can communicate with each other through one or more switching network boards. When there are multiple interface boards, they can jointly achieve load sharing and redundant backup. Under the centralized forwarding architecture, network nodes do not need switching network boards, and the interface boards are responsible for processing business data of the entire system. Under the distributed forwarding architecture, network nodes include multiple interface boards. Data exchange between multiple interface boards can be realized through switching network boards, providing large-capacity data exchange and processing capabilities. Therefore, the data access and processing capabilities of network nodes with a distributed architecture are greater than those with a centralized architecture. The specific architecture used depends on the network deployment scenario and is not limited here.

In an optional implementation, the memory 2032 and/or the memory 2042 is a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (random access memory, RAM) or other types of dynamic storage devices that can store information and instructions, or electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory, CD-ROM) or other optical disc storage, optical disc storage (including compressed disc, Laser disc, optical disc, digital versatile disc, Blu-ray disc, etc.), magnetic disk or other magnetic storage device, or any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and that can be accessed by a computer, But not limited to this. The memory 2032 may exist independently and be connected to the processor 2031 through a communication bus, or may be integrated with the processor 2031. The memory 2042 may exist independently and be connected to the processor 2041 through a communication bus, or may be integrated with the processor 2041.

The memory 2032 is used to store program codes, and is controlled by the processor 2031 to execute part or all of the steps of the method provided by the above embodiments. The processor 2031 is used to execute program codes stored in the memory 2032. The program code may include one or more software modules. This one or more software modules may be the functional modules provided in the above embodiment shown in Figure 18. The memory 2042 can also be used to store program codes, and the processor 2041 controls the execution to execute some or all steps of the method provided by the above embodiments. Similarly, the memory 2014 can also be used to store program codes, and the execution is controlled by the central processor 2012 to execute part or all of the steps of the method provided by the above embodiments.

In an optional implementation, the network interface 2033 and the network interface 2043 can be any transceiver-like device used to communicate with other devices or communication networks, such as Ethernet, radio access network (radio access network, RAN). , wireless local area networks (WLAN), etc.

Please refer to Figure 21, which shows a schematic diagram of yet another message transmission device 2100 provided by an embodiment of the present application. The message transmission device 2100 may be a network node or a functional component in a network node, or may be a controller or a functional component in the controller. The message transmission device 2100 includes a processor 2102, a memory 2104, a communication interface 2106, and a bus 2108. The processor 2102, the memory 2104, and the communication interface 2106 are communicatively connected through the bus 2108. In other embodiments, the processor 2102, the memory 2104, and the communication interface 2106 may also be connected in other ways.

Among them, the memory 2104 is used to store a computer program 21042, which may include instructions and data. The memory 2104 can be various types of storage media, such as RAM, ROM, non-volatile RAM (non-volatile RAM, NVRAM), programmable ROM (programmable ROM, PROM), erasable PROM (erasable PROM, EPROM) , electrically erasable PROM (electrically erasable PROM, EEPROM), flash memory, optical memory and registers, etc.

Wherein, the processor 2102 may be a general-purpose processor, and the general-purpose processor may be a processor that performs specific steps and/or operations by reading and executing a computer program (eg, computer program 21042) stored in a memory (eg, memory 2104), The general-purpose processor may use the data stored in the memory in performing the above steps and/or operations. The stored computer program can be executed to implement related functions of the aforementioned processing module 1810, sending module 1820, etc. A general-purpose processor may be a CPU. The processor 2102 can also be a special-purpose processor. A special-purpose processor is a processor specially designed to perform specific steps and/or operations. The special-purpose processor can be a digital signal processor (digital signal processor, DSP), ASIC or FPGA. wait. Processor 2102 may also be a multi-core processor. The processor 2102 includes at least one circuit to perform all or part of the steps of the above embodiment method.

Among them, the communication interface 2106 may include an input/output (I/O) interface, a physical interface, a logical interface, and other interfaces for realizing device interconnection within the message transmission device 2100, and for realizing message transmission. An interface through which device 2100 interconnects with other devices, such as network devices. The physical interface may be a gigabit Ethernet (GE) interface, which may be used to interconnect the message transmission device 2100 with other devices. The logical interface may be an interface within the message transmission device 2100, which may be used to implement the message transmission device 2100. The device interconnection inside the text transmission device 2100. Easy to understand, communication interface 2106 It can be used to communicate between the message transmission device 2100 and other devices. For example, the communication interface 2106 is used to send and receive messages between the message transmission device 2100 and other devices. The communication interface 2106 can implement the aforementioned sending module 1820 and receiving module 1910. , sending module 1930 and other related functions. The communication interface 2106 may also include a transceiver for sending and receiving messages. The transceiver may also implement related functions of the aforementioned sending module 1820, receiving module 1910, sending module 1930, etc.

The bus 2108 may be any type of communication bus used to interconnect the processor 2102, the memory 2104, and the communication interface 2106, such as a system bus.

The above-mentioned devices may be arranged on separate chips, or at least part or all of them may be arranged on the same chip. Whether each device is independently installed on different chips or integrated on one or more chips often depends on the needs of product design. The embodiments of this application do not limit the specific implementation forms of the above devices.

The message transmission device 2100 shown in FIG. 21 is only an example, and the message transmission device 2100 may also include other components. The message transmission device 2100 transmits messages by executing all or part of the steps of the method provided in the above embodiments.

Embodiments of the present application provide a message transmission system. The message transmission system includes multiple network nodes. At least one network node among the multiple network nodes includes the message transmission system shown in Figure 18, Figure 20 or Figure 21. device.

Optionally, the message transmission system also includes a controller, which includes the message transmission device shown in Figure 19 or Figure 21.

Optionally, the message transmission system is as shown in Figure 1 or Figure 2.

Embodiments of the present application provide a computer-readable storage medium. A computer program is stored in the computer-readable storage medium. The computer program is executed (for example, executed by a network node, a controller, one or more processors, etc.) When, all or part of the steps of the message transmission method provided by the above method embodiment are implemented.

Embodiments of the present application provide a computer program product. The computer program product includes a program or code. When the program or code is executed (for example, executed by a network node, a controller, one or more processors, etc.), the following is implemented: All or part of the steps of the message transmission method provided by the above method embodiments.

Embodiments of the present application provide a chip, which includes programmable logic circuits and/or program instructions. When running, the chip implements all or part of the steps of the message transmission method provided in the above method embodiments.

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it may be implemented in whole or in part in the form of a computer program product including one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are generated in whole or in part. The computer may be a general purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another, for example, the computer instructions may be transferred from a website, computer, server, or data The center transmits to another website, computer, server or data center through wired (such as coaxial cable, optical fiber, digital subscriber line) or wireless (such as infrared, wireless, microwave, etc.) means. The computer-readable storage medium may be any available medium that can be accessed by a computer, or a data storage device such as a server, data center, or the like that includes one or more available media integrated therein. The available media may be magnetic media (eg, floppy disks, hard disks, tapes), optical media, or semiconductor media (eg, solid state drives), etc.

It should be understood that the term “at least one” in this application refers to one or more, and the term “plurality” refers to two or more. In this application, unless otherwise stated, the symbol "/" generally means or, for example, A/B can mean A or B. The term "and/or" in this application is only an association relationship describing related objects, indicating that there can be three relationships, for example, A and/or B, which can mean: A alone exists, A and B exist simultaneously, alone There are three situations B. In addition, in order to facilitate clear description, in this application, words such as “first”, “second” and “third” are used to distinguish the same or similar items with basically the same functions and effects. Those skilled in the art can understand that words such as “first”, “second” and “third” do not limit the number and execution order.

Different types of embodiments such as method embodiments and device embodiments provided in the embodiments of this application can all refer to each other, and the embodiments of this application do not limit this. The sequence of operations of the method embodiments provided by the embodiments of the present application can be adjusted appropriately, and the operations can also be increased or decreased in response to the situation. Any person familiar with the technical field can easily think of changes within the technical scope disclosed in the present application. All methods are covered by the protection scope of this application, and therefore will not be described again.

In the corresponding embodiments provided in this application, it should be understood that the disclosed devices can be implemented in other configurations. For example, the device embodiments described above are only illustrative. For example, the division of units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated. to another system, or some features can be ignored, or not implemented.

A unit described as a separate component may or may not be physically separate. A component described as a unit may or may not be a physical unit, and may be located in one place, or may be distributed to multiple network nodes. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

The above are only exemplary embodiments of the present application, but the protection scope of the present application is not limited thereto. Any person familiar with the technical field can easily think of various equivalents within the technical scope disclosed in the present application. Any modification or replacement shall be covered by the protection scope of this application. Therefore, the protection scope of this application should be subject to the protection scope of the claims.

Claims

A message transmission method, characterized in that it is applied to the first network node in the first deterministic network, and the method includes:

The first network node obtains a first message, the first message carries first type indication information and first bounded delay information, and the first type indication information is used to indicate the first bounded time delay. The type of delay information, the first bounded delay information is used to ensure the end-to-end deterministic delay of the first message in the first deterministic network;

The first network node forwards the first message according to the first type indication information and the first bounded delay information.
The method according to claim 1, characterized in that the first bounded delay information includes time resource information or service requirement information.
The method according to claim 2, characterized in that the time resource information includes at least one of the following: queue indication information, cycle indication information, time slot indication information, and priority information.
The method according to claim 2 or 3, characterized in that the service requirement information includes at least one of the following: delay requirement information, jitter requirement information, and deadline requirement information.
The method according to any one of claims 1 to 4, characterized in that the first network node forwards the first message according to the first type indication information and the first bounded delay information, include:

The first network node determines the type of the first bounded delay information according to the first type indication information;

The first network node determines a first resource in the first network node used to transmit the first message according to the first bounded delay information and the type of the first bounded delay information. ;

The first network node forwards the first message through the first resource.
The method according to any one of claims 1 to 5, characterized in that the first message also carries second bounded delay information and second type indication information, and the second type indication information is used to indicate The type of the second bounded delay information, the second bounded delay information is used to ensure the end-to-end deterministic delay of the first message in the first deterministic network, the The second type indication information and the second bounded delay information are used by a second network node to forward the first message, and the second network node is in the first deterministic network.
The method according to claim 6, characterized in that the type of the second bounded delay information is different from the type of the first bounded delay information.
The method according to any one of claims 1 to 7, characterized in that the first network node is an entry node of the first deterministic network, and the first network node obtains the first message, including:

The first network node receives the second message;

The first network node receives a control message sent by the controller, and the control message includes the first type indication information. information and the first bounded delay information;

The first network node generates the first message according to the second message, the first type indication information and the first bounded delay information.
The method according to claim 8, characterized in that, before the first network node receives the control message sent by the controller, the method further includes:

The first network node sends the capability information of the first network node to the controller, and the controller is configured to determine the first type indication information and the first bounded delay information based on the capability information. .
The method according to any one of claims 1 to 7, characterized in that the first network node is an entry node of the first deterministic network, and the first network node obtains the first message, including:

The first network node receives a second message, the second message comes from a second deterministic network, and the second message carries target bounded delay information;

The first network node obtains the first type indication information and the first bounded delay information according to the target bounded delay information;

The first network node generates the first message according to the second message, the first type indication information and the first bounded delay information.
The method according to any one of claims 1 to 10, characterized in that,

The first message is an Internet Protocol version 6 IPv6 message, and the first type indication information and the first bounded delay information are both located in the IPv6 extension header of the first message.
The method according to claim 11, characterized in that the IPv6 extension header includes any one of the following: hop-by-hop header HBH, destination option header DOH, and segment routing header SRH.
The method according to claim 12, characterized in that the IPv6 extension header is the HBH or the DOH, and the first type indication information and the first bounded delay information are located in the IPv6 extension header. header options field.
The method according to claim 12, characterized in that the IPv6 extension header is the SRH, the SRH includes a segment list, and the first type indication information and the first bounded delay information are located at in the paragraph list.
The method of claim 14, wherein the segment list includes a first segment identifier SID, and the first type indication information and the first bounded delay information are located in parameters of the first SID. in the field.
The method according to claim 12, characterized in that the IPv6 extension header is the SRH, the SRH includes a type length value TLV field, the first type indication information and the first bounded delay information are located in the TLV field.
The method according to claim 16, characterized in that the SRH further includes a segment list, and the segment list includes Including the first segment identification SID, the first bounded delay information and the first SID both correspond to the first network node, and the type of the first SID is a target type.
The method according to any one of claims 11 to 17, characterized in that the first message also carries slice indication information, and the slice indication information is located in the IPv6 extension header of the first message.
The method according to any one of claims 1 to 10, characterized in that,

The first message is a multi-protocol label switching MPLS message, and the first type indication information and the first bounded delay information are both located in the MPLS extension header of the first message.
A message transmission method, characterized in that the method includes:

The controller receives capability information of a first network node in the first deterministic network;

The controller obtains first type indication information and first bounded delay information according to the capability information. The first type indication information is used to indicate the type of the first bounded delay information. The first The bounded delay information is used to ensure the end-to-end deterministic delay of the packet carrying the first bounded delay information in the first deterministic network;

The controller sends a control message to the first network node, where the control message includes the first type indication information and the first bounded delay information.
The method according to claim 20, characterized in that the first bounded delay information includes time resource information or service requirement information.
The method according to claim 21, characterized in that the time resource information includes at least one of the following: queue indication information, cycle indication information, time slot indication information, and priority information.
The method according to claim 21 or 22, characterized in that the service requirement information includes at least one of the following: delay requirement information, jitter requirement information, and deadline requirement information.
The method according to any one of claims 20 to 23, characterized in that,

The controller receiving capability information of a first network node includes: the controller receiving capability information of multiple network nodes, the multiple network nodes being in the first deterministic network, and the multiple network nodes including the first network node;

The controller obtains the first type indication information and the first bounded delay information according to the capability information, including: the controller obtains at least one bounded delay information and at least one bounded delay information according to the capability information of the plurality of network nodes. A type indication information, the at least one bounded delay information corresponds to the at least one type indication information, each type indication information is used to indicate the corresponding type of the bounded delay information, the At least one bounded delay information includes the first bounded delay information, and the at least one type indication information includes the first type indication information, wherein the control message includes the at least one bounded delay information. information and the at least one type indication information.
The method of claim 24, wherein the at least one bounded delay information further includes a second Bounded delay information, the at least one type indication information also includes second type indication information, the second type indication information is used to indicate the type of the second bounded delay information, the second bounded delay information The delay information is used to ensure the end-to-end deterministic delay of the message carrying the second bounded delay information in the first deterministic network. The type of the second bounded delay information is the same as the type of the second bounded delay information. The first bounded delay information is of different types.
The method according to claim 24 or 25, characterized in that the second bounded delay information and the first bounded delay information are arranged sequentially in the control message, and the second type The indication information and the first type indication information are arranged in sequence in the control message, and the arrangement order of the second type indication information and the first type indication information is consistent with the second bounded delay information and The first bounded delay information is arranged in the same order.
The method of claim 26, wherein the control message includes a first type length value TLV field and a second TLV field arranged in sequence, the first type indication information and the first bounded The delay information is located in the first TLV field, and the second type indication information and the second bounded delay information are located in the second TLV field.
The method according to claim 26, characterized in that:

The control message includes an information stack. The information stack includes a first information item and a second information item arranged in sequence. The first information item includes the first type indication information and the first bounded time. Delay information, the second information item includes the second type indication information and the second bounded delay information.
A message transmission device, characterized in that it is applied to a first network node in a first deterministic network, and the device includes:

A processing module configured to obtain a first message, where the first message carries first type indication information and first bounded delay information, and the first type indication information is used to indicate the first bounded delay. The type of information, the first bounded delay information is used to ensure the end-to-end deterministic delay of the first message in the first deterministic network;

A sending module, configured to forward the first message according to the first type indication information and the first bounded delay information.
The apparatus according to claim 29, wherein the first bounded delay information includes time resource information or service requirement information.
The device according to claim 30, wherein the time resource information includes at least one of the following: queue indication information, cycle indication information, time slot indication information, and priority information.
The device according to claim 30 or 31, characterized in that the service requirement information includes at least one of the following: delay requirement information, jitter requirement information, and deadline requirement information.
The device according to any one of claims 29 to 32, characterized in that the sending module is used for:

Determine the type of the first bounded delay information according to the first type indication information;

According to the first bounded delay information and the type of the first bounded delay information, it is determined that the first network node The first resource used to transmit the first message;

Forward the first message through the first resource.
The device according to any one of claims 29 to 33, characterized in that the first message also carries second bounded delay information and second type indication information, and the second type indication information is used to indicate The type of the second bounded delay information, the second bounded delay information is used to ensure the end-to-end deterministic delay of the first message in the first deterministic network, the The second type indication information and the second bounded delay information are used by a second network node to forward the first message, and the second network node is in the first deterministic network.
The apparatus according to claim 34, wherein the type of the second bounded delay information is different from the type of the first bounded delay information.
The device according to any one of claims 29 to 35, wherein the first network node is an entry node of the first deterministic network, and the processing module is used to:

receive the second message;

Receive a control message sent by the controller, where the control message includes the first type indication information and the first bounded delay information;

The first message is generated according to the second message, the first type indication information and the first bounded delay information.
The device according to claim 36, characterized in that:

The sending module is further configured to send the capability information of the first network node to the controller, and the controller is configured to determine the first type indication information and the first bounded time based on the capability information. delay information.
The device according to any one of claims 29 to 35, wherein the first network node is an entry node of the first deterministic network, and the processing module is used to:

Receive a second message, the second message comes from the second deterministic network, and the second message carries target bounded delay information;

Obtain the first type indication information and the first bounded delay information according to the target bounded delay information;

The first message is generated according to the second message, the first type indication information and the first bounded delay information.
The device according to any one of claims 29 to 38, characterized in that,

The first message is an Internet Protocol version 6 IPv6 message, and the first type indication information and the first bounded delay information are both located in the IPv6 extension header of the first message.
The device according to claim 39, wherein the IPv6 extension header includes any one of the following: hop-by-hop header HBH, destination option header DOH, and segment routing header SRH.
The device according to claim 40, wherein the IPv6 extension header is the HBH or the DOH, and the first type indication information and the first bounded delay information are located in the IPv6 extension header. header options field.
The device according to claim 40, characterized in that the IPv6 extension header is the SRH, the SRH includes a segment list, and the first type indication information and the first bounded delay information are located at in the paragraph list.
The device according to claim 42, wherein the segment list includes a first segment identifier SID, and the first type indication information and the first bounded delay information are located in parameters of the first SID. in the field.
The device according to claim 40, characterized in that the IPv6 extension header is the SRH, the SRH includes a type length value TLV field, the first type indication information and the first bounded delay information are located in the TLV field.
The device according to claim 44, wherein the SRH further includes a segment list, the segment list includes a first segment identification SID, and the first bounded delay information and the first SID are both related to the first segment identifier. Corresponding to the first network node, the type of the first SID is a target type.
The device according to any one of claims 39 to 45, characterized in that the first message also carries slice indication information, and the slice indication information is located in the IPv6 extension header of the first message.
The method according to any one of claims 29 to 38, characterized in that,

The first message is a multi-protocol label switching MPLS message, and the first type indication information and the first bounded delay information are both located in the MPLS extension header of the first message.
A message transmission device, characterized in that it is applied to a controller, and the device includes:

A receiving module, configured to receive capability information of a first network node in the first deterministic network;

A processing module configured to obtain first type indication information and first bounded delay information according to the capability information, where the first type indication information is used to indicate the type of the first bounded delay information, and the third A bounded delay information is used to ensure the end-to-end deterministic delay of the message carrying the first bounded delay information in the first deterministic network;

A sending module, configured to send a control message to the first network node, where the control message includes the first type indication information and the first bounded delay information.
The apparatus according to claim 48, wherein the first bounded delay information includes time resource information or service requirement information.
The device according to claim 49, wherein the time resource information includes at least one of the following: queue indication information, cycle indication information, time slot indication information, and priority information.
The device according to claim 49 or 50, characterized in that the service requirement information includes at least one of the following: delay requirement information, jitter requirement information, and deadline requirement information.
The device according to any one of claims 48 to 51, characterized in that,

The receiving module is configured to receive capability information of multiple network nodes, the multiple network nodes are in the first deterministic network, and the multiple network nodes include the first network node;

The processing module is configured to obtain at least one bounded delay information and at least one type indication information according to the capability information of the plurality of network nodes, and the at least one bounded delay information is consistent with the at least one type indication information. Correspondingly, each type indication information is used to indicate the corresponding type of bounded delay information, the at least one bounded delay information includes the first bounded delay information, and the at least one type The indication information includes the first type of indication information, wherein the control message includes the at least one bounded delay information and the at least one type of indication information.
The apparatus according to claim 52, wherein the at least one bounded delay information further includes second bounded delay information, the at least one type indication information further includes second type indication information, and the third The second type indication information is used to indicate the type of the second bounded delay information, and the second bounded delay information is used to ensure that the message carrying the second bounded delay information is processed in the first determined The type of the second bounded delay information is different from the type of the first bounded delay information.
The device according to claim 52 or 53, characterized in that the second bounded delay information and the first bounded delay information are arranged sequentially in the control message, and the second type The indication information and the first type indication information are arranged in sequence in the control message, and the arrangement order of the second type indication information and the first type indication information is consistent with the second bounded delay information and The first bounded delay information is arranged in the same order.
The device according to claim 54, wherein the control message includes a first type length value TLV field and a second TLV field arranged in sequence, the first type indication information and the first bounded The delay information is located in the first TLV field, and the second type indication information and the second bounded delay information are located in the second TLV field.
The device according to claim 54, characterized in that:

The control message includes an information stack. The information stack includes a first information item and a second information item arranged in sequence. The first information item includes the first type indication information and the first bounded time. Delay information, the second information item includes the second type indication information and the second bounded delay information.
A message transmission device, characterized in that it is applied to a network node and includes a memory and a processor;

The memory is used to store computer programs;

The processor is configured to execute a computer program stored in the memory so that the message transmission device executes the message transmission method according to any one of claims 1 to 28.
A message transmission system, characterized in that the system includes a plurality of network nodes, and among the plurality of network nodes At least one network node includes the message transmission device according to any one of claims 29 to 47 and 57.
The system according to claim 58, characterized in that the system further includes a controller, and the controller includes the message transmission device according to any one of claims 48 to 57.
A computer-readable storage medium, characterized in that a computer program is stored in the computer-readable storage medium, and when the computer program is executed, the message transmission method according to any one of claims 1 to 28 is implemented.
A computer program product, characterized in that the computer program product includes a program or code, and when the program or code is executed, the message transmission method according to any one of claims 1 to 28 is implemented.