WO2017016254A1 - Procédé et appareil de traitement d'encapsulation de message ipv6 - Google Patents

Procédé et appareil de traitement d'encapsulation de message ipv6 Download PDF

Info

Publication number
WO2017016254A1
WO2017016254A1 PCT/CN2016/080539 CN2016080539W WO2017016254A1 WO 2017016254 A1 WO2017016254 A1 WO 2017016254A1 CN 2016080539 W CN2016080539 W CN 2016080539W WO 2017016254 A1 WO2017016254 A1 WO 2017016254A1
Authority
WO
WIPO (PCT)
Prior art keywords
list
forwarding
node
ipv6
information
Prior art date
Application number
PCT/CN2016/080539
Other languages
English (en)
Chinese (zh)
Inventor
廖婷
王翠
孟伟
李洪涛
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2017016254A1 publication Critical patent/WO2017016254A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/20—Hop count for routing purposes, e.g. TTL
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/741—Routing in networks with a plurality of addressing schemes, e.g. with both IPv4 and IPv6
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling

Definitions

  • 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.
  • Segment routing 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.
  • the network device 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.
  • the network device pushes a segment routing header (SR Header) into the IP packet, or adds another segment indication in the segment routing header;
  • SR Header 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the method further includes:
  • the forwarding entry that generates the LIST ID includes:
  • 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:
  • the destination address is the address of the forwarding node
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • a LIST ID is assigned to the LIST
  • 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.
  • FIG. 1 is a schematic diagram of a format of a packet header of an SR in the related art
  • FIG. 2 is a schematic diagram of a packet header format of an IPv6 SR in the related art
  • FIG. 3 is a schematic diagram of a network topology in the related art
  • FIG. 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.
  • FIG. 8 is a schematic diagram of a forwarding table on a router R1 according to Embodiment 2 of the present invention.
  • FIG. 9 is a schematic diagram of a LIST ID forwarding table according to Embodiment 3 of the present invention.
  • FIG. 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.
  • 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).
  • SR segment route
  • LIST ID list identifier
  • 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 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 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.
  • the method further includes: generating a forwarding entry of the LIST ID.
  • 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.
  • the forwarding according to the correspondence between the segment routing list and the LIST ID, forwarding the received IPV6 packet, including:
  • the destination address is the address of the forwarding node
  • 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.
  • all path node information in the path is carried by placing the LIST ID in the destination address field of the IPV6 forwarding message.
  • 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 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
  • 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:
  • 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.
  • 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.
  • 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
  • PCEP Path Computation Element Protocol
  • BGP-LS Border Gateway Protocol-Link-state
  • openflow open flow
  • netconf netconf
  • 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;
  • 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;
  • 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;
  • 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.
  • the node SID is covered.
  • the adjacent SID Adjacency SID
  • FIG. 6 there is a relationship between R4 and R6.
  • 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:
  • 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;
  • 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;
  • 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.
  • 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.
  • 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;
  • 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.
  • the R8 node operates in the same manner as R6, and forwards the packet to the R10 node.
  • 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.
  • 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)
  • 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)
  • 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.
  • the same nodes such as R2 and R3 also form forwarding entries.
  • the packet can be transmitted along the path without extending the header carrying information.
  • 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.
  • 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:
  • 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.
  • 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.
  • 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 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 forwarding unit is configured to forward the IPV6 packet by using the IPV6 address of the next hop as the destination address.
  • 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.
  • 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.
  • 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.
  • 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 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.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention se rapporte à un procédé de traitement d'encapsulation de message IPV6, selon lequel : un nœud d'acheminement acquiert une corrélation entre une liste de routage par segment et un identificateur de liste (LIST ID) ; et le nœud d'acheminement achemine le message IPV6 reçu, conformément à la corrélation entre la liste de routage par segment et le LIST ID.
PCT/CN2016/080539 2015-07-30 2016-04-28 Procédé et appareil de traitement d'encapsulation de message ipv6 WO2017016254A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510460405.8 2015-07-30
CN201510460405.8A CN106411738A (zh) 2015-07-30 2015-07-30 Ipv6报文封装的处理方法和装置

Publications (1)

Publication Number Publication Date
WO2017016254A1 true WO2017016254A1 (fr) 2017-02-02

Family

ID=57884057

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/080539 WO2017016254A1 (fr) 2015-07-30 2016-04-28 Procédé et appareil de traitement d'encapsulation de message ipv6

Country Status (2)

Country Link
CN (1) CN106411738A (fr)
WO (1) WO2017016254A1 (fr)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113411259A (zh) * 2021-06-30 2021-09-17 新华三技术有限公司 一种报文转发方法、装置及设备
CN113472666A (zh) * 2021-06-29 2021-10-01 新华三信息安全技术有限公司 报文转发方法及设备
CN113472653A (zh) * 2021-05-25 2021-10-01 新华三信息安全技术有限公司 路径一致性的检测方法及装置
CN113542059A (zh) * 2021-06-29 2021-10-22 新华三大数据技术有限公司 段路由多路径bfd检测方法、装置及存储介质
CN114124781A (zh) * 2021-11-23 2022-03-01 中国联合网络通信集团有限公司 SRv6中报文的转发方法、系统、电子设备及存储介质
CN114365464A (zh) * 2019-09-27 2022-04-15 华为技术有限公司 一种在sr网络中转发报文的方法、设备和系统
CN114697254A (zh) * 2020-12-31 2022-07-01 北京华为数字技术有限公司 一种报文处理的方法及相关装置
WO2024001701A1 (fr) * 2022-06-30 2024-01-04 华为技术有限公司 Procédé, appareil et système de traitement de données
US11902153B1 (en) 2018-12-28 2024-02-13 Juniper Networks, Inc. Compressed routing header

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109962847B (zh) * 2017-12-14 2021-07-30 中国电信股份有限公司 业务功能链报文的封装方法和装置及计算机可读存储介质
CN109379359B (zh) * 2018-10-19 2021-09-07 苏州盛科通信股份有限公司 SRv6数据包的处理方法和装置
CN109688057B (zh) * 2018-12-13 2021-08-24 Ut斯达康通讯有限公司 基于ipv6的段路由网络的报文转发方法及装置
CN111510386B (zh) * 2019-01-30 2023-06-20 华为技术有限公司 用于处理报文的方法和装置
CN111669422B (zh) * 2019-03-08 2022-03-11 华为技术有限公司 报文的传输方法和设备
US11412071B2 (en) 2019-05-13 2022-08-09 Juniper Networks, Inc. Compressed routing header information for networks
CN112350934A (zh) * 2019-08-07 2021-02-09 中国电信股份有限公司 数据传输方法、网络节点和数据传输系统
CN110611616A (zh) * 2019-09-18 2019-12-24 下一代互联网重大应用技术（北京）工程研究中心有限公司 一种基于Radius服务器的流量调度方法、系统、设备和介质
CN112910772B (zh) * 2019-11-19 2023-01-13 中国移动通信有限公司研究院 一种基于分段路由的报文转发方法及设备
CN115314563A (zh) 2020-01-20 2022-11-08 华为技术有限公司 一种消息生成方法、处理方法及装置
CN111541614B (zh) * 2020-01-21 2022-04-08 中国银联股份有限公司 报文转发方法以及网络节点
CN116346717A (zh) * 2020-06-02 2023-06-27 华为技术有限公司 一种确定处理能力的方法、节点和系统
CN114666259A (zh) * 2020-12-22 2022-06-24 华为技术有限公司 报文传输的方法、装置、设备、存储介质及系统
CN113014485B (zh) * 2021-02-25 2022-04-26 烽火通信科技股份有限公司 一种基于SRv6-TE路径的报文转发方法和报文转发装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070058638A1 (en) * 2005-09-14 2007-03-15 Guichard James N System and methods for network segmentation
US20140269266A1 (en) * 2012-10-05 2014-09-18 Cisco Technology, Inc. Method and system for path monitoring using segment routing
WO2014144344A1 (fr) * 2013-03-15 2014-09-18 Cisco Technology, Inc. Acheminement à segments transparents
WO2014163863A1 (fr) * 2013-03-11 2014-10-09 Cisco Technology, Inc. Identifiant de segment indexé

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070058638A1 (en) * 2005-09-14 2007-03-15 Guichard James N System and methods for network segmentation
US20140269266A1 (en) * 2012-10-05 2014-09-18 Cisco Technology, Inc. Method and system for path monitoring using segment routing
WO2014163863A1 (fr) * 2013-03-11 2014-10-09 Cisco Technology, Inc. Identifiant de segment indexé
WO2014144344A1 (fr) * 2013-03-15 2014-09-18 Cisco Technology, Inc. Acheminement à segments transparents

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"IPv6 Segment Routing Header (SRH", NETWORK WORKING GROUP INTERNET -DRAFT, 9 June 2014 (2014-06-09), pages 3 - 24 *

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11902153B1 (en) 2018-12-28 2024-02-13 Juniper Networks, Inc. Compressed routing header
CN114365464A (zh) * 2019-09-27 2022-04-15 华为技术有限公司 一种在sr网络中转发报文的方法、设备和系统
CN114365464B (zh) * 2019-09-27 2023-03-24 华为技术有限公司 一种在sr网络中转发报文的方法、设备和系统
CN114697254A (zh) * 2020-12-31 2022-07-01 北京华为数字技术有限公司 一种报文处理的方法及相关装置
CN113472653A (zh) * 2021-05-25 2021-10-01 新华三信息安全技术有限公司 路径一致性的检测方法及装置
CN113472666A (zh) * 2021-06-29 2021-10-01 新华三信息安全技术有限公司 报文转发方法及设备
CN113542059A (zh) * 2021-06-29 2021-10-22 新华三大数据技术有限公司 段路由多路径bfd检测方法、装置及存储介质
CN113542059B (zh) * 2021-06-29 2022-08-30 新华三大数据技术有限公司 段路由多路径bfd检测方法、装置及存储介质
CN113472666B (zh) * 2021-06-29 2023-08-18 新华三信息安全技术有限公司 报文转发方法及设备
CN113411259A (zh) * 2021-06-30 2021-09-17 新华三技术有限公司 一种报文转发方法、装置及设备
CN114124781A (zh) * 2021-11-23 2022-03-01 中国联合网络通信集团有限公司 SRv6中报文的转发方法、系统、电子设备及存储介质
WO2024001701A1 (fr) * 2022-06-30 2024-01-04 华为技术有限公司 Procédé, appareil et système de traitement de données

Also Published As

Publication number Publication date
CN106411738A (zh) 2017-02-15

Similar Documents

Publication Publication Date Title
WO2017016254A1 (fr) Procédé et appareil de traitement d'encapsulation de message ipv6
US20220376987A1 (en) Segment routing: pce driven dynamic setup of forwarding adjacencies and explicit path
US11438260B2 (en) Method and apparatus for forwarding MPLS data packet
US10880203B2 (en) Centralized segment routing dataplane based backup path validation
WO2016165492A1 (fr) Procédé et appareil permettant la mise en œuvre de chaîne de fonction de service
CN106487686B (zh) Sr转发条目生成方法及装置
US9444677B2 (en) Scalable edge node protection using IPv6 segment routing extension header
US10021023B2 (en) Packet forwarding method, controller, forwarding device, and network system
WO2016115850A1 (fr) Procédé de traitement de routage de segment, appareil de traitement et appareil d'envoi
WO2016198015A1 (fr) Procédé de transmission de paquets, appareil, et système
US20150109904A1 (en) Scalable edge node protection using segment routing
CN107317751A (zh) 使用IPv4映射的IPv6地址的出口对等工程
WO2015192501A1 (fr) Procédé et appareil de libération d'informations d'adresse
US20100110902A1 (en) Traffic Matrix Computation for a Backbone Network Supporting Virtual Private Networks
EP2993836A1 (fr) Procédé et dispositif de routage d'un message de données
WO2018072728A1 (fr) Acquisition d'identifiant de segment
US10015085B2 (en) Packet forwarding method, controller, forwarding device, and network system
EP3886378B1 (fr) Routage continu de segments de bout en bout dans les réseaux de zones métropolitaines
US11323371B1 (en) Micro SID packet processing with operations, administration, and management
EP3054634A1 (fr) Schéma pour effectuer une fonction de transfert tunnel monopasse sur une structure de réseau à deux couches
CN108494684B (zh) 创建隧道的方法及装置
CN108270671A (zh) 对分组执行服务
CN113542126B (zh) 广义SRv6全路径压缩方法及装置
CN106789705A (zh) 传输控制报文的方法和装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16829621

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16829621

Country of ref document: EP

Kind code of ref document: A1