CN117279034A

CN117279034A - Information processing method, apparatus, and storage medium

Info

Publication number: CN117279034A
Application number: CN202210675906.8A
Authority: CN
Inventors: 宋雪雁; 彭少富; 刘尧
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2022-06-15
Filing date: 2022-06-15
Publication date: 2023-12-22
Also published as: WO2023241053A1

Abstract

The application provides an information processing method, equipment and a storage medium, wherein the method comprises the following steps: acquiring a deterministic network DetNet data packet, and encapsulating the DetNet data packet to obtain an encapsulated DetNet data packet, wherein the encapsulated DetNet data packet comprises a deterministic queue tag, and the deterministic queue tag is used for carrying deterministic queue information; and sending the encapsulated DetNet data packet to an intermediate node of the next hop, so that the intermediate node performs queue scheduling on the DetNet data packet according to the deterministic queue information in the deterministic queue tag. The method and the device realize DetNet data surface encapsulation of deterministic queue information, and the deterministic queue information is transmitted to related nodes in a transmission path along with the DetNet data packet, so that the related nodes can determine a queue scheduling mode adopted for the DetNet data packet according to the deterministic queue information carried by the DetNet data packet, and guarantee and support are provided for realizing end-to-end deterministic boundary delay.

Description

Information processing method, apparatus, and storage medium

Technical Field

The present invention relates to the field of communications technologies, and in particular, to an information processing method, apparatus, and storage medium.

Background

Deterministic networks refer to communication networks that can achieve low jitter guarantees with low latency. The main mode for reducing the time delay is to reduce the node residence time delay, when the node residence time delay is reduced to a certain level, the total time delay change amplitude is small, and therefore the low jitter effect is further obtained. In order to reduce the residence time delay of the nodes, each node of the transmission path can be enabled to provide deterministic queue scheduling service according to the deterministic time delay requirement of the data packet, however, the related technology has no specific solution.

Disclosure of Invention

The embodiment of the application provides an information processing method, network equipment, a computer readable storage medium and a computer program product, which are used for realizing deterministic delay queue scheduling service of data packets.

In a first aspect, an embodiment of the present application provides an information processing method, applied to an ingress node, the method including:

acquiring a deterministic network DetNet data packet, and encapsulating the DetNet data packet to obtain an encapsulated DetNet data packet, wherein the encapsulated DetNet data packet comprises a deterministic queue tag, and the deterministic queue tag is used for carrying deterministic queue information;

And sending the encapsulated DetNet data packet to an intermediate node of the next hop, so that the intermediate node performs queue scheduling on the DetNet data packet according to the deterministic queue information in the deterministic queue tag.

In a second aspect, embodiments of the present application provide an information processing method, applied to an intermediate node, the method including:

receiving a deterministic network DetNet data packet from a previous hop node, the DetNet data packet comprising a deterministic queue tag, the deterministic queue tag carrying deterministic queue information;

and carrying out queue scheduling on the DetNet data packet according to the deterministic queue information.

In a third aspect, embodiments of the present application provide a network device, including:

a processor and a memory;

the memory has stored thereon program instructions which, when executed by the processor, cause the processor to perform the method as described in the first or second aspect above.

In a fourth aspect, embodiments of the present application provide a computer readable storage medium storing program instructions which, when executed by a computer, implement the method as described in the first or second aspect above.

In a fifth aspect, embodiments of the present application provide a computer program product storing program instructions that when run on a computer cause the computer to perform the method as described above in the first or second aspect.

According to the scheme, firstly, when the DetNet data packet is packaged, a deterministic queue tag is added to the DetNet data packet, deterministic queue information is carried by the deterministic queue tag, and DetNet data plane packaging of the deterministic queue information is achieved. The deterministic queue information of the DetNet data packet is transmitted to related nodes in a transmission path along with the DetNet data packet, so that the related nodes can determine a queue scheduling strategy adopted for the DetNet data packet according to the deterministic queue information carried by the DetNet data packet, and further, the residence time delay of the DetNet data packet on the nodes can meet the deterministic time delay requirement, and guarantee and support are provided for realizing end-to-end deterministic boundary time delay.

Drawings

Fig. 1 is a schematic diagram of a network scenario applicable to an embodiment of the present application;

fig. 2 is a schematic flow chart of an information processing method according to an embodiment of the present application;

Fig. 3 is a schematic diagram of an original package structure of a DetNet packet acquired by an ingress node in an embodiment of the present application;

fig. 4A is a schematic diagram of an encapsulation structure of a DetNet packet according to an embodiment of the present application;

fig. 4B is a schematic diagram of an encapsulation structure of another DetNet packet according to an embodiment of the present application;

FIG. 5 is a schematic diagram of a package structure of deterministic queue information according to an embodiment of the present disclosure;

fig. 6 is a schematic diagram of an encapsulation structure of a Flag field provided in an embodiment of the present application;

fig. 7 is a schematic diagram of an encapsulation structure of a Sub-TLV field provided in an embodiment of the present application;

fig. 8 is a schematic diagram of a package structure of an outer label of an SLP according to an embodiment of the present application;

FIG. 9 is a flowchart of another information processing method according to an embodiment of the present disclosure;

fig. 10 is a schematic structural diagram of a network device according to an embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.

It should be appreciated that in the description of the embodiments of the present application, if any, the descriptions of "first," "second," etc. are used for the purpose of distinguishing between technical features only, and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated or implicitly indicating the precedence of the technical features indicated. "at least one" means one or more, and "a plurality" means two or more. "and/or", describes an association relation of association objects, and indicates that there may be three kinds of relations, for example, a and/or B, and may indicate that a alone exists, a and B together, and B alone exists. Wherein A, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship. "at least one of the following" and the like means any of these items, including any group of single or plural items. For example, at least one of a, b, and c may represent: a, b, c, a and b, a and c, b and c, or a and b and c, wherein a, b and c may be single or multiple.

In addition, the technical features described below in the various embodiments of the present application may be combined with each other as long as they do not form a conflict with each other.

Deterministic networks (detnets) refer to communication networks that can acquire low jitter guarantees with low latency. The deterministic network should meet quality of service (Quality of Service, qoS) metrics such as minimum and maximum end-to-end delay, timely delivery, bounded jitter, and low packet loss. To achieve these metrics, deterministic networks may employ resource reservation, deterministic forwarding, explicit routing, traffic protection to provide QoS guarantees.

The time delay of the deterministic network data packet mainly comprises a link time delay and a node residence time delay. The link delay is mainly affected by the link length and the information transmission rate of the link. Typically, when network devices are deployed, their locations will not change substantially, i.e., the link length is fixed. Meanwhile, the information transmission rate of the link is dependent on the cable medium and is unchanged. The link latency is relatively stable without changing the link distance (e.g., deploying edge computing nodes) or changing different media cables. Because the link delay is constant and depends on physical factors, the main mode of reducing the delay upper limit is to reduce the node residence delay, when the node residence delay is reduced to a certain level, the total delay change amplitude is small, namely, the delay upper limit is reduced to enable the node residence delay to approach the delay lower limit infinitely, so that the low jitter effect is further obtained. Therefore, reducing the node residence time delay can simultaneously obtain a low time delay upper limit and a low jitter upper limit.

In order to reduce the residence time delay of the nodes, each node of the transmission path can be enabled to provide deterministic queue scheduling service according to the deterministic time delay requirement of the data packet, however, the related technology has no specific solution.

In view of this, the embodiments of the present application provide an information processing method, a network device, a computer readable storage medium, and a computer program product, which enable a relevant node on a transmission path to perform queue scheduling of deterministic latency on a DetNet data packet according to deterministic queue information carried by the DetNet data packet by carrying deterministic queue information in the DetNet data packet, thereby providing guarantee and support for implementing end-to-end deterministic boundary latency.

The embodiments described herein may be applied in a communication system, such as in at least one of the following systems: global system for mobile communications (GSM) or any other second generation cellular communication system, universal mobile telecommunications system based on basic wideband code division multiple access (W-CDMA) (UMTS, 3G), high Speed Packet Access (HSPA), long Term Evolution (LTE), LTE-advanced, systems based on the IEEE 802.11 specification, systems based on the IEEE 802.15 specification and/or fifth generation (5G) mobile or cellular communication systems; and future mobile communication systems. However, the embodiments are not limited to the systems given by the above examples, but a person skilled in the art may apply the solution to other communication systems having the necessary properties.

Before introducing the technical scheme of the embodiment of the invention, an application scene of the embodiment of the invention is described in an exemplary way. Fig. 1 is a schematic diagram of a network scenario applicable to the embodiment of the present application. A plurality of network devices are included in network 100 in fig. 1. The network device herein is a device that performs a routing forwarding function, and may be a router, a switch, a repeater, or the like, where the router, the switch, and the repeater may be physical devices, or may be virtual devices (e.g., a virtual server, a virtual router, a virtual switch, and a virtual repeater) implemented based on a virtualization technology. Depending on where and roles in the network device is deployed, the network device may also be referred to as a Provider Edge (PE) device or a Provider (P) device, e.g., PE1, PE2 in fig. 1 belongs to a PE device and P1, P2 belongs to a P device. It should be understood that, according to the transmission direction of the data packet, the embodiment of the present application refers to the start node PE1 of the transmission path as an ingress node, the end node PE2 of the transmission path as an egress node, and the P devices (P1, P2) in the middle of the transmission path as intermediate nodes. It should be noted that the number of intermediate nodes in fig. 1 is merely exemplary, and in a practical application scenario, the number of intermediate nodes may be one or more. It should be further noted that the network device in fig. 1 may perform packet transmission based on an internet protocol (Internet Protocol, IP) protocol or a multiprotocol label switching (Multi-Protocol Label Switching, MPLS) protocol.

Referring to fig. 2, a flow chart of an information processing method according to an embodiment of the present application is provided, and the method includes, but is not limited to, the following steps S110 to S120:

step S110, an ingress node acquires a deterministic network DetNet data packet, encapsulates the DetNet data packet to obtain an encapsulated DetNet data packet, wherein the encapsulated DetNet data packet comprises a deterministic queue tag, and the deterministic queue tag is used for carrying deterministic queue information;

in step S120, the ingress node sends the encapsulated DetNet packet to the intermediate node of the next hop, so that the intermediate node performs queue scheduling on the DetNet packet according to the deterministic queue information in the deterministic queue tag.

It should be understood that the DetNet packets described in the embodiments of the present application are DetNet application flow valid packets (DetNet App-Flow Payload Packet), which may also be referred to as a DetNet application flow, which is a payload carried by a DetNet flow that is transmitted between non-DetNet aware end systems, the application flow not including any DetNet related attributes, and no specific requirements are imposed on the DetNet nodes.

It should be understood that, in step S110, the original encapsulation structure of the DetNet packet acquired by the ingress node may refer to fig. 3, which includes the following fields: detNet control word (DetNet Control Word), S tag (S-Lable), F tag (F-Lable), data chain (Data-Link), physical (Physical).

It should be appreciated that when a DetNet packet flows to an ingress node, the ingress node can obtain its deterministic latency requirements from the DetNet packet. In particular, deterministic latency requirements may include minimum and maximum end-to-end delay, jitter, packet loss rate, and like parameters. The ingress node may determine deterministic queue information of the DetNet data packet according to the deterministic latency requirement, and then add the determined deterministic queue information to the DetNet data packet to obtain an encapsulated DetNet data packet, where the encapsulated DetNet data packet is a DetNet data packet carrying deterministic queue information.

The deterministic queue information is packaged into the DetNet data packet so that the deterministic queue information is transmitted to the next hop node along with the DetNet data packet, the next hop node can determine a queue scheduling strategy favorable for the DetNet data packet according to the deterministic queue information, the deterministic delay queue service is provided, the queuing delay of the DetNet data packet at the next hop node is reduced, the deterministic delay requirement of the DetNet data packet is met, and the low delay and low jitter of deterministic forwarding are realized.

In a specific embodiment, the deterministic queue information includes queue scheduling mechanism information that indicates a queue scheduling mechanism employed by the intermediate node for the DetNet packets. By way of example, queue scheduling mechanisms include, but are not limited to, the following:

First, a Time scheduling queuing mechanism (Time-scheduling queuing mechanisms) is employed for the DetNet packets. The time schedule queuing mechanism is a time aware shaping (Time Aware Shaping, TAS) based queue scheduling mechanism, and a detailed description of TAS is referred to the definition in the standard IEEE 802.1Qbv and will not be repeated here.

Second, a Priority scheduling queuing mechanism (Priority-scheduling queuing mechanisms) is employed for DetNet packets. The priority scheduling queuing mechanism is a queue scheduling mechanism based on credit shaping (Credit Based Shaping, CBS) and asynchronous traffic shaping (Asynchronous Traffic Shaping, ATS), wherein detailed description of CBS can be found in the definition in standard IEEE 802.1Q-2014, and detailed description of ATS can be found in the definition in standard IEEE 802.1Qcr, which is not repeated here.

Third, a round robin queuing mechanism (Cyclic-scheduling queueing mechanisms) is employed for the DetNet packets. The round robin queuing mechanism is a queue scheduling mechanism based on round robin queuing forwarding (Cyclic Queuing and Forwarding, CQF), and a detailed description of CQF is referred to the definition in standard IEEE 802.1Qch and will not be repeated here.

It should be noted that the queue scheduling mechanism adopted for the DetNet packet may be one or more of the above queue scheduling mechanisms. In addition, the above queue scheduling mechanisms are all exemplary, and more or fewer scheduling mechanisms may be selected in specific applications, which are not limited in this embodiment of the present application.

The DetNet data packet carries queue scheduling mechanism information, so that after the next hop node receives the DetNet data packet, the queue scheduling mechanism adopted for the DetNet data packet can be determined according to the queue scheduling mechanism information in the DetNet data packet.

In a specific embodiment, the deterministic queue information further includes latency information for instructing the intermediate node to determine a scheduling priority of the DetNet packet. Illustratively, the latency information includes latency information including at least one of: the expected residence time delay of the node, the expected residence time delay of all nodes before the node is reached, the actual residence time delay of all nodes before the node is reached or the accumulated residence time delay deviation. Wherein the expected residence time delay of the node indicates the expected time that the DetNet data packet is allowed to reside at the node; the expected residence time delay of all nodes before reaching the node indicates the sum of the expected residence time delays of the DetNet data packet on all nodes before the node; the actual residence time delay of all nodes before reaching the node indicates the sum of the actual residence time delays of the DetNet data packet on all nodes before the node; the cumulative residence delay deviation indicates the cumulative residence delay deviation of the DetNet data packet on all nodes before the present node.

By carrying the delay information by the DetNet data packet, after the next hop node receives the DetNet data packet, the allowed residence delay of the DetNet data packet on the current residence node can be calculated according to the delay information in the DetNet data packet, then the scheduling priority of the DetNet data packet is calculated according to the residence delay, and the DetNet data packet is scheduled to a queue meeting the allowed residence delay according to the scheduling priority, so that the refined deterministic delay queue scheduling is realized.

It should be understood that, in the embodiment of the present application, the DetNet data packet is based on the encapsulation format of the MPLS label stack, in order to implement that the DetNet data packet carries deterministic queue information, a new layer of label is added to the DetNet data packet on the basis of the example of fig. 3, where the new label is referred to as a deterministic queue label, and the embodiment of the present application carries deterministic queue information through the deterministic queue label.

It should be appreciated that the form of deterministic queue tags specifically includes special purpose tags (Special Purpose Label, SPL) or Entropy tags (Entropy Label).

Referring to fig. 4A, the DetNet packet shown in fig. 4A is added with a special purpose tag (SPL), which is the deterministic queue tag described above, compared to the DetNet packet shown in fig. 3. The deterministic queue information described in the embodiments of the present application is located in the SPL. Referring to fig. 4B, the DetNet packet shown in fig. 4B is added with an Entropy Label (Entropy Label), which is the deterministic queue Label described above, compared to the DetNet packet shown in fig. 3. The deterministic queue information described in the embodiments of the present application is located in the entropy label. It should be understood that the deterministic queue tag may also be other forms of tags, and embodiments of the present application are not limited.

In the following description of the present application, SPL will be taken as an example, to describe a specific encapsulation structure of a deterministic queue tag.

Fig. 5 is a schematic diagram of a package structure of deterministic queue information. In the example of fig. 5, the deterministic queue information is in a Type-Length-Value (TLV) format, including an 8-bit Type (Type) field, an 8-bit Flag (Flag) field, a 16-bit Length (Length) field, and a 920-bit subtype Length Value (Sub-Type-Value, sub-TLV) field. The Flag field is used for carrying queue scheduling mechanism information, and the Sub-TLV field is used for carrying delay information corresponding to the queue scheduling mechanism information. It should be appreciated that deterministic queue information is encapsulated in the SPL in TLV format as shown in fig. 5.

In a specific embodiment, the specific encapsulation structure of the Flag field may include multiple mechanism identifications, with different mechanism identifications corresponding to different queue scheduling mechanisms, as shown in fig. 6. In the fig. 6 example, the Flag field includes the following multiple mechanism identifications:

1) T Flag:1bit, which is used for identifying a time scheduling queuing mechanism, when the value of T is 1, the time scheduling queuing mechanism is adopted for the DetNet data packet;

2) P Flag,1bit, is used for marking the priority dispatch queuing mechanism, when the value of P is 1, it means that the priority dispatch queuing mechanism is adopted for the DetNet data packet;

3) C Flag,1bit, is used for marking the cyclic scheduling queuing mechanism, when the value of C is 1, the cyclic scheduling queuing mechanism is adopted for the DetNet data packet.

It should be noted that, in the example of fig. 6, the Flag field has 8 bits in total, and the space in the Flag field except for the above 3 mechanism identifiers may be used as a reserved tag bit to put in more mechanism identifiers.

It should be appreciated that encapsulating the DetNet data packet includes: and setting the value of a mechanism identifier corresponding to a queue scheduling mechanism adopted by the DetNet data packet to be 1. The default value of 0 is set for queue scheduling mechanisms that are not employed. For example, when the DetNet packet adopts the time scheduling queuing mechanism, the tag value of T is set to 1, and the rest flag bits P, C are set to the default value of 0.

It should be noted that, the DetNet packet may employ a combined queue scheduling mechanism, and in this case, a plurality of mechanism flags in the Flag field may be set to 1. For example, the DetNet packet adopts a time schedule queuing mechanism and a priority schedule queuing mechanism, then the tag values of T and P are set to 1, and the flag bit C is set to a default value of 0.

It should be further noted that the Flag field encapsulation structure shown in fig. 6 is merely exemplary, and does not limit the type of the mechanism identifier included in the Flag field, the location of the mechanism identifier, the length of the mechanism identifier, and the like. More or fewer mechanism identifications than the example of fig. 6 may be contained in the Flag field. In addition, the naming of each mechanism identifier is also merely exemplary, and other naming may be adopted for the mechanism identifier corresponding to each mechanism, which is not limited in the embodiments of the present application.

And after receiving the DetNet data packet, the intermediate node acquires the queue scheduling mechanism information of the DetNet data packet from the Flag field of the SPL so as to determine the queue scheduling mechanism adopted for the DetNet data packet and perform deterministic time delay queue scheduling.

In a specific embodiment, the specific encapsulation structure of the Sub-TLV field may include a special queuing assistance data (Special Queuing AillaryData) field, as shown in fig. 7, in which delay information corresponding to the queue scheduling mechanism indicated by the Flag field may be carried. For example, the value of the T Flag bit in the Flag field is 1, which indicates that the DetNet packet adopts a time scheduling queuing mechanism, and the delay information corresponding to the time scheduling queuing mechanism may include: the node expects residence time delay, expects residence time delay of all nodes before reaching the node, actual residence time delay of all nodes before reaching the node, and accumulated residence time delay deviation, the entering node adds the time delay information into the special queuing auxiliary data so as to send the data packet to a next hop intermediate node along with the data packet of the DetNet, and the next hop intermediate node carries out deterministic queue scheduling on the data packet of the DetNet according to the time delay information.

It should be appreciated that in order to encapsulate multiple latency information into the special queuing assistance data field, the special queuing assistance data field may be split into multiple domains, each of which encapsulates one type of latency information. In addition, the special queuing auxiliary data field may include a plurality of layers of labels, and each layer of labels encapsulates different delay information. The embodiment of the application does not limit the specific encapsulation format of the special queuing auxiliary data field.

In a specific embodiment, the SPL further includes a deterministic queue indicator, where the deterministic queue indicator is configured to instruct the intermediate node to perform deterministic queue scheduling on the DetNet data packet according to deterministic queue information.

In particular, when the tag value of the deterministic queue indicator may be predefined to be 1, it indicates that the intermediate node needs to perform deterministic queue scheduling on the current DetNet data packet. For example, after receiving a DetNet data packet, the intermediate node obtains a tag value of a deterministic queue indicator from the SPL of the DetNet data packet, and if the tag value of the deterministic queue indicator is 1, which indicates that deterministic queue scheduling needs to be performed on the DetNet data packet, further obtains associated deterministic queue information from the SPL of the DetNet data packet, and performs deterministic queue scheduling on the DetNet data packet according to the deterministic queue information. If the tag value of the deterministic queue indicator is 0, it means that there is no need to do deterministic queue scheduling for the current DetNet packet, and there is no need for the intermediate node to obtain deterministic queue information from the SPL.

It should be understood that after the ingress node acquires the DetNet data packet, if it is determined that deterministic queue scheduling is required according to the deterministic latency requirement of the DetNet data packet, when the DetNet data packet is encapsulated, the tag value of the deterministic queue indicator is set to 1, so that the next-hop intermediate node can determine whether to perform deterministic queue scheduling on the DetNet data packet according to the tag value of the deterministic queue indicator.

In a specific embodiment, the deterministic queue indicator is a hop-by-hop (hop-by-hop) identification that indicates each hop node in the transmission path to deterministic queue scheduling the DetNet data packet according to the deterministic queue information.

It should be understood that when the ingress node encapsulates the DetNet data packet, the tag value of the hop-by-hop identifier is set to 1, and then after receiving the DetNet data packet, the ingress node obtains deterministic queue information from the SPL of the DetNet data packet according to the value of the hop-by-hop identifier being 1, and performs deterministic queue scheduling on the DetNet data packet according to the deterministic queue information.

In a specific embodiment, the foregoing hop-by-hop identifier is encapsulated in an outer label (also referred to as a top label) of the SPL, where the encapsulation structure of the outer label is shown in fig. 8, and the outer label includes, in addition to the 1-bit hop-by-hop identifier (H), a 20-bit SPL value field and a 1-bit S identifier, where the S identifier is a bottom identifier, and is used to indicate whether the label is a bottom of a stack. The deterministic queue information is encapsulated in an inner layer label of the SPL, and further, the inner layer label carrying the deterministic queue information may be located in a stack of the SPL or at the bottom of the stack of the SPL. In specific application, each hop node in the transmission path can determine that the SPL inner layer carries deterministic queue information through the hop-by-hop identification of the SPL outer layer, and then deterministic queue scheduling is performed on the DetNet data packet according to the deterministic queue information of the inner layer.

Illustratively, when the ingress node acquires the DetNet data packet and determines that deterministic queue service needs to be provided for the DetNet data packet according to the deterministic latency requirement of the DetNet data packet, deterministic queue information is further obtained by calculation according to the deterministic latency requirement of the DetNet data packet; adding an SPL field in the DetNet data packet, pressing the deterministic queue information into an inner layer tag of the SPL, and then marking a hop-by-hop mark at the outer layer tag of the SPL as 1. Thus, the deterministic queue information and the hop-by-hop identification indicating to provide deterministic queue services for the DetNet data packets are encapsulated in the DetNet data packets; the ingress node sends the encapsulated DetNet data packet to an intermediate node of the next hop, so that the intermediate node of the next hop obtains deterministic queue information according to the hop-by-hop identification, and further performs deterministic queue scheduling on the DetNet data packet according to the deterministic queue information. According to the embodiment of the application, the DetNet data packet carries the deterministic delay queue scheduling related information, so that the service guarantee of deterministic boundary delay is completed.

Referring to fig. 9, a flowchart of another information processing method according to an embodiment of the present application is provided, and the method includes, but is not limited to, the following steps S210 to S220:

Step S210, the intermediate node receives a deterministic network DetNet data packet from the previous hop node, wherein the DetNet data packet comprises a deterministic queue tag, and the deterministic queue tag carries deterministic queue information;

in step S220, the intermediate node performs queue scheduling on the DetNet packet according to the deterministic queue information.

In a specific embodiment, the deterministic queue information includes queue scheduling mechanism information. The queue scheduling mechanism information is used for indicating a queue scheduling mechanism adopted by the intermediate node for the DetNet data packet. By way of example, queue scheduling mechanisms include, but are not limited to, the following: time scheduling queuing mechanism (Time-scheduling queuing mechanisms), priority scheduling queuing mechanism (Priority-scheduling queuing mechanisms) or round robin scheduling queuing mechanism (cycle-scheduling queueing mechanisms). It should be noted that the queue scheduling mechanism adopted for the DetNet packet may be one or more of the above queue scheduling mechanisms. The specific meaning of the above queue scheduling mechanisms may be referred to the above related description, and will not be repeated here.

Correspondingly, the intermediate node performs queue scheduling on the DetNet data packet according to the deterministic queue information, and the method can be realized by the following steps:

Step S221A, determining a queue scheduling mechanism adopted for the DetNet data packet according to the queue scheduling mechanism information;

in step S222A, at least the queue scheduling mechanism performs queue scheduling on the DetNet packet.

For example, assuming that the queue scheduling mechanism information indicates that a time scheduling queuing mechanism is employed for the DetNet data packet, the queue scheduling is performed for the DetNet data packet based on the time scheduling queuing mechanism.

In another specific embodiment, the deterministic queue information further includes latency information corresponding to queue scheduling mechanism information, the latency information being used to instruct the intermediate node to determine a scheduling priority of the DetNet packet. Illustratively, the latency information includes latency information including at least one of: the expected residence time delay of the node, the expected residence time delay of all nodes before the node is reached, the actual residence time delay of all nodes before the node is reached or the accumulated residence time delay deviation. Wherein the expected residence time delay of the node indicates the expected time that the DetNet data packet is allowed to reside at the node; the expected residence time delay of all nodes before reaching the node indicates the sum of the expected residence time delays of the DetNet data packet on all nodes before the node; the actual residence time delay of all nodes before reaching the node indicates the sum of the actual residence time delays of the DetNet data packet on all nodes before the node; the cumulative residence delay deviation indicates the cumulative residence delay deviation of the DetNet data packet on all nodes before the present node.

step S221B, determining a queue scheduling mechanism adopted for the DetNet data packet according to the queue scheduling mechanism information;

step S222B, determining the scheduling priority of the DetNet data packet according to the time delay information;

and step S223B, carrying out queue scheduling on the DetNet data packet according to a queue scheduling mechanism and scheduling priority.

Specifically, the intermediate node can quickly determine a queue scheduling mechanism adopted for the DetNet data packet through the queue scheduling mechanism information, calculate the allowed residence time delay of the DetNet data packet on the intermediate node according to the time delay information, calculate the scheduling priority of the DetNet data packet under the corresponding queue scheduling mechanism according to the residence time delay, and schedule the DetNet data packet to a queue meeting the allowed residence time delay according to the scheduling priority, thereby realizing refined deterministic time delay queue scheduling.

It should be appreciated that the form of deterministic queue tags specifically includes special purpose tags (Special Purpose Label, SPL) or Entropy tags (Entropy Label). The embodiment of the application is used for carrying deterministic queue information by adding a special purpose label or an entropy label to the DetNet data packet.

In a specific embodiment, the deterministic queue tag is an SPL, the deterministic queue information is located in the SPL and is in TLV format, and the deterministic queue tag includes a Flag field and a Sub-TLV field, wherein the Flag field carries queue scheduling mechanism information, and the Sub-TLV field carries delay information corresponding to the queue scheduling mechanism information. For the encapsulation structure of deterministic queue information, reference is made to the description related to fig. 5, and the description is omitted here.

In a specific embodiment, the Flag field includes a plurality of mechanism identifiers, different mechanism identifiers respectively correspond to different queue scheduling mechanisms, and a mechanism identifier with a value of 1 in the plurality of mechanism identifiers indicates a queue scheduling mechanism adopted by the DetNet data packet.

Illustratively, the Flag field includes a 1-bit T Flag, a 1-bit P Flag, and a 1-bit C Flag. The T Flag is used for identifying a time scheduling queuing mechanism, and when the value of T is 1, the time scheduling queuing mechanism is adopted for the DetNet data packet; the P Flag is used for identifying a priority scheduling queuing mechanism, and when the value of P is 1, the priority scheduling queuing mechanism is adopted for the DetNet data packet; c Flag is used for identifying a cyclic scheduling queuing mechanism, and when the value of C is 1, the cyclic scheduling queuing mechanism is adopted for the DetNet data packet.

The intermediate node determines that the DetNet data packet adopts a time scheduling queuing mechanism through determining a queue scheduling mechanism adopted by the DetNet data packet in the Flag field, for example, the value of a T mark in the Flag field is 1, and the values of the other marks are 0, so that the DetNet data packet can be determined to adopt the time scheduling queuing mechanism, and further deterministic queue scheduling is carried out on the DetNet data packet based on the determined time scheduling queuing mechanism.

In a specific embodiment, the Sub-TLV field includes a special queuing assistance data (Special Queuing Aillary Data) field in which delay information corresponding to the queue scheduling mechanism indicated by the Flag field may be carried. For example, the value of the T Flag bit in the Flag field is 1, which indicates that the DetNet packet adopts a time scheduling queuing mechanism, and delay information corresponding to the time scheduling queuing mechanism includes: the node expects residence time delay, expects residence time delay of all nodes before reaching the node, actual residence time delay of all nodes before reaching the node, accumulated residence time delay deviation, and the intermediate node carries out deterministic queue scheduling on the DetNet data packet according to the time delay information.

In a specific embodiment, the SPL further comprises a deterministic queue indicator. The deterministic queue indicator is used for indicating the intermediate node to schedule the deterministic queue for the DetNet data packet according to deterministic queue information.

In particular, when the tag value of the deterministic queue indicator is 1, it may be predefined to indicate that deterministic queue scheduling needs to be performed on the current DetNet data packet.

Correspondingly, after receiving the deterministic network DetNet data packet from the last hop node, the intermediate node further performs the following steps before performing queue scheduling on the DetNet data packet according to the deterministic queue information:

s301, acquiring the value of the deterministic queue indicator from the SPL;

s302, when the value of the deterministic queue indicator is 1, the deterministic queue information is obtained from the SPL, so as to perform queue scheduling on the DetNet data packet according to the deterministic queue information.

For example, after receiving a DetNet data packet, the intermediate node obtains a tag value of a deterministic queue indicator from the SPL of the DetNet data packet, and if the tag value of the deterministic queue indicator is 1, which indicates that deterministic queue scheduling needs to be performed on the DetNet data packet, further obtains associated deterministic queue information from the SPL of the DetNet data packet, and performs deterministic queue scheduling on the DetNet data packet according to the deterministic queue information. If the tag value of the deterministic queue indicator is 0, it means that there is no need to do deterministic queue scheduling for the current DetNet packet, and there is no need for the intermediate node to obtain deterministic queue information from the SPL.

The SPL carries the deterministic queue indicator, so that the intermediate node can quickly judge whether to carry out deterministic queue scheduling on the current DetNet data packet, and the information processing efficiency is improved.

In a specific embodiment, the deterministic queue indicator is a hop-by-hop identification, which is used to instruct each hop node in the transmission path to perform deterministic queue scheduling on the DetNet data packet according to the deterministic queue information. It should be appreciated that when the value of the hop-by-hop identifier of a DetNet packet is 1, each hop node in the transmission path needs to obtain associated deterministic queue information from the SPL field of the DetNet packet after receiving the DetNet packet, so as to perform deterministic queue scheduling on the DetNet packet.

In a specific embodiment, the foregoing hop-by-hop identifier is encapsulated in an outer label (also referred to as a top label) of the SPL, where the encapsulation structure of the outer label is illustrated in fig. 8, and the outer label includes, in addition to the hop-by-hop identifier (H), a SPL value field and an S identifier, where the S identifier is a bottom identifier. Illustratively, the SPL value range occupies 20 bits, the S identifier occupies 1bit, and the hop-by-hop identifier occupies 1bit. The deterministic queue information is encapsulated in an inner layer label of the SPL, and the inner layer label carrying the deterministic queue information can be located in a stack of the SPL or at the bottom of the stack of the SPL. In specific application, each hop node in the transmission path can determine that the SPL inner layer carries deterministic queue information through the hop-by-hop identification of the SPL outer layer, and then deterministic queue scheduling is carried out on the DetNet data packet according to the deterministic queue information.

It should be appreciated that the intermediate node, after obtaining the deterministic queue information from the SPL, also performs the following steps:

s401, determining deterministic queue information of the node;

s402, updating the deterministic queue information in the SPL according to the deterministic queue information of the node.

For example, the intermediate node P1 obtains deterministic queue information from the SPL of the DetNet data packet, determines the queue scheduling policy of the DetNet data packet according to the deterministic queue information, and then determines deterministic queue information of the DetNet data packet at the node (P1) (e.g., expected residence time delay of the node, expected residence time delays of all nodes before reaching the node, actual residence time delays of all nodes before reaching the node, or accumulated residence time delay deviation), so as to replace the deterministic queue information in the DetNet data packet SPL with the deterministic queue information of the node (P1).

The deterministic queue information in the SPL is updated to the deterministic queue information of the node, so that the next hop node can perform deterministic queue scheduling according to the updated deterministic queue information.

Illustratively, the intermediate node receives a DetNet packet from a previous hop node and obtains a hop-by-hop identification from the SPL of the DetNet packet; when the value of the hop-by-hop mark is 1, further acquiring deterministic queue information from the SPL, and determining a queue scheduling strategy of the DetNet data packet according to the deterministic queue information; determining deterministic queue information (such as expected residence time delay of the node, expected residence time delay of all nodes before the node is reached, actual residence time delay of all nodes before the node is reached or accumulated residence time delay deviation) of the DetNet data packet in the node, replacing the deterministic queue information in the DetNet data packet SPL with deterministic queue information of the node, and sending the DetNet data packet with updated deterministic queue information to a next-hop node, so that the next-hop node performs deterministic queue scheduling according to the updated deterministic queue information to realize forwarding of deterministic boundary time delay.

The scheme of the embodiment of the present application is further described below with reference to the network scenario shown in fig. 1.

When the technical solution provided in the embodiment of the present application is applied to the network scenario shown in fig. 1, the method may include the following steps:

step S501, when the DetNET data packet flows through the PE1 node, the PE1 node obtains the deterministic latency requirement of the DetNET data packet;

step S502, the PE1 node determines deterministic queue information of the DetNET data packet according to the deterministic delay requirement of the DetNET data packet, wherein the deterministic queue information comprises queue scheduling mechanism information and delay information corresponding to the queue scheduling mechanism information;

step S503, PE1 node adds SPL in the DetNET data packet, and sets hop-by-hop mark in SPL as 1, so as to carry out deterministic queue scheduling on the DetNET data packet through each hop node of hop-by-hop mark advertising transmission path;

in step S504, the PE1 node adds deterministic queue information in the DetNET packet SPL, including: setting the value of a mechanism identifier corresponding to a queue scheduling mechanism adopted by the DetNet data packet in the Flag field as 1, and adding delay information corresponding to the queue scheduling mechanism information into the Sub-TLV field to obtain an encapsulated DetNET data packet;

Step S505, the PE1 node sends the encapsulated DetNET data packet to the P1 node;

step S506, after the P1 node receives the DetNET data packet from the PE1 node, acquiring a value of a hop-by-hop mark in the SPL of the DetNET data packet, wherein the value of the hop-by-hop mark is 1, so that deterministic queue information is further acquired from the SPL;

step S507, the P1 node determines a queue scheduling mechanism and a scheduling priority of the DetNET data packet according to the deterministic queue information, and further performs deterministic queue scheduling on the DetNET data packet according to the queue scheduling mechanism and the scheduling priority;

step S508, the P1 node determines deterministic queue information of the DetNet data packet in the node (e.g. expected residence time delay of the node, expected residence time delay of all nodes before reaching the node, actual residence time delay or accumulated residence time delay deviation of all nodes before reaching the node), and replaces the deterministic queue information in the DetNet data packet SPL with deterministic queue information of the node;

step S509, the P1 node sends the DetNET data packet after updating the deterministic queue information to the P2 node of the next hop;

step S510, after receiving the DetNET data packet from the P1 node, the P2 node obtains the value of the hop-by-hop mark in the SPL of the DetNET data packet, wherein the value of the hop-by-hop mark is 1, so that deterministic queue information is further obtained from the SPL;

In step S511, the P2 node determines a queue scheduling mechanism and a scheduling priority of the DetNET data packet according to the deterministic queue information, and then performs deterministic queue scheduling on the DetNET data packet according to the queue scheduling mechanism and the scheduling priority, so as to send the DetNET data packet to the PE2 node.

Thus, the end-to-end deterministic delay data packet transmission between PE1 and PE2 is completed.

It will be appreciated that although operations are described in a particular order in the figures, this should not be construed as requiring that these operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous.

It is to be further understood that the foregoing description of various embodiments has been provided with a focus, and that no detailed description or description of certain embodiments may be had by reference to other embodiments.

The embodiment of the present application further provides a network device, as shown in fig. 10, where the network device 900 includes, but is not limited to:

a processor 910 and a memory 920;

the memory 920 has stored thereon program instructions that, when executed by the processor 910, cause the processor 910 to perform the information processing method as described in any of the embodiments above.

In a specific embodiment, the network device may be configured to implement each step of the information processing method corresponding to the ingress node in the method embodiment.

In another specific embodiment, the network device may be configured to implement each step of the information processing method corresponding to the intermediate node in the method embodiment.

It should be appreciated that the processor 910 and the memory 920 described above may be connected by a bus or other means.

It should be appreciated that the processor 910 may employ a central processing unit (Central Processing Unit, CPU). The processor may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. Or the processor 910 may employ one or more integrated circuits for executing associated programs to perform the techniques provided in the embodiments of the present application.

The memory 920 is used as a non-transitory computer readable storage medium for storing a non-transitory software program and a non-transitory computer executable program, such as the information processing method executed by the network device side as described in any embodiment of the present application. The processor 910 implements the information processing method executed on the network device side described above by running a non-transitory software program and instructions stored in the memory 920.

Memory 920 may include a storage program area that may store an operating system, at least one application required for functionality, and a storage data area; the storage data area may store information processing methods or training methods of the spectrum sensing model, which are executed on the network device side as described above. In addition, memory 920 may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid state storage device. In some implementations, the memory 920 may optionally include memory located remotely from the processor 910, which may be connected to the processor 910 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The non-transitory software programs and instructions required to implement the information processing method performed by the network device side described above are stored in the memory 920, and when executed by the one or more processors 910, perform the information processing method performed by the network device side provided by any embodiment of the present application.

The embodiment of the application also provides a computer readable storage medium, wherein the computer readable storage medium stores program instructions, and when the program instructions are executed by a computer, the information processing method described in any embodiment above is realized.

In a specific embodiment, the above-mentioned computer readable storage medium may be used to implement the steps of the information processing method corresponding to the ingress node in the above-mentioned method embodiment.

In another specific embodiment, the above-mentioned computer readable storage medium may be used to implement the steps of the information processing method corresponding to the intermediate node in the above-mentioned method embodiment.

Any combination of one or more computer readable media may be employed as the computer storage media of the embodiments herein. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

The computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Computer program code for carrying out operations of the present application may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).

The present embodiments provide a computer program product storing program instructions that, when run on a computer, cause the computer to implement the information processing method described in any of the above embodiments.

In a specific embodiment, the above computer program product may be used to implement the steps of the information processing method corresponding to the ingress node in the above method embodiment.

In another specific embodiment, the above-mentioned computer program product may be used to implement the steps of the information processing method corresponding to the intermediate node in the above-mentioned method embodiment.

The preferred embodiments of the present application have been described in detail, but the present application is not limited to the above embodiments, and those skilled in the art will appreciate that the present application is not limited thereto. Various equivalent modifications and substitutions may be made under shared conditions, and are intended to be included within the scope of the present application.

Claims

1. An information processing method applied to an ingress node, the method comprising:

2. The method of claim 1, wherein the deterministic queue information includes queue scheduling mechanism information indicating a queue scheduling mechanism employed by the intermediate node for the DetNet data packet.

3. The method of claim 2, wherein the queue scheduling mechanism comprises one or more of the following mechanisms: a time schedule queuing mechanism, a priority schedule queuing mechanism, or a round robin schedule queuing mechanism.

4. The method of claim 2, wherein the deterministic queue information further comprises latency information corresponding to the queue scheduling mechanism information, the latency information being used to instruct the intermediate node to determine a scheduling priority of the DetNet data packet.

5. The method of claim 1, wherein the deterministic queue tag is a special purpose tag, SPL, and the deterministic queue information is located in the SPL.

6. The method of claim 5, wherein the deterministic queue information is in a type length value TLV format, and comprises a Flag field and a subtype length value Sub-TLV field, wherein the Flag field is used for carrying queue scheduling mechanism information, and the Sub-TLV field is used for carrying delay information corresponding to the queue scheduling mechanism information.

7. The method of claim 6, wherein the Flag field includes a plurality of mechanism identifications, the plurality of mechanism identifications corresponding to different queue scheduling mechanisms, respectively;

the encapsulating the DetNet packet includes:

and setting the value of a mechanism identifier corresponding to a queue scheduling mechanism adopted by the DetNet data packet to be 1.

8. The method of claim 6, wherein the SPL further comprises a deterministic queue indicator for instructing the intermediate node to deterministic queue schedule the DetNet data packets according to the deterministic queue information.

9. The method of claim 8, wherein the deterministic queue indicator is a hop-by-hop identification that indicates each hop node in a transmission path to deterministic queue scheduling the DetNet data packet according to the deterministic queue information.

10. An information processing method applied to an intermediate node, the method comprising:

11. The method of claim 10, wherein the deterministic queue information comprises queue scheduling mechanism information;

the queue scheduling of the DetNet data packet according to the deterministic queue information includes:

determining a queue scheduling mechanism adopted for the DetNet data packet according to the queue scheduling mechanism information;

and carrying out queue scheduling on the DetNet data packet at least according to the queue scheduling mechanism.

12. The method of claim 11, wherein the queue scheduling mechanism comprises one or more of the following mechanisms: a time schedule queuing mechanism, a priority schedule queuing mechanism, or a round robin schedule queuing mechanism.

13. The method of claim 11, wherein the deterministic queue information further comprises latency information corresponding to the queue scheduling mechanism information;

The queue scheduling of the DetNet data packet at least according to the queue scheduling mechanism comprises:

determining the scheduling priority of the DetNet data packet according to the time delay information;

and carrying out queue scheduling on the DetNet data packet according to the queue scheduling mechanism and the scheduling priority.

14. The method of claim 11, wherein the deterministic queue tag is a special purpose tag SPL, the deterministic queue information being located in the SPL.

15. The method of claim 14, wherein the deterministic queue information is in a type length value TLV format, comprising a Flag field and a subtype length value Sub-TLV field, wherein the Flag field carries queue scheduling mechanism information, and wherein the Sub-TLV field carries latency information corresponding to the queue scheduling mechanism information.

16. The method of claim 15, wherein the Flag field includes a plurality of mechanism identifications, the plurality of mechanism identifications corresponding to different queue scheduling mechanisms, respectively, the mechanism identifications with a value of 1 in the plurality of mechanism identifications representing the queue scheduling mechanism employed by the DetNet data packet.

17. The method of claim 15, wherein the SPL further comprises a deterministic queue indicator;

After the receiving a deterministic network DetNet data packet from the last hop node, before the queuing of the DetNet data packet according to the deterministic queue information, the method further comprises:

obtaining a value of the deterministic queue indicator from the SPL;

and when the value of the deterministic queue indicator is 1, acquiring the deterministic queue information from the SPL, and performing queue scheduling on the DetNet data packet according to the deterministic queue information.

18. The method of claim 17, wherein after obtaining the deterministic queue information from the SPL, the method further comprises:

determining deterministic queue information of the node;

and updating the deterministic queue information in the SPL according to the deterministic queue information of the node.

19. The method of claim 17, wherein the deterministic queue indicator is a hop-by-hop identification that indicates each hop node in a transmission path to deterministic queue scheduling of the DetNet data packet according to the deterministic queue information.

20. A network device, comprising:

A processor and a memory;

the memory has stored thereon program instructions which, when executed by the processor, cause the processor to perform the method of any of claims 1-19.

21. A computer readable storage medium, characterized in that program instructions are stored, which, when executed by a computer, implement the method of any of claims 1-19.

22. A computer program product, characterized in that the computer program product stores program instructions which, when run on a computer, cause the computer to perform the method of any of claims 1-19.