WO2021078171A1

WO2021078171A1 - Message transmission method and device, and digital processing chip

Info

Publication number: WO2021078171A1
Application number: PCT/CN2020/122573
Authority: WO
Inventors: 梁波; 黄蕾
Original assignee: 华为技术有限公司
Priority date: 2019-10-25
Filing date: 2020-10-21
Publication date: 2021-04-29
Also published as: CN112714063A; CN112714063B

Abstract

Disclosed are a message transmission method, a related device, and a digital processing chip, wherein same are used for improving the encapsulation efficiency and the transmission efficiency of a message. The method of the embodiments of the present application comprises the following steps: a node acquiring a short tag, wherein the short tag is used for indicating forwarding information that a next-hop node forwards a message, and the length of the short tag is less than 20 bits; a node replacing at least some of the bits of a target tag with the short tag, wherein the target tag is located in the message; and then, the next-hop node of the node sending the message.

Description

Message transmission method, equipment and digital processing chip

This application claims the priority of a Chinese patent application filed with the State Intellectual Property Office of China, the application number is 201911025945.8, and the invention title is "a message transmission method, equipment and digital processing chip" on October 25, 2019, and its entire contents Incorporated in this application by reference.

Technical field

This application relates to network communication technology, in particular to a message transmission method, device, and digital processing chip.

Background technique

Segment routing (SR) is a network transmission technology. The transmission of multi-protocol label switching (muti-protocol label switching, MPLS) labels can be used to implement message transmission.

When using SR technology, the first node pushes the MPLS long labels of all nodes included in the node path at one time. Each node of the node path determines the egress port and next hop address of the forwarded packet according to the corresponding MPLS long label. Due to the large number of layers of MPLS long labels, the overhead is too large and the efficiency of packet encapsulation is low.

Summary of the invention

The present application provides the embodiments of the present application provide a message transmission method, related equipment, and digital processing chip, which are used to reduce the overhead of the message in the process of message transmission and improve the encapsulation efficiency of the message.

In the first aspect, an embodiment of the present invention provides a message transmission method. The method includes: first, the node obtains a short label, the short label is used to indicate the forwarding information of the next-hop node to forward the message, and the length of the short label is less than 20 bits; then, the node replaces at least part of the bits of the target label with the short label, The target label is in the message; subsequently, the node sends the message to the next hop node.

In this embodiment, the head node converts the long label stack into short labels. The short label stack effectively improves the efficiency of packet encapsulation and transmission. And because the length of the short label is shorter, the network can support node paths with a larger number of nodes.

Based on the first aspect of the embodiments of the present invention, in an alternative implementation of the first aspect of the embodiments of the present invention, the node is the first node of the node path, and the node path includes the first node and N nodes arranged in the order of transmitting the message. Non-head node, before the node obtains the short label, the method further includes: the node obtains a long label stack, the long label stack includes N long labels, the N long labels correspond to the N non-head nodes, and the long label is used to indicate the corresponding node The forwarding information of the forwarded message; the node converts the long label stack into a short label stack, the short label stack includes the target label and N short labels, and the N short labels and N long labels correspond to the N non-head nodes respectively; the node will The short label stack is encapsulated into the message.

In this embodiment, the head node can successfully convert the long label stack to the short label stack. Therefore, the message is forwarded based on the short label stack, and the encapsulation efficiency and transmission efficiency of the message are improved.

Based on the first aspect of the embodiments of the present invention, in an optional implementation of the first aspect of the embodiments of the present invention, the target label includes the first field, and the node converting the long label stack to the short label stack includes: the node determines the first value , N long labels all include the first value; the node sets the first field to the first value.

In this embodiment, the first field of the target tag is not used for the association of forwarding information. The purpose of associating forwarding information can be achieved only through the second field. This reduces the number of bits used to associate forwarding information in the target tag.

Based on the first aspect of the embodiments of the present invention, in an optional implementation of the first aspect of the embodiments of the present invention, the node converting the long label stack to the short label stack includes: the node determines that the N short labels are N second Numerical value, and the N second numerical values are part of the bits included in the N long tags.

In this embodiment, the first node determines N second values in the long label stack. The N second values are respectively used to correlate the forwarding information of N non-head nodes. Because the length of the second value is less than 20bit. Effectively reduce the length of the associated forwarding information.

Based on the first aspect of the embodiments of the present invention, in an optional implementation of the first aspect of the embodiments of the present invention, the target label further includes a second field, the node is a non-tail node of the node path, and the node adds at least part of the target label The replacement of bits with short labels includes: the node sets the second field to the second value.

In this embodiment, when the message is forwarded to a non-tail node. After the non-tail node determines the associated forwarding information according to the second field of the target label, the non-tail node dynamically sets the second field of the target label. The second field that has been set is the short label corresponding to the next hop node. It can be seen that through the dynamic setting of the second field by each non-tail node, each non-tail node directly forwards the message according to the second field. Effectively improve the message forwarding efficiency.

Based on the first aspect of the embodiments of the present invention, in an optional implementation of the first aspect of the embodiments of the present invention, the node is a non-head node of the node path, and before the node replaces at least some bits of the target label with a short label, the method It also includes: the node determines that the first field is the same as the preset value.

In this embodiment, if the node determines that the second field is the preset value, the node can forward the message based on the short label stack. If the node determines that the second field is not equal to the preset value, the node can forward the message based on the existing long label stack. It enables the node to be compatible with different label stacks to realize message forwarding.

Based on the first aspect of the embodiments of the present invention, in an optional implementation manner of the first aspect of the embodiments of the present invention, the node converting the long label stack to the short label stack includes: the node obtains label correspondences, and the label correspondences include N The correspondence between the long label and the N short labels; the node determines the N short labels according to the label correspondence.

Based on the first aspect of the embodiments of the present invention, in an optional implementation manner of the first aspect of the embodiments of the present invention, the node is a non-tail node of the node path, and the node replacing at least part of the bits of the target label with a short label includes: node Make sure that the target tag is a short tag.

Based on the first aspect of the embodiments of the present invention, in an optional implementation manner of the first aspect of the embodiments of the present invention, the node is an intermediate node of the node path, and before the node replaces at least part of the bits of the target label with a short label, the method also Including: the node determines the long label corresponding to the target label according to the label correspondence relationship; the node determines the corresponding forwarding information according to the long label.

In this embodiment, there is no need to uniformly allocate long labels based on the first value. Each non-tail node on the node path directly uses the short label as an index, and the long label can be determined by querying the label correspondence.

Based on the first aspect of the embodiments of the present invention, in an optional implementation of the first aspect of the embodiments of the present invention, the node acquiring the short label includes: the node acquiring the short label according to at least one indication field included in the short label stack, at least An indication field is used to indicate the short label.

In this embodiment, each node can accurately determine the corresponding short label according to the indication of the indication field. This effectively guarantees that the message can be transmitted along multiple nodes included in the node path.

In the second aspect, an embodiment of the present invention provides a message transmission method. The method includes: first, a control device obtains a long label stack, the long label stack includes N long labels, N long labels and N included in the node path The non-head nodes correspond respectively, and the N long labels respectively include N short labels. The short labels are used to indicate the path for the corresponding node to forward the message, and the length of the short label is less than 20 bits; then, the control device sends the long label stack to the node. The beneficial effects shown in this aspect are shown in the above-mentioned first aspect in detail, and will not be repeated.

Based on the second aspect of the embodiment of the present invention, in an optional implementation of the second aspect of the embodiment of the present invention, the long label further includes the first value, and the N long labels all include the first value.

In a third aspect, an embodiment of the present invention provides a message transmission method. The method includes: first, a control device sends a long label stack to a node, the long label stack includes N long labels, and the N long labels and the path included in the node The N non-head nodes correspond to each other, and the long label is used to indicate the path for the corresponding node to forward the message; the control device sends the label correspondence to the node, and the label correspondence includes the correspondence between N long labels and N short labels.

In a fourth aspect, an embodiment of the present invention provides a forwarding device, including: a processor, a memory, and a transceiver, wherein the processor, the memory, and the transceiver are interconnected through a line, and the processor calls the program code in the memory to execute the foregoing Functions related to processing in the message transmission method shown in any one of the first aspect. The transceiver is used to perform functions related to receiving and sending in the message transmission method shown in any one of the foregoing first aspects.

In a fifth aspect, an embodiment of the present invention provides a control device, including: a processor, a memory, and a transceiver, where the processor, the memory, and the transceiver are interconnected through a line, and the processor calls the program code in the memory to execute the above A processing-related function in the message transmission method shown in any one of the second aspect or the third aspect. The transceiver is used to perform functions related to receiving and sending in the message transmission method shown in any one of the second aspect or the third aspect.

In a sixth aspect, an embodiment of the present invention provides a digital processing chip. The chip includes a processor and a memory. The memory and the processor are interconnected by wires. The memory stores instructions. The processor is used to execute the above-mentioned first to third aspects. Functions related to processing in any of the message transmission methods.

In a seventh aspect, an embodiment of the present invention provides a communication system. The communication system includes a control device and a plurality of forwarding devices. The control device is as shown in the above fifth aspect. The forwarding device is as shown in the above-mentioned fourth aspect.

In an eighth aspect, an embodiment of the present invention provides a computer-readable storage medium, including instructions, which when run on a computer, cause the computer to execute the message transmission in any one of the first to third aspects. method.

In a ninth aspect, an embodiment of the present invention provides a computer program product containing instructions, which when run on a computer, causes the computer to execute the message transmission method in any one of the foregoing first aspect to the third aspect.

Description of the drawings

Figure 1 is a diagram of an example structure of a transport network;

Figure 2 is an example diagram of a process of SR technology for message transmission;

Figure 3 is a diagram of an example structure of a long label stack;

Figure 4 is a structural example diagram of a short label stack provided by this application;

FIG. 5 is a flowchart of the steps of an embodiment of the message transmission method provided by this application;

Figure 6 is an example diagram of a partial structure of a long label stack;

FIG. 7 is a diagram of another example structure of the short label stack provided by this application;

FIG. 8 is a flowchart of the steps of another embodiment of the message transmission method provided by this application;

FIG. 9 is a structural example diagram of a forwarding device or a control device provided by this application;

Fig. 10 is a structural example diagram of the communication network provided by this application.

Detailed ways

The technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work shall fall within the protection scope of the present invention.

First, with reference to FIG. 1, the structure of the transmission network applied by the message transmission method provided by the present application will be described. It should be clear that Figure 1 does not limit the specific type of the transport network. Figure 1 shows an example where the type of the transport network is a microwave (MW) network. As shown in Figure 1, it can also be used for any other transport network. For example, optical transport network (optical transport network, OTN), digital subscriber line (digital subscriber line, DSL), or Ethernet (ethernet), etc.

As shown in FIG. 1, the microwave network 100 includes at least one node path. This node path is used to transmit service data from the customer network 102. This application does not limit the specific network type of the client network 102. Wherein, the node path includes a first node 101, a plurality of intermediate nodes 103, and a tail node 104 arranged in the order of the transmission message. The first node 101 is located at the entrance of the microwave network 100. The head node 101 is used to receive service data from the customer network 102. The intermediate node 103 is located inside the microwave network 100. The tail node 104 is located at the exit of the microwave network 100. Figure 1 takes the number of intermediate nodes of 4 as an example for illustration. Figure 1 shows an example where each node is a label switching router (LSR).

Based on the microwave network 100 shown in FIG. 1, the process of how the SR technology shown in the existing solution performs message transmission will be described below in conjunction with FIG. 2.

As shown in Figure 2, take the node path including 6 nodes arranged in the order of transmitting the message as an example. The 6 nodes are the A node to the F node shown in FIG. 2. Among them, node A is the first node of the node path. The F node is the end node of the node path. Nodes B to E are all intermediate nodes of the node path.

In order to realize the transmission of the message, when the A node receives the service data, the A node can push the long label stack of the node path once before the service data to form the message. The long label stack supports the transmission of messages from node A to node F. The structure of the long label stack is described below with reference to Figure 3:

In this example, the value of layer N is 5, which means that the long label has 5 layers of long labels. The five layers of long labels are long label B to long label F respectively. Take the outermost long label 301 (ie, long label B) of the long label stack as an example. The long label 301 has four fields in total, namely, a label field (Label) field, an extended field (Exp) field, a stack bottom identifier (S) field, and a time-to-live (TTL) field. Wherein, the length of the Label field is 20 bits (bit), which is used to associate forwarding information used for forwarding the message. Wherein, the forwarding information may include the address of the egress port and the next hop node (C node). The length of the Exp field is 3 bits. The length of the S field is 1 bit, and when the S field is 1, it indicates that the long label is the bottom label of the long label stack. When the S field is 0, it means that there is a next hop node. The S field of the long label 301 shown in FIG. 3 is 0. The length of the time to live (TTL) field is 8 bits, which indicates how many hops the message can transmit. For the description of other long labels in the label stack, please refer to Long Label B for details.

Node B can obtain the outermost long label (long label B) after receiving the message. Node B can find out the outgoing port associated with long label B and the address of the next hop node. Node B peels off the outermost long label (ie, long label B). Node B can forward the message to the next hop node (node C) through the outgoing port.

Intermediate nodes (C to E) treat long labels in the same way as node B. It can be seen that each intermediate node forwards the message according to the outermost label. And each intermediate node also strips the outer long label hop by hop. Until the message is transmitted to the tail node (F node). The business data is restored by the F node to complete the business processing.

In the scheme shown above, the first node needs to encapsulate more long labels. As shown in Figure 2, node A needs to encapsulate a 5-layer long label. Each long label occupies 4 bytes (Bytes). The header forwarded by node A requires an additional 20Bytes to encapsulate the long label stack. If the length of the service data obtained by the A node is 64 bytes, after the A node encapsulates the 5-layer long label, the packet encapsulation efficiency = 64/(20+64) = 76%. Among them, the encapsulation efficiency of the message refers to the proportion of business data in the entire message. It can be seen that the more layers of the long label encapsulated in the message, the lower the encapsulation efficiency of the message. The lower the packet encapsulation efficiency is, the lower the packet transmission efficiency will be.

In addition, the message transmission scheme shown in Figure 2 is also limited by the hardware processing capabilities of the nodes. For example, if the node has the ability to process 10-layer long labels at most. The node can support a node path with 10 nodes at most. The node cannot support node paths with more than 10 nodes.

The structure of the short label stack used in the message transmission method provided by the present application will be described below with reference to FIG. 4. The specific description of the Exp field, the S field, and the TTL field of the short label stack shown in FIG. 4 is detailed in the related description in FIG. 3, and will not be repeated here.

The short label stack also includes the target label, whose length is 20 bits as an example. The short label stack also includes N short labels, that is, short label 1 to short label N shown in FIG. 4. The value of N represents the number of non-first nodes included in the node path. It can be seen that the N short labels included in the short label stack shown in FIG. 4 respectively correspond to the N non-head nodes of the node path. In order to realize the forwarding of the message, the N short labels included in the short label stack are arranged in sequence according to the order of the transmission message.

For example, if the short label stack shown in FIG. 4 is used in the message transmission process shown in FIG. 2, the value of N is 5. That is, short label 1 corresponds to node B, and so on, short label 5 corresponds to node F. As shown in Figure 4, the length of each short label is not limited, as long as the length of each short label is less than 20 bits. For example, the length of the short label is 8 bits.

As shown in FIG. 4, the short label stack includes two indication fields as an example, that is, the first indication field and the second indication field. The length of the first indication field may be 4 bits, which is used to indicate the total number of short labels included in the short label stack. The length of the second indication field is 4 bits, which is used to indicate the number of the short label of the node currently performing packet forwarding in the short label stack. It should be clear that the description of the number and functions of the indication fields shown in FIG. 4 is an optional example and is not limited. As long as each node on the node path determines the short label corresponding to the next hop node according to the indication of the indication field.

The implementation of SR may be an SR deployed on the MPLS data plane. The implementation of SR can also be applied to the Internet Protocol Version 6 (Internet Protocol Version 6, IPv6) network. It is called segment routing over IPv6 (SRv6) based on IPv6. The short label stack shown in FIG. 4 can be used in any of the above-mentioned implementations of SR. It should be clear that the short label stack shown in FIG. 4 can also be used in other SR implementations, and is not limited.

The following describes how to perform message transmission using the short label stack shown in FIG. 4 in conjunction with FIG. 5:

Step 501: The control device sends the long label stack to the first node.

For a detailed description of the long label stack structure, please refer to Figure 3. In this embodiment, the long label stack is sent by the control device to the head node as an example. In other examples, the long label stack may also be generated in advance by the head node.

The following describes the label field of each long label sent by the control device with reference to FIG. 6:

The label field of each long label includes L bits located in the upper bits and M bits located in the lower bits. Among them, L+M=20. The upper L bits refer to the first L bits included in the label field. The lower M bits refer to the last M bits included in the label field. Optionally, the L bit can also be located in the high bit of the label field, and the M bit can also be located in the low bit of the label field.

Specifically, all the high-order L bits included in the long label stack are the first value 601. In addition, the value of the first value 601 is the same in the label field of different long labels. In an optional example, the value of L may be 12. That is, the length of the first value 601 of each long tag is 12 bits. Specifically, as shown in FIG. 6, the value of each first value 601 is "101001011010". It should be clear that the description of the value and length of the first value 601 is not limited in this embodiment.

The low-order M bits included in the long tag are the second value 602. In the long label stack, the second value 602 included in the label field of different long labels is different. In an optional example, the value of M may be 8. The length of the second value 602 of each long tag is 8 bits. Specifically, as shown in FIG. 6, the second value 602 of the label field 603 is "10101010", and the second value 602 of the label field 604 is "010110101"... It should be clear that the description of the specific value of the second value 602 in this embodiment is an optional example and is not limited.

The length of the second value 602 is related to the number of all outgoing ports included in the node path. Because different values of the second value 602 correspond to different outgoing ports. It can be seen that the number of all outgoing ports included in the node path is less than or equal to the number of second values 602 with different values. For example, in the case where the length of the second value 602 is 8 bits, it is sufficient that the number of all outgoing ports included in the node path is less than or equal to 28=256. If the number of all outgoing ports included in the node path is greater than 256, the length of the second value 602 needs to be increased.

Step 502: The head node receives the long label stack from the control device.

Step 503: The first node judges whether the trigger condition is met, and if so, execute step 504.

In this embodiment, when the first node obtains the long label stack, it needs to determine whether the trigger is satisfied. The first node that meets the trigger condition has the ability to execute the message transmission method shown in this embodiment. The trigger conditions shown in this embodiment may specifically include trigger condition a and trigger condition b, which are specifically as follows:

The trigger condition a may be: all the first values included in the long label stack have the same value. And the first value is the same as the preset value. The preset value may be sent by the control device to the first node, or may be sent to the control device after being configured by the first node, and the specific value is not limited.

If the label field of the long label stack is shown in Figure 6. The first node can determine that all the first values have the same value. And the first value is the same as the preset value "101001011010". The first node determines that the trigger condition a is satisfied.

The trigger condition b may be: the first node obtains the configured enable (enable) field. Wherein, when the value of the enable field is 0, it indicates that the first node does not satisfy the trigger condition b. If the value of the enable field is 1, it indicates that the first node meets the trigger condition b.

In this embodiment, when the first node determines that the trigger condition a and the trigger condition b are satisfied at the same time, the triggering of the first node to perform step 504 is taken as an example for description.

The purpose of performing step 503 shown in this embodiment is: if the initiating node meets the trigger condition, the initiating node can forward the message based on the short label stack. If the initiating node does not meet the trigger condition, the initiating node can forward the message based on the existing long label stack. The first node can be compatible with different label stacks to realize message forwarding.

It should also be clear that step 503 shown in this embodiment is an optional step. In other examples, after receiving the long label stack, the head node may directly perform step 504.

Step 504: The first node determines the address of the outgoing port and the next hop node.

After the first node obtains the long label stack, it determines the addresses of the outgoing port and the next hop node according to the outer long label of the long label stack. Specifically, the head node determines the associated egress port and the address of the next hop node according to the label field of the outermost long label.

Step 505: The first node converts the long label stack into a short label stack.

In this embodiment, in order to realize the purpose that the message can be transmitted via the node path. The first node needs to convert the long label stack into a short label stack. For the specific description of the short label stack structure, please refer to Figure 4 for details. The following describes the specific process of how the first node converts the long label stack into the short label stack:

First, the process of how the first node determines the target label is explained:

The first node determines the first value and the second value among N long labels. Among them, N long labels correspond to N non-head nodes included in the node path. Specifically, since the head node has obtained the corresponding outgoing port and the address of the next hop node according to the outer long label of the long label stack, there is no need to convert the long label of the head node into a short label. For the specific description of the first value and the second value, please refer to step 501 for details.

As shown in Figure 4, the target tag includes a first field and a second field. The first node can set the first field to the first value. The second field is the second value included in the long label of the next hop node. In the example shown in FIG. 6, if the long label 603 is the long label of the next hop node of the head node, the head node may set the second field to "10101010".

Secondly, the process of determining N short labels by the first node is explained:

In the case that the first node has determined the second values respectively included in the N long labels, the first node determines that the N short labels are respectively N second values.

This embodiment does not limit the sequence of execution timing between step 504 and step 505.

Step 506: The head node forwards the message to the next hop node.

When the head node obtains the message, it encapsulates the short label into the header of the message. In this embodiment, the next hop node of the first node is an intermediate node of the node path as an example for illustration. In other examples, the next hop node of the head node may also be the tail node. Specifically, the first node forwards the message to the next hop node according to the determined egress port and the address of the next hop node.

Step 507: The intermediate node receives the message from the previous hop node.

The intermediate node shown in this step can be any intermediate node of the node path.

Step 508: The intermediate node judges whether the trigger condition is met, and if so, execute step 509.

For a specific description of whether the intermediate node determines whether the trigger condition is satisfied, please refer to step 503.

Step 509: The intermediate node determines the address of the outgoing port and the next hop node.

Wherein, after obtaining the short label stack, the intermediate node determines the associated egress port and the address of the next hop node according to the second field of the target label.

Step 510: The intermediate node determines the short label corresponding to the next hop node.

When the intermediate node obtains the short label stack, it may obtain the first indication information and the second indication information. For the specific description of the first instruction information and the second instruction information, please refer to Figure 4 for details. It is assumed that the short label stack shown in this embodiment is used as shown in FIG. 2, and the intermediate node shown in this step is Node B as an example. In this example, the number indicated by the first indication information is 5. The second indication information indicates that the short label corresponding to the Node B is the first one in the short label stack.

It can be seen that, according to the first indication information and the second indication information, the intermediate node can determine the short label corresponding to the next hop node of the intermediate node among the N short labels included in the short label stack. As shown in FIG. 4, the intermediate node determines, according to the first indication information and the second indication information, that the short label corresponding to the next hop node is the second of the five short labels, that is, the short label 2 of the C node. It should be clear that the description of how the intermediate node determines the short label corresponding to the next hop node in this embodiment is an optional example and is not limited.

Step 511: The intermediate node replaces the second field of the target label with the short label corresponding to the next hop node.

In this embodiment, when a message is forwarded to each intermediate node of the node path, each intermediate node determines the outgoing port and the next hop address according to the second field of the target label. The intermediate node can also dynamically change the second field of the target label. The changed second field is the short label corresponding to the next hop node. Therefore, after the next hop node receives the short label stack, it can determine how to forward the message according to the second field.

Step 512: The intermediate node forwards the message to the next hop node.

Step 513: The tail node strips the short label stack from the message.

In this embodiment, the specific number of intermediate nodes included in the node path is not limited. For the processing process after each intermediate node receives the message, please refer to the above step 507 to step 512 for details.

The message obtained by the tail node has been encapsulated with the short label stack. And because the tail node does not need to forward the message to the next hop node. The tail node can directly strip the entire short label stack from the header. In this way, the business data is restored, and the tail node can perform corresponding business processing on the business data. Optionally, each non-tail node can strip its corresponding short label from the short label. In this embodiment, the tail node is responsible for stripping short labels as an example, which can effectively improve the alignment of the short label stack format, reduce the difficulty of processing the short labels by the node, and improve the processing efficiency.

Using the method shown in this embodiment, the head node converts the long label stack into the short label stack, which effectively reduces the length of the label stack. As shown in Figure 3, if you need to press in a 5-layer long label. Then the length of the long label stack shown in FIG. 3={length of the label field (20bit)+length of the Exp field (3bit)+length of the S field (1bit)+length of the TTL field (8bit)}*5=160bit. As shown in Figure 4, the 5-layer long label is converted into a short label. The length of the short label stack shown in Figure 4 = the length of the target label (20bit) + the length of the Exp field (3bit) + the length of the S field (1bit) +Length of the TTL field (8bit)+Length of the first indicator field (4bit)+Length of the second indicator field (4bit)+Length of the short tag (8bit)*5=80bit. Furthermore, the short label stack can effectively improve the encapsulation efficiency of the message, thereby improving the transmission efficiency of the message. Moreover, the length of each short label shown in this embodiment is small, so that the node can support a node path with a larger number of nodes to forward the message.

The structure of another short label stack used in the message transmission method provided by the present application will be described with reference to FIG. 7. The following describes the difference between the short label stack shown in FIG. 7 and the short label stack shown in FIG. 4 as follows:

First, the target label of the short label stack shown in FIG. 7 is no longer divided into the first field and the second field.

Second, the length of the target label shown in Figure 7 is equal to the length of the short label. Since the length of the short label is less than 20 bits, the length of the target label is also less than 20 bits. For example, if the length of the short label is 4 bits, the length of the target label is also 4 bits. For the description of other fields of the short label stack shown in Fig. 7, please refer to Fig. 4 for details.

The following describes how to perform message transmission using the short label stack shown in FIG. 7 in conjunction with FIG. 8:

Step 801: The control device sends the long label stack to the first node.

For a specific description of the long label stack shown in this embodiment, please refer to Figure 3 for details.

Step 802: The control device sends the label correspondence to the head node.

In order to realize the forwarding of the message by each non-tail node on the node path, each node needs to obtain a long label for associated forwarding information. The control device shown in this embodiment may send the label correspondence to the head node. The label correspondence relationship establishes the correspondence relationship between the short label and the long label of each non-tail node on the node path. Specifically, the label correspondence relationship establishes the correspondence relationship between the label fields of the short label and the long label of each non-tail node.

Optionally, the control device may pass one of the intermediate system to the intermediate system (intermediate system to intermediate system, open shortest path first (OSPF), and border gateway protocol (border gateway protocol, BGP) to the first The node sends the correspondence to the label.

It should be clear that this embodiment does not limit the execution timing of steps 801 and 802. In addition, steps 801 and 802 shown in this embodiment are optional steps. It should be clarified that the label correspondence can also be configured in advance by the first node. It is also obtained through negotiation between the first node and other nodes.

Step 803: The head node receives the long label stack from the control device.

Step 804: The first node receives the label correspondence from the control device.

Step 805: The first node judges whether the trigger condition is met, and if so, step 806 is executed.

The trigger condition shown in this embodiment is the trigger condition b shown in FIG. 5. For details, please refer to step 503 shown in FIG. 5 for details.

Step 806: The first node determines the address of the outgoing port and the next hop node.

After the first node obtains the long label stack, the first node determines the long label at the outermost layer of the long label stack. The first node can determine the associated egress port and the address of the next hop node based on the long label.

Step 807: The first node converts the long label stack into a short label stack.

For a detailed description of the short label stack structure, please refer to Figure 7 for details. The following describes the specific process of how the first node converts the long label stack into the short label stack:

The first node uses N long tags as an index, and determines the corresponding N short tags by querying the corresponding relationship of the tags. The first node then sets the N short labels in the short label stack according to the transmission sequence of the message. The head node determines all the bits of the target label as the short label corresponding to the next hop node of the head node.

Step 808: The head node forwards the message to the next hop node.

For the specific execution process, please refer to step 505 shown in Figure 5 for details.

Step 809: The intermediate node receives the message from the previous hop node.

Step 810: The intermediate node receives the label correspondence from the control device.

Wherein, the label correspondence received by the intermediate node may be the same as the label correspondence received by the first node. Optionally, the label correspondence received by the intermediate node may also only include the correspondence between the short label and the long label of the intermediate node. It should be clarified that the label correspondence can also be configured in advance by the intermediate node. It is also negotiated by the intermediate node and other nodes to obtain it.

Step 811: The intermediate node determines whether the trigger condition is met, and if so, execute step 812.

For a specific description of whether the intermediate node determines whether the trigger condition is satisfied, please refer to step 805.

Step 812: The intermediate node determines the address of the outgoing port and the next hop node.

Wherein, since the target label is the short label of the intermediate node, the intermediate node uses the target label as an index, and determines the corresponding long label by querying the label correspondence. The long label is associated with the outgoing port of the intermediate node and the address of the next hop node.

Step 813: The intermediate node determines the short label corresponding to the next hop node.

For the process that the intermediate node determines the short label corresponding to the next hop node in the short label stack, refer to step 510.

Step 814: The intermediate node replaces the target label with the short label corresponding to the next hop node.

In this embodiment, when the intermediate node determines the short label corresponding to the next hop node, all bits of the target label can be replaced with the short label corresponding to the next hop node.

Step 815: The intermediate node forwards the message to the next hop node.

Step 816: The tail node strips the short label stack from the message.

For the specific execution process of step 815 to step 816 shown in this embodiment, reference may be made to step 512 to step 513 shown in FIG. 5.

Using the method shown in this embodiment, without the need for uniform allocation of long labels based on the first value, each non-tail node on the node path is directly indexed by the short label, which can be determined by querying the label correspondence relationship. Long label.

The forwarding device and the control device in this application will be described below with reference to FIG. 9. Among them, FIG. 9 may be a schematic structural diagram of a forwarding device. The forwarding device may be any one of the head node, the intermediate node, and the tail node in the foregoing method embodiment. The forwarding device includes a processor 901, a memory 902, and a transceiver 903. The processor 901, the memory 902, and the transceiver 903 are interconnected by wires. Among them, the memory 902 is used to store program instructions and data.

The memory 902 stores program instructions and data that are executed by the node in supporting the steps shown in FIG. 5 and FIG. 8. The processor 901 and the transceiver 903 are configured to execute the method steps shown in any one of the embodiments in FIG. 5 and FIG. 8.

If the forwarding device is used as the head node, in FIG. 5, the transceiver 903 is used to perform step 502 and step 506. The processor 901 is configured to execute step 503 to step 505. In FIG. 8, the transceiver 903 is used to perform step 803, step 804, and step 808. The processor 901 is configured to execute step 805 to step 807.

If the forwarding device is used as an intermediate node, in FIG. 5, the transceiver 903 is used to perform step 507 and step 512. The processor 901 is configured to execute step 508 to step 511. In FIG. 8, the transceiver is used to perform step 809 and step 815. The processor 901 is configured to execute step 810 to step 814.

If the forwarding device is used as the tail node, in FIG. 5, the processor 901 is configured to perform step 513. In FIG. 8, the processor 901 is configured to perform step 816.

In another possible implementation manner, FIG. 9 may also be a structural example diagram of the control device. The memory 902 shown in FIG. 9 stores program instructions and data executed by the control device in the steps shown in FIG. 5 and FIG. 8. The processor 901 and the transceiver 903 are used to execute the steps shown in any one of the embodiments in FIGS. 5 and 8. The method steps shown.

In FIG. 5, the transceiver 901 is used to perform step 501 shown in FIG. 5. In FIG. 8, the transceiver 901 is used to perform step 801 to step 802 shown in FIG. 8.

The structure of the communication system provided by the present application will be described below with reference to FIG. 10. As shown in FIG. 10, the communication system shown in this embodiment includes a control device 1001, a forwarding device 1002 as a head node, one or more forwarding devices 1003 as intermediate nodes, and a forwarding device 1004 as a tail node. Among them, the specific description of forwarding equipment and control equipment, please refer to Figure 9 for details. This embodiment does not limit the specific number of forwarding devices 1003 as intermediate nodes.

The embodiment of the application also provides a digital processing chip. The digital processing chip integrates a circuit for realizing the functions of the processor 901 and one or more interfaces. When a memory is integrated in the digital processing chip, the digital processing chip can complete the method steps of any one or more of the foregoing embodiments. When the memory is not integrated in the digital processing chip, it can be connected to an external memory through an interface. The digital processing chip implements the actions performed by the control device or the forwarding device in the foregoing embodiment according to the program code stored in the external memory.

A person of ordinary skill in the art can understand that all or part of the steps for implementing the foregoing embodiments can be completed by hardware, or by a program instructing related hardware to be completed. The program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a random access memory, and the like. Specifically, for example: the above-mentioned processing unit or processor may be a central processing unit, a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device , Transistor logic devices, hardware components, or any combination thereof. Whether the above-mentioned functions are executed by hardware or software depends on the specific application and design constraint conditions of the technical solution. Professionals and technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered beyond the scope of this application.

When implemented by software, the method steps described in the above embodiments may be implemented in the form of a computer program product in whole or in part. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on the computer, the processes or functions according to the embodiments of the present application are generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. Computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, computer instructions may be transmitted from a website, computer, server, or data center through a cable (such as Coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) to transmit to another website site, 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 such as a server or data center integrated with one or more available media. The usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium.

Finally, it should be noted that the above are only specific implementations of this application, but the protection scope of this application is not limited to this. Any person skilled in the art can easily think of changes within the technical scope disclosed in this application. Or replacement should be covered within the scope of protection of this application. Therefore, the protection scope of this application should be subject to the protection scope of the claims.

Claims

A message transmission method, characterized in that the method includes:

The node obtains a short label, where the short label is used to indicate forwarding information of a next-hop node to forward a packet, and the length of the short label is less than 20 bits;

The node replaces at least part of the bits of the target label with the short label, and the target label is located in the message;

The node sends the message to the next hop node.
The method according to claim 1, wherein the node is the first node of a node path, and the node path includes the first node and N non-first nodes arranged in the order in which the message is transmitted, so Before the node obtains the short label, the method further includes:

The node obtains a long label stack, the long label stack includes N long labels, the N long labels correspond to the N non-head nodes, and the long label is used to instruct the corresponding node to forward the report. The forwarding information of the text;

The node converts the long label stack into a short label stack, the short label stack includes the target label and N short labels, and the N short labels correspond to the N long labels;

The node encapsulates the short label stack into the message.
The method according to claim 2, wherein the target label includes a first field, and the node converting the long label stack into a short label stack comprises:

Determining a first value by the node, and all of the N long labels include the first value;

The node sets the first field to the first value.
The method according to claim 2 or 3, wherein the node converting the long label stack into a short label stack comprises:

The node determines that the N short tags are respectively N second values, and the N second values are respectively part of bits included in the N long tags.
The method according to claim 4, wherein the target label further comprises a second field, the node is a non-tail node of the node path, and the node replaces at least some bits of the target label with the Short tags include:

The node sets the second field to the second value.
The method according to claim 3, wherein the node is a non-head node of the node path, and before the node replaces at least some bits of the target label with the short label, the method further comprises:

The node determines that the first field is the same as the preset value.
The method according to claim 2, wherein the node converting the long label stack into a short label stack comprises:

Acquiring, by the node, a label correspondence, where the label correspondence includes the correspondence between the N long labels and the N short labels;

The node determines the N short labels according to the label correspondence relationship.
The method according to claim 7, wherein the node is a non-tail node of the node path, and the node replacing at least part of the bits of the target label with the short label comprises:

The node determines that the target label is the short label.
The method according to claim 8, wherein the node is an intermediate node of the node path, and before the node replaces at least part of the bits of the target label with the short label, the method further comprises:

Determining, by the node, a long label corresponding to the target label according to the label correspondence relationship;

The node determines corresponding forwarding information according to the long label.
The method according to any one of claims 2 to 9, wherein the node acquiring a short label comprises:

The node obtains the short label according to at least one indication field included in the short label stack, where the at least one indication field is used to indicate the short label.
A forwarding device, characterized in that it comprises:

A processor, a memory, and a transceiver, wherein the processor, the memory, and the transceiver are interconnected by wires, and the processor calls the program code in the memory to perform the following steps:

Acquiring a short label, where the short label is used to indicate forwarding information of a next-hop node to forward a message, and the length of the short label is less than 20 bits;

Replacing at least part of the bits of the target tag with the short tag, where the target tag is located in the message;

The transceiver is specifically configured to perform the following steps:

Sending the message to the next hop node.
The forwarding device according to claim 11, wherein the forwarding device is a head node of a node path, and the node path includes the head node and N non-head nodes arranged in the order in which the message is transmitted , The processor is specifically configured to:

Obtain a long label stack, the long label stack includes N long labels, the N long labels correspond to the N non-head nodes respectively, and the long labels are used to instruct the corresponding node to forward the packet forwarding information;

Convert the long label stack into a short label stack, the short label stack includes the target label and N short labels, the N short labels and the N long labels are respectively associated with the N non-head nodes correspond;

Encapsulate the short label stack into the message.
The forwarding device according to claim 12, wherein the target tag includes a first field, and the processor is specifically configured to:

Determine a first value, where all the N long tags include the first value;

Set the first field to the first value.
The forwarding device according to claim 12 or 13, wherein the processor is specifically configured to:

It is determined that the N short tags are respectively N second values, and the N second values are respectively part of bits included in the N long tags.
The forwarding device according to claim 14, wherein the target label further includes a second field, the forwarding device is a non-tail node of the node path, and the processor is specifically configured to:

Set the second field to the second numerical value.
The forwarding device according to claim 13, wherein the forwarding device is a non-head node of the node path, and the processor is specifically configured to:

It is determined that the first field is the same as the preset value.
The forwarding device according to claim 12, wherein the processor is specifically configured to:

Acquiring label correspondences, where the label correspondences include correspondences between the N long labels and the N short labels;

The N short tags are determined according to the tag correspondence relationship.
The forwarding device according to claim 17, wherein the forwarding device is a non-tail node of the node path, and the processor is specifically configured to:

It is determined that the target tag is the short tag.
The forwarding device according to claim 18, wherein the forwarding device is an intermediate node of the node path, and the processor is specifically configured to:

Determine a long label corresponding to the target label according to the label correspondence relationship;

The corresponding forwarding information is determined according to the long label.
The forwarding device according to any one of claims 12 to 19, wherein the processor is specifically configured to:

Acquire the short label according to at least one indication field included in the short label stack, where the at least one indication field is used to indicate the short label.
A digital processing chip, characterized in that the chip includes a processor and a memory, the memory and the processor are interconnected by wires, the memory is stored with instructions, and the processor is used to execute 10. The message transmission method shown in any one of 10.