CN117336253A

CN117336253A - Message transmission method, device and system

Info

Publication number: CN117336253A
Application number: CN202211216213.9A
Authority: CN
Inventors: 杨帆; 周天然; 耿雪松; 常晓东; 陈爽
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2022-06-30
Filing date: 2022-09-30
Publication date: 2024-01-02
Also published as: WO2024001733A1

Abstract

A message transmission method, device and system belong to the technical field of networks. The method comprises the following steps: a first network node in a first deterministic network obtains a first message and forwards the first message according to first type indication information and first bounded time delay information (bounded latency information, BLI) carried by the first message. The first type indication information is used for indicating the type of first bounded time delay information, and the first bounded time delay information is used for guaranteeing end-to-end deterministic time delay of the first message in the first deterministic network. The message transmission scheme can ensure the end-to-end deterministic time delay of the first message in the first deterministic network.

Description

Message transmission method, device and system

The present application claims priority to chinese patent application No. 202210771414.9 entitled "method, apparatus, and system for message processing", whose application date is 2022, month 06, 30, and the entire contents of which are incorporated herein by reference.

Technical Field

The present invention relates to the field of network technologies, and in particular, to a method, an apparatus, and a system for transmitting a message.

Background

In an industrial internet scenario, an automation control service puts deterministic demands 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 the automatic control service in the network.

Disclosure of Invention

The application provides a message transmission method, device and system, which can ensure the certainty of the end-to-end delay of a message in a deterministic network (namely, ensure the end-to-end deterministic delay of the message in the deterministic network). The technical scheme of the application is as follows:

in a first aspect, a method for transmitting a message is provided, which is applied to a first network node in a first deterministic network, and the method includes: the method comprises the steps that a first network node obtains a first message, wherein the first message carries first type indication information and first bounded time delay information, the first type indication information is used for indicating the type of the first bounded time delay information, and the first bounded time delay information is used for guaranteeing end-to-end deterministic time delay of the first message in a first deterministic network; the first network node forwards the first message according to the first type indication information and the first bounded time delay information. Wherein the first message is a service message of the first service flow.

According to the technical scheme, the first bounded time delay information and the first type indication information for indicating the first bounded time delay information are carried in the first message transmitted in the first deterministic network, so that the network node in the first deterministic network is assisted to forward the first message, and the end-to-end deterministic time delay of the first message in the first deterministic network is ensured.

Optionally, the first bounded latency information includes time resource information or service requirement information. The time resource information is used for indicating resources for transmitting the first message in the network node. The service requirement information is used for indicating the service requirement of the first message. The time resource information is bottom layer resource information or abstract resource information, the bottom layer resource information directly indicates resources for transmitting the first message in the network node, a mapping relation exists between the abstract resource information and the bottom layer resource information, and the abstract resource information indirectly and directly indicates the resources for transmitting the first message in the network node through the mapping relation.

Optionally, the time resource information includes at least one of: queue indication information, period indication information, slot indication information, priority information. The queue indication information is used for indicating a queue for transmitting a first message in the network node. The cycle indication information is used for indicating a cycle period of transmitting the first message in the network node. The time slot indication information is used for indicating a time slot for transmitting the first message in the network node. The priority information is used for indicating the priority of the first message so as to indicate a queue corresponding to the priority.

Optionally, the service requirement information includes at least one of: delay requirement information, jitter requirement information, deadline requirement information. The delay requirement information is used for indicating the delay requirement of the first message. The jitter requirement information is used to indicate the jitter requirement of the first traffic stream. The deadline requirement information is used for indicating the deadline requirement of the first message.

Optionally, the latency requirement information includes at least one of: end-to-end delay requirement information and local delay requirement information. The end-to-end delay requirement information is used to indicate an 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 for indicating the delay requirement of the first message in the corresponding network node.

Optionally, the jitter requirement information includes at least one of: end-to-end jitter requirement information, local jitter requirement information. The end-to-end jitter requirement information is used to indicate an end-to-end jitter requirement of the first traffic stream in the first deterministic network. The local jitter requirement information corresponds to at least one network node in the first deterministic network, the local latency requirement information being used to indicate the jitter requirement of the first traffic 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: end-to-end deadline requirement information, local deadline requirement information. The end-to-end deadline requirement information is for indicating a deadline requirement for the first message to leave the first deterministic network. The local deadline requirement information corresponds to a network node, and the local deadline requirement information is used for indicating the deadline requirement of the first message leaving the corresponding network node.

Optionally, the first network node forwards the first message according to the first type indication information and the first bounded time delay information, including: the first network node determines the type of first bounded time delay information according to the first type indication information; the first network node determines a first resource for transmitting a first message in the first network node according to the first bounded time delay information and the type of the first bounded time delay information; the first network node forwards the first message through the first resource. For example, the first network node determines that the first bounded latency information includes time resource information according to the first type indication information, and the time resource information is abstract resource information, and the first network node determines the first resource according to the time resource information and the local mapping relation. For another example, the first network node determines that the first bounded latency information includes service requirement information according to the first type indication information, the first network node determines resources in the first network node that satisfy the service requirement information, and the first network node determines first resources among the resources that satisfy the service requirement information.

According to the technical scheme, the first network node determines the first resource for transmitting the first message in the first network node according to the first type indication information and the first bounded time delay information, and forwards the first message through the first resource, so that the end-to-end deterministic time delay of the first message in the first deterministic network is guaranteed.

Optionally, the first packet further carries second bounded time delay information and second type indication information, the second type indication information is used for indicating a type of the second bounded time delay information, the second bounded time delay information is used for guaranteeing end-to-end deterministic time delay of the first packet in the first deterministic network, the second type indication information and the second bounded time delay information are used for forwarding the first packet by the second network node, and the second network 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 time delay information is different from the type of the first bounded time delay information. For example, the first bounded latency information is time resource information and the second bounded latency information is traffic demand information. For another example, the first bounded latency information is queue indication information and the second bounded latency information is period indication information.

Optionally, the first network node is an ingress node of a first deterministic network, and the first network node obtains a first packet, including: the first network node receives the second message; the method comprises the steps that a first network node receives a control message sent by a controller, wherein the control message comprises first type indication information and first bounded time delay information; the first network node generates a first message according to the second message, the first type indication information and the first bounded time delay information. For example, the first network node adds the first type indication information and the first bounded time delay information to the second message to obtain a first message. Wherein the second message is a service message of the first service flow.

According to the technical scheme, the entry node of the first deterministic network generates the first message carrying the first type indication information and the first bounded time delay information according to the received second message and the control message, so that a network node (such as the first network node) in the first deterministic network can conveniently forward the first message according to the first bounded time delay information and the first type indication information, and the end-to-end deterministic time delay of the first message in the first deterministic network is guaranteed.

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 a controller, and the controller is used for determining first type indication information and first bounded time delay information according to the capability information.

Optionally, the first network node is an ingress node of a first deterministic network, and the first network node obtains a first packet, including: the first network node receives a second message, wherein the second message is from a second deterministic network, and the second message carries target bounded time delay information; the first network node acquires first type indication information and first bounded time delay information according to target bounded time delay information; the first network node generates a first message according to the second message, the first type indication information and the first bounded time delay information. For example, the first network node adds the first type indication information and the first bounded time delay information to the second message to obtain a first message.

According to the technical scheme, the entry node of the first deterministic network generates the first message carrying the first type indication information and the first bounded time delay information according to the received second message and the target bounded time delay information carried by the second message, so that the network node (such as the first network node) in the first deterministic network can conveniently forward the first message according to the first bounded time delay information and the first type indication information, and the end-to-end deterministic time delay of the first message in the first deterministic network is guaranteed.

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

Optionally, the IPv6 extension header includes any one of the following: hop-by-hop header (hop by hop header, HBH), destination option header (destination options header, DOH), segment routing header (segment routing header, SRH). The hop-by-hop header is also referred to as hop-by-hop option header (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 latency information are both located in an option (option) field of the IPv6 extension header.

Optionally, the IPv6 extension header is an SRH, where the SRH includes a segment list (segment list), and the first type indication information and the first bounded latency information are located in the segment list.

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

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

Optionally, the SRH further includes a segment list, where the segment list includes a first SID, the first bounded time delay information and the first SID both correspond to the first network node, the type of the first SID is a target type, and the target type indicates that the TLV field of the SRH carries the bounded time delay information corresponding to the first SID.

Optionally, the TLV field carries a plurality of type indication information and a plurality of bounded time delay information, where the plurality of type indication information corresponds to the plurality of bounded time delay information one-to-one, each type indication information is used to indicate a type of the corresponding bounded time delay information, the plurality of bounded time delay information includes first bounded time delay information, and the plurality of type indication information includes first type indication information; the segment list comprises a plurality of SIDs, the SIDs are in one-to-one correspondence with a plurality of network nodes along the first message, the plurality of bounded time delay information is in one-to-one correspondence with a plurality of network nodes along the first message, the number of the bounded time delay information is not greater than that of the SIDs, and the type of the SID corresponding to the bounded time delay information in the SIDs is a target type. That is, the plurality of SIDs are in one-to-one correspondence with a plurality of network nodes along the first packet, and the plurality of bounded time delay information is in one-to-one correspondence with all or part of the plurality of network nodes, so that the plurality of bounded time delay information is in one-to-one correspondence with all or part of the plurality of SIDs, and the SID type corresponding to the bounded time delay information in the plurality of SIDs is the target type.

Optionally, the segment list includes a plurality of SIDs, where the plurality of SIDs correspond to a plurality of network nodes along the first packet in a one-to-one manner, the first bounded time delay information corresponds to the plurality of network nodes, and types of the plurality of SIDs are all target types.

Optionally, the first network node is an egress node of the first deterministic network, the first packet is a packet of a segmented routing internet protocol version 6 (segment routing internet protocol version, srv 6), the SRH of the first packet includes a segment list and a TLV field, the segment list includes a plurality of SIDs, the plurality of SIDs are in one-to-one correspondence with a plurality of network nodes along the first packet, the first type indication information and the first bounded time delay information are both located in the TLV field, the first bounded time delay information corresponds only to the first network node, and a type of SID corresponding only to the first network node among the plurality of SIDs is a target type. For example, the first message carries one bounded latency information corresponding only to the egress node of the first deterministic network.

Optionally, the first message further carries slice indication information, where the slice indication information is located in an IPv6 extension header of the first message.

According to the technical scheme, the first message carries the slice indication information, the first bounded time delay information and the first type indication information for indicating the first bounded time delay information, and the network node in the first deterministic network forwards the first message according to the slice indication information, the first bounded time delay information and the first type indication information, so that the end-to-end deterministic time delay of the first message in the first deterministic network is ensured, and the deterministic time delay of the first message in a network slice indicated by the slice indication information is ensured.

Optionally, the slice indication information and the first bounded time delay information are located in the same IPv6 extension header of the first message; or, the slice indication information and the first bounded time delay information are located in different IPv6 extension headers of the first message. The first type indication information and the first bounded time 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 time delay information are both located in the SRH of the first packet.

Optionally, the first message is a multiprotocol label switching (multiprotocol label switching, MPLS) message, and the first type indication information and the first bounded time delay information are located in an MPLS Extension Header (EH) of the first message.

In a second aspect, a method for transmitting a message is provided, where the method includes: the controller receives capability information of a first network node, the first network node being in a first deterministic network; the controller acquires first type indication information and first bounded time delay information according to the capability information, wherein the first type indication information is used for indicating the type of the first bounded time delay information, and the first bounded time delay information is used for guaranteeing end-to-end deterministic time delay of a message carrying the first bounded time delay information in a first deterministic network; the controller sends a control message to the first network node, the control message including first type indication information and first bounded time delay information. For example, the controller generates a control message according to the first type indication information and the first bounded time delay information, and then sends the control message to the first network node. Optionally, the first network node is an ingress node of a first deterministic network.

According to the technical scheme, the controller determines the first type indication information and the first bounded time delay information according to the capability information of the first network node, and sends the control message comprising the first type indication information and the first bounded time delay information to the first network node, so that the first network node can conveniently forward the service message carrying the first type indication information and the first bounded time delay information, and the end-to-end deterministic time delay of the service message in the first deterministic network is ensured.

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

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

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

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

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

Optionally, the deadline requirement information includes at least one of: 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 a plurality of network nodes, the plurality of network nodes being in a first deterministic network, the plurality of network nodes comprising a first network node; correspondingly, the controller acquires first type indication information and first bounded time delay information according to the capability information, and the method comprises the following steps: the controller obtains at least one bounded time 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 time delay information corresponds to the at least one type indication information one by one, each type indication information is used for indicating the type of the corresponding bounded time delay information, the at least one bounded time delay information comprises first bounded time delay information, the at least one type indication information comprises first type indication information, and the control message comprises the at least one bounded time delay information and the at least one type indication information.

According to the technical scheme, the controller obtains at least one bounded time delay information and at least one type indication information according to capability information of a plurality of network nodes, and sends a control message comprising the at least one bounded time delay information and the at least one type indication information to an inlet node of a first deterministic network, after the inlet node of the first deterministic network receives the control message, the inlet node of the first deterministic network can generate a first message carrying the at least one type indication information and the at least one bounded time delay information according to the control message, so that the network nodes in the first deterministic network can forward the first message according to the at least one bounded time delay information and the at least one type indication information, and end-to-end deterministic time delay of the first message in the first deterministic network is guaranteed.

Optionally, the at least one bounded time delay information further includes second bounded time delay information, the at least one type of indication information further includes second type of indication information, the second type of indication information is used for indicating a type of the second bounded time delay information, the second bounded time delay information is used for guaranteeing end-to-end deterministic time delay of a message carrying the second bounded time delay information in the first deterministic network, and the type of the second bounded time delay information is different from the type of the first bounded time delay information.

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

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

Optionally, the control message includes an information stack, where the information stack includes a first information item and a second information item sequentially arranged, the first information item includes a first type of indication information and a first bounded time delay information, and the second information item includes a second type of indication information and a second bounded time delay information. In this way, the second bounded time delay information and the first bounded time delay information are sequentially arranged.

In a third aspect, a message transmission apparatus is provided, comprising respective modules for performing the method as provided in the first aspect or any of the alternatives of the first aspect.

In a fourth aspect, there is provided a message transmission apparatus comprising means for performing the method as provided in the second or any alternative of the second aspect.

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

In a fifth aspect, a message transmission device is provided, including a memory and a processor; the memory is used for storing a computer program; the processor is configured to execute a computer program stored in the memory to cause the messaging device to perform a method as provided in the first aspect or any of the alternatives of the first aspect.

In a sixth aspect, a message transmission device is provided, including a memory and a processor; the memory is used for storing a computer program; the processor is configured to execute a computer program stored in the memory to cause the messaging device to perform a method as provided in the second aspect or any alternative of the second aspect described above.

In a seventh aspect, a message transmission system is provided, the message transmission system comprising a plurality of network nodes, at least one of the plurality of network nodes comprising a message transmission apparatus as provided in the third or fifth aspect above.

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

In an eighth aspect, there is provided a computer readable storage medium having stored therein a computer program which, when executed, implements a method as provided in the above first aspect or any of the alternatives of the first aspect, or implements a method as provided in the above second aspect or any of the alternatives of the second aspect.

A ninth aspect provides a computer program product comprising a program or code which when executed implements a method as provided in the first aspect or any of the alternatives of the first aspect, or implements a method as provided in the second aspect or any of the alternatives of the second aspect.

In a tenth aspect, there is provided a chip comprising programmable logic circuitry and/or program instructions, the chip being operable to implement a method as provided in or as provided in any of the above-described first aspect or the alternatives of the first aspect.

The beneficial effects that this application provided technical scheme brought are:

Drawings

Fig. 1 is a schematic diagram of a message transmission system according to an embodiment of the present application;

fig. 2 is a schematic diagram of another message transmission system according to an embodiment of the present application;

FIG. 3 is a diagram of a BLI data field provided in an embodiment of the present application;

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

fig. 5 is a schematic diagram of a first packet according to an embodiment of the present application;

Fig. 6 is a schematic diagram of MPLS EH provided in an embodiment of the present application;

fig. 7 is a schematic diagram of another first packet provided in an embodiment of the present application;

fig. 8 is a schematic diagram of still another first packet according to an embodiment of the present application;

FIG. 9 is a schematic diagram of an SRH according to an embodiment of the present application;

FIG. 10 is a schematic diagram of another SRH provided in an embodiment of the present application;

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

FIG. 12 is a schematic diagram of yet another SRH provided by an embodiment of the present application;

fig. 13 is a flowchart of a message transmission method provided in an embodiment of the present application;

fig. 14 is a schematic diagram of yet another first packet provided in an embodiment of the present application;

fig. 15 is a flowchart of another method for transmitting a message according to an embodiment of the present application;

fig. 16 is a schematic diagram of message transmission provided in an embodiment of the present application;

fig. 17 is a schematic diagram of another message transmission provided in an embodiment of the present application;

fig. 18 is a schematic diagram of a message transmission device according to an embodiment of the present application;

fig. 19 is a schematic diagram of another message transmission apparatus according to an embodiment of the present application;

fig. 20 is a schematic diagram of another message transmission apparatus according to an embodiment of the present application;

Fig. 21 is a schematic diagram of another message transmission apparatus according to an embodiment of the present application.

Detailed Description

Embodiments of the present application will be further described below with reference to the accompanying drawings.

In industrial internet scenarios, automation control services, in particular precise motion control (motion control) services, place deterministic demands on the end-to-end delay of the network. For example, the International electrotechnical Commission (International Electro technical Commission, IEC)/institute of Electrical and electronics Engineers (Institute of Electrical and Electronics Engineers, IEEE) 60802 Industrial Automation use case document, IEC manufacturing traffic type document, defines requirements for business transport assurance: deadlines (deadlines), latency, bandwidth. These requirements are used to guarantee the certainty of the end-to-end delay of the traffic in the network, or the end-to-end delay is bounded (i.e., the end-to-end delay is less than the delay threshold).

IEEE time sensitive network (time scalar network, TSN) technology and internet engineering task force (Internet Engineering Task Force, IETF) deterministic network (deterministic networking, detNet) technology are both in an effort to develop network technologies that promote traffic forwarding from "best-effort (BE)" to "on-time, accurate, fast", control and reduce end-to-end latency of traffic. The IEEE TSN technology is an ethernet technology developed by the TSN group in the IEEE 802.1 working group, which allows time-synchronized low-latency services to be implemented over 802 networks. IETF DetNet technology is a network technology developed by the IETF DetNet working group that focuses on implementing deterministic paths on layer 2 bridging and layer 3 routing segments that can provide worst-case boundaries for latency, packet loss, jitter, etc., thereby providing end-to-end deterministic latency (i.e., guaranteeing the certainty of end-to-end latency). The goal of the DetNet working group is to extend deterministic network technology to wide area networks through Internet protocol (internet protocol, IP) technology, multiprotocol Label switching (multi-protocol label switching, MPLS) technology, and the like.

Both the IEEE TSN technology and the IETF DetNet technology are network technologies for guaranteeing the end-to-end deterministic latency development of traffic. However, in the traffic forwarding process, a packet transmission scheme that can be applied to a deterministic network is needed to forward traffic with deterministic requirements to guarantee end-to-end deterministic latency of these traffic in the deterministic network.

The method and the device for transmitting the message provided by the application have the advantages that the message transmitted in the deterministic network carries the bounded time delay information and the type indication information for indicating the type of the bounded time delay information, so that the network node in the deterministic network is assisted to transmit the message, and the end-to-end deterministic time delay of the message in the deterministic network is ensured. For example, a first network node in a first deterministic network acquires a first message carrying first type indication information and first bounded time delay information, forwards the first message according to the first type indication information and the first bounded time delay information, the first type indication information is used for indicating the type of the first bounded time delay information, and the first bounded time delay information is used for guaranteeing end-to-end deterministic time delay of the first message in the first deterministic network, so that end-to-end deterministic time delay of the first message in the first deterministic network is guaranteed. The first deterministic network is a TSN, but may be other deterministic networks that may be developed in the future to guarantee latency. That is, the message transmission scheme provided in the present application may be applied to deterministic networks that have been developed, and may also be applied to deterministic networks that may be developed in the future.

The technical scheme of the application is described below, and first, an application scenario of the embodiment of the application is described.

An application scenario of an embodiment of the present application provides a message transmission system, which includes a plurality of network nodes connected by communication. The network node may be a physical node or a logical node. The physical node is a network device such as a switch or a router. Logical nodes are functional modules in the network device, e.g., logical nodes are virtual switches, virtual routers, etc. deployed in the network device.

In an embodiment of the present application, the packet transfer system includes at least one deterministic network (deterministic networking, detNet) that is a TSN, but may also be other detnets for guaranteeing latency. When the messaging system includes a plurality of deterministic networks: the plurality of deterministic networks are deterministic networks based on the same deterministic technique, e.g., the plurality of deterministic networks are all TSNs; alternatively, the plurality of deterministic networks include deterministic networks based on different deterministic techniques, e.g., some of the plurality of deterministic networks are TSNs and others are other detnets for guaranteeing latency. Optionally, each deterministic network is a communication network such as a data center network (data center network, DCN), metropolitan area network, wide area network, or campus network. Further, the data plane (data plane) of each deterministic network is IPv6 or MPLS, which IPv6 may be SRv6 or other IPv6. Each deterministic network includes at least one network node in the messaging system, each deterministic network includes an edge network node and may also include a core network node. 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 further includes at least one controller, each controller is connected to at least one network node in the message transmission system, and each controller is configured to control the network node to which the controller is connected. In one implementation, the message transmission system includes a deterministic network and a controller located within or outside the deterministic network, the controller being communicatively coupled to network nodes in the deterministic network. In another implementation, the message transmission system includes a plurality of deterministic networks and a controller located outside the plurality of deterministic networks, the controller communicatively coupled to a network node in the plurality of deterministic networks. In another implementation manner, the message transmission system comprises a plurality of deterministic networks and a plurality of controllers, wherein the controllers comprise inter-domain controllers and a plurality of intra-domain controllers, the intra-domain controllers are located in the deterministic networks in a one-to-one correspondence manner, and each intra-domain controller is in communication connection with a network node in the deterministic network where the intra-domain controller is located so as to control the network node in the deterministic network where the intra-domain controller is located; the inter-domain controller is communicatively coupled to the plurality of intra-domain controllers to control network nodes in the deterministic network via the intra-domain controllers. The controller integrates functions of network management, service control, network analysis and the like, and can be integrated in network equipment or independent of the network equipment. For example, the controller is a functional module deployed in a server, or is a server cluster formed by a plurality of servers, or is a cloud computing service center. When the messaging system includes multiple controllers, all or part of the multiple controllers may be deployed in a server.

In the embodiment of the application, the deterministic network comprises a transmission path, and the transmission path comprises a plurality of network nodes. The network nodes on the transmission path comprise, in terms of the transmission direction, an ingress (ingress) node, an egress (egress) node and at least one intermediate (transit) node located between the ingress node and the egress node. The number of intermediate nodes is different according to the length of the transmission path, or the transmission path only includes the entry node and the exit node, but does not include the intermediate node. The references herein to network nodes, ingress nodes, intermediate nodes, egress nodes, transmission paths, etc. are merely exemplary, and in some implementations, network nodes are also referred to as network devices, forwarding nodes, forwarding devices, gateway nodes, gateway devices, routing nodes, routing devices, etc. Ingress nodes are also referred to as ingress devices, head nodes (head nodes), head node devices, head nodes, head node devices, etc. The intermediate nodes are also referred to as transit nodes, transit devices, intermediate devices, etc. The egress node is also referred to as an egress device, end node (end node), end node device, etc.; the transmission path is also called a forwarding path, a communication tunnel, or the like. For example, the transmission path is a segment routing traffic engineering (segment routing traffic engineering, SR-TE) tunnel, a traffic engineering extension based resource reservation protocol (resource reservation protocol-traffic engineering, RSVP-TE) tunnel, a Segment Routing (SR) tunnel, or an internet protocol version 6segment routing (internet protocol version 6segment routing,SRv6) tunnel, etc.

As an example, fig. 1 shows a schematic diagram of a message transmission system provided in an embodiment of the present application. The message transmission system comprises a deterministic network 1 and a controller 300, the controller 300 being located outside the deterministic network 1. Deterministic network 1 includes network nodes 101-103, and controller 300 is communicatively coupled to network nodes 101-103. Network nodes 101 to 103 are all network nodes supporting the network protocol corresponding to deterministic network 1. For example, deterministic network 1 is a TSN and network nodes 101-103 are all network nodes supporting the TSN protocol (e.g., referred to as TSN nodes). Network nodes that do not support the network protocol corresponding to deterministic network 1 may also be included in deterministic network 1, such as to the left of network node 101, between network node 101 and network node 102, between network node 102 and network node 103, to the right of network node 103, etc., which are not shown in fig. 1 for simplicity. Furthermore, the data plane of deterministic network 1 may be IPv6 or MPLS. Illustratively, 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 SRv DetNet), TSN over MPLS DetNet (TSN based on MPLS DetNet). For a certain traffic flow, the transmission path S1 of the traffic flow in the deterministic network 1 is 101- >102- >103, the network node 101 is an ingress node, the network node 102 is an intermediate node, and the network node 103 is an egress node. Network node 101 and network node 103 may each be PE devices and network node 102 may be a P device.

Fig. 1 illustrates that the messaging system includes a deterministic network and a controller, and that 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 the application may further include a plurality of deterministic networks, and the message transmission system is described below by taking two deterministic networks as an example.

As another example, fig. 2 shows a schematic diagram of another packet transmission system provided in an embodiment of the present application. The message transmission system shown in fig. 2 further comprises a deterministic network 2 on the basis of fig. 1, and the controller 300 is located outside the deterministic network 2. For a description of the deterministic network 1 please refer to the relevant part of fig. 1, the deterministic network 2 is mainly described here. Deterministic network 2 includes network nodes 201-202, controller 300 is also communicatively coupled to network nodes 201-202, and network node 202 is communicatively coupled to network node 101 in deterministic network 1. Wherein, the network nodes 201 to 202 are all network nodes supporting the network protocol corresponding to the deterministic network 2. For example, deterministic network 2 is a TSN and network nodes 201-202 are all TSN nodes. Network nodes that do not support the network protocol corresponding to deterministic network 2 may also be included in deterministic network 2, e.g., to the left of network node 201, between network node 201 and network node 202, to the right of network node 202, etc., which are not shown in fig. 2 for simplicity. Illustratively, deterministic network 2 is an IPv 6DetNet, SRv6DetNet, MPLS DetNet, TSN over IPv 6DetNet, TSN over SRv6DetNet, TSN over MPLS DetNet. For a certain traffic flow, the transmission path S2 of the traffic flow in the deterministic network 2 is 201- >202, the network node 201 is an ingress node and the network node 202 is an egress node.

Fig. 2 illustrates that the deterministic network 1 and the deterministic network 2 are directly connected, and in practical applications, other network devices or network systems may be deployed between the deterministic network 1 and the deterministic network 2, which is not limited in the embodiment of the present application.

The message transmission systems shown in fig. 1 and fig. 2 are only used as examples, and are not used to limit the technical solutions of the embodiments of the present application. In 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 required. The deterministic network in the embodiments of the present application may also be referred to as a deterministic network domain, a deterministic transport domain, a deterministic management domain, or the like. The embodiment of the application assists a network node in a deterministic network 1 to forward a message by carrying bounded latency information and type indication information for indicating the type of the bounded latency information in the message transmitted in the deterministic network (e.g. deterministic network 1), and ensures an end-to-end deterministic latency of the message in the deterministic network 1 (i.e. deterministic latency of the message from entering the deterministic network 1 to leaving the deterministic network 1). It should be noted that, unless otherwise specified, all network nodes described herein refer to network nodes in a deterministic network that support a deterministic network protocol and conform to a deterministic network standard.

The above is an introduction of the application scenario of the present application, and the bounded time delay information (bounded latency information, BLI) and the type indication information for indicating the bounded time delay information described in the embodiments of the present application are described below.

The bounded time delay information refers to: information for guaranteeing end-to-end deterministic latency of messages in deterministic networks. Or it is: information for guaranteeing bounded end-to-end delay of messages in deterministic networks. The bounded time delay information can also guarantee end-to-end deterministic jitter of messages in a deterministic network. The bounded time delay information and the type indication information for indicating the bounded time delay information may be carried in a service message to assist a network node in the deterministic network in forwarding the service message.

The following description describes, as an example, a service packet carrying bounded time delay information and type indication information for indicating the bounded time delay information as a first packet, where the first packet belongs to a first service flow, and the bounded time delay information and the type indication information are used for forwarding the first packet by a network node in a first deterministic network.

In the embodiment of the present application, the bounded time delay information is time resource (time resource) information or service requirement information. The time resource information is used to indicate a resource 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 for indicating the service requirement of the first message. The time resource information is bottom layer resource information or abstract resource information, the bottom layer resource information directly indicates resources for transmitting the first message in the network node, a mapping relation exists between the abstract resource information and the bottom layer resource information, and the abstract resource information indirectly and directly indicates the resources for transmitting the first message in the network node through the mapping relation.

In an alternative embodiment, the time resource information includes at least one of: queue (queue) indication information, period (period) indication information, time slot (time slot) indication information, priority (priority) information. The queue indication information is used for indicating a queue for transmitting the first message in the network node, and the queue indication information is information such as a queue identification, a queue number and the like. The period indication information is used for indicating a cycle (cycle) period of transmitting the first message in the network node, and the period indication information is information such as a period identifier, a period number and the like. The time slot indication information is used for indicating a time slot for transmitting the first message in the network node, and the time slot indication information is information such as time slot identification, time slot number and the like. The priority information is used for indicating the priority of the first message so as to indicate a queue corresponding to the priority in the network node. The priority information may be quality of service (quality of service, qoS) priority information, differentiated services code point (differentiated services code point, DSCP) priority information, type of service (ToS) priority information, or 802.1p priority information, and the priority indicated by the priority information may be QoS priority, DSCP priority, toS priority information, or 802.1p priority. The queue indication information is resource indication information used in a scheduling mechanism based on a queue, the period indication information is resource indication information used in a circular queuing mechanism, and the time slot indication information is resource indication information used in a scheduling mechanism based on a time slot.

In an alternative embodiment, the service requirement information includes at least one of: delay requirement information, jitter requirement information, deadline requirement information. The delay requirement information is used for indicating the delay requirement of the first message. The jitter requirement information is used for jitter requirements of the first traffic stream, also known as delay variation (delay variation) or delay variation. The deadline requirement information is used for indicating the deadline requirement of the first message. In some embodiments, the latency requirement information is also referred to as latency budget (delay budget) information, the jitter requirement information is also referred to as jitter budget (jitter budget) information, and the deadline requirement information is also referred to as deadline budget (deadline budget) information.

In an alternative embodiment, the latency requirement information includes at least one of: end-to-end delay requirement information and local delay requirement information. The jitter requirement information includes at least one of: end-to-end jitter requirement information and local jitter delay requirement information. The deadline requirement information includes at least one of: end-to-end deadline requirement information, local deadline requirement information. The end-to-end delay requirement information is used for indicating the end-to-end delay requirement of the first message in the first deterministic network, and the end-to-end delay of the first message in the first deterministic network is required to be equal to the end-to-end delay required by the end-to-end delay requirement information. The local delay requirement information corresponds to at least one network node, and is used for indicating the delay requirement of the first message in the corresponding network node, wherein the transmission delay of the first message in the corresponding network node cannot be larger than the local delay required by the local delay requirement information. The end-to-end jitter requirement information is used to indicate an end-to-end jitter requirement of the first traffic stream in the first deterministic network, the end-to-end jitter requirement of the first traffic stream in the first deterministic network being equal to the end-to-end jitter required by the end-to-end jitter requirement information. The local jitter requirement information corresponds to at least one network node, and the local jitter requirement information is used for indicating the jitter requirement of the first service flow in the corresponding network node, and the jitter of the first service flow in the corresponding network node cannot be larger than the local jitter required by the local delay requirement information. The end-to-end deadline requirement information is used for indicating the deadline requirement that the first message leaves the first deterministic network, the first message needs to leave the first deterministic network at the deadline required by the end-to-end deadline requirement information, and the deadline that the first message leaves the first deterministic network is the birth timestamp (packet birth timestamp) of the first message plus the end-to-end delay of the first message in the first deterministic network. The local deadline requirement information corresponds to a network node, and the local deadline requirement information is used for indicating the deadline requirement that the first message leaves the corresponding network node, and the first message needs to leave the corresponding network node at the deadline required by the local deadline requirement information. In some embodiments, the end-to-end latency requirement information is also referred to as end-to-end latency budget (end to end delay budget) information, the local latency requirement information is also referred to as local latency budget (local delay budget) information, the end-to-end jitter requirement information is also referred to as end-to-end jitter budget (end to end jitter budget) information, the local jitter requirement information is also referred to as local jitter budget (local jitter budget) information, and the end-to-end deadline requirement information is also referred to as end-to-end deadline budget (end to end delay deadline budget) information, and the local deadline requirement information is also referred to as local deadline budget (local deadline budget) information.

In the embodiment of the present application, the time resource information and the service requirement information are two different types of bounded time delay information, and the time resource information and the service requirement information may be two major classes of bounded time delay information. The queue indication information, the period indication information, the slot indication information, and the priority information are four different types of time resource information, which are four sub-categories of time resource information. The end-to-end delay requirement information, the local delay requirement information, the end-to-end jitter requirement information, the local jitter requirement information, the end-to-end deadline requirement information, and the local deadline requirement information are six different types of service requirement information, and the six types of information are six subclasses of the service requirement information. The types of different bounded time delay information can be indicated by different types of indication information, so that the network node can distinguish different bounded time delay information. As one example, bounded time delay information and type indication information for indicating the type of the bounded time delay information are shown in table 1 below.

TABLE 1

Referring to table 1, the queue indication information, the period indication information, the time slot indication information and the priority information all belong to time resource information, and the type indication information "1" is used for indicating the queue indication information (or is used for indicating that the type of the bounded time delay information is the queue indication information); the type indication information "2" is used for indicating the period indication information (or is used for indicating that the type of the bounded time delay information is the period indication information); the type indication information "3" is used for indicating time slot indication information (or is used for indicating that the type of the bounded time delay information is the time slot indication information); the type indication information "4" is used to indicate priority information (or is used to indicate that the type of the bounded time delay information is priority information), and the other is the same, and details are not repeated here.

The above-described time resource information is all bottom layer resource information, where the bottom layer resource information indicates bottom layer resources of the network node, for example, queue indication information is used to indicate queues in the network node, period indication information is used to indicate a cycle period of the network node, time slot indication information is used to indicate time slots in the network node, and priority information is used to indicate priorities of messages so as to indicate queues corresponding to the priorities in the network node. The time resource information in the embodiment of the present application may also be abstract information of the bottom layer resource information, for example, abstract processing is performed on the bottom layer resource information to obtain abstract resource information corresponding to the bottom layer resource information, and a mapping relationship between the bottom layer resource information and the abstract resource information is established, so that the network node may locally store the mapping relationship between the bottom layer resource information and the abstract resource information. In the actual service message forwarding process, the network node determines corresponding bottom layer resource information according to abstract resource information carried by the service message and a local mapping relation, determines bottom layer resources used for forwarding the service message in the network node according to the bottom layer resource information, and forwards the service message through the bottom layer resources. The method and the device have the advantages that the bottom layer resource information is abstracted, the mapping relation between the bottom layer resource information and the abstract resource information is established, the abstract resource information is carried in the service message, the decoupling of the data plane parameters (such as the abstract resource information) carried by the service message and the bottom layer implementation technology of the network node can be realized through the design, the adaptability to the bottom layer mechanism is higher, the bottom layer parameters (such as the bottom layer resource information) of the network node do not need to be exposed on the data plane, and the safety is higher.

The bounded latency information described above is merely an example of the present application, and it may also be other information for guaranteeing end-to-end deterministic latency of a message in a deterministic network. For example, the bounded latency information may also be latency compensation (delay compensation) information, where the latency compensation information is used to instruct the network node to perform latency compensation on a packet carrying the latency compensation information, so as to ensure an end-to-end deterministic latency of the packet in the deterministic network. Illustratively, the delay compensation information includes local delay compensation (local delay compensation) information. The delay compensation information belongs to service requirement information, and is used for multipath transmission scenes. For example, a certain service flow is carried through at least two paths, the time delays of the at least two paths are different, and in order to ensure the end-to-end deterministic time delay of the service flow, the time delay compensation can be performed on the service flow on at least one path, so that the end-to-end deterministic time delay of a message transmitted through the at least two paths in the certain service flow is equal or has a smaller difference value.

For convenience of description, the type indication information for indicating the type of the bounded time delay information is referred to as type indication information corresponding to the bounded time delay information. The method for carrying the bounded time delay information and the type indication information corresponding to the bounded time delay information in the service message is described below by taking the first message as an example.

In this embodiment of the present application, the first packet carries at least one bounded time delay information and at least one type indication information, where the at least one bounded time delay information corresponds to the at least one type indication information one to one, each type indication information is used to indicate a type of the corresponding bounded time delay information, and the at least one bounded time delay information and the at least one type indication information are used to assist a network node in the first deterministic network to forward the first packet. Wherein the at least one bounded time 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 time delay information, and each network node forwards the first message according to the bounded time delay information and the type indication information corresponding to each network node. In one embodiment, the first message carries a bounded latency information and a type indication information, the bounded latency information corresponding to a plurality of network nodes in the first deterministic network, the plurality of network nodes forwarding the first message according to the bounded latency information and the type indication information. In another embodiment, the first message carries a bounded latency information and a type indication information, the bounded latency information corresponding to a network node (e.g., an egress node) in the first deterministic network, the network node forwarding the first message based on the bounded latency information and the type indication information. In yet another embodiment, the first packet carries a plurality of bounded latency information and a plurality of type indication information, the plurality of bounded latency information corresponds one-to-one to a plurality of network nodes in the first deterministic network, and each network node in the plurality of network nodes forwards the first packet according to the bounded latency information and the type indication information corresponding to each network node. In yet another embodiment, the first message carries a plurality of bounded latency information and a plurality of type indication information, the plurality of bounded latency information corresponding to each of a plurality of network nodes in the first deterministic network, each network node forwarding the first message in accordance with the plurality of bounded latency information and the plurality of type indication information in combination with a local policy. In yet another embodiment, the first packet carries a plurality of bounded latency information and a plurality of type indication information, the plurality of bounded latency information corresponding to one network node in the first deterministic network, the one network node forwarding the first packet in accordance with the plurality of bounded latency information and the plurality of type indication information in combination with a local policy. In an embodiment in which the first packet carries a plurality of bounded latency information, the plurality of bounded latency information are of the same type, e.g., the plurality of bounded latency information are all periodic indication information. Or at least two bounded time delay information in the plurality of bounded time delay information are different in type; for example, some of the plurality of bounded latency information is time resource information and others is traffic demand information; as another example, some of the plurality of bounded latency information are queue indication information, others are period indication information, and still others are latency requirement information.

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

Optionally, a BLI data field is extended in the HBH, DOH or MPLS extension header, where the BLI data field carries bounded latency information and type indication information corresponding to the bounded latency information. The bounded time delay information and the type indication information corresponding to the bounded time delay information are carried in a segment list or TLV field of the SRH. Therefore, the first message carries the bounded time delay information and the type indication information corresponding to the bounded time delay information includes multiple implementations, and the multiple implementations are described below. Before this, the BLI data field provided in the embodiments of the present application will be first described.

The BLI data field provided in the embodiments of the present application includes at least one BLI data space (space), where each BLI data space is configured to carry one bounded latency information and type indication information corresponding to the bounded latency information. For example, each BLI data space includes a type indication subspace and a BLI subspace, the BLI subspace is used for carrying bounded time delay information, and the type indication subspace is used for carrying type indication information corresponding to the bounded time delay information. Optionally, each BLI data space further includes a format (format) subspace, the format subspace is used for carrying a format of corresponding bounded time delay information, and formats of different bounded time delay information are different. For example, the time resource information, the delay requirement information, the jitter requirement information is a 16-bit unsigned number (16 bit unsigned integer), a 32-bit unsigned number (32 bit unsigned integer), or a 64-bit unsigned number (32 bit unsigned integer), and the deadline requirement information is a network time protocol (network time protocol, NTP) 32-bit timestamp, NTP 64-bit timestamp, precision time protocol (precision time protocol, PTP) 64-bit timestamp, or PTP 80-bit timestamp. The first BLI data space (the BLI data space located at the beginning of the BLI data field) may also include a flag (flags) subspace that indicates whether there are more BLI data spaces after the first BLI data space. The flag subspace includes a plurality of flag bits, the number of the plurality of flag bits indicating a maximum number of BLI data spaces that the BLI data field can include, a value of each flag bit being 0 or 1, the number of flag bits having a value of 1 in the plurality of flag bits indicating the number of BLI data spaces that the BLI data field actually includes.

Fig. 3 is a schematic diagram of a BLI data field according to an embodiment of the present application. The BLI data field comprises m BLI data spaces, m is more than or equal to 1, and m is an integer. The BLI data space includes a type indication subspace, a format subspace, a BLI subspace and a reserved (reserved) subspace, and the BLI data space 1 further includes a flag subspace for indicating that the BLI data field includes the m BLI data spaces. In each BLI data space: the BLI subspace is used for carrying the bounded time delay information, the type indication subspace is used for carrying the type indication information corresponding to the bounded time delay information, and the format subspace is used for carrying the format of the bounded time delay information. When m >1, the m bounded time delay information carried by the BLI data field is the same in type, or at least two bounded time delay information in the m bounded time delay information are different in type.

An implementation of carrying bounded time delay information and type indication information in a first message is described below.

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

By way of example, fig. 4 is a schematic diagram of an option field provided in an embodiment of the present application. The option fields include 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 for indicating the type of the option field, the highest 3 bits of the option type subfield is 001, and if the network node cannot identify the option type during the process of processing the message comprising the option field, the network node skips the option field, and the value of the option type subfield can be changed during the process of processing the option field by the network node. The option data length subfield is used to indicate the length of the BLI data field.

Fig. 5 is a schematic diagram of a first packet according to an embodiment of the present application. The first message is an IPv6 message that includes a payload, a user datagram protocol (user datagram protocol, UDP) header, other IPv6 extension header, an HBH that includes the option fields shown in fig. 3, an IPv6 header, a media access control (media access control, MAC) header, and an ethernet header. The option field carries m bounded time delay information and m type indication information, the m bounded time delay information corresponds to each network node along the first message, and each network node forwards the first message according to the m bounded time delay information and the m type indication information in combination with a local strategy.

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

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

Third implementation: the first message is an MPLS message, and the first message includes an MPLS Extension Header (EH), where the bounded time delay information and the type indication information corresponding to the bounded time delay information are both located in the MPLS EH.

In an alternative embodiment, the MPLS EH includes a BLI data field, and the bounded latency information and the type indication information corresponding to the bounded latency information are both located in the BLI data field. Fig. 6 is a schematic diagram of MPLS EH according to an embodiment of the present application. The MPLS EH includes a Next Header (NH) field, a header extension length (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 the MPLS EH. The HLEN field is used to indicate the length of the BLI data field.

In an alternative embodiment, the first packet is an MPLS packet, the first packet includes an EH stack (EH stack), the EH stack includes a plurality of MPLS EHs, the plurality of MPLS EHs are in one-to-one correspondence with a plurality of network nodes along the first packet, and each MPLS EH carries at least one bounded time delay information and type indication information corresponding to the at least one bounded time delay information. The first message may further include an MPLS label stack (MPLS label) that includes a plurality of MPLS labels that are in one-to-one correspondence with a plurality of network nodes along the first message. For example, the plurality of MPLS EHs are in one-to-one correspondence with the plurality of MPLS labels, each of the plurality of network nodes being in a first deterministic network. Fig. 7 is a schematic diagram of another first packet according to 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 of stack (BoS), and an MPLS label stack. The English of PAH is post-stack MNA header, chinese is stack MNA header, english of MNA is MPLS network actions, chinese is MPLS network action. The EH stack includes n MPLS EHs, each of which is structured as shown in fig. 6. The n MPLS EHs are in one-to-one correspondence with n network nodes along the first message, and each network node in the n network nodes processes the first message according to the corresponding MPLS EH. Fig. 7 illustrates that each of the n MPLS EHs includes m BLI data spaces, and thus each of the n MPLS EHs carries m bounded latency information and m type indication information, and in other embodiments, at least two of the n MPLS EHs carry different amounts of bounded latency information.

In another alternative embodiment, the first packet includes an MPLS EH for carrying bounded latency information, the MPLS EH corresponding to a network node along the first packet (e.g., an egress node of the first deterministic network), the MPLS EH carrying at least one bounded latency information and type indication information corresponding to the at least one bounded latency information. Fig. 8 is a schematic diagram of still another first packet according to an embodiment of the present application. The first message is an MPLS packet, where the first packet includes an MPLS payload, an MPLS EH, a UDP header, an IPv6 header, a MAC header, and an ETH, where the MPLS EH has a structure as shown in fig. 6, where the MPLS EH corresponds to an egress node of the first deterministic network, and the egress node processes the first packet according to the MPLS EH.

Fourth implementation: the first message is a SRv message, and the first message includes an SRH, where the SRH includes a segment list (segment list), and the bounded time delay information and the type indication information corresponding to the bounded time delay information are both located in the segment list.

Optionally, the segment list includes a plurality of SIDs, each SID including a location (locator) field, a function (function) field, and a parameter (parameter) field, and the bounded time delay information and the type indication information corresponding to the bounded time delay information are located in the parameter field of the SID. The first packet carries at least one bounded time delay information and at least one type indication information, the at least one bounded time delay information corresponds to the at least one type indication information one by one in a parameter field of the at least one SID, and each type indication information corresponds to the bounded time delay information in the same parameter field. Wherein the SIDs are in one-to-one correspondence with the network nodes along the first message, and therefore the at least one bounded time delay information is in one-to-one correspondence with at least one network node of the network nodes.

Taking as an example a bounded time delay information and a type indication information carried by the parameter field of each SID. Fig. 9 is a schematic diagram of an SRH according to an embodiment of the present application. The SRH includes the following fields: next header, header extension length, routing type (routing type), segment Left (SL), last entry (last entry), flags (tags), tags, < segment list [1], segment list [2], < segment list [ n ], and optional TLV. Each of the segment list [1], segment list [2]. Segment list [ n ] is a SID. The parameter field of each of the segment lists [1], segment list [2]. The segment list [ n ] includes one bounded time delay information and one type indication information, and the type indication information in the parameter field of each of the segment lists is used to indicate the type of the bounded time delay information in the parameter field. The SRH shown in FIG. 9 carries n bounded latency information and n type indication information, n.gtoreq.1, and n is an integer. When n >1, the n bounded time delay information is the same type, or at least two bounded time delay information in the n bounded time delay information are different types. Optionally, when the n bounded time delay information types are the same, the n bounded time delay information types may be preconfigured types, and the n SIDs may not carry type indication information, which is not limited in the embodiment of the present application.

Fifth implementation manner: the first message is a SRv6 message, the first message includes an SRH, the SRH includes a TLV field, and the bounded time delay information and the type indication information corresponding to the bounded time delay information are both located in the TLV field.

Wherein the TLV field carries at least one bounded latency information and at least one type indication information, the at least one bounded latency information corresponding to at least one network node in the first deterministic network. For example, the at least one bounded latency information corresponds one-to-one with the at least one network node, or each of the at least one network node corresponds to all of the at least one bounded latency information. The SRH also includes a segment list including a plurality of SIDs in one-to-one correspondence with a plurality of network nodes along the first message, the plurality of network nodes in the first deterministic network. Wherein the number of the at least one bounded time delay information is not greater than the number of the plurality of SIDs, and the SID corresponding to the bounded time delay information in the plurality of SIDs is a target type (the SID corresponding to the same network node corresponds to the bounded time delay information), and the target type indicates that the TLV field includes the bounded time delay information corresponding to the corresponding SID. For example, the target type is end.bli, i.e., the SID corresponding to the bounded latency information is end.bli SID. Optionally, the SID that does not correspond to the bounded time delay information in the plurality of SIDs is of a type END or end.x, that is, the SID that does not correspond to the bounded time delay information is an END SID or end.x SID. The END SID is a destination node (END SID), identifies a certain destination node in the network, and the end.x SID is an END SID of a three-layer cross-connect, identifies a certain link in the network.

In an alternative embodiment, the SRH includes a segment list and a TLV field, the segment list includes a plurality of SIDs, the plurality of SIDs are in one-to-one correspondence with a plurality of network nodes along the first packet, the TLV field carries a plurality of bounded time delay information and a plurality of type indication information, the plurality of bounded time delay information is in one-to-one correspondence with the plurality of type indication information, the plurality of bounded time delay information is in one-to-one correspondence with a plurality of network nodes along the first packet, the number of the plurality of type indication information is not greater than the number of the plurality of SIDs, and a type of the SID corresponding to the bounded time delay information in the plurality of SIDs is a target type. Fig. 10 is a schematic diagram of another SRH provided in an embodiment of the present application. The SRH includes the following fields: next header, header extension length, route type, remaining segments, last entry, flag, tag, < segment list [1], segment list [2]. Segment list [ n ] > and TLV. Each of the segment list [1], segment list [2]. Segment list [ n ] is a SID. The TLV field includes the following subfields: type, length, remaining BLI, reserved 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, each of BLI list [1], BLI list [2]. BLI list [ m ] is used to carry one bounded time delay information and one type indication information, and the type indication information in each BLI list is used to indicate the type of bounded time delay information in the BLI list. The SRH shown in fig. 10 carries n SIDs, m bounded latency information, and m type indication information, n is greater than or equal to m is greater than or equal to 1, n and m are integers, and SID corresponding to the bounded latency information in the n SIDs is SID end. When m >1, the m bounded time delay information is the same type, or at least two bounded time delay information in the m bounded time delay information are different types. Optionally, when the types of the m bounded time delay information are the same, the BLI list may also not carry type indication information, and the type of the m bounded time delay information may be indicated by a type subfield in the TLV field, which is not limited in the embodiment of the present application. Fig. 10 is merely an example, where the number of bounded latency information carried by an SRH is smaller than the number of SIDs carried by the SRH (for example, the SRH carries n SIDs), n BLI lists may also be set in the TLV field of the SRH, where the n BLI lists are in a one-to-one correspondence with the n SIDs, where the n SIDs are end.bli SIDs, and a part of the BLI lists in the n BLI lists are set to be empty, which is not limited in this embodiment of the present application.

In another alternative embodiment, the SRH includes a segment list and a TLV field, the segment list includes a plurality of SIDs, the plurality of SIDs are in one-to-one correspondence with a plurality of network nodes along the first packet, the TLV field carries one bounded time delay information and one type indication information, the one bounded time delay information corresponds to the plurality of network nodes, the types of the plurality of SIDs are all target types, and each network node in the plurality of network nodes processes the first packet according to the one bounded time delay information and the one type indication information. Fig. 11 is a schematic diagram of still another SRH provided in an embodiment of the present application. The SRH includes the following fields: next header, header extension length, route type, remaining segments, last entry, flag, tag, < segment list [1], segment list [2]. Segment list [ n ] > and TLV. Each of the 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 for indicating the type of the TLV field, the length subfield is used for indicating the length of the data field of the TLV field, the BLI subfield is used for carrying bounded time delay information, the type subfield is used for carrying type indication information, and the type indication information is used for indicating the type of the bounded time delay information. The SRH shown in fig. 11 carries n SIDs, one bounded latency information, and one type indication information, n being an integer greater than or equal to 1, the one bounded latency information corresponding to the n SIDs, the n SIDs being end. In some embodiments, the TLV field may not include a type indication subfield, and the type of the bounded latency information may be indicated by a type subfield in the TLV field. In other embodiments, the BLI field shown in fig. 3 is extended in the TLV field to carry a plurality of bounded time delay information and a plurality of type indication information, so that the BLI field corresponds to the n SIDs, and the network node corresponding to each SID in the plurality of SIDs processes the first packet according to the plurality of bounded time delay information and the plurality of type indication information.

In yet another alternative embodiment, the SRH includes a segment list including a plurality of SIDs in one-to-one correspondence with a plurality of network nodes along the first message, and a TLV field carrying one bounded latency information corresponding to a last network node of the plurality of network nodes (e.g., an egress node of the first deterministic network) and one type indication information, the last SID of the plurality of SIDs being of a target type. Fig. 12 is a schematic diagram of yet another SRH provided in an embodiment of the present application. The structure of the SRH is the same as that of the SRH shown in fig. 11, except that the SRH shown in fig. 12 carries n SIDs, one bounded time delay information corresponding to the last SID among the n SIDs, which is an end. In some embodiments, the TLV field in the SRH shown in fig. 12 may not include a type indication subfield, and the type of the bounded latency information may be indicated by the type subfield in the TLV field. In other embodiments, the BLI field shown in fig. 3 is extended in the TLV field to carry a plurality of bounded time delay information and a plurality of type indication information, so that the BLI field corresponds to the last SID, and the network node corresponding to the last SID processes the first packet according to the plurality of bounded time delay information and the plurality of type indication information.

Embodiments of the message transmission method of the present application are described below.

Fig. 13 is a flowchart of a message transmission method according to an embodiment of the present application. The message transmission method is applied to a first network node in a first deterministic network. The first network node is an ingress node, an intermediate node or an egress node of the first deterministic network. For example, the first deterministic network is deterministic network 1 in fig. 1 or fig. 2, the first network node being any one of network nodes 101-103. As shown in fig. 13, the method includes the following steps S301 to S302.

S301, a first network node acquires a first message, wherein the first message carries first type indication information and first bounded time delay information, the first type indication information is used for indicating the type of the first bounded time delay information, and the first bounded time delay information is used for guaranteeing end-to-end deterministic time delay of the first message in a first deterministic network.

The first message carries first type indication information and first bounded time delay information, and the first type indication information and the first bounded time delay information are used for forwarding the first message by the first network node. The first type indication information and the first bounded latency information may also be used for forwarding the first message by other network nodes in the first deterministic network, which is not limited in the embodiments of the present application.

Wherein the first bounded time delay information includes time resource information or service requirement information. The first bounded time delay information may be one bounded time delay information; alternatively, the first bounded time delay information includes a plurality of bounded time delay information, and the plurality of bounded time delay information is of a different type. In one example, the first bounded time delay information is any one of the bounded time delay information in table 1. In another example, the first bounded time delay information includes at least two bounded time delay information in table 1.

In an alternative embodiment, the first message is an IPv6 message, and the first type indication information and the first bounded time delay information are both located in an IPv6 extension header of the first message, where the IPv6 extension header includes any one of HBH, DOH, SRH. Alternatively, the first message is an MPLS message, and the first type indication information and the first bounded time delay information are both located in an MPLS extension header of the first message. In one example, the first packet is an IPv6 packet as shown in fig. 5, where the HBH of the first packet carries m bounded latency information and m type indication information, the first bounded latency information includes the m bounded latency information, the first type indication information includes the m type indication information, and the first type indication information and the first bounded latency information are used for forwarding the first packet by a plurality of network nodes along the first packet, where the plurality of network nodes are in the first deterministic network. In another example, the first packet is an MPLS packet as shown in fig. 8, where the MPLS EH of the first packet carries m bounded latency information and m type indication information, the first bounded latency information includes the m bounded latency information, the first type indication information includes the m type indication information, and the first type indication information and the first bounded latency information are used for forwarding the first packet by an egress node of the first deterministic network. In yet another example, the first message is a SRv6 message (an IPv6 message), the first message includes an SRH as shown in fig. 11, the SRH carrying one bounded time delay information and one type of indication information, the one bounded time delay information being first bounded time delay information, the one type of indication information being first type of indication information, the first type of indication information and the first bounded time delay information being used for forwarding the first message by a plurality of network nodes along the first message, the plurality of network nodes being in a first deterministic network. In yet another example, the first message is a SRv message, the first message including an SRH as shown in fig. 12, the SRH carrying one bounded time delay information and one type of indication information, the one bounded time delay information being first bounded time delay information, the one type of indication information being first type of indication information, the first type of indication information and the first bounded time delay information being for use by an egress node for a first deterministic network to forward the first message.

In an alternative embodiment, the first packet further carries second bounded time delay information and second type indication information, the second type indication information is used for indicating a type of the second bounded time delay information, the second bounded time delay information is used for guaranteeing end-to-end deterministic time delay of the first packet in the first deterministic network, the second type indication information and the second bounded time delay information are used for forwarding the first packet by the second network node, and the second network node is in the first deterministic network. Wherein the second bounded time delay information is one bounded time delay information or the second bounded time delay information comprises a plurality of bounded time delay information. When the second bounded time delay information includes a plurality of bounded time delay information, the plurality of bounded time delay information are of different types. Optionally, the type of the second bounded time delay information is different from the type of the first bounded time delay information. In one example, the second bounded time delay information and the first bounded time delay information are any two bounded time delay information in table 1, and the type of the second bounded time delay information is different from the type of the first bounded time delay information. For example, the first bounded latency information is queue indication information and the second bounded latency information is period indication information. In another example, the first bounded time delay information includes at least two bounded time delay information in table 1, the second bounded time delay information includes at least two bounded time delay information in table 1, and the type of at least one bounded time delay information included in the second bounded time delay information is different from the type of at least one bounded time delay information included in the first bounded time delay information. For example, the first bounded latency information includes queue indication information and period indication information, and the second bounded latency information includes queue indication information and slot indication information. In other embodiments, the type of the second bounded time delay information may be the same as the type of the first bounded time delay information. When the first message carries the second bounded time delay information and the second type indication information and the first message is an IPv6 message, the second type indication information and the second bounded time delay information are both positioned in an IPv6 extension header of the first message, and the first bounded time delay information and the second bounded time delay information are positioned in the same IPv6 extension header of the first message, or the first bounded time delay information and the second bounded time delay information are positioned in different IPv6 extension headers of the first message. When the first message carries the second bounded time delay information and the second type indication information and the first message is an MPLS message, the second type indication information and the second bounded time delay information are both positioned in an MPLS extension header of the first message.

In an alternative embodiment, the first packet carries a plurality of bounded time delay information and a plurality of type indication information, where the plurality of bounded time delay information corresponds to the plurality of type indication information one-to-one, each type indication information is used to indicate a type of the corresponding bounded time delay information, and the plurality of bounded time delay information is used to ensure an end-to-end deterministic time delay of the first packet in the first deterministic network. The plurality of bounded time delay information are of the same type or at least two of the plurality of bounded time delay information are of different types. The plurality of bounded time delay information includes first bounded time delay information and second bounded time delay information, and 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 time delay information and the plurality of type indication information are both located in an IPv6 extension header of the first message. When the first message is an MPLS message, the plurality of bounded time delay information and the plurality of type indication information are both located in an MPLS extension header of the first message. In one example, the first packet is an MPLS packet as shown in fig. 7, where the first packet includes n MPLS EHs, each MPLS EH carries m bounded time delay information and m type indication information, the first bounded time delay information and the second bounded time delay information are bounded time delay information carried by any two MPLS EHs in the n MPLS EHs, and the first type indication information and the second type indication information are type indication information carried by the any two MPLS EHs. For example, MPLS EH1 carries first bounded latency information and first type indication information, and MPLS EH2 carries second bounded latency information and second type indication information. In another example, the first packet is a SRv packet, where the first packet includes an SRH as shown in fig. 9, where the SRH carries n bounded time delay information and n type indication information, the first bounded time delay information and the second bounded time delay information are any two bounded time delay information in the n bounded time delay information, the first type indication information and the first bounded time delay information are located in the same parameter field, and the second type indication information and the second bounded time delay information are located in the same parameter field. For example, the first bounded latency information is bounded latency information 1 and the first type indication information is type indication information 1; the second bounded time delay information is bounded time delay information 2 and the second type indication information is type indication information 2. In yet another example, the first message is a SRv6 message, the first message includes an SRH as shown in FIG. 10, the SRH includes m BLI lists, each BLI list is used to carry one bounded time delay information and one type indication information, the first bounded time delay information and the second bounded time delay information are the m BLI lists

The first type indication information and the second type indication information are the bounded time delay information carried by any two BLI lists

Meaning the type indication information carried by both BLI lists. For example, the first bounded time delay information and the first type indication information are carried in

In BLI list [1], the second bounded latency information and the second type indication information are carried in BLI list [2 ].

In an alternative embodiment, the first packet is an IPv6 packet, and the first packet further carries slice indication information, where the slice indication information is located in an IPv6 extension header of the first packet, for example, where the slice indication information is located in HBH, DOH, or SRH of the first packet. The slice indication information indicates a network slice for forwarding the first message, and the slice indication information may be a slice Identifier (ID). The slice indication information and the first bounded time delay information are located in the same IPv6 extension head of the first message. Or, the slice indication information and the first bounded time delay information are located in different IPv6 extension headers of the first message. For example, the first bounded time delay information is located in the SRH and the slice indication information is located in the HBH. Fig. 14 is a schematic diagram of yet another first packet according to an embodiment of the present application. The first message is a SRv6 message, which includes a payload, SRH, HBH, and IPv6 header. The structure of the SRH is the same as that of fig. 9, and the SRH carries m bounded time delay information, where the first bounded time delay information is any one of the m bounded time delay information, and the slice ID is located in the HBH. The HBH includes the following fields: the next header, header extension length, flag, slice ID, and reservation. The IPv6 header includes the following fields: version field, stream class, stream label, payload length, next header, hop limit, source address, destination address. According to the method, the slice indication information is carried in the HBH of the first message, and each network node along the first path can determine the corresponding network slice according to the slice indication information, so that the first message is forwarded through the network slice. By way of example, the network node along the first message forwards the first message according to the slice indication information, the bounded time delay information and the type indication information for indicating the bounded time delay information, so that not only can the end-to-end deterministic time delay of the first message in the first deterministic network be ensured, but also the deterministic time delay of the first message in the network slice indicated by the slice indication information can be ensured.

In an embodiment of the present application, the first network node is an ingress node, an intermediate node or an egress 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 a first message from a last hop node of the first network node, the last hop node being in the first deterministic network. The first network node generates a first message when the first network node is an ingress node of a first deterministic network. The following description of S301 mainly describes an implementation scheme in which the first network node obtains the first packet when the first network node is an ingress node of the first deterministic network.

The first network node receives a second message from a last hop node of the first network node, the first network node obtains first type indication information and first bounded time delay information, and the first network node generates a first message according to the second message, the first type indication information and the first bounded time delay information, and the last hop node is located outside the first deterministic network. Optionally, the first network node further obtains second type indication information and second bounded time delay information, and the first network node generates the first message according to the second message, the first type indication information, the first bounded time delay information, the second type indication information and the second bounded time delay information. In a specific embodiment, a first network node obtains a plurality of type indication information and a plurality of bounded time delay information, where the plurality of type indication information and the plurality of bounded time delay information are in one-to-one correspondence, the plurality of type indication information includes a first type indication information and a second type indication information, the plurality of bounded time delay information includes a first bounded time delay information and a second bounded time delay information, and the first network node generates a first message according to the second message, the plurality of type indication information and the plurality of bounded time delay information.

In one embodiment, a first network node receives a control message sent by a controller, where the control message includes first type indication information and first bounded time delay information, and the first network node obtains the first type indication information and the first bounded time delay information from the control message. Optionally, the control message includes a plurality of type indication information and a plurality of bounded time delay information, the plurality of type indication information corresponds to the plurality of bounded time delay information one by one, each type indication information is used for indicating a type of the corresponding bounded time delay information, the plurality of bounded time delay information includes first bounded time delay information, the plurality of type indication information includes first type indication information, and the first network node obtains the plurality of type indication information and the plurality of bounded time delay information from the control message. The plurality of bounded time delay information is arranged in the control message in sequence, and the plurality of type indication information is arranged according to the arrangement sequence of the plurality of bounded time delay information. In one example, the control message includes a plurality of TLV fields arranged in sequence, the plurality of bounded time delay information being located in the plurality of TLV fields in a one-to-one correspondence, each type indication information being located in the same TLV field as its corresponding bounded time delay information. In another example, the control message includes an information stack including a plurality of information items arranged in sequence, the plurality of bounded time delay information being included in the plurality of information items in one-to-one correspondence, each type of indication information being included in the same information item as its corresponding bounded time delay information. The plurality of bounded time delay information corresponds to a plurality of network nodes along the first service flow one by one, the plurality of network nodes are all in a first deterministic network, and the first message belongs to the first service flow. Each TLV field of the plurality of TLV fields may further include a node identifier, to indicate a network node corresponding to the bounded latency information carried by each TLV field. Each of the plurality of information items may further include a node identifier to indicate a network node to which the bounded time delay information included in each information item corresponds. The node identification may be the SID of the node, or other indication information for identifying the network node.

Optionally, before the first network node receives the control message sent by the controller, the first network node sends capability information of the first network node to the controller, and the controller determines the first type indication information and the first bounded time delay information according to the capability information of the first network node. In one example, the first bounded time delay information is underlying resource information, the capability information of the first network node includes the underlying resource information of the first network node, the controller obtains the underlying resource information of the first network node from the capability information of the first network node, and the controller determines the underlying resource information of the first network node as the first bounded time delay information and generates first type indication information for indicating a type of the first bounded time delay information. In another example, the first bounded time delay information is abstract resource information, the capability information of the first network node includes bottom layer resource information of the first network node, and the controller generates the first bounded time delay information (i.e., abstract resource information) and the first type indication information according to the bottom layer resource information of the first network node, and establishes a mapping relationship between the bottom layer resource information and the abstract resource information. In yet another example, the first bounded time delay information is traffic requirement information, the capability information of the first network node includes traffic requirement information of the first traffic stream, the controller obtains the traffic requirement information of the first traffic stream from the capability information of the first network node, and the controller determines the traffic requirement information of the first traffic stream as the first bounded time delay information and generates first type indication information for indicating a type of the first bounded time delay information. Optionally, before the first deterministic network transmits the first traffic stream, each network node in the first deterministic network sends capability information of each network node to the controller, and the controller determines bounded time delay information and type indication information for indicating the bounded time delay information according to the capability information of the plurality of network nodes.

In another embodiment, the second message is from a second deterministic network, the second message carrying target bounded latency information for guaranteeing end-to-end deterministic latency of the second message in the second deterministic network. For example, as shown in fig. 2, the first deterministic network is deterministic network 1, the second deterministic network is deterministic network 2, and the target bounded latency information is used to guarantee the end-to-end deterministic latency of the second packet in deterministic network 2. The first network node may obtain the first type indication information and the first bounded time delay information according to the target bounded time delay information carried by the second packet. Optionally, the first network node obtains a plurality of type indication information and a plurality of bounded time delay information according to the target bounded time delay information, the plurality of type indication information corresponds to the plurality of bounded time delay information one by one, each type indication information is used for indicating a type of the corresponding bounded time delay information, the plurality of bounded time delay information comprises first bounded time delay information, and the plurality of type indication information comprises first type indication information. For example, the first network node stores an association relationship (for example, referred to as a first association relationship) between the target bounded time delay information and the plurality of bounded time delay information, and obtains the plurality of bounded time delay information according to the target bounded time delay information and the first mapping relationship. The first association relationship is configured in the first network node through the command line, or configured on the controller and issued to the first network node by the controller, or generated by the controller and issued to the first network node.

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

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

In an alternative embodiment, the first network node determines that the first bounded latency information comprises time resource information according to the first type indication information, and the first network node determines the first resource according to the time resource information. As an example, the time resource information included in the first bounded time delay information is underlying resource information, the first network node determines an underlying resource indicated by the time resource information, and the first network node determines the first resource among the underlying resources indicated by the time resource information. For example, the time resource information is queue indication information, and the first network node determines a 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 a queue (assumed to be queue 1) indicated by the queue indication information, and the first network node determines a cycle period (assumed to be cycle 1) indicated by the cycle indication information, and the first network node determines the queue 1 or cycle 1 as the first resource in combination with the local policy. As another example, the time resource information included in the first bounded latency information is abstract information (abbreviated as abstract resource information) of underlying resource information, and the first network node determines the first resource according to a local mapping relationship between the time resource information and the first network node. The local mapping relation comprises a mapping relation between bottom layer resource information and abstract resource information, the first network node determines bottom layer resource information corresponding to the time resource information according to the time resource information (namely abstract resource information) and the local mapping relation, the first network node determines bottom layer resources indicated by the bottom layer resource information, and the first network node determines first resources in the bottom layer resources indicated by the bottom layer resource information. For example. The first bounded time delay information comprises time resource information (namely abstract resource information) which is a resource ID1, the first network node determines that bottom layer resource information corresponding to the resource ID1 is a queue ID1 according to the resource ID1 and the local mapping relation, and the first network node determines a queue indicated by the queue ID1 as a first resource. For another example, the time resource information included in the first bounded time delay information is a resource ID2, the first network node determines that the bottom layer resource information corresponding to the resource ID2 includes a queue ID1 and a cycle ID1 according to the resource ID2 and the local mapping relation, the first network node determines a queue indicated by the queue ID1 (assumed to be the queue 1), determines a cycle period indicated by the cycle ID1 (assumed to be the cycle period 1), and the first network node determines the queue 1 or the cycle period 1 as the first resource in combination with the local policy.

In another alternative embodiment, the first network node determines that the first bounded time delay information includes service requirement information according to the first type indication information, and the first network node determines resources meeting the service requirement information in the first network node according to the service requirement information, so as to determine first resources among the resources meeting the service requirement information. In an example, the first network node determines, according to the service requirement information, a queue and/or a cycle period and/or a time slot in the first network node that satisfies the service requirement information, and the first network node determines, in combination with a local policy, a first resource in the queue and/or the cycle period and/or the time slot that satisfies the service requirement information. As an example, the resources satisfying the service requirement information in the first network node include a queue 1, a cycle 1 and a time slot 1, if the first network node adopts a layer1 (L1) scheduling policy to perform service scheduling, the first network node determines the time slot 1 as the first resource; if the first network node performs traffic scheduling using a layer2 (L2) scheduling policy or a layer3 (L3) scheduling policy, the first network node determines the queue 1 or the cycle 1 as the first resource.

In an alternative embodiment, the first message further carries slice indication information, and the first network node forwards the first message according to the first type indication information, the first bounded time delay information and the slice indication information. In an example, the first network node determines a network slice according to the slice indication information, and the first network node determines a first resource for transmitting a first message in the network slice according to the first type indication information and the first bounded time delay information. In this embodiment, the bounded time delay information and the slice indication information are combined, so that the resource for transmitting the first message is located on the network slice, which not only can ensure the end-to-end deterministic time delay of the first message in the first deterministic network, but also can ensure the deterministic time delay of the first message in the network slice indicated by the slice indication information. Also, in this embodiment, one network slice may be associated with multiple bounded-delay resources (resources indicated by bounded-delay information, e.g., queues) such that multiple service level agreements (service level agreement, SLA) levels may be planned within one network slice for differentiated services, providing a more flexible SLA provisioning policy.

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

In summary, according to the message transmission method provided in the embodiment of the present application, a first network node in a first deterministic network obtains a first message carrying first type indication information and first bounded time delay information, and forwards the first message according to the first type indication information and the first bounded time delay information. The first type indication information is used for indicating the type of first bounded time delay information, and the first bounded time delay information is used for guaranteeing end-to-end deterministic time delay of the first message in the first deterministic network. Therefore, the first message transmitted in the first deterministic network carries the bounded time delay information and the type indication information for indicating the type of the bounded time delay information to assist the network node in the first deterministic network to forward the first message, so that the end-to-end deterministic time delay of the first message in the first deterministic network is ensured. The technical scheme provided by the embodiment of the application can be applied to various network scenes such as IPv6DetNet, SRv 6DetNet, MPLS DetNet, TSN over IPv6DetNet, TSN over SRv 6DetNet, TSN over MPLS DetNet and the like.

Referring to fig. 15, a flowchart of another method for transmitting a message according to an embodiment of the present application is shown. The message transmission method is applied to the controller. As shown in fig. 15, the method includes the following steps S501 to S503.

S501, the controller receives capability information of a first network node, wherein the first network node is in a first deterministic network.

The first network node sends capability information of the first network node to the controller via an interior gateway protocol (interior gateway protocol, IGP) or border gateway protocol link state (border gateway protocol link-state, BGP-LS), and the controller receives the capability information of the first network node via IGP or BGP-LS, respectively.

The capability information of the first network node is used for indicating the processing capability of the first network node to the first service flow, and the capability information of the first network node comprises information of bottom layer resources which can be used for transmitting the first service flow in the first network node. As one example, the capability information of the first network node includes at least one of queue indication information for indicating a queue in the first network node that can be used to transmit the first traffic stream, period indication information for indicating a cycle period in the first network node that can be used to transmit the first traffic stream, slot indication information for indicating a slot in the first network node that can be used to transmit the first traffic stream, and priority information for indicating a priority queue in the first network node that can be used to transmit the first traffic stream.

In an alternative embodiment, the capability information of the first network node further comprises service requirement information of the first service flow, the service requirement information comprising at least one of: delay requirement information, jitter requirement information, deadline requirement information. Wherein the latency requirement information includes at least one of: end-to-end delay requirement information and local delay requirement information. The jitter requirement information includes at least one of: end-to-end jitter requirement information, local jitter requirement information. The deadline requirement information includes at least one of: end-to-end deadline requirement information, local deadline requirement information. The capability information of the first network node may also be other information, and the specific content of the capability information of the first network node is not limited in the embodiment of the present application.

In an alternative embodiment, the first deterministic network comprises a plurality of network nodes including the first network node, each of the plurality of network nodes sending capability information of the each network node to the controller via IGP or BGP-LS, and the controller receiving the capability information of each of the plurality of network nodes via IGP or BGP-LS, respectively. The capability information of each network node includes information of an underlying resource capable of being used for transmitting the first service flow in each network node, and may further include service requirement information of the first service flow.

S502, the controller acquires first type indication information and first bounded time delay information according to capability information of the first network node, wherein the first type indication information is used for indicating the type of the first bounded time delay information, and the first bounded time delay information is used for guaranteeing end-to-end deterministic time delay of a message carrying the first bounded time delay information in a first deterministic network.

The first bounded latency information includes time resource information or traffic demand information. The time resource information is used to indicate resources in the network node that transmit the first traffic stream. The service requirement information is used to indicate a service requirement of the first service flow. The time resource information is bottom layer resource information or abstract information (abbreviated as abstract resource information) of the bottom layer resource information, the bottom layer resource information directly indicates resources for transmitting the first service flow in the network node, a mapping relation exists between the abstract resource information and the bottom layer resource information, and the abstract resource information indirectly indicates the resources for transmitting the first service flow in the network node through the mapping relation.

In one embodiment, the first bounded time delay information includes time resource information, the time resource information is bottom layer resource information, the capability information of the first network node includes information of bottom layer resources (abbreviated as bottom layer resource information of the first network node) capable of being used for transmitting the first service flow in the first network node, and the controller determines the first bounded time delay information and the first type indication information according to the bottom layer 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, slot indication information, and priority information, the controller determines the at least one of queue indication information, period indication information, slot indication information, and priority information as first bounded time delay information, and the controller generates first type indication information indicating a type of the first bounded time delay information.

In another embodiment, the first bounded time delay information includes time resource information, the time resource information is abstract resource information, the capability information of the first network node includes bottom layer resource information of the first network node, the controller performs abstract processing on the bottom layer resource information of the first network node to obtain abstract resource information, the controller determines the abstract resource information as first bounded time delay information, and the controller generates first type indication information for indicating a type of the first bounded time delay information. In this embodiment, the controller may further establish a mapping relationship between the underlying resource information and the abstract resource information, and send the mapping relationship to the first network node, so as to be used by the first network node to forward the first service flow.

In an alternative embodiment, the controller obtains at least one bounded time delay information and at least one type indication information according to capability information of a plurality of network nodes in the first deterministic network, the at least one bounded time delay information corresponds to the at least one type indication information one by one, each type indication information is used for indicating a type of the corresponding bounded time delay information, each bounded time delay information is used for guaranteeing end-to-end deterministic time delay of a message carrying the each bounded time delay information in the first deterministic network, the at least one bounded time delay information comprises the first bounded time delay information, and the at least one type indication information comprises the first type indication information. Wherein the capability information of each network node includes information of an underlying resource of the each network node that can be used to transmit the first traffic stream (the information of the underlying resource of the each network node that can be used to transmit the first traffic stream is abbreviated as underlying resource information of the each network node), and the controller determines the at least one bounded time delay information according to the underlying resource information of the plurality of network nodes and generates at least one type indication information for indicating the at least one bounded time delay information. In one example, the at least one bounded time delay information corresponds to all network nodes along the first traffic stream, the at least one bounded time delay information being used to assist all network nodes along the first traffic stream in forwarding the first traffic stream. In another example, the at least one bounded latency information corresponds to an egress node of the first deterministic network, the at least one bounded latency information being used to assist all network nodes along the first traffic stream in forwarding the first traffic stream. In yet another example, the at least one bounded time delay information corresponds one-to-one with at least one network node along the first traffic stream, each bounded time delay information being used to assist the corresponding network node in forwarding the first traffic stream. For example, the at least one bounded latency information is a plurality of bounded latency information that is hop-by-hop auxiliary forwarding information, each bounded latency information being for assisting a one-hop network node along the first traffic stream in forwarding the first traffic stream.

When the at least one bounded time delay information is a plurality of bounded time delay information, the plurality of bounded time delay information are the same type or at least two of the plurality of bounded time delay information are different types. The at least one bounded time delay information further includes second bounded time delay information, the second bounded time delay information being of a different type than the first bounded time delay information. For example, the first bounded latency information is queue indication information and the second bounded latency information is period indication information. For another example, the first bounded latency information is queue indication information and the second bounded latency information is abstract resource information.

Taking the at least one bounded time delay information as a plurality of bounded time delay information and the bounded time delay information as abstract resource information as an example. The controller performs abstract processing on the bottom layer resource information of each network node in the plurality of network nodes to obtain abstract resource information corresponding to the bottom layer resource information of each network node, the controller determines the abstract resource information as bounded time delay information, and the controller can obtain the plurality of bounded time delay information. For example, the plurality of network nodes includes network nodes 101-103, the bottom layer resource information used by the network node 101 to transmit the first traffic stream is a queue ID1, the bottom layer resource information used by the network node 102 to transmit the first traffic stream is a period ID1, the bottom layer resource information used by the network node 103 to transmit the first traffic stream is a slot ID1, the controller abstracts the queue ID1 to a resource ID11, the period ID1 to a resource ID12, the slot ID1 to a resource ID13, and the resource ID11, the resource ID12, and the resource ID13 are all boundary delay information. In this example, the controller establishes a mapping relationship (e.g., referred to as mapping relationship 1) of queue ID1 and resource ID11, and sends mapping relationship 1 to network node 101 for network node 101 to determine underlying resource information when forwarding the first traffic stream carrying resource ID 11. The controller establishes a mapping relationship (e.g. referred to as mapping relationship 2) between the period ID1 and the resource ID12, and sends the mapping relationship 2 to the network node 102, so that the network node 102 can determine the underlying resource information when forwarding the first traffic stream carrying the resource ID 12. The controller establishes a mapping relationship (e.g. referred to as mapping relationship 3) between the slot ID1 and the resource ID13, and sends the mapping relationship 3 to the network node 103, so that when the network node 103 forwards the first traffic stream carrying the resource ID13, the bottom layer resource information is determined.

Taking the at least one bounded time delay information as a bounded time delay information, and the bounded time delay information is abstract resource information as an example. The controller performs abstract processing on the bottom layer resource information of the plurality of network nodes to obtain abstract resource information corresponding to the bottom layer resource information of the plurality of network nodes, namely bounded time delay information. For example, the plurality of network nodes includes network nodes 101 to 103, the bottom layer resource information of the network node 101 for transmitting the first traffic flow is a queue ID1, the bottom layer resource information of the network node 102 for transmitting the first traffic flow is a period ID1, the bottom layer resource information of the network node 103 for transmitting the first traffic flow is a slot ID1, and the controller abstracts the queue ID1, the period ID1 and the slot ID1 into a resource ID1, where the resource ID1 is bounded time delay information. In this example, the controller establishes a mapping relationship between the queue ID1, the period ID1, the slot ID1 and the resource ID1, and sends the mapping relationship to the network nodes 101 to 103, so that the network nodes 101 to 103 determine the underlying resource information when forwarding the first traffic stream carrying the resource ID 1.

S503, the controller sends a control message to the first network node, wherein the control message comprises first type indication information and first bounded time delay information.

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

In an embodiment of the present application, the control message includes first type indication information and first bounded time delay information, so as to instruct the first network node to process the first service flow according to the first type indication information and the first bounded time delay information. Optionally, the control message further includes second type indication information and second bounded time delay information, the second bounded time delay information and the first bounded time delay information are sequentially arranged in the control message, the second type indication information and the first type indication information are sequentially arranged in the control message, and an arrangement sequence of the second type indication information and the first type indication information is the same as an arrangement sequence of the second bounded time delay information and the first bounded time delay information. In one example, the control message includes a first TLV field and a second TLV field arranged in sequence, the first type of indication information and the first bounded time delay information being located in the first TLV field, the second type of indication information and the second bounded time delay information being located in the second TLV field. In another example, the control message includes an information stack including a first information item and a second information item arranged in sequence, the first information item including a first type of indication information and a first bounded time delay information, the second information item including a second type of indication information and a second bounded time delay information.

In an alternative embodiment, the control message includes a plurality of bounded time delay information and a plurality of type indication information, the plurality of bounded time delay information corresponds to the plurality of type indication information one-to-one, the plurality of bounded time delay information includes a first bounded time delay information and a second bounded time delay information, and the plurality of type indication information includes a first type indication information and a second type indication information. The plurality of bounded time delay information is arranged in sequence in the control message, the plurality of type indication information is arranged in sequence in the control message, and the arrangement sequence of the plurality of type indication information is the same as the arrangement sequence of the plurality of bounded time delay information. In one example, the control packet includes a plurality of TLV fields arranged in sequence, where the plurality of bounded time delay information is located in the plurality of TLV fields in a one-to-one correspondence, and each type indication information is located in the same TLV field as the bounded time delay information corresponding to the bounded time delay information, and optionally, the plurality of bounded time delay information is located in the plurality of network nodes in the first deterministic network in a one-to-one correspondence, and each TLV field further includes a node identifier to indicate a network node corresponding to the bounded time delay information carried in each TLV field. In another example, the control packet includes an information stack, where the information stack includes a plurality of information items arranged in sequence, the plurality of bounded time delay information is included in the plurality of information items in a one-to-one correspondence, each type of indication information and the bounded time delay information corresponding thereto are included in the same information item, and optionally, the plurality of bounded time delay information is in a one-to-one correspondence with a plurality of network nodes in the first deterministic network, and each information item further includes a node identifier to indicate the network node corresponding to the bounded time delay information included in each information item.

It should be noted that, S503 is illustrated by taking the first network node as an entry node of the first deterministic network, and the meaning of S503 is expressed in practice as follows: the controller sends a control message to an ingress node of the first deterministic network.

In summary, according to the method for transmitting a message provided in the embodiment of the present application, the controller generates, according to the capability information of the first network node in the first deterministic network, a control message including the first type indication information and the first bounded time delay information, and sends the control message to the first network node, so that the first network node may obtain, according to the control message, a service message (for example, the first message) carrying the first type indication information and the first bounded time delay information, and forward the service message according to the first type indication information and the first bounded time delay information, thereby guaranteeing an end-to-end deterministic time delay of the service message in the first deterministic network.

In order to facilitate understanding of the technical solution of the present application, the following description of the actual network scenario describes the technical solution of the embodiment of the present application.

Fig. 16 is a schematic diagram of message transmission according to an embodiment of the present application. Fig. 16 illustrates the transmission of a first traffic flow from network node 101 to network node 105. Network nodes 101-105 are all in a first deterministic network, network node 101 being an ingress node of the first deterministic network and network node 105 being an egress node of the first deterministic network, in which base slice, network slice 1 and network slice 2 are deployed. Fig. 16 illustrates that a packet of the first traffic flow carries a slice ID and a plurality of bounded latency information, where the plurality of bounded latency information corresponds to a plurality of network nodes along the packet one-to-one.

After network node 101 receives message 1, network node 101 encapsulates the IPv6 header, HBH, and SRH in message 1 to obtain message 2.HBH carries slice ID1. The SRH includes a SL field whose value indicates the number of SID's remaining unprocessed to reach the destination node, and Duan Liebiao, and includes 4 SIDs in one-to-one correspondence with the network nodes 102 to 105, and a parameter (args) field of each SID carrying one bounded time delay information and type indication information (type indication information is not shown in the figure for simplicity) for indicating the type of the bounded time delay information. For example, the network node 102 corresponds to the SID102, the network node 103 corresponds to the SID103, the network node 104 corresponds to the SID104, the network node 105 corresponds to the SID105 (in the figure, SID102 is denoted as "102", SID103 is denoted as "103", SID104 is denoted as "104", SID105 is denoted as "105"), the parameter field of the SID102 carries the queue ID1 and the type indication information for indicating the type of the queue ID1, the parameter field of the SID103 carries the period ID1 and the type indication information for indicating the type of the period ID1, the parameter field of the SID104 carries the slot ID1 and the type indication information for indicating the type of the slot ID1, and the parameter field of the SID105 carries the local delay information and the type indication information for indicating the type of the local delay information. The IPv6 header includes an IPv6 Source Address (SA) field for carrying an IPv6 SA and an IPv6 destination address (destination address, DA) field for carrying an IPv6 DA. The IPv6 SA of the packet 2 is SID101 (SID corresponding to the network node 101, schematically indicated as "101") and the IPv6 DA of the packet 2 is SID102. Network node 101 forwards message 2 to network node 102 through network slice 1 based on slice ID1.

After the network node 102 receives the message 2, the network node 102 executes the instruction corresponding to the SID102, and the network node 102 subtracts 1 from the value of the SL field of the message 2 and modifies the IPv6 DA of the message 2 to the SID103 to obtain the message 3. The network node 102 determines the queue 1 indicated by the queue ID1 in the queues corresponding to the network slice 1 according to the slice ID1 and the queue ID1 carried by the SID102, and the network node 102 forwards the message 3 to the network node 103 through the queue 1.

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

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

After the network node 105 receives the message 5, the network node 105 executes the instruction corresponding to the SID105, and the network node 105 strips the IPv6 header, HBH and SRH of the message 5 to obtain the message 1. According to the local delay information carried by the slice ID1 and the SID105, the network node 105 determines the resource meeting the delay requirement indicated by the local delay information from the resources corresponding to the network slice 1, and the network node 105 forwards the message 1 through the resource meeting the delay requirement indicated by the local delay information.

Fig. 17 is a schematic diagram of another message transmission provided in an embodiment of the present application. Fig. 17 illustrates the transmission of a first traffic flow from network node 101 to network node 105. Network nodes 101-105 are all in a first deterministic network, network node 101 being an ingress node of the first deterministic network and network node 105 being an egress node of the first deterministic network, in which base slice, network slice 1 and network slice 2 are deployed. Fig. 16 illustrates that the slice ID and a bounded time delay information are carried in a packet of the first traffic flow, and the bounded time delay information is abstract resource information.

Referring to fig. 17, after network node 101 receives message 1, network node 101 encapsulates the IPv6 header, HBH, and SRH in message 1 to obtain message 2.HBH carries slice ID1. The SRH includes a SL field including 4 SIDs, each of which is of an end.bli type, in one-to-one correspondence with the network nodes 102 to 105, a segment list carrying a resource ID1 and type indication information (type indication information is not shown in the figure for brevity) for indicating the type of the resource ID1, the resource ID1 being abstract resource information, and a TLV field whose value indicates the number of SIDs remaining unprocessed to reach the destination node. The IPv6 header comprises an IPv6 SA field and an IPv6 DA field, the IPv6 SA field is used for carrying an IPv6 SA, and the IPv6 DA field is used for carrying an IPv6 DA. The IPv6 SA of message 2 is SID101, and the IPv6 DA is SID102. Network node 101 forwards message 2 to network node 102 through network slice 1 based on slice ID1.

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

After the network node 103 receives the message 3, the network node 103 executes an instruction corresponding to the SID103, and the network node 103 subtracts 1 from the value of the SL field of the message 3 and modifies the IPv6 DA of the message 3 to the SID104 to obtain the message 4. The network node 103 determines the bottom resource information (assumed to be period ID 1) corresponding to the resource ID1 on the network node 103 according to the resource ID1 and the local mapping relation, the network node 103 determines the period 1 indicated by the period ID1 in the period corresponding to the network slice 1 according to the slice ID1 and the period ID1, and the network node 103 forwards the message 4 to the network node 104 through the period 1.

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

After the network node 105 receives the message 5, the network node 105 executes the instruction corresponding to the SID105, and the network node 105 strips 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 according to the resource ID1 and the local mapping relationship, the network node 105 determines the queue with the priority 1 (the priority indicated by the priority information 1) in the queue corresponding to the network slice 1 according to the slice ID1 and the priority information 1, and the network node 105 forwards the message 1 through the queue with the priority 1.

The foregoing is an introduction to method embodiments of the present application. Embodiments of the apparatus of the present application are described below, which may be used to perform the methods of the present application. For details not disclosed in the device embodiments, please refer to the method embodiments.

Fig. 18 is a schematic diagram of a message transmission apparatus 1800 according to an embodiment of the present application. The message transmission device 1800 is applied to a first network node in a first deterministic network, e.g. the message transmission device 1800 is the first network node or a functional component in the first network node. Referring to fig. 18, the message transmission apparatus 1800 includes a processing module 1810 and a sending module 1820.

The processing module 1810 is configured to obtain a first packet, where the first packet carries first type indication information and first bounded time delay information, the first type indication information is used to indicate a type of the first bounded time delay information, and the first bounded time delay information is used to ensure an end-to-end deterministic time delay of the first packet in the first deterministic network. The functional implementation of the processing module 1810 may refer to the relevant description in S301 above.

The sending module 1820 is configured to forward the first packet according to the first type indication information and the first bounded time delay information. The functional implementation of the transmitting module 1820 may refer to the relevant description in S302 above.

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

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

determining a first resource used for transmitting a first message in a first network node according to the first bounded time delay information and the type of the first bounded time delay information; and forwarding the first message through the first resource.

Optionally, the first packet further carries second bounded time delay information and second type indication information, the second type indication information is used for indicating a type of the second bounded time delay information, the second bounded time delay information is used for guaranteeing end-to-end deterministic time delay of the first packet in the first deterministic network, the second type indication information and the second bounded time delay information are used for forwarding the first packet by the second network node, and the second network node is in the first deterministic network.

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

Optionally, the first network node is an ingress node of a first deterministic network, and the processing module 1810 is configured to: receiving a second message; receiving a control message sent by a controller, wherein the control message comprises first type indication information and first bounded time delay information; and generating a first message according to the second message, the first type indication information and the first bounded time delay information.

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

Optionally, the first network node is an ingress node of a first deterministic network, and the processing module 1810 is configured to: receiving a second message from a second deterministic network, wherein the second message carries target bounded time delay information; acquiring first type indication information and first bounded time delay information according to target bounded time delay information; and generating a first message according to the second message, the first type indication information and the first bounded time delay information.

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

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

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

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

Optionally, the IPv6 extension header is an SRH, and the SRH includes a TLV field, where the first type indication information and the first bounded time delay information are located in the TLV field. The SRH also includes a segment list including a first SID, the first bounded latency information and the first SID each corresponding to a first network node, the first SID being of a target type.

In one example, the TLV field carries a plurality of type indication information and a plurality of bounded time delay information, where the plurality of type indication information and the plurality of bounded time delay information are in one-to-one correspondence, each type indication information is used to indicate a type of the corresponding bounded time delay information, the plurality of bounded time delay information includes first bounded time delay information, and the plurality of type indication information includes first type indication information; the segment list comprises a plurality of SIDs, the SIDs are in one-to-one correspondence with a plurality of network nodes along the first message, the plurality of bounded time delay information is in one-to-one correspondence with a plurality of network nodes along the first message, the number of the bounded time delay information is not greater than that of the SIDs, and the type of the SID corresponding to the bounded time delay information in the SIDs is a target type.

In another example, the segment list includes a plurality of SIDs, where the plurality of SIDs are in one-to-one correspondence with a plurality of network nodes along the first packet, the first bounded latency information is corresponding to the plurality of network nodes, and types of the plurality of SIDs are all target types.

Optionally, the first network node is an egress node of the first deterministic network, the first packet is a SRv packet, the SRH of the first packet includes a segment list and a TLV field, the segment list includes a plurality of SIDs, the plurality of SIDs are in one-to-one correspondence with a plurality of network nodes along the path of the first packet, the first type indication information and the first bounded time delay information are both located in the TLV field, the first bounded time delay information only corresponds to the first network node, and a type of SID corresponding to only the first network node in the plurality of SIDs is a target type.

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

the slice indication information and the first bounded time 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 time delay information are located in an MPLS extension header of the first message.

In summary, according to the packet transmission device provided in the embodiment of the present application, the first packet is carried with the first bounded time delay information and the first type indication information for indicating the type of the first bounded time delay information, so as to assist the network node in the first deterministic network to forward the first packet, thereby guaranteeing the end-to-end deterministic time delay of the first packet in the first deterministic network.

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

A receiving module 1910 is configured to receive capability information of a first network node, where the first network node is in a first deterministic network. The functional implementation of the receiving module 1910 may refer to the related description in S501 above.

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

A 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 time delay information. The function implementation of the transmission module 1930 may refer to the description in S503 described above.

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

a processing module 1920, configured to obtain at least one bounded time delay information and at least one type indication information according to capability information of the plurality of network nodes, where the at least one bounded time delay information corresponds to the at least one type indication information one-to-one, each type indication information is used for indicating a type of the corresponding bounded time delay information, the at least one bounded time delay information includes first bounded time delay information, the at least one type indication information includes first type indication information, and the control message includes the at least one bounded time delay information and the at least one type indication information.

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

Optionally, the control message includes an information stack, where the information stack includes a first information item and a second information item sequentially arranged, the first information item includes a first type of indication information and a first bounded time delay information, and the second information item includes a second type of indication information and a second bounded time delay information.

In summary, in the packet transmission device provided in the embodiment of the present application, the packet transmission device obtains the first bounded time delay information and the first type indication information for indicating the type of the first bounded time delay information according to the capability information of the first network node, and sends a control packet including the first type indication information and the first bounded time delay information to the first network node, so that the first network node may obtain, according to the control packet, a service packet (for example, a first packet) carrying the first type indication information and the first bounded time delay information, and forward the service packet according to the first type indication information and the first bounded time delay information, thereby guaranteeing an end-to-end deterministic time delay of the service packet in the first deterministic network.

The message transmission device provided by the embodiment of the application can also be implemented by an application-specific integrated circuit (ASIC-specific integrated circuit) or a programmable logic device (programmable logic device, PLD). The PLD may be a complex program logic device (complex programmable logical device, CPLD), a field-programmable gate array (field-programmable gate array, FPGA), general-purpose array logic (generic array logic, GAL), or any combination thereof. The method provided by the method embodiment can also be implemented by software, and when the message transmission method provided by the method embodiment is implemented by software, each module in the message transmission device can also be a software module.

Referring to fig. 20, a schematic diagram of still another message transmission apparatus 2000 according to an embodiment of the present application is shown. The message transmitting 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. The plurality of interface boards also comprises, in the case of a plurality of interface boards, a switching network board (not shown in fig. 20) for completing the data exchange between the interface boards (interface boards are also called line cards or service boards).

The main control board 2010 is used for completing functions such as system management, equipment maintenance, protocol processing and the like. Interface board 2030 and interface board 2040 are used to provide various service interfaces (e.g., POS interface, GE interface, ATM interface, etc.) and to implement message forwarding. The main control board 2010 mainly has 3 kinds of functional units: the system comprises a system management control unit, a system clock unit and a system maintenance unit. The main control board 2010, the interface board 2030 and the interface board 2040 are connected with a system back board through a system bus to realize intercommunication. The interface board 2030 includes one or more processors 2031 thereon. The processor 2031 is configured 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 for storage capability information, bounded latency information, and the like. The interface board 2030 includes one or more network interfaces 2033 for receiving and sending messages, and detailed implementation is not described here. As shown in fig. 20, the main control board 2010 further includes a memory 2014, where the memory 2014 is configured to store system management information, protocols, and the like, which is not limited in the embodiment of the present application.

As shown in fig. 20, this embodiment includes a plurality of interface boards, and a distributed forwarding mechanism is used, where the operation on the interface board 2040 is substantially similar to the operation of the interface board 2030. For example, the interface board 2040 includes one or more network interfaces 2043 for receiving and transmitting messages, memory 2042 for storing capability information, bounded latency information, and a processor 2041 for controlling and managing the interface board 2040 and communicating with a central processor 2012 on the main control board 2010. For brevity, the interface board 2040 is not described in detail herein.

The processor 2031 in the interface board 2030 and/or the processor 2041 in the interface board 2040 in fig. 20 may be dedicated hardware or a chip, such as a network processor or an application-specific integrated circuit, for performing the functions described above, i.e., the forwarding plane is usually processed by dedicated hardware or a chip. In other embodiments, the processor 2031 in the interface board 2030 and/or the processor 2041 in the interface board 2040 may also be a general purpose processor, such as a central processing unit (central processing unit, CPU).

In addition, it should be noted that the master control board may have one or more pieces, and the master control board may include a main master control board and a standby master control board when there are more pieces. The interface boards may have one or more blocks, the more data processing capabilities the network nodes are, the more interface boards are provided. Under the condition of a plurality of interface boards, the interface boards can communicate through one or a plurality of exchange network boards, and load sharing redundancy backup can be realized jointly when a plurality of interface boards exist. Under the centralized forwarding architecture, the network node may not need to exchange network boards, and the interface board bears the processing function of the service data of the whole system. Under the distributed forwarding architecture, the network node comprises a plurality of interface boards, and data exchange among the plurality of interface boards can be realized through the exchange network board, so that high-capacity data exchange and processing capacity are provided. Therefore, the data access and processing power of the network nodes of the distributed architecture is greater than that of the network nodes of the centralized architecture. Which architecture is specifically adopted depends on the networking deployment scenario, and no limitation is made here.

In alternative embodiments, memory 2032 and/or Memory 2042 is read-only Memory (ROM) or other type of static storage device that can store static information and instructions, random access Memory (random access Memory, RAM) or other type of dynamic storage device that can store information and instructions, but can also be, but is not limited to, electrically erasable programmable read-only Memory (electrically erasable programmable read-only Memory, EEPROM), compact disc read-only Memory (compact disc read-only Memory, CD-ROM) or other optical disk storage, optical disk storage (including compact disc, laser disc, optical disc, digital versatile disc, blu-ray disc, etc.), magnetic disk or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory 2032 may be provided separately and connected to the processor 2031 via a communication bus or may be integrated with the processor 2031. The memory 2042 may be separate and coupled to the processor 2041 via a communications bus or may be integral to the processor 2041.

The memory 2032 is for storing program codes and is controlled to be executed by the processor 2031 to perform part or all of the steps of the method provided by the above embodiments. The processor 2031 is for executing program code stored in the memory 2032. One or more software modules may be included in the program code. The one or more software modules may be the functional modules provided in the embodiment shown in fig. 18 described above. The memory 2042 may also be used to store program code and be controlled by the processor 2041 for execution to perform some or all of the steps of the methods provided by the embodiments described above. Similarly, the memory 2014 may also be used for storing program codes and be controlled by the central processor 2012 to execute some or all of the steps of the method provided by the above embodiments.

In alternative embodiments, the network interface 2033, 2043 may be a device using any transceiver or the like for communicating with other devices or communication networks, such as ethernet, radio access network (radio access network, RAN), wireless local area network (wireless local area networks, WLAN), etc.

Referring to fig. 21, a schematic diagram of yet another message transmission apparatus 2100 according to an embodiment of the present application is shown. The message transmission apparatus 2100 may be a network node or a functional component in a network node, or may be a controller or a functional component in a controller. The message transmission device 2100 includes a processor 2102, a memory 2104, a communication interface 2106, and a bus 2108, where the processor 2102, the memory 2104, and the communication interface 2106 are communicatively coupled via the bus 2108. In other embodiments, the processor 2102, the memory 2104, and the communication interface 2106 may be connected in other ways.

The memory 2104 is used to store, among other things, a computer program 21042, which computer program 21042 may include instructions and data. The memory 2104 may be various types of storage media such as RAM, ROM, nonvolatile RAM (NVRAM), programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (electrically erasable PROM, EEPROM), flash memory, optical memory, registers, and the like.

The processor 2102 may be a general-purpose processor, which may be a processor that performs certain steps and/or operations by reading and executing a computer program (e.g., computer program 21042) stored in a memory (e.g., memory 2104), which may use data stored in the memory in performing the steps and/or operations. The stored computer programs may be executed to implement the relevant functions of the aforementioned processing module 1810, transmitting module 1820, and the like. The general purpose processor may be a CPU. The processor 2102 may also be a special purpose processor, which is a specially designed processor for performing certain steps and/or operations, which may be a digital signal processor (digital signal processor, DSP), ASIC, FPGA, or the like. The 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 methods of the embodiments described above.

Among other things, the communication interface 2106 may include input/output (I/O) interfaces, physical interfaces, logical interfaces, and the like for enabling interconnection of devices within the message transmitting apparatus 2100, as well as interfaces for enabling interconnection of the message transmitting apparatus 2100 with other devices (e.g., network devices). The physical interface may be Gigabit Ethernet (GE) that may be used to implement the interconnection of the message transmission apparatus 2100 with other devices, and the logical interface is an interface inside the message transmission apparatus 2100 that may be used to implement the interconnection of devices inside the message transmission apparatus 2100. It is to be readily understood that the communication interface 2106 may be used for the packet transmission apparatus 2100 to communicate with other devices, for example, the communication interface 2106 may be used for sending and receiving packets between the packet transmission apparatus 2100 and other devices, and the communication interface 2106 may implement the foregoing functions related to the sending module 1820, the receiving module 1910, the sending module 1930, and so on. The communication interface 2106 may also include a transceiver for transceiving messages, which may likewise implement the functionality associated with the aforementioned transmit module 1820, receive module 1910, transmit module 1930, and the like.

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

The above devices may be provided on separate chips, or may be provided at least partially or entirely on the same chip. Whether the individual devices are independently disposed on different chips or integrally disposed on one or more chips is often dependent on the needs of the product design. The embodiment of the application does not limit the specific implementation form of the device.

The message transmitting apparatus 2100 illustrated in fig. 21 is merely an example, and the message transmitting apparatus 2100 may further include other components. The message transmission apparatus 2100 transmits a message by performing all or part of the steps of the method provided by the above-described embodiments.

The embodiment of the application provides a message transmission system, which comprises a plurality of network nodes, wherein at least one network node of the plurality of network nodes comprises a message transmission device shown in fig. 18, 20 or 21.

Optionally, the message transmission system further includes a controller, where the controller includes the message transmission device shown in fig. 19 or fig. 21.

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

The present application provides a computer readable storage medium having stored therein a computer program which, when executed (e.g., by a network node, a controller, one or more processors, etc.), implements all or part of the steps of a message transmission method as provided by the method embodiments described above.

The present application provides a computer program product comprising a program or code which, when executed (e.g. by a network node, a controller, one or more processors, etc.), implements all or part of the steps of a method for transmitting messages as provided by the method embodiments described above.

The embodiment of the application provides a chip, which comprises a programmable logic circuit and/or program instructions, and the chip realizes all or part of the steps of the message transmission method provided by the embodiment of the method when running.

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be embodied in whole or in part in the form of a computer program product comprising one or more computer instructions. When loaded and executed on a computer, produces a flow or function in accordance with embodiments of the present application, in whole or in part. The computer may be a general purpose computer, a network of computers, or other programmable devices. The computer instructions may be stored in or transmitted from one computer readable storage medium to another, for example, by wired (e.g., coaxial cable, optical fiber, digital subscriber line) or wireless (e.g., infrared, wireless, microwave, etc.) means from one website, computer, server, or data center. The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device including one or more servers, data centers, etc. that can be integrated with the available medium. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium, or a semiconductor medium (e.g., solid state disk), etc.

It should be understood that the term "at least one" in this application refers to one or more, and "a plurality" refers to two or more. In the present application, the symbol "/" generally means or unless otherwise indicated, for example, a/B may represent a or B. The term "and/or" in this application is merely an association relation describing an associated object, meaning that three relations may exist, e.g., a and/or B, may represent: a exists alone, A and B exist together, and B exists alone. In addition, for purposes of clarity of description, the words "first," "second," "third," and the like are used throughout this application to distinguish between identical or similar items that have substantially the same function and effect. Those skilled in the art will appreciate that the words "first," "second," "third," etc. do not limit the number and order of execution.

Different types of embodiments, such as a method embodiment and a device embodiment, provided in the embodiments of the present application may be mutually referred to, and the embodiments of the present application are not limited to this. The sequence of the operations of the method embodiment provided in the embodiment of the present application can be appropriately adjusted, the operations can also be increased or decreased according to the situation, and any method that is easily conceivable to be changed by a person skilled in the art within the technical scope of the present application is covered in the protection scope of the present application, so that no further description is provided.

In the corresponding embodiments provided in the present application, it should be understood that the disclosed apparatus and the like may be implemented by other structural manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of elements is merely a logical functional division, and there may be additional divisions of actual implementation, e.g., multiple elements or components may be combined or integrated into another system, or some features may be omitted, or not performed.

The elements illustrated as separate elements may or may not be physically separate, and elements described as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network nodes. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

While the invention has been described with reference to exemplary embodiments thereof, it will be understood by those skilled in the art that various changes and substitutions of equivalents may be made without departing from the spirit and scope of the invention. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A method of message transmission, for use with a first network node in a first deterministic network, the method comprising:

the first network node acquires a first message, wherein the first message carries first type indication information and first bounded time delay information, the first type indication information is used for indicating the type of the first bounded time delay information, and the first bounded time delay information is used for guaranteeing end-to-end deterministic time delay of the first message in the first deterministic network;

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

2. The method of claim 1, wherein the first bounded latency information comprises time resource information or traffic demand information.

3. The method of claim 2, wherein the time resource information comprises at least one of: queue indication information, period indication information, slot indication information, priority information.

4. A method according to claim 2 or 3, wherein the service requirement information comprises at least one of: delay requirement information, jitter requirement information, deadline requirement information.

5. The method according to any of claims 1 to 4, wherein the first network node forwarding the first message according to the first type indication information and the first bounded time delay information comprises:

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

the first network node determines a first resource used for transmitting the first message in the first network node according to the first bounded time delay information and the type of the first bounded time delay information;

and the first network node forwards the first message through the first resource.

6. The method according to any of claims 1 to 5, wherein the first message further carries second bounded time delay information and second type indication information, the second type indication information being used to indicate a type of the second bounded time delay information, the second bounded time delay information being used to guarantee an end-to-end deterministic time delay of the first message in the first deterministic network, the second type indication information and the second bounded time delay information being used by a second network node forwarding the first message, the second network node being in the first deterministic network.

7. The method of claim 6, wherein the second bounded time delay information is of a different type than the first bounded time delay information.

8. The method according to any of claims 1 to 7, wherein the first network node is an ingress node of the first deterministic network, the first network node obtaining a first message comprising:

the first network node receives a second message;

the first network node receives a control message sent by a controller, wherein the control message comprises the first type indication information and the first bounded time delay information;

the first network node generates the first message according to the second message, the first type indication information and the first bounded time delay information.

9. The method of claim 8, wherein prior to the first network node receiving the control message sent by the controller, the method further comprises:

the first network node sends capability information of the first network node to the controller, and the controller is used for determining the first type indication information and the first bounded time delay information according to the capability information.

10. The method according to any of claims 1 to 7, wherein the first network node is an ingress node of the first deterministic network, the first network node obtaining a first message comprising:

the first network node receives a second message, wherein the second message is from a second deterministic network and carries target bounded time delay information;

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

11. The method according to any one of claims 1 to 10, wherein,

the first message is an internet protocol version 6 IPv6 message, and the first type indication information and the first bounded time delay information are both positioned in an IPv6 extension header of the first message.

12. The method of claim 11, wherein the IPv6 extension header includes any one of: hop-by-hop header HBH, destination option header DOH, segment routing header SRH.

13. The method of claim 12, wherein the IPv6 extension header is the HBH or the DOH, and wherein the first type indication information and the first bounded latency information are both located in an option field of the IPv6 extension header.

14. The method of claim 12, wherein the IPv6 extension header is the SRH, the SRH comprising a segment list, the first type indication information and the first bounded latency information both being located in the segment list.

15. The method of claim 14, wherein the segment list comprises a first segment identification SID, wherein the first type indication information and the first bounded time delay information are both located in a parameter field of the first SID.

16. The method of claim 12, wherein the IPv6 extension header is the SRH, the SRH comprising a type length value TLV field, the first type indication information and the first bounded time delay information both being located in the TLV field.

17. The method of claim 16, wherein the SRH further comprises a segment list comprising a first segment identification, SID, the first bounded latency information and the first SID each corresponding to the first network node, the first SID being of a target type.

18. The method according to any of claims 11 to 17, wherein the first message further carries slice indication information, the slice indication information being located in an IPv6 extension header of the first message.

19. The method according to any one of claims 1 to 10, wherein,

the first message is a multiprotocol label switching MPLS message, and the first type indication information and the first bounded time delay information are both located in an MPLS extension header of the first message.

20. A method for transmitting a message, the method comprising:

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

the controller acquires first type indication information and first bounded time delay information according to the capability information, wherein the first type indication information is used for indicating the type of the first bounded time delay information, and the first bounded time delay information is used for guaranteeing end-to-end deterministic time delay of a message carrying the first bounded time delay information in the first deterministic network;

the controller sends a control message to the first network node, wherein the control message comprises the first type indication information and the first bounded time delay information.

21. The method of claim 20, wherein the first bounded latency information comprises time resource information or traffic demand information.

22. The method of claim 21, wherein the time resource information comprises at least one of: queue indication information, period indication information, slot indication information, priority information.

23. The method according to claim 21 or 22, wherein the service requirement information comprises at least one of: delay requirement information, jitter requirement information, deadline requirement information.

24. The method according to any one of claims 20 to 23, wherein,

the controller receives capability information of a first network node, comprising: the controller receives capability information of a plurality of network nodes, the plurality of network nodes being in the first deterministic network, the plurality of network nodes including the first network node;

the controller obtains first type indication information and first bounded time delay information according to the capability information, and the method comprises the following steps: the controller obtains at least one bounded time delay information and at least one type indication information according to capability information of the plurality of network nodes, wherein the at least one bounded time delay information corresponds to the at least one type indication information one by one, each type indication information is used for indicating the corresponding type of the bounded time delay information, the at least one bounded time delay information comprises the first bounded time delay information, the at least one type indication information comprises the first type indication information, and the control message comprises the at least one bounded time delay information and the at least one type indication information.

25. The method of claim 24, wherein the at least one bounded time delay information further comprises a second bounded time delay information, the at least one type of indication information further comprises a second type of indication information, the second type of indication information is used to indicate a type of the second bounded time delay information, the second bounded time delay information is used to guarantee an end-to-end deterministic time delay of a message carrying the second bounded time delay information in the first deterministic network, and the type of the second bounded time delay information is different from the type of the first bounded time delay information.

26. The method according to claim 24 or 25, wherein the second bounded time delay information and the first bounded time delay information are arranged sequentially in the control message, the second type of indication information and the first type of indication information are arranged sequentially in the control message, and the order of arrangement of the second type of indication information and the first type of indication information is the same as the order of arrangement of the second bounded time delay information and the first bounded time delay information.

27. The method of claim 26, wherein the control message comprises a first type length value TLV field and a second TLV field in sequence, wherein the first type indication information and the first bounded time delay information are located in the first TLV field, and wherein the second type indication information and the second bounded time delay information are located in the second TLV field.

28. The method of claim 26, wherein the step of determining the position of the probe is performed,

the control message comprises an information stack, wherein the information stack comprises a first information item and a second information item which are sequentially arranged, the first information item comprises the first type indication information and the first bounded time delay information, and the second information item comprises the second type indication information and the second bounded time delay information.

29. A message transmission apparatus for use in a first network node in a first deterministic network, the apparatus comprising:

the processing module is used for acquiring a first message, wherein the first message carries first type indication information and first bounded time delay information, the first type indication information is used for indicating the type of the first bounded time delay information, and the first bounded time delay information is used for guaranteeing the end-to-end deterministic time delay of the first message in the first deterministic network;

and the sending module is used for forwarding the first message according to the first type indication information and the first bounded time delay information.

30. The apparatus of claim 29, wherein the first bounded latency information comprises time resource information or traffic demand information.

31. The apparatus of claim 30, wherein the time resource information comprises at least one of: queue indication information, period indication information, slot indication information, priority information.

32. The apparatus according to claim 30 or 31, wherein the service requirement information comprises at least one of: delay requirement information, jitter requirement information, deadline requirement information.

33. The apparatus according to any one of claims 29 to 32, wherein the sending module is configured to:

determining the type of the first bounded time delay information according to the first type indication information;

determining a first resource used for transmitting the first message in the first network node according to the first bounded time delay information and the type of the first bounded time delay information;

and forwarding the first message through the first resource.

34. The apparatus according to any of claims 29 to 33, wherein the first message further carries second bounded time delay information and second type indication information, the second type indication information being used to indicate a type of the second bounded time delay information, the second bounded time delay information being used to guarantee an end-to-end deterministic time delay of the first message in the first deterministic network, the second type indication information and the second bounded time delay information being used by a second network node forwarding the first message, the second network node being in the first deterministic network.

35. The apparatus of claim 34, wherein the second bounded time delay information is of a different type than the first bounded time delay information.

36. The apparatus according to any of claims 29 to 35, wherein the first network node is an ingress node of the first deterministic network, the processing module being configured to:

receiving a second message;

receiving a control message sent by a controller, wherein the control message comprises the first type indication information and the first bounded time delay information;

and generating the first message according to the second message, the first type indication information and the first bounded time delay information.

37. The apparatus of claim 36, wherein the device comprises a plurality of sensors,

the sending module is further configured to send capability information of the first network node to the controller, where the controller is configured to determine the first type indication information and the first bounded time delay information according to the capability information.

38. The apparatus according to any of claims 29 to 35, wherein the first network node is an ingress node of the first deterministic network, the processing module being configured to:

Receiving a second message, wherein the second message is from a second deterministic network and carries target bounded time delay information;

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

39. The device according to any one of claims 29 to 38, wherein,

40. The apparatus of claim 39, wherein the IPv6 extension header includes any one of: hop-by-hop header HBH, destination option header DOH, segment routing header SRH.

41. The apparatus of claim 40, wherein the IPv6 extension header is either the HBH or the DOH, and wherein the first type indication information and the first bounded latency information are both located in an option field of the IPv6 extension header.

42. The apparatus of claim 40, wherein the IPv6 extension header is the SRH, the SRH including a segment list, the first type indication information and the first bounded time delay information both being located in the segment list.

43. The apparatus of claim 42, wherein the segment list comprises a first segment identification, SID, the first type indication information and the first bounded time delay information are both located in a parameter field of the first SID.

44. The apparatus of claim 40, wherein the IPv6 extension header is the SRH, the SRH including a type length value TLV field, the first type indication information and the first bounded time delay information both being located in the TLV field.

45. The apparatus of claim 44, wherein the SRH further comprises a segment list, the segment list comprising a first segment identification, SID, the first bounded latency information and the first SID each corresponding to the first network node, the first SID being of a type that is a target type.

46. The apparatus according to any one of claims 39 to 45, wherein the first message further carries slice indication information, the slice indication information being located in an IPv6 extension header of the first message.

47. The method according to any one of claims 29 to 38, wherein,

48. A message transmission device, applied to a controller, comprising:

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

the processing module is used for acquiring first type indication information and first bounded time delay information according to the capability information, wherein the first type indication information is used for indicating the type of the first bounded time delay information, and the first bounded time delay information is used for guaranteeing end-to-end deterministic time delay of a message carrying the first bounded time delay information in the first deterministic network;

and the sending module is used for sending a control message to the first network node, wherein the control message comprises the first type indication information and the first bounded time delay information.

49. The apparatus of claim 48, wherein the first bounded latency information comprises time resource information or traffic demand information.

50. The apparatus of claim 49, wherein the time resource information comprises at least one of: queue indication information, period indication information, slot indication information, priority information.

51. The apparatus of claim 49 or 50, wherein the traffic demand information comprises at least one of: delay requirement information, jitter requirement information, deadline requirement information.

52. The device of any one of claims 48 to 51, wherein,

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

the processing module is configured to obtain at least one bounded time delay information and at least one type indication information according to capability information of the plurality of network nodes, where the at least one bounded time delay information corresponds to the at least one type indication information one by one, each type indication information is used for indicating a type of the corresponding bounded time delay information, the at least one bounded time delay information includes the first bounded time delay information, and the at least one type indication information includes the first type indication information, and the control message includes the at least one bounded time delay information and the at least one type indication information.

53. The apparatus of claim 52, wherein the at least one bounded time delay information further comprises a second bounded time delay information, the at least one type of indication information further comprises a second type of indication information, the second type of indication information is used to indicate a type of the second bounded time delay information, the second bounded time delay information is used to guarantee an end-to-end deterministic time delay of a message carrying the second bounded time delay information in the first deterministic network, and the type of the second bounded time delay information is different from the type of the first bounded time delay information.

54. The apparatus of claim 52 or 53, wherein the second bounded time delay information and the first bounded time delay information are sequentially arranged in the control message, the second type of indication information and the first type of indication information are sequentially arranged in the control message, and an arrangement order of the second type of indication information and the first type of indication information is the same as an arrangement order of the second bounded time delay information and the first bounded time delay information.

55. The apparatus of claim 54, wherein the control message comprises a first type length value TLV field and a second TLV field in sequence, wherein the first type indication information and the first bounded time delay information are located in the first TLV field, and wherein the second type indication information and the second bounded time delay information are located in the second TLV field.

56. The apparatus of claim 54, wherein the device comprises,

57. A message transmission device, which is characterized by being applied to a network node and comprising a memory and a processor;

the memory is used for storing a computer program;

the processor is configured to execute a computer program stored in the memory to cause the message transmission apparatus to perform the message transmission method according to any one of claims 1 to 28.

58. A message transmission system, characterized in that the system comprises a plurality of network nodes, at least one of which comprises a message transmission device according to any of claims 29 to 47, 57.

59. The system of claim 58, further comprising a controller, the controller comprising a message transmission device of any one of claims 48 to 57.

60. A computer readable storage medium, wherein a computer program is stored in the computer readable storage medium, which when executed implements the message transmission method according to any one of claims 1 to 28.

61. A computer program product, characterized in that the computer program product comprises a program or code which, when executed, implements the message transmission method of any one of claims 1 to 28.