CN113645135A

CN113645135A - SID compression method, message forwarding method, message compression device and electronic equipment

Info

Publication number: CN113645135A
Application number: CN202110882637.8A
Authority: CN
Inventors: 严敏; 唐勇
Original assignee: Maipu Communication Technology Co Ltd
Current assignee: Maipu Communication Technology Co Ltd
Priority date: 2021-08-02
Filing date: 2021-08-02
Publication date: 2021-11-12

Abstract

The application relates to a SID compression method, a message forwarding device and electronic equipment, and belongs to the technical field of network communication. The method comprises the steps of obtaining a segment list, wherein the segment list comprises a plurality of SIDs, and each SID corresponds to one node or link in a message forwarding path; and determining a compressed SID of the SID based on a preset compression rule aiming at each SID in the segment list, wherein the compressed SID comprises a SID bitmap and a short SID, each bit in the SID bitmap is used for indicating whether each byte in the SID is 0 or non-0, each bit in the SID bitmap corresponds to each byte in the SID one by one, the sequence of each bit in the SID bitmap is consistent with the sequence of each byte in the SID, and the short SID is obtained by combining all non-0 bytes in the SID according to the original sequence. The method can effectively improve the load rate of the message.

Description

SID compression method, message forwarding method, message compression device and electronic equipment

Technical Field

The application belongs to the technical field of network communication, and particularly relates to a SID compression method, a message forwarding method, a message compression device and electronic equipment.

Background

Segment Routing (SR) is a protocol designed based on the concept of source Routing and used for forwarding packets on a network, and supports explicit specification of a packet forwarding path at a source node. When the SR is deployed on the Internet Protocol Version 6 (IPv 6) data plane, it is called SRv6(Segment Routing Version 6). SRv6, the message is guided to be forwarded in the network by extending Segment Routing Header (SRH) on the basis of IPv 6.

The SRH includes a Segment List (Segment List), which is also called a Segment Identification (SID) linked List or an SID address stack, and includes a plurality of SIDs, where each SID corresponds to a node or a link in a packet forwarding path. In the process of message forwarding, the network node updates the destination address of the IPv6 message through SID information in SRH to complete the segment-by-segment forwarding of the message.

Each SID is a 128-bit (bit) IPv6 address. Because each SID occupies 128 bits in the packet, the length of the SRH will be increased by 128 bits and the length of the packet will be increased by 128 bits when each SID is added in the Segment list. The more SIDs, the more flexible the packet forwarding path. However, the increase of the message length will cause the network resources occupied in the forwarding process to increase, such as bandwidth, which will reduce SRv6 the message transmission efficiency in the network.

Disclosure of Invention

In view of this, an object of the present application is to provide a SID compression method, a message forwarding method, a device and an electronic device, so as to solve the problem of low message load rate caused by too long SID in an IPv6 message.

The embodiment of the application is realized as follows:

in a first aspect, an embodiment of the present application provides a SID compression method, which is applied to a network device, and the method includes: acquiring a segment list, wherein the segment list comprises a plurality of SIDs, and each SID corresponds to a node or a link in a message forwarding path; and determining a compressed SID of the SID based on a preset compression rule aiming at each SID in the segment list, wherein the compressed SID comprises a SID bitmap and a short SID, each bit in the SID bitmap is used for indicating whether each byte in the SID is 0 or non-0, each bit in the SID bitmap corresponds to each byte in the SID one by one, the sequence of each bit in the SID bitmap is consistent with the sequence of each byte in the SID, and the short SID is obtained by combining all non-0 bytes in the SID according to the original sequence. In the embodiment of the application, the original SID is compressed into a SID with shorter bytes, and the length of the SID is shortened, so that the length of an SRH extension header is shortened, and further, the load rate of a message can be improved, and the message processing efficiency and the network forwarding efficiency are improved.

With reference to one possible implementation manner of the embodiment of the first aspect, determining a compressed SID of the SID based on a preset compression rule includes: setting the value of the bit corresponding to each byte in the SID bitmap according to the value of the byte, wherein the value of the bit corresponding to each byte is used for indicating that the byte is 0 or non-0; removing 0 bytes in the SID, and combining all non-0 bytes after removal according to the original sequence to form the short SID; and splicing the SID bitmap and the short SID to obtain the compressed SID. In the embodiment of the application, the compressed SID is represented by splicing the SID bitmap and the short SID, and because the structure is simple, the effect of the compressed SID can be improved, and meanwhile, because the value of the bit in the SID bitmap is set according to the value of the byte corresponding to the bit in the SID, and indicates whether the byte is 0 or non-0, the original SID can be rapidly and accurately obtained when the original SID is restored according to the compressed SID in the following steps.

With reference to a possible implementation manner of the embodiment of the first aspect, before determining, for each SID in the segment list, a compressed SID of the SID based on a preset compression rule, the method further includes: collecting compressed SID information supported by other network equipment in the network through a routing protocol; determining that all SIDs in the segment list support compression based on the collected SID information. In the embodiment of the present application, before determining the compressed SID of each SID in the segment list based on the preset compression rule, it needs to be determined that all SIDs in the segment list support compression, so as to ensure that all subsequent compressed SIDs can be restored to the original SID, thereby ensuring the implementability of the scheme.

With reference to one possible implementation manner of the embodiment of the first aspect, the method further includes: acquiring message attribute information of a message to be forwarded; acquiring a target segment list corresponding to the message attribute information, replacing an original SID in the target segment list by using a compressed SID corresponding to the original SID in the target segment list, aligning the tail of the compressed SID in the target segment list according to 8 bytes, and filling the part which is less than 8 bytes with 0; and encapsulating the updated target segment list in an SRH extension header of the packet to be forwarded, and correspondingly filling fields in the SRH extension header so that each network device supporting SRv6 can analyze and forward an IPv6 packet carrying a compressed SID, wherein the fields in the SRH extension header include an identification field for representing whether the SID in the SRH is a compressed SID and a field for representing a byte offset value for which the SID has been analyzed. In the embodiment of the application, by encapsulating the SRH extension header in the message to be forwarded, encapsulating the compressed SID in the SRH extension header, and correspondingly filling the field in the SRH extension header, each network device supporting SRv6 can analyze and forward the IPv6 message carrying the compressed SID, so as to improve the message processing efficiency and the network forwarding efficiency.

In a second aspect, an embodiment of the present application further provides a packet forwarding method, which is applied to a network device, and the method includes: acquiring an SRH extension header in a to-be-forwarded message carrying a compressed SID; analyzing the field in the SRH expansion header, and judging whether the analyzed field contains an identifier for representing that the SID in the SRH is a compressed SID; if the analyzed field contains an identifier for representing that the SID in the SRH is a compressed SID, acquiring a target compressed SID corresponding to an offset value according to the offset value for representing the SID decompression position in the analyzed field; determining an original SID corresponding to the target compressed SID according to a preset reduction mode, and updating the offset value to the offset value of the next compressed SID to obtain an updated message to be forwarded; and forwarding the updated message to be forwarded to a node or a link corresponding to the original SID corresponding to the target compressed SID. In the embodiment of the application, when a to-be-forwarded message carrying a compressed SID needs to be forwarded, the SRH extension header in the to-be-forwarded message is acquired, the SRH extension header is analyzed, then whether the SID in the SRH is the compressed SID is determined according to whether an analyzed field contains an identifier for representing that the SID in the SRH is the compressed SID, if the analyzed field contains an identifier for representing that the SID in the SRH is the compressed SID, a target compressed SID corresponding to an offset value is acquired according to the offset value in the analyzed field, an original SID corresponding to the target compressed SID is determined according to a preset reduction mode, and the offset value is updated to an offset value of a next compressed SID to obtain an updated to-be-forwarded message, so that the updated to-be-forwarded message can be forwarded, and the whole scheme forms a closed loop.

With reference to a possible implementation manner of the embodiment of the second aspect, determining the original SID corresponding to the target compressed SID according to a preset restoring manner includes: obtaining a SID bitmap and a short SID contained in the target compressed SID; sequentially analyzing each bit in the SID bitmap until all bits in the SID bitmap are analyzed, and obtaining an original SID corresponding to the target compressed SID; if the bit is 0, the byte corresponding to the bit in the original SID is 0, and if the bit is 1, the byte corresponding to the bit in the original SID is the byte corresponding to the abbreviated SID; or, if the bit is 0, the byte corresponding to the bit in the original SID is the byte corresponding to the short SID, and if the bit is 1, the byte corresponding to the bit in the original SID is 0. In the embodiment of the application, after determining the original SID corresponding to the target compressed SID, sequentially analyzing each bit in the SID bitmap, if the bit is 1, the byte corresponding to the bit in the original SID is the byte corresponding to the short SID; or, if the bit is 0, the byte corresponding to the bit in the original SID is the byte corresponding to the abbreviated SID, and if the bit is 1, the byte corresponding to the bit in the original SID is 0, so that the original SID corresponding to the target compressed SID can be quickly determined.

In a third aspect, an embodiment of the present application further provides a SID compression apparatus, where the apparatus includes: the device comprises an acquisition module and a compression module; an obtaining module, configured to obtain a segment list, where the segment list includes multiple SIDs, and each SID corresponds to a node or a link in a packet forwarding path; the compression module is used for determining a compressed SID of the SID based on a preset compression rule aiming at each SID in the segment list, wherein the compressed SID comprises a SID bitmap and a short SID, each bit in the SID bitmap is used for indicating whether each byte in the SID is 0 or non-0, each bit in the SID bitmap corresponds to each byte in the SID one by one, the sequence of each bit in the SID bitmap is consistent with the sequence of each byte in the SID, and the short SID is obtained by combining all non-0 bytes in the SID according to the original sequence.

In a fourth aspect, an embodiment of the present application further provides a packet forwarding apparatus, where the apparatus includes: the system comprises an acquisition module, an analysis module, a restoration module and a forwarding module; the acquisition module is used for acquiring an SRH extension header in the to-be-forwarded message carrying the compressed SID; the analysis module is used for analyzing the field in the SRH expansion header and judging whether the analyzed field contains an identifier for representing that the SID in the SRH is a compressed SID; if the analyzed field contains an identifier for representing that the SID in the SRH is a compressed SID, acquiring a target compressed SID corresponding to an offset value according to the offset value for representing the SID decompression position in the analyzed field; the restoring module is used for determining an original SID corresponding to the target compressed SID according to a preset restoring mode, and updating the offset value to the offset value of the next compressed SID to obtain an updated message to be forwarded; and the forwarding module is used for forwarding the updated message to be forwarded to a node or a link corresponding to the original SID corresponding to the target compressed SID.

In a fifth aspect, an embodiment of the present application further provides an electronic device, including: a memory and a processor, the processor coupled to the memory; the memory is used for storing programs; the processor is configured to invoke a program stored in the memory to perform the method according to the foregoing first aspect embodiment and/or any possible implementation manner in combination with the first aspect embodiment, or to perform the method according to the foregoing second aspect embodiment and/or any possible implementation manner in combination with the second aspect embodiment.

In a sixth aspect, embodiments of the present application further provide a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to perform the foregoing first aspect embodiment and/or the method provided in connection with any one of the possible implementations of the first aspect embodiment, or to perform the foregoing second aspect embodiment and/or the method provided in connection with any one of the possible implementations of the second aspect embodiment.

Additional features and advantages of the application will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the embodiments of the application. The objectives and other advantages of the application may be realized and attained by the structure particularly pointed out in the written description and drawings.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts. The foregoing and other objects, features and advantages of the application will be apparent from the accompanying drawings. Like reference numerals refer to like parts throughout the drawings. The drawings are not intended to be to scale as practical, emphasis instead being placed upon illustrating the subject matter of the present application.

Fig. 1 shows a flowchart of a SID compression method provided in an embodiment of the present application.

Fig. 2 is a schematic diagram illustrating a process of determining a compressed SID corresponding to an original SID according to an embodiment of the present application.

Fig. 3 is a schematic diagram illustrating a process of determining a compressed SID corresponding to an original SID according to an embodiment of the present application.

Fig. 4 shows a schematic diagram of a network topology provided in an embodiment of the present application.

Fig. 5 shows a schematic diagram of the SID corresponding to each node in the network topology shown in fig. 4.

Fig. 6 is a schematic diagram illustrating an encapsulation result of encapsulating an SRH extension header in an IPv6 message according to an embodiment of the present application.

Fig. 7 is a schematic diagram illustrating encapsulation of an SRH extension header of a standard SRv6 message according to an embodiment of the present application.

Fig. 8 shows a flowchart of a message forwarding method according to an embodiment of the present application.

Fig. 9 is a schematic diagram illustrating an SRH after updating a value of a CSID Offset field in the SRH according to an embodiment of the present application.

Fig. 10 is a schematic diagram illustrating a process of determining an original SID corresponding to a compressed SID according to an embodiment of the present application.

Fig. 11 shows a block diagram of a SID compression apparatus according to an embodiment of the present application.

Fig. 12 shows a module schematic diagram of a message forwarding apparatus according to an embodiment of the present application.

Fig. 13 shows a schematic structural diagram of an electronic device provided in an embodiment of the present application.

Detailed Description

The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application.

It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures. Meanwhile, relational terms such as "first," "second," and the like may be used solely in the description herein to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.

Further, the term "and/or" in the present application is only one kind of association relationship describing the associated object, and means that three kinds of relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone.

In order to solve the problem that the SID in the IPv6 message is too long, which results in a low message load rate, an embodiment of the present application provides a SRv 6-based SID compression method, which can improve the message load rate, and improve the message processing efficiency and the network forwarding efficiency by compressing the SID in the SRH extension header. For example, in SRv6 network, the IPv6 message is configured as an IPv6 standard header (40 bytes in length) + SRH extended header + payload, where SRH occupies a fixed header + SID n (16 bytes n) of 8 bytes in message length. For a packet carrying 10 SIDs in the IPv6 packet header SRH, with an average payload of 256 bytes, the payload rate is only about 55% (256/(256+168+ 40)). By shortening the SID length, the SRH extension header length is shortened, and the message load rate is improved, thereby improving the message processing efficiency and the network forwarding efficiency.

The SID compression method provided in the embodiment of the present application will be described below with reference to fig. 1.

S1: and acquiring a segment list, wherein the segment list comprises a plurality of SIDs, and each SID corresponds to one node or link in the message forwarding path.

And acquiring a Segment List (Segment List), wherein the Segment List comprises a plurality of SIDs, and each SID corresponds to one node or link in the message forwarding path.

S2: and for each SID in the segment list, determining a compressed SID of the SID based on a preset compression rule, wherein the compressed SID comprises a SID bitmap and a short SID.

After the segment list is obtained, determining the compressed SID of each SID in the segment list based on a preset compression rule until all SIDs in the segment list are compressed. The bytes of the compressed SID are smaller than the bytes of the SID before compression, so that the length occupied by each SID in the message can be shortened, and the load rate of the message is improved.

The compressed SID comprises a SID bitmap and a short SID, wherein each bit in the SID bitmap is used for indicating whether each byte in the SID is 0 or non-0, each bit in the SID bitmap corresponds to each byte in the SID one by one, the sequence of each bit in the SID bitmap is consistent with the sequence of each byte in the SID, and the short SID is obtained by combining all non-0 bytes in the SID according to the original sequence. For example, if the SID is 16 bytes, the SID bitmap includes 16 bits (bits), although the number of bits in the SID bitmap may also be less than 16, and if the number of bits is less than 16, for example, the number of bits in the SID bitmap is 8, each bit is used to indicate whether every 2 bytes in the SID is 0 or non-0. Each bit in the SID bitmap corresponds to every 2 bytes in the SID.

In one embodiment, the process of determining the compressed SID of the SID based on the preset compression rule may be: setting the value of the bit corresponding to each byte in the SID bitmap according to the value of the byte, wherein the value of the bit corresponding to each byte is used for indicating that the byte is 0 or non-0, so that the SID bitmap can be obtained; removing 0 bytes in the SID, and combining all non-0 bytes after removal according to the original sequence to form a short SID; finally, the SID bitmap and the short SID are spliced to obtain the compressed SID.

For ease of understanding, the following example assumes an original SID of 1000:2:3: 4, i.e., 10, 00, 02, 00, 03, 00, 04, for a total of 16 bytes. Assuming that 0 is used in the bits of the SID bitmap to indicate that the byte in the original SID is 0, and 1 is used in the bits of the SID bitmap to indicate that the byte in the original SID is not 0, the 16 bits of the SID bitmap have the following values: 1. 0, 1, 0, 1, which can be represented as 0x 9401; removing 0 byte in the SID, and combining all non-0 bytes after removal according to the original sequence to form a short SID, namely 10, 02, 03 and 04, which can be expressed as 0x 10020304; the SID bitmap and the short SID are then concatenated to obtain a compressed SID, which may be denoted as 94, 01, 10, 02, 03, 04, and the process described above with reference to fig. 2. In fig. 2, CSID (compressed SID) is a compressed SID, CSID Bitmap is a SID Bitmap, and ssid (short SID) is a short SID.

The original SID needs to be represented by 16 bytes, and the compressed SID: 0x94, 0x01, 0x10, 0x02, 0x03 and 0x04, which only need 6 bytes to represent. The compression method has a significant compression efficiency in SIDs with more 0 bytes, and can optimally compress SIDs with 16 bytes into 4 bytes, as shown in FIG. 3, the original SID is 1::2, and after compression is (0x40, 0x01, 0x01, 0x 02). For a message containing 10 SIDs in the SRH, the compression method of the present application can compress the length of the SID address stack in the SRH from 160 bytes to 40 bytes at most.

It should be noted that, the above-mentioned mapping relationship between 0 bytes and non-0 bytes in the original SID with 16 bytes represented by SID bitmap with 2 bytes should not be taken as a limitation of the present application, and actually, representing such mapping relationship by SID bitmap with 3 bytes and 4 bytes should be within the protection scope of the present invention. In addition, the meanings expressed by 1 and 0 in the SID bitmap can be replaced, for example, in the above example, 0 is used in the bit of the SID bitmap to indicate that the byte in the original SID is 0, 1 is used in the bit of the SID bitmap to indicate that the byte in the original SID is non-0, and vice versa: the bits in the SID bitmap are 0 to indicate that the bytes in the original SID are non-0, and the bits in the SID bitmap are 1 to indicate that the bytes in the original SID are 0.

Optionally, before determining, for each SID in the segment list, a compressed SID of the SID based on a preset compression rule, the SID compression method further includes: and collecting the SID information supported by other network devices in the network through a routing protocol, and determining that all SIDs in the segment list support compression based on the collected SID information. Each network device in the network notifies the compressed SID information supported by the device to other network devices in the same network through a routing protocol. The network device at the network entrance collects the compressed SID information supported by other network devices in the network through the routing protocol, then determines that all SIDs in the segment list support compression based on the collected SID information, if the segment list supports compression

All SIDs in (a) can be matched in the collected SID information, which indicates all the SIDs in the segment list

The SIDs support compression.

Routing protocols include, but are not limited to: an Open Shortest Path First version 3 (OSPFv 3) routing Protocol, an Intermediate System-to-Intermediate System (IS-IS) routing Protocol, a Border Gateway Protocol (BGP), and the like.

Taking OSPFv3 routing protocol as an example, a TLV structure (TLV refers to a structure composed of data Type, data Length, and data Value) for identifying whether the device has the capability of compressing SID is added to a Link Status Advertisement (LSA) to advertise the SID information that supports compression. Taking the network topology shown in fig. 4 as an example, the network topology is composed of a device a, a device B, a device C, and a device D. OSPFv3 neighbors are established among the devices, and each device informs other devices in the network of the SID information supported by the device. A TLV is added in the link state advertisement to indicate the type, length and specific information of the advertisement information. The type is used to identify the TLV and is used to advertise SID compression capability information, and the length is used to indicate the content length of the TLV information field, and the content of the specific information includes, but is not limited to, Locator information (including SID) or specific SID information. It should be understood that the SID compression capability information may be advertised using all routing protocols, and is not intended to limit the invention by way of example.

And after receiving the SID compression capability information, each device in the network summarizes, and identifies whether all SIDs contained in each Segment List support compression or not through the collected Locator information or SID information. If so, all SIDs in the Segment List may be compressed.

Wherein, Locator represents a positioning identifier for identifying a device, which is also one of the constituents of SID. Each network device will generate a route of Locator network segment to announce in the network, and other nodes in the network can be located to the node through the route of Locator network segment.

The SID compression method provided by the embodiment of the present application further includes: acquiring message attribute information of a message to be forwarded; acquiring a target segment list corresponding to the message attribute information, replacing an original SID in the target segment list by using a compressed SID corresponding to the original SID in the target segment list, aligning the tail of the compressed SID in the target segment list according to 8 bytes, and filling up the part which is less than 8 bytes by using 0; and encapsulating the updated target segment list in an SRH extension header of the message to be forwarded, and correspondingly filling fields in the SRH extension header so that each network device supporting SRv6 can analyze and forward the IPv6 message carrying the compressed SID, wherein the fields in the SRH extension header comprise an identification field for representing whether the SID in the SRH is the compressed SID and a field for representing the byte offset value of the SID which has been analyzed.

When the network device at the network entrance sends a message to other network devices in the network, the network device obtains the message attribute information of the message to be forwarded, such as the destination IP address or the service Class (Traffic Class), obtains the target segment list corresponding to the message attribute information, replaces the original SID in the target segment list with the compressed SID, aligns the end of the compressed SID in the target segment list by 8 bytes, and makes up the part less than 8 bytes with 0 to make it meet the IPv6 message standard format, then encapsulates the updated target segment list in the SRH extension Header of the message to be forwarded, and correspondingly fills fields in the SRH extension Header, such as Next Header, Hdr Ext leg, Routing Type, Segments Left, Last Entry, Flag, Tag, etc., adds an identifier for indicating that the SID in the SRH extension Header is compressed SID in the Flag field, such as "C", and the filling content and meaning of the rest fields are consistent with the SRH standard, so that each network device supporting SRv6 can analyze and forward the IPv6 message carrying the compressed SID.

Certainly, when the SRH extension Header is encapsulated in the IPv6 message, the fields in the SRH extension Header may be filled first, and then the updated target segment list is encapsulated in the SRH extension Header of the message to be forwarded, for example, fields such as Next Header, Hdr Ext Len, Routing Type, Segments Left, Last Entry, Flag, and Tag are filled first, an identifier for indicating that the SID in the SRH extension Header is the compressed SID is added to the Flag field, such as "C", and the filling content and meaning of the remaining fields are consistent with those of the standard SRH; the middle value of the added CSID Offset field represents the byte Offset value analyzed by the CSID, and 0 is initially filled; and finally, filling the CSID field with the CSID obtained by compressing all SIDs obtained from the Segment List, aligning the tail according to 8 bytes after filling, and filling 0 in the part which is less than 8 bytes for completion.

For convenience of understanding, taking the SRH extension header encapsulation performed by the node a in the network topology shown in fig. 5, which needs to pass through the node B, the node C, and the node D as an example, the node a encapsulates the encapsulation result of the SRH extension header in the IPv6 message, as shown in fig. 6. The SRH shown in FIG. 6 encapsulates 3 CSIDs (2::2 (expressed as 16 bytes, namely 00, 02, 00, 02), 3::3 (expressed as 16 bytes, namely 00, 03, 00, 03), 4::4 (expressed as 16 bytes, namely 00, 04, 00, 04), Flag field fills in the "C" mark, represents that SIDs in the SRH extension header are all compressed SIDs, Hdr Ext Len field fills in the actual SID length 16, CSID Offset field is initially 0, and other fields are consistent with the standard SRH extension header SRv6 message. Wherein, SID: 2: 2 corresponds to a compressed SID of 0x40010202(CSID1), SID: 3: 3 corresponds to a compressed SID of 0x40010303(CSID2), SID: 4: 4 corresponds to a compressed SID of 0x40010404(CSID 3).

To illustrate the encapsulation effect more intuitively, the header encapsulation example of the standard SRv6 message SRH extension shown in fig. 7 can be compared. As can be seen from the comparison between fig. 6 and fig. 7, the process of encapsulating the SRH extension header containing the compressed SID is substantially the same as the process of encapsulating the SRH extension header containing the original SID, except that when the SRH extension header containing the compressed SID is encapsulated, an identifier, such as "C", for indicating that the SIDs in the SRH extension header are all compressed SIDs is added to the Flag field, and a field CSID Offset for indicating that the CSID has already resolved the byte Offset value is newly added.

Based on the same inventive concept, the embodiment of the present application further provides a message forwarding method, and the following describes the message forwarding method implemented in the present application with reference to fig. 8.

S10: and acquiring the SRH extension header in the message to be forwarded carrying the compressed SID.

When receiving a to-be-forwarded message carrying a compressed SID, a network device obtains an SRH extension header in the to-be-forwarded message carrying the compressed SID by analyzing the message.

S20: and analyzing the field in the SRH extension header, and judging whether the analyzed field contains an identifier for representing that the SID in the SRH is a compressed SID.

After the SRH extension header in the message to be forwarded carrying the compressed SID is acquired, analyzing fields in the SRH extension header, and judging whether the analyzed fields, such as Flag fields, contain identifiers for representing that the SID in the SRH is the compressed SID, and if yes, judging that the Flag fields contain the 'C' identifiers, indicating that the SID in the SRH is the compressed SID.

S30: and if the analyzed field contains an identifier for representing that the SID in the SRH is the compressed SID, acquiring the target compressed SID corresponding to the offset value according to the offset value for representing the SID decompression position in the analyzed field.

If the analyzed field contains the identifier for representing the SID in the SRH as the compressed SID, the target compressed SID corresponding to the Offset value is obtained according to the Offset value used for representing the SID decompression position in the analyzed field, e.g., the CSID Offset field, for example, taking the SRH shown in fig. 6 as an example, if the Offset value is 0, the corresponding target compressed SID is CSID1, that is, 0x 40010202.

S40: and determining the original SID corresponding to the target compressed SID according to a preset reduction mode, and updating the offset value to the offset value of the next compressed SID to obtain the updated message to be forwarded.

After the target compressed SID corresponding to the offset value is obtained, the original SID corresponding to the target compressed SID is determined according to a preset reduction mode, for example, the original SID is obtained as 00, 02, 00, 02. And update the Offset value to the Offset value of the next compressed SID to obtain the updated message to be forwarded, because the CSID1 is 4 bytes, the updated Offset value is 4, that is, the value in the CSID Offset field is 4, and the updated SRH is as shown in fig. 9.

Optionally, the process of determining the original SID corresponding to the target compressed SID in the preset reduction manner may be to obtain a SID bitmap and a short SID included in the target compressed SID, and sequentially analyze each bit in the SID bitmap until all bits in the SID bitmap are analyzed, so as to obtain the original SID corresponding to the target compressed SID; if the bit is 0, the byte corresponding to the bit in the original SID is 0, and if the bit is 1, the byte corresponding to the bit in the original SID is the corresponding byte in the abbreviated SID; or, if the bit is 0, the byte corresponding to the bit in the original SID is the byte corresponding to the abbreviated SID, and if the bit is 1, the byte corresponding to the bit in the original SID is 0.

The process of determining the original SID of the target compressed SID (0x940110020304) is described, taking as an example that 0 is used in the bits of the SID bitmap to indicate that the byte in the original SID is 0, and 1 is used in the bits of the SID bitmap to indicate that the byte in the original SID is non-0, then the SID bitmap of the target compressed SID is 0x9401, the corresponding 2-ary is 1001010000000001, and the abbreviated SID is 10, 02, 03, 04. Since the 1 st bit in the SID bitmap is 1, the byte corresponding to the bit in the original SID is the corresponding byte in the abbreviated SID, that is, 10, since the 2 nd and 3 rd bits in the SID bitmap are 0, the byte corresponding to the 2 nd and 3 rd bits in the original SID is 0, since the 4 th bit in the SID bitmap is 1, the byte corresponding to the 4 th bit in the original SID is 02, and so on, the original SID can be obtained as: 10. 00, 02, 00, 03, 00, 04, for a total of 16 bytes. The above process can be seen in fig. 10.

S50: and forwarding the updated message to be forwarded to a node or a link corresponding to the original SID corresponding to the target compressed SID.

After the original SID corresponding to the target compressed SID is obtained, the updated packet to be forwarded may be forwarded to a node or a link corresponding to the original SID corresponding to the target compressed SID.

Based on the same inventive concept, the present application further provides a SID compression apparatus 100, as shown in fig. 11, where the SID compression apparatus 100 includes: an acquisition module 110 and a compression module 120.

The obtaining module 110 is configured to obtain a segment list, where the segment list includes a plurality of SIDs, and each SID corresponds to one node or link in a packet forwarding path.

A compression module 120, configured to determine, for each SID in the segment list, a compressed SID of the SID based on a preset compression rule, where the compressed SID includes a SID bitmap and a short SID, each bit in the SID bitmap is used to indicate whether each byte in the SID is 0 or non-0, each bit in the SID bitmap corresponds to each byte in the SID in a one-to-one manner, and an order between each bit in the SID bitmap is consistent with an order between each byte in the SID, and the short SID is obtained by combining all non-0 bytes in the SID in an original order.

A compression module 120, configured to set, for each byte in the SID bitmap, a bit value corresponding to the byte according to a value of the byte, where the bit value corresponding to the byte is used to indicate that the byte is 0 or non-0; removing 0 bytes in the SID, and combining all non-0 bytes after removal according to the original sequence to form the short SID; and splicing the SID bitmap and the short SID to obtain the compressed SID.

The compression module 120 is further configured to collect, by using a routing protocol, compressed SID information supported by other network devices in the network before determining, based on a preset compression rule, a compressed SID of each SID in the segment list; determining that all SIDs in the segment list support compression based on the collected SID information.

Optionally, the SID compression apparatus 100 further includes an encapsulation module, configured to obtain message attribute information of a message to be forwarded; acquiring a target segment list corresponding to the message attribute information, replacing an original SID in the target segment list by using a compressed SID corresponding to the original SID in the target segment list, aligning the tail of the compressed SID in the target segment list according to 8 bytes, and filling the part which is less than 8 bytes with 0; and encapsulating the updated target segment list in an SRH extension header of the packet to be forwarded, and correspondingly filling fields in the SRH extension header so that each network device supporting SRv6 can analyze and forward an IPv6 packet carrying a compressed SID, wherein the fields in the SRH extension header include an identification field for representing whether the SID in the SRH is a compressed SID and a field for representing a byte offset value for which the SID has been analyzed.

The implementation principle and the resulting technical effect of the SID compression apparatus 100 provided in the embodiment of the present application are the same as those of the foregoing SID compression method embodiment, and for the sake of brief description, no part of the apparatus embodiment is mentioned, and reference may be made to the corresponding contents in the foregoing method embodiment.

Based on the same inventive concept, an embodiment of the present application further provides a message forwarding apparatus 200, as shown in fig. 12, where the message forwarding apparatus 200 includes: an obtaining module 210, an analyzing module 220, a restoring module 230, and a forwarding module 240.

An obtaining module 210, configured to obtain an SRH extension header in the to-be-forwarded message carrying the compressed SID.

An analyzing module 220, configured to analyze a field in the SRH extension header, and determine whether the analyzed field includes an identifier for representing that the SID in the SRH is a compressed SID; and if the analyzed field contains an identifier for representing that the SID in the SRH is the compressed SID, acquiring the target compressed SID corresponding to the offset value according to the offset value for representing the SID decompression position in the analyzed field.

The restoring module 230 is configured to determine an original SID corresponding to the target compressed SID according to a preset restoring manner, and update the offset value to an offset value of a next compressed SID to obtain an updated message to be forwarded.

A forwarding module 240, configured to forward the updated packet to be forwarded to a node or a link corresponding to the original SID corresponding to the target compressed SID.

Optionally, the restoring module 230 is configured to obtain a SID bitmap and a short SID included in the target compressed SID; sequentially analyzing each bit in the SID bitmap until all bits in the SID bitmap are analyzed, and obtaining an original SID corresponding to the target compressed SID; if the bit is 0, the byte corresponding to the bit in the original SID is 0, and if the bit is 1, the byte corresponding to the bit in the original SID is the byte corresponding to the abbreviated SID; or, if the bit is 0, the byte corresponding to the bit in the original SID is the byte corresponding to the short SID, and if the bit is 1, the byte corresponding to the bit in the original SID is 0.

The message forwarding apparatus 200 provided in the embodiment of the present application has the same implementation principle and technical effect as those of the foregoing message forwarding method embodiment, and for brief description, no part of the embodiment of the apparatus is mentioned, and reference may be made to the corresponding contents in the foregoing method embodiment.

As shown in fig. 13, fig. 13 is a block diagram illustrating a structure of an electronic device 300 according to an embodiment of the present application. The electronic device 300 includes: a transceiver 310, a memory 320, a communication bus 330, and a processor 340.

The elements of the transceiver 310, the memory 320 and the processor 340 are electrically connected to each other directly or indirectly to realize data transmission or interaction. For example, these components may be electrically coupled to each other via one or more communication buses 330 or signal lines. The transceiver 310 is used for transceiving data. The memory 320 is used for storing a computer program, such as a software functional module shown in fig. 11 or fig. 12, that is, the SID compression apparatus 100 of fig. 11 or the message forwarding apparatus 200 of fig. 12. The SID compression apparatus 100 or the message forwarding apparatus 200 includes at least one software function module, which may be stored in the memory 320 in the form of software or firmware (firmware) or fixed in an Operating System (OS) of the electronic device 300. The processor 340 is configured to execute the executable modules stored in the memory 320.

For example, the processor 340 is configured to, when the processor 340 is used in a software function module or a computer program included in the SID compression apparatus 100, the processor 340 is configured to obtain a segment list, where the segment list includes a plurality of SIDs, and each SID corresponds to one node or link in a packet forwarding path; and determining a compressed SID of the SID based on a preset compression rule aiming at each SID in the segment list, wherein the compressed SID comprises a SID bitmap and a short SID, each bit in the SID bitmap is used for indicating whether each byte in the SID is 0 or non-0, each bit in the SID bitmap corresponds to each byte in the SID one by one, the sequence of each bit in the SID bitmap is consistent with the sequence of each byte in the SID, and the short SID is obtained by combining all non-0 bytes in the SID according to the original sequence.

For example, the processor 340 is configured to, when the processor 340 is used in a software function module or a computer program included in the message forwarding apparatus 200, the processor 340 is configured to obtain an SRH extension header in a to-be-forwarded message that carries a compressed SID; analyzing the field in the SRH expansion header, and judging whether the analyzed field contains an identifier for representing that the SID in the SRH is a compressed SID; if the analyzed field contains an identifier for representing that the SID in the SRH is a compressed SID, acquiring a target compressed SID corresponding to an offset value according to the offset value for representing the SID decompression position in the analyzed field; determining an original SID corresponding to the target compressed SID according to a preset reduction mode, and updating the offset value to the offset value of the next compressed SID to obtain an updated message to be forwarded; and forwarding the updated message to be forwarded to a node or a link corresponding to the original SID corresponding to the target compressed SID.

The Memory 320 may be, but is not limited to, a Random Access Memory (RAM), a Read Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Read-Only Memory (EPROM), an electrically Erasable Read-Only Memory (EEPROM), and the like.

Processor 340 may be an integrated circuit chip having signal processing capabilities. The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor 340 may be any conventional processor or the like.

The electronic device 300 includes, but is not limited to, a switch, a router, and the like.

An embodiment of the present application further provides a computer-readable storage medium (hereinafter, referred to as a storage medium), where the storage medium stores a computer program, and the computer program is executed by the electronic device 300 as described above to execute the above-mentioned SID compression method or execute the above-mentioned message forwarding method.

It should be noted that, in the present specification, the embodiments are all described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments may be referred to each other.

In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. The apparatus embodiments described above are merely illustrative, and for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

In addition, functional modules in the embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.

The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product stored in a computer-readable storage medium, which includes several instructions for causing a computer device (which may be a personal computer, a notebook computer, a server, or an electronic device) to execute all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned computer-readable storage media comprise: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.

The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A SID compression method, for application to a network device, the method comprising:

acquiring a segment list, wherein the segment list comprises a plurality of SIDs, and each SID corresponds to a node or a link in a message forwarding path;

and determining a compressed SID of the SID based on a preset compression rule aiming at each SID in the segment list, wherein the compressed SID comprises a SID bitmap and a short SID, each bit in the SID bitmap is used for indicating whether each byte in the SID is 0 or non-0, each bit in the SID bitmap corresponds to each byte in the SID one by one, the sequence of each bit in the SID bitmap is consistent with the sequence of each byte in the SID, and the short SID is obtained by combining all non-0 bytes in the SID according to the original sequence.

2. The method of claim 1, wherein determining the compressed SID for the SID based on a predetermined compression rule comprises:

setting the value of the bit corresponding to each byte in the SID bitmap according to the value of the byte, wherein the value of the bit corresponding to each byte is used for indicating that the byte is 0 or non-0;

removing 0 bytes in the SID, and combining all non-0 bytes after removal according to the original sequence to form the short SID;

and splicing the SID bitmap and the short SID to obtain the compressed SID.

3. The method of claim 1, wherein before determining, for each SID in the segment list, a compressed SID for that SID based on preset compression rules, the method further comprises:

collecting compressed SID information supported by other network equipment in the network through a routing protocol;

determining that all SIDs in the segment list support compression based on the collected SID information.

4. The method of claim 1, further comprising:

acquiring message attribute information of a message to be forwarded;

acquiring a target segment list corresponding to the message attribute information, replacing an original SID in the target segment list by using a compressed SID corresponding to the original SID in the target segment list, aligning the tail of the compressed SID in the target segment list according to 8 bytes, and filling the part which is less than 8 bytes with 0;

and encapsulating the updated target segment list in an SRH extension header of the packet to be forwarded, and correspondingly filling fields in the SRH extension header so that each network device supporting SRv6 can analyze and forward an IPv6 packet carrying a compressed SID, wherein the fields in the SRH extension header include an identification field for representing whether the SID in the SRH is a compressed SID and a field for representing a byte offset value for which the SID has been analyzed.

5. A message forwarding method is applied to a network device, and the method comprises the following steps:

acquiring an SRH extension header in a to-be-forwarded message carrying a compressed SID;

analyzing the field in the SRH expansion header, and judging whether the analyzed field contains an identifier for representing that the SID in the SRH is a compressed SID;

if the analyzed field contains an identifier for representing that the SID in the SRH is a compressed SID, acquiring a target compressed SID corresponding to an offset value according to the offset value for representing the SID decompression position in the analyzed field;

determining an original SID corresponding to the target compressed SID according to a preset reduction mode, and updating the offset value to the offset value of the next compressed SID to obtain an updated message to be forwarded;

and forwarding the updated message to be forwarded to a node or a link corresponding to the original SID corresponding to the target compressed SID.

6. The method of claim 5, wherein determining the original SID corresponding to the target compressed SID according to a preset recovery manner comprises:

obtaining a SID bitmap and a short SID contained in the target compressed SID;

sequentially analyzing each bit in the SID bitmap until all bits in the SID bitmap are analyzed, and obtaining an original SID corresponding to the target compressed SID;

if the bit is 0, the byte corresponding to the bit in the original SID is 0, and if the bit is 1, the byte corresponding to the bit in the original SID is the byte corresponding to the abbreviated SID; or, if the bit is 0, the byte corresponding to the bit in the original SID is the byte corresponding to the short SID, and if the bit is 1, the byte corresponding to the bit in the original SID is 0.

7. An SID compression apparatus, comprising:

an obtaining module, configured to obtain a segment list, where the segment list includes multiple SIDs, and each SID corresponds to a node or a link in a packet forwarding path;

the compression module is used for determining a compressed SID of the SID based on a preset compression rule aiming at each SID in the segment list, wherein the compressed SID comprises a SID bitmap and a short SID, each bit in the SID bitmap is used for indicating whether each byte in the SID is 0 or non-0, each bit in the SID bitmap corresponds to each byte in the SID one by one, the sequence of each bit in the SID bitmap is consistent with the sequence of each byte in the SID, and the short SID is obtained by combining all non-0 bytes in the SID according to the original sequence.

8. A message forwarding apparatus, the apparatus comprising:

the acquisition module is used for acquiring an SRH extension header in the to-be-forwarded message carrying the compressed SID;

the analysis module is used for analyzing the field in the SRH expansion header and judging whether the analyzed field contains an identifier for representing that the SID in the SRH is a compressed SID; if the analyzed field contains an identifier for representing that the SID in the SRH is a compressed SID, acquiring a target compressed SID corresponding to an offset value according to the offset value for representing the SID decompression position in the analyzed field;

the restoring module is used for determining an original SID corresponding to the target compressed SID according to a preset restoring mode, and updating the offset value to the offset value of the next compressed SID to obtain an updated message to be forwarded;

and the forwarding module is used for forwarding the updated message to be forwarded to a node or a link corresponding to the original SID corresponding to the target compressed SID.

9. An electronic device, comprising:

a memory and a processor, the processor coupled to the memory;

the memory is used for storing programs;

the processor for invoking a program stored in the memory to perform the method of any one of claims 1-4 or to perform the method of claim 5 or 6.

10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method of any one of claims 1-4 or the method of claim 5 or 6.