WO2017016254A1

WO2017016254A1 - Ipv6 message encapsulation processing method and apparatus

Info

Publication number: WO2017016254A1
Application number: PCT/CN2016/080539
Authority: WO
Inventors: 廖婷; 王翠; 孟伟; 李洪涛
Original assignee: 中兴通讯股份有限公司
Priority date: 2015-07-30
Filing date: 2016-04-28
Publication date: 2017-02-02
Also published as: CN106411738A

Abstract

An IPV6 message encapsulation processing method, comprising: a forwarding node acquiring a correlation between a segment routing list and a list identifier (LIST ID); the forwarding node forwarding the received IPV6 message according to the correlation between the segment routing list and the LIST ID.

Description

IPV6 message encapsulation processing method and device

Technical field

The present application relates to, but is not limited to, the field of communications, and in particular, to a method and an apparatus for processing IPV6 message encapsulation.

Background technique

Segment routing (SR) is a method based on source address routing. By superimposing a layer of information that affects the existing shortest path forwarding, the data is carried outside the data packet. Specify path node information for shortest path forwarding.

As shown in Figure 1, when a packet containing a segment routing header is transmitted in the SR network domain, the network device (router) routes the packet according to the segment header by using the specified SR node path information carried in the segment routing header. The segment operation indicates that a corresponding operation is performed, and the operation indication includes Push, Next, and Continue. When the operation indication is a PUSH operation, the network device pushes a segment routing header (SR Header) into the IP packet, or adds another segment indication in the segment routing header; Next and continue The operation indicates by the pointer of Ptr that when it is judged that the current segment operation has been completed, the pointer moves to the next segment, and the segment pointed by the pointer indicates that it is an active segment for forwarding the next hop; the Continue operation is The segment operation does not end and the pointer remains on the current segment. By specifying the path forwarding function by SR, it is very convenient to implement network load balancing and process engineering, as well as complex network functions such as fast rerouting.

As shown in Figure 2, the segment routing technology utilizes the existing IPV6 routing header for encapsulation extension. The existing IPV6 (Internet Protocol Version 6, Internet Protocol version 6) packet header carries the SR Header. In addition, the packet header of the IPV6 in the related art carries the next type of Next Header (NH), and the routing type is one of the extension headers. The format of the extension header is shown in FIG. 3. In the SR extension encapsulation process in the related art, since the IPV6SR extension header is composed of an expandable length field, the display specified node or chain carried in the LIST list is displayed. The more the number of channels, the longer the length of the message header.

For example, take the network shown in Figure 4 as an example:

When a display path in the network covers almost all the nodes in the network, an SR LIST display is specified as: R1-R2-R4-R3-R5-R6-R8-R7-R9-R10, then the IPV6 packet header of the SR A header length of at least 128 bits*9+64 bits is required to be encapsulated at the R1 node.

As can be seen from the above, this extended form will impose a heavy burden on the header of IPV6.

Summary of the invention

The following is an overview of the topics detailed in this document. This Summary is not intended to limit the scope of the claims.

The embodiment of the invention provides a method and a device for processing an IPV6 packet encapsulation, which can solve the problem that the packet header of the IPV6 is overburdened in the related art.

The embodiments of the present invention provide the following technical solutions:

A method for processing an IPV6 packet encapsulation, including:

The forwarding node acquires a correspondence between the SR segment routing list and the list identifier LIST ID;

The forwarding node forwards the received IPV6 packet according to the correspondence between the segment routing list and the LIST ID.

The LIST ID is carried by the forwarding node in an extended packet header of the IPV6 packet when the forwarding node is an SR ingress node.

The LIST ID is identified by using the bit setting information of the Flag field or the specific preset value information of the routing type in the header of the IPV6 message.

After the forwarding node obtains the correspondence between the segment routing list and the list identifier LIST ID, the method further includes:

Generate a forwarding entry for the LIST ID.

The forwarding entry that generates the LIST ID includes:

Finding outbound interface information of the next forwarding node of the forwarding node in the LIST list;

The outbound interface information of the LIST ID is saved as the outbound interface of the forwarding entry of the LIST ID.

The forwarding, according to the correspondence between the segment routing list and the LIST ID, forwarding the received IPV6 packet, including:

If the destination address is the address of the forwarding node, if the type of the next extended header in the packet header of the IPV6 packet is a route type, and the hop count of the remaining LIST list is not zero, then according to the LIST ID The value obtains the next hop information in the LIST list, and uses the IPV6 address of the next hop as the destination address to continue forwarding the IPV6 packet.

When all the path node information in the path is included in the LIST ID, all the path node information in the path is carried by placing the LIST ID in the destination address field of the IPV6 forwarding message.

A processing device for IPV6 packet encapsulation, comprising:

Obtaining a module, configured to obtain a correspondence between the SR segment routing list and the list identifier LIST ID;

The forwarding module is configured to forward the received IPV6 packet according to the correspondence between the segment routing list and the LIST ID.

Wherein, the device further comprises:

The generating module is configured to generate a forwarding entry of the LIST ID after acquiring the correspondence between the segment routing list and the list identifier LIST ID.

The generating module includes:

a searching unit, configured to search for outbound interface information of the next forwarding node of the forwarding node in the LIST list;

The saving unit is configured to save the found outbound interface information as the outbound interface information of the forwarding entry of the LIST ID.

The forwarding module includes:

The obtaining unit is configured to: if the destination address is the address of the forwarding node, if the type of the next extension header in the packet header of the IPV6 packet is a route type, and the remaining LIST list If the hop count is not zero, the next hop information in the LIST list is obtained according to the LIST ID value;

The forwarding unit is configured to forward the IPV6 packet by using the IPV6 address of the next hop as the destination address.

The embodiment of the invention further provides a computer readable storage medium storing computer executable instructions, the method for processing the IPV6 message encapsulation being implemented when the computer executable instructions are executed.

In the embodiment of the present invention, a LIST ID is assigned to the LIST, and the IPV6 carries the LIST ID by encapsulation, and identifies the LIST by using the LIST id, and searches for the next destination address in the LIST through the LIST ID to find the corresponding destination address encapsulation. The publication is still the original forwarding table, except that the mapping of the LIST ID to the LIST on the specified node is displayed in the LIST. The V6 extended encapsulation with a fixed length is used for the SR header encapsulation, and the LIST ID is used to map the node information of the SR LIST, and the IPV6SR packet is forwarded to the destination, and the SR of the IPV6 packet is carried by the LIST ID carrying form. The encapsulation is implemented to effectively solve the problem that the packet header load increases with the number of designated nodes, which reduces the burden on the header of the IPV6 packet and improves the data transmission efficiency.

Other aspects will be apparent upon reading and understanding the drawings and detailed description.

BRIEF abstract

1 is a schematic diagram of a format of a packet header of an SR in the related art;

2 is a schematic diagram of a packet header format of an IPv6 SR in the related art;

3 is a schematic diagram of a network topology in the related art;

4 is a schematic diagram of an IPv6 extension header in the related art;

FIG. 5 is a flowchart of a method for processing IPV6 packet encapsulation according to an embodiment of the present invention;

FIG. 6 is a schematic diagram of an extended header format of an IPv6 packet according to Embodiment 1 of the present invention;

FIG. 7 is a schematic diagram of a network topology according to Embodiment 2 of the present invention;

8 is a schematic diagram of a forwarding table on a router R1 according to Embodiment 2 of the present invention;

9 is a schematic diagram of a LIST ID forwarding table according to Embodiment 3 of the present invention;

10 is a schematic diagram of a Flag field in a packet header of an IPV6 packet according to an embodiment of the present disclosure;

FIG. 11 is a structural diagram of an apparatus for processing IPV6 packet encapsulation according to an embodiment of the present invention.

Embodiments of the invention

The present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be noted that, in the case of no conflict, the features in the embodiments and the embodiments in the present application may be arbitrarily combined with each other.

FIG. 5 is a flowchart of a method for processing IPV6 packet encapsulation according to an embodiment of the present invention. The method shown in Figure 5 includes:

Step 501: The forwarding node acquires a correspondence between a segment route (SR) list and a list identifier (LIST ID).

Step 502: The forwarding node forwards the received IPV6 packet according to the correspondence between the segment routing list and the LIST ID.

The method provided by the embodiment of the present invention obtains the correspondence between the end router list and the LIST ID, and then uses the corresponding relationship to forward the packet, and effectively solves the problem that the packet header load increases with the number of designated nodes by using the carried LIST ID. The problem is that the burden on the header of the IPV6 packet is reduced, and the data transmission efficiency is improved.

The method embodiments provided by the embodiments of the present invention are further described below:

Optionally, the node in the path path can make full use of the LIST ID by using the IPV6 message at the ingress node.

The LIST ID is a bit setting information of a Flag field in a packet header of an IPV6 packet or The specific type information of the routing type is identified.

By making full use of the fields available in the format of the header of the IPV6 packet, the modification of the existing protocol can be reduced, which is simple and convenient.

After the forwarding node obtains the correspondence between the segment routing list and the list identifier LIST ID, the method further includes: generating a forwarding entry of the LIST ID.

By generating a forwarding entry for the LIST ID, the LIST ID can be conveniently used for data forwarding, and the efficiency of IPV6 packet forwarding is improved.

The forwarding entry that generates the LIST ID includes:

The outbound interface information of the forwarding node of the forwarding node in the LIST list is searched; and the outbound interface information of the forwarding entry of the LIST ID is saved as the outbound interface information of the forwarding entry of the LIST ID.

In addition, when all the path node information in the path is included in the LIST ID, all path node information in the path is carried by placing the LIST ID in the destination address field of the IPV6 forwarding message.

Embodiment 1

The SR LIST problem of the present application is explained below in one embodiment. By extending the management IPV6 address block, an unused global IPV6 address or other bit length identifier is used to indicate the mapping identifier of the LIST, as shown in FIG.

The controller (Operator) obtains the IPV6 address of all the nodes in the network, and finds that there is a globally unique unicast IPV6 address 2001::1001-2001::2000 (this field can be continuous or discontinuous. The node segment identifier (SID) assigned to the nodes R1-R10 is 2001::1001-2001::1010, and a policy path calculated by the controller according to the policy is 2001::1001- 2001::1002-2001::1004-2001::1003-2001::1005-2001::1006-2001::1008-2001:: 1007-2001::1009-2001::1010, the current SR header extension will carry the LIST node information in the RH extension header. This is just one of the scenarios. If the network size is large, some special strategies are needed. After the node with more hops, all the node information needs to be carried in the extension header, which greatly increases the burden on the packet header. The application can be implemented as follows:

1. The unused 2001::2000 route is assigned to the path on the controller, and the mapping of the policy path to the controller is performed by using the address of 2001::2000, that is, the unique identifier by the LIST ID. The LIST;

2. Will 2001::2000 to 2001::1001-2001::1002-2001::1004-2001::1003-2001::1005-2001::1006-2001::1008-2001::1007-2001: :1009-2001::1010 mapping information (the information is delivered through the southbound interface (that is, the interface that manages other vendors' network management or devices, that is, the interface provided downwards, supports multiple forms of interface protocols), such as PCEP ( Path Computation Element Protocol, BGP-LS (Border Gateway Protocol-Link-state), openflow (open flow), netconf (network configuration), etc. Each node in the path is delivered.

3. For each node in the path, form a LIST ID (2001::2000) to LIST (2001::1001-2001::1002-2001::1004-2001::1003-2001::1005- 2001::1006-2001::1008-2001::1007-2001::1009-2001::1010) mapping table;

4. For the ingress node R1 of the message, as shown in FIG. 6, a new routing type header is added to indicate that the extension header carries a path identification information, and the new type still includes the same as the existing extension. The Segments Left field (the number of hops in the remaining LIST list) is still the number of nodes in the policy path -2 (counting from zero, its first hop has been stripped), and the Segment LIST ID is encapsulated as 2001: : 2000, the packet encapsulation destination address of the base v6 is the next hop node 2001::1002, R2 of the node R1 (2001::1001) in the LIST, and is forwarded according to the routing entry in the forwarding table of R2;

5. When the packet is forwarded to R2, the destination address is itself, and the packet carries the NH header. If the Left field of the Segment is not 0, the Segment LIST ID field is taken out, and the mapping table is searched. The node R2 is found. 2001::1002) Next hop node 2001: in the LIST 1004, R4, the address of R4 is filled in the destination address field, the left field of the Segments is decremented by 1, and then forwarded according to the destination address R4;

6. The message is forwarded to R4, and the operation described in step 5 is repeated. The message is forwarded to R3-R5-R6-R8-R7-R9-R10.

7. When the packet arrives at R10, the destination address is itself, the packet carries the NH header, and the Lefts Left field is 0. It is determined that it is the last hop, and the extension header of the SR type in the NH packet is optional. pop up.

Embodiment 2

In the above embodiments, the node SID is covered. When the path needs to specify that the display path passes through a certain link, the adjacent SID (Adjacency SID) of each node needs to be involved. As shown in FIG. 6, there is a relationship between R4 and R6. For two equal-cost links, the adjacent SID specified by the above link is the local label value. The upper two links are FE80::9001 and FE80::9002 respectively. If the specified display path must pass through R4-R6. If the above link is reachable, the controller calculates a LIST, such as LIST 3: 2001::1001-2001::1004-FE80::9001-2001::1010, or the control as described in the first embodiment. Under the surface control, the map of the LIST 3 is identified as 2001::1199, and the controller sends the mapping information of the identifier and the path information to R1, R3, and R10, and each node stores the mapping table information:

1. For the R1 node, the path that the controller needs to send the packet header to the policy path is 2001::1001-2001::1004-FE80::9001-2001::1010, carrying the LIST ID mapping: 2001::1199; as shown in Figure 6, the packet header to be sent to the traffic header of the policy path needs to be the number of nodes in the policy path - 2 (from 0) Start counting, the local node loses its own hop count), which is 2, the Segment LIST ID is encapsulated as 2001::1199, and the IPV6 packet encapsulation destination address is the node R1 (2001::1001). The next hop node 2001::1004, R4 in the LIST is forwarded according to the route from the shortest path to R4, as shown in the forwarding table of Figure 8, where the shortest path from R1 to R4 is reachable through R2;

2. The packet is forwarded to the R2 node, and the R2 node views the destination address to R4, and the NH header is routing. The type header does not need to be processed by itself, that is, the content in the extension header and the outer encapsulation is not processed, and the packet is forwarded to the R4 node;

3. When the packet arrives at the R4 node and finds that the destination address is to itself, and the NH header displays the next extension header as the routing type header, the type in the routing type header is the indicated path identifier, and the left field of the segments is 2. I am not the last hop. I look up the mapping table. The next hop of my own is FE80::9001, which is the local link address. The next hop address 2001::1010 is encapsulated in the Dst (destination) field to forward the packet. On the interface where the link address is located, the left field of the segments is decremented to the local area, and then the first link is decremented to the local link, and the delivered message is 0 at this time;

4. The message is transmitted to R6 through the interface of the 9001 link. R6 is the forwarding intermediate node. It is not in the LIST. It is forwarded according to the DST field of the message 2001::1010. The default shortest path is R6-R8-R10. The NH header is a routing type header, and does not need to be processed by itself. That is, the Dst content in the extension header and the outer encapsulation is not processed, and the packet is forwarded to the R8 node.

5. The R8 node operates in the same manner as R6, and forwards the packet to the R10 node.

6. The destination address is itself, the NH header is the routing type header, and the Lefts Left field is 0. It is determined that it is the last hop, and the extension header of the SR type in the NH message can be selectively popped up.

Embodiment 3

As described in the first embodiment, the controller sends a mapping information LIST ID (2001::2000) of the display path to the LIST (2001::1001-2001::1002-2001::1004-2001::1003-2001: :1005-2001::1006-2001::1008-2001::1007-2001::1009-2001::1010) For all nodes, when the path between ingress to egress (export) nodes contains all intermediate nodes of the path path When all forwarding nodes receive the mapping message. Then, the next hop information of the LIST ID can be learned as the outbound interface and the gateway address of the next hop in the LIST list, that is, the forwarding entry of R1 is similar to that shown in FIG. 7, and the next hop of R1 is in the LIST. The middle is R2, the next hop is the outgoing interface to R2, the gateway is also the gateway to R2, then a forwarding entry to the LIST ID is generated locally, the next hop is the outgoing interface to R2, and the gateway is also the gateway to R2. As shown in FIG. 9; the same nodes such as R2 and R3 also form forwarding entries. Then When the packet is encapsulated, the LIST ID information is placed on the destination node, and the forwarding of each node is forwarded according to the destination address LIST ID. Optionally, the packet can be transmitted along the path without extending the header carrying information. At the destination node R10, it is necessary to identify itself as the purpose of the LIST, parse the message content, and perform analysis. The third embodiment requires the LIST to cover the complete node information in the path, otherwise the intermediate forwarding node may not find the routing entry of the LIST ID.

Embodiment 4

The LIST is marked with a unique identifier LIST ID, which may be a 20-bit tag or a 32-bit ipv4 address or a 128-bit IPV6 address.

The LIST ID can be carried in the following manner, including:

Identifies by setting certain bits in the RESV field in the extension header of the route type; or, setting a new routing type value.

The RESV field may be carried in a field of an existing SR extension. As shown in FIG. 10, a certain R in the FLAG field indicates that the path identifier is carried. Since the node has a mapping table of the path identifier, the reserved bits of the original policy can be vacant to indicate how many bits of the label are carried. For example, if the three bit fields of the lower part of the FLAG field are used to identify the number of bits. The identifier of the set.

FIG. 11 is a structural diagram of an apparatus for processing IPV6 packet encapsulation according to an embodiment of the present invention. The device shown in Figure 10 includes:

The obtaining module 1101 is configured to obtain a correspondence between a segment route (SR) list and a list identifier (LIST ID);

The forwarding module 1102 is configured to forward the received IPV6 packet according to the correspondence between the segment routing list and the LIST ID.

The LIST ID is carried by the forwarding node in an extended packet header of the IPV6 packet when the device is located at the SR ingress node.

Wherein, the device further comprises:

The generating module includes:

The forwarding module 1102 includes:

The obtaining unit is configured to: when the destination address is the address of the forwarding node, if the type of the next extension header in the packet header of the IPV6 packet is a route type, and the hop count of the remaining LIST list is not zero , obtaining the next hop information in the LIST list according to the LIST ID value;

The device provided by the embodiment of the present invention obtains the correspondence between the router list and the LIST ID, and then uses the corresponding relationship to forward the packet. The LIST ID is used to effectively solve the problem that the packet header load increases with the number of designated nodes. The problem is that the burden on the header of the IPV6 packet is reduced, and the data transmission efficiency is improved.

One of ordinary skill in the art will appreciate that all or a portion of the steps of the above-described embodiments can be implemented using a computer program flow, which can be stored in a computer readable storage medium, such as on a corresponding hardware platform (eg, The system, device, device, device, etc. are executed, and when executed, include one or a combination of the steps of the method embodiments.

Alternatively, all or part of the steps of the above embodiments may also be implemented by using an integrated circuit. These steps may be separately fabricated into individual integrated circuit modules, or multiple modules or steps may be fabricated into a single integrated circuit module. achieve. Thus, the application is not limited to any particular combination of hardware and software.

Each of the devices/function modules/functional units in the above embodiments may be implemented by a general-purpose computing device, which may be centralized on a single computing device or distributed over a network of multiple computing devices.

Each device/function module/functional unit in the above embodiments may be stored in a computer readable storage medium when implemented in the form of a software function module and sold or used as a standalone product. The above mentioned computer readable storage medium may be a read only memory, a magnetic disk or an optical disk or the like.

The foregoing is only an embodiment of the present application, but the scope of protection of the present application is not limited thereto, and any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed in the present application. It is covered by the scope of protection of this application. Therefore, the scope of protection of the application should be determined by the scope of protection described in the claims.

Industrial applicability

The technical solution of the present application effectively solves the problem that the packet header load increases with the number of designated nodes, reduces the burden on the header of the IPV6 packet, and improves the data transmission efficiency.

Claims

A method for processing the sixth edition of the IPV6 packet encapsulation of the Internet protocol, comprising:

The forwarding node acquires a correspondence between the segment route SR list and the list identifier LIST ID;

The forwarding node forwards the received IPV6 packet according to the correspondence between the segment routing list and the LIST ID.
The method according to claim 1, wherein when the forwarding node is an SR ingress node, the LIST ID is carried by the forwarding node in an extended header of an IPV6 message.
The method according to claim 2, wherein the LIST ID is identified by a bit set information of a flag of a flag in an IPV6 message header or a specific preset value information of a route type.
The method according to claim 1, further comprising: after the forwarding node acquires a correspondence between the segment routing list and the list identifier LIST ID,

A forwarding entry of the LIST ID is generated.
The method of claim 4, wherein the generating the forwarding entry of the LIST ID comprises:

Finding outbound interface information of the next forwarding node of the forwarding node in the LIST list;

The found outbound interface information is saved as the outbound interface information of the forwarding entry of the LIST ID.
The method of claim 1, wherein the forwarding of the received IPV6 message according to the correspondence between the segment routing list and the LIST ID comprises:

If the destination address is the address of the forwarding node, if the type of the next extension header in the packet header of the IPV6 packet is a route type, and the hop count of the remaining LIST list is not zero, The LIST ID value acquires the next hop information in the LIST list, and uses the IPV6 address of the next hop as the destination address to continue forwarding the IPV6 packet.
The method according to any one of claims 1 to 6, wherein when all the route node information in the path is included in the LIST ID, all the paths are carried by placing the LIST ID in the destination address field of the IPV6 forwarding message. Route node information.
A processing device for IPV6 packet encapsulation, comprising:

Obtaining a module, configured to obtain a correspondence between the segment route SR list and the list identifier LIST ID;

The forwarding module is configured to forward the received IPV6 packet according to the correspondence between the segment routing list and the LIST ID.
The apparatus according to claim 8, wherein when the forwarding node is an SR ingress node, the LIST ID is carried by the forwarding node in an extended packet header of an IPV6 message.
The apparatus according to claim 9, wherein the LIST ID is identified by a bit set information of a flag flag in a header of the IPV6 message or a specific preset value information of a route type.
The apparatus of claim 8 further comprising:

And generating a module, configured to generate a forwarding entry of the LIST ID after acquiring a correspondence between the segment routing list and the list identifier LIST ID.
The apparatus of claim 11 wherein said generating module comprises:

a searching unit, configured to search for outbound interface information of the next forwarding node of the forwarding node in the LIST list;

The saving unit is configured to save the found outbound interface information as the outbound interface information of the forwarding entry of the LIST ID.
The apparatus of claim 8 wherein said forwarding module comprises:

The obtaining unit is configured to: when the destination address is the address of the forwarding node, if the type of the next extension header in the packet header of the IPV6 packet is a route type, and the hop count of the remaining LIST list is not zero Obtaining next hop information in the LIST list according to the LIST ID value;

The forwarding unit is configured to forward the IPV6 packet by using the IPV6 address of the next hop as the destination address.
The apparatus according to any one of claims 8 to 13, wherein when all the route node information in the path is included in the LIST ID, the path is carried by placing the LIST ID in a destination address field of an IPV6 forwarded message. All route node information.