[go: up one dir, main page]

WO2021000619A1 - 报文转发方法及装置 - Google Patents

报文转发方法及装置 Download PDF

Info

Publication number
WO2021000619A1
WO2021000619A1 PCT/CN2020/083784 CN2020083784W WO2021000619A1 WO 2021000619 A1 WO2021000619 A1 WO 2021000619A1 CN 2020083784 W CN2020083784 W CN 2020083784W WO 2021000619 A1 WO2021000619 A1 WO 2021000619A1
Authority
WO
WIPO (PCT)
Prior art keywords
interface
routing
message
route
forwarding
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2020/083784
Other languages
English (en)
French (fr)
Inventor
徐本崇
王会来
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to US17/624,380 priority Critical patent/US20220360519A1/en
Priority to EP20834672.6A priority patent/EP3996334A4/en
Publication of WO2021000619A1 publication Critical patent/WO2021000619A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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/02—Topology update or discovery
    • 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/18—Loop-free operations
    • 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/42—Centralised routing
    • 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/54—Organization of routing tables
    • 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/56—Routing software
    • H04L45/566—Routing instructions carried by the data packet, e.g. active networks
    • 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/02—Topology update or discovery
    • H04L45/08—Learning-based routing, e.g. using neural networks or artificial intelligence
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding in a switch fabric

Definitions

  • the present invention relates to the field of communications, and in particular to a method and device for message forwarding.
  • the Spine-Leaf architecture is easy to expand, can greatly improve network utilization, and avoid congestion. It is now a de facto standard architecture for data center networks. Both new metropolitan area networks and access networks may use this architecture extensively in the future.
  • the Spine node In the Spine-Leaf architecture, the Spine node is north, the Leaf is south, and the node that points to the same layer is east-west. In order to save the space of unicast routing table entries, nodes often advertise default routes to the south and detailed routes to the north. When the detailed routing table of the southbound node is slow or the distribution of the detailed routing table fails due to a failure, a loop will occur.
  • Node111, Node112, Node121, Node122 learn a default route 0.0.0.0/0 from Spine21 and Spine22
  • Leaf111, Leaf112 learn a default route 0.0.0.0/0 from Node111 and Node112
  • Leaf121 , Leaf122 learns a default route 0.0.0.0/0 from Node121 and Node122.
  • Leaf111 generates a 1.0.0.0/24 detailed route and advertises it to Node111 and Node112, and then floods it to Spine21 and Spine22. For the convenience of description, it is assumed that Leaf121 sends packets to the destination 1.0.0.1 through Node121, Spine21, Node111, and Leaf111.
  • Leaf111 has 0.0.0.0/0 route pointing to Node111
  • Node111 has 0.0.0.0/0 route pointing to Spine21
  • Spine21 has 1.0.0.0/24 route pointing to Node111
  • Node111 has 1.0.0.0/24 route pointing to Leaf111 and
  • Equal-Cost Multipath Routing Due to the existence of a large number of Equal-Cost Multipath Routing (ECMP) links, the actual situation may be that a loop is formed between adjacent layers, not necessarily between two fixed devices, but the impact is the same.
  • ECMP Equal-Cost Multipath Routing
  • the embodiment of the present invention provides a message forwarding method and device, so as to at least solve the problem of loop formation in the related art due to the failure to deliver the detailed routing table.
  • a message forwarding method including: receiving interface direction information and a routing table issued by a control plane, wherein the route in the routing table carries a routing direction mark; After receiving the message, the forwarding plane determines the interface direction of the inbound interface of the message according to the interface direction information, and determines the routing direction of the message according to the routing direction mark; if the interface direction of the inbound interface If it matches the routing direction, the message is forwarded; otherwise, the message is discarded.
  • the interface directions include: east-west, south and north; the routing directions include: east-west, south and north; among them, in the network topology, high-level nodes to low-level nodes are south, and low-level nodes
  • the north direction is from the node to the higher-level node, and the east-west direction is between the nodes at the same level.
  • control plane before receiving the interface direction information issued by the control plane, it further includes: the control plane learns the interface direction information of the network topology through configuration or dynamic learning, and sends it to the forwarding plane.
  • determining the routing direction of the message according to the routing direction mark includes: searching the routing table according to the destination address in the message, and using the routing direction mark corresponding to the found route as the message's Route direction.
  • the default route or the aggregated route in the routing table carries a route direction mark.
  • the method should be set as a Spine-Leaf architecture network.
  • a message forwarding device including: a receiving module configured to receive interface direction information and a routing table issued by the control plane, wherein the routing in the routing table carries the routing Direction mark; the determination module is set to determine the interface direction of the inbound interface of the message according to the interface direction information after receiving a message from the interface, and determine the direction of the message according to the routing direction mark Routing direction; a forwarding module, configured to forward the message when the interface direction of the inbound interface matches the routing direction, otherwise, discard the message.
  • the interface directions include: east-west, south and north; the routing directions include: east-west, south and north; among them, in the network topology, high-level nodes to low-level nodes are south, and low-level nodes
  • the north direction is from the node to the higher-level node, and the east-west direction is between the nodes at the same level.
  • the device further includes: a issuing module, which is configured to learn the interface direction information of the network topology through configuration or dynamic learning, and deliver it to the forwarding plane.
  • a issuing module which is configured to learn the interface direction information of the network topology through configuration or dynamic learning, and deliver it to the forwarding plane.
  • the determining module includes: a searching unit configured to search the routing table according to a destination address in the message; a determining unit configured to mark the routing direction corresponding to the found route as the message The routing direction.
  • the default route or the aggregated route in the routing table carries a route direction mark.
  • a storage medium in which a computer program is stored, wherein the computer program is configured to execute the steps in the foregoing method embodiment when running.
  • an electronic device including a memory and a processor, the memory is stored with a computer program, and the processor is configured to run the computer program to execute the foregoing method embodiments Steps in.
  • the control plane issues the direction information of the interface to the forwarding plane, and the routing table issued by the control plane carries the routing direction mark; when the traffic is received from a certain interface, except according to the report
  • the routing table issued by the control plane carries the routing direction mark; when the traffic is received from a certain interface, except according to the report
  • it In addition to finding the route for the destination of the message, it must also match the direction of the traffic inbound interface and the direction of the route.
  • the message can be forwarded only if it matches, and discarded if it does not match, so as to avoid loops.
  • Figure 1 is a schematic diagram of a Spine-Leaf network topology according to related technologies
  • FIG. 2 is a flowchart of a method for forwarding a message according to an embodiment of the present invention
  • FIG. 3 is a schematic diagram of the module structure of a message forwarding device according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of a module structure of a message forwarding device according to another embodiment of the present invention.
  • Figure 5 is a schematic diagram of a Spine-Leaf network topology with a north-south connection according to an embodiment of the present invention
  • Fig. 6 is a schematic diagram of a Spine-Leaf network topology with east-west connection according to an embodiment of the present invention.
  • This embodiment provides a method for packet forwarding that can prevent loops.
  • 2 is a flowchart of a method according to an embodiment of the present invention. As shown in FIG. 2, the process includes the following steps:
  • Step S202 Receive interface direction information and a routing table issued by the control plane, where the routes in the routing table carry routing direction marks;
  • Step S204 After receiving the message from the interface, the forwarding plane determines the interface direction of the inbound interface of the message according to the interface direction information, and determines the routing direction of the message according to the routing direction mark;
  • Step S206 If the interface direction of the inbound interface matches the routing direction, the message is forwarded; otherwise, the message is discarded.
  • the interface directions include: east, west, south, and north; the routing directions include: east, west, south, and north; wherein, in the network topology, higher-level nodes go down The node of the hierarchy is south, the node of the lower level is north to the node of the higher level, and the nodes of the same level are east or west.
  • the method further includes: the control plane learns the interface direction information of the network topology through configuration or dynamic learning, and sends it to the forwarding plane.
  • the routing table may be searched according to the destination address in the message, and the routing direction corresponding to the route found is marked as the routing direction of the message.
  • the default route or aggregated route in the routing table carries a route direction mark.
  • the Spine-Leaf architecture network is taken as an example in this embodiment, in a network with regional division or hierarchical relationship, for example, the intermediate system to the intermediate system (Intermediate System to Intermediate System, ISIS) has different levels. For boundary nodes in different areas, and Open Shortest Path First (OSPF) boundary nodes in different areas, the solution provided in this embodiment is also applicable.
  • ISIS Intermediate System to Intermediate System
  • OSPF Open Shortest Path First
  • the control plane issues the direction information of the interface to the forwarding plane, and the routing table delivered by the control plane carries the direction field; when traffic is received from a certain interface, in addition to the purpose of the message In addition to finding the route locally, it must also match the direction of the traffic inbound interface and the direction of the route. Only if it matches can be forwarded, and if it does not match, it will be discarded, thus avoiding loops.
  • the method according to the above embodiment can be implemented by means of software plus the necessary general hardware platform, of course, it can also be implemented by hardware, but in many cases the former is Better implementation.
  • the technical solution of the present invention essentially or the part that contributes to the existing technology can be embodied in the form of a software product, and the computer software product is stored in a storage medium (such as ROM/RAM, magnetic disk, The optical disc) includes a number of instructions to enable a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to execute the method described in each embodiment of the present invention.
  • This embodiment also provides a packet forwarding device that can prevent loops.
  • the device is configured to implement the above-mentioned embodiments and preferred implementations, and what has been described will not be repeated.
  • the term "module" can implement a combination of software and/or hardware with predetermined functions.
  • the devices described in the following embodiments are preferably implemented by software, hardware or a combination of software and hardware is also possible and conceived.
  • FIG. 3 is a structural block diagram of a message forwarding device according to an embodiment of the present invention. As shown in FIG. 3, the device includes a receiving module 10, a determining module 20, and a forwarding module 30.
  • the receiving module 10 is configured to receive interface direction information and a routing table issued by the control plane, wherein the routes in the routing table carry routing direction marks.
  • the determining module 20 is configured to, after receiving a message from an interface, the forwarding plane determines the interface direction of the inbound interface of the message according to the interface direction information, and determines the routing direction of the message according to the routing direction mark.
  • the forwarding module is configured to forward the message when the interface direction of the inbound interface matches the routing direction, otherwise, discard the message.
  • FIG. 4 is a structural block diagram of a message forwarding device according to another embodiment of the present invention.
  • the device includes all the modules shown in FIG. 3 and also includes a sending module 40.
  • the issuing module 40 is configured to learn the interface direction information of the network topology through configuration or dynamically, and deliver it to the forwarding plane.
  • the determining module 20 further includes a searching unit 201 and a determining unit 202.
  • the searching unit 201 is configured to search the routing table according to the destination address in the message.
  • the determining unit 202 is configured to mark the routing direction corresponding to the found route as the routing direction of the packet.
  • each of the above modules can be implemented by software or hardware.
  • it can be implemented in the following manner, but not limited to this: the above modules are all located in the same processor; or, the above modules are combined in any combination The forms are located in different processors.
  • Spine21 and Spine22 are level 2 nodes
  • Node111, Node112, Node121, and Node122 are level 1 nodes
  • Leaf111, Leaf112, Leaf121, and Leaf122 are level 0 nodes
  • the high-level nodes are the north direction of the lower-level nodes
  • the lower-level The node is the south direction of the high-level node, and the same level becomes the east-west direction.
  • the default route issued on the forwarding plane carries a direction mark. After a match is made, only the route direction and the traffic ingress interface direction are allowed to be forwarded, and if they do not match, it is discarded.
  • the default route 0.0.0.0/0 issued by Node111 is marked as southbound. After a hit, traffic from the southbound interface (interfaces connected to Leaf111 and Leaf112) is forwarded, and the rest is discarded.
  • the default route 0.0.0.0/0 issued by Leaf111 is marked as southbound. After a hit, traffic from the southbound interface (the interface connected to Host1) is forwarded, and the rest is discarded.
  • the packet from Spine21 with the destination 1.0.0.1 will match the default route, and then check the direction, and find that the route is marked as southbound , And the interface direction is marked as north, and the packet is discarded. This can effectively prevent packets from being re-forwarded to Spine21 through the default route.
  • the packets coming from Node111 with the destination of 1.0.0.1 will match the default route, and then check the direction, and find that the route is marked as southbound , And the interface direction is marked as north, and the packet is discarded. This can effectively prevent packets from being re-forwarded to Node111 through the default route.
  • the forwarding method can also effectively prevent the formation of loops.
  • the forwarding plane matches the default route, direction verification is required, including the Spine-Leaf network forwarding on the east-west path, as shown in Figure 6.
  • the Host1 address is 1.0.0.1, which is connected to Leaf111.
  • the interface network segment is 1.0.0.0/24, and a packet goes from Leaf121 to Host1 via Node121, Spine21, Node112, Node111, and Leaf111.
  • the interface connecting Leaf111 and Leaf112 is marked with the south direction, and the interface connecting Node112 is marked with the east-west direction.
  • the default route issued on the forwarding plane carries a direction mark. After a hit, forwarding is allowed only if the direction of the route matches the direction of the inbound interface of the traffic. If it does not match, it will be discarded; for example, the default route 0.0.0.0/0 issued by Node111 in Figure 6 is set. Southbound mark, after hit, the traffic coming from the southbound interface (interface connected to Leaf111, Leaf112) is forwarded, and the rest is discarded;
  • the message from Node112 with the destination of 1.0.0.1 will match the default route, and then check the direction, and find that the route is marked as southbound , And the interface direction is marked as east-west, and the message is discarded, effectively preventing the message from being re-forwarded to Node112 through the default route;
  • the forwarding method can also effectively prevent the formation of loops.
  • the forwarding plane is matched to the route, and the direction mark needs to be checked.
  • the network is shown in Figure 6.
  • the Host1 address is 1.0.0.1 and the interface network segment connected to Leaf111 is 1.0. 0.0/24, a message goes from Leaf121 to Host1 via Node121, Spine21, Node112, Node111, and Leaf111.
  • the interface connecting Leaf111 and Leaf112 is marked with a southbound mark, and the interface connecting Node112 is marked with an east-west mark; on Leaf111, the interface connecting Node111 and is marked with a northbound mark, and the others are marked with a southbound mark.
  • the route issued on the forwarding plane carries a direction mark. After a hit, only the route direction and the traffic inbound interface direction are allowed to be forwarded, and if they do not match, they are discarded; for example, the default route 0.0.0.0/0 issued by Node111 in Figure 6 is set to the south. After the hit, the traffic coming from the southbound interface (the interface connected to Leaf111 and Leaf112) is forwarded, and the rest is discarded; the detailed route 1.0.0.0/24 issued by Node111 is marked with east-west mark, and after hit, it goes from east-west to the interface The incoming traffic (interface connected to Node112) is forwarded, and the rest is discarded; the default route 0.0.0.0/0 issued by Leaf111 is marked as southbound.
  • the traffic coming from the southbound interface (interface connected to Host1) is forwarded.
  • the rest is discarded; the detailed route 1.0.0.0/24 issued by Leaf111 is marked as southbound.
  • the traffic coming from the southbound interface (the interface connected to Host1) is forwarded, and the rest is discarded.
  • the direction can be used as one of the keywords for route matching, that is, the direction is obtained from the traffic ingress interface after the traffic comes in, and the virtual private network identifier (Virtual Private Network Identity, vpnid) + direction + destination is used to look up the table. . It can also be implemented as using the traditional vpnid+destination lookup table, and then comparing the marking of the inbound interface of the traffic with the marking of the routing table after the hit.
  • routing table does not carry a direction mark, traffic in any direction should be forwarded; if the interface does not carry a direction mark, the traffic received from the interface must be forwarded normally regardless of whether the hit table entry carries a direction mark.
  • An embodiment of the present invention also provides a storage medium in which a computer program is stored, wherein the computer program is configured to execute the steps in any one of the foregoing method embodiments when running.
  • the foregoing storage medium may include, but is not limited to: U disk, Read-Only Memory (Read-Only Memory, ROM for short), Random Access Memory (Random Access Memory, RAM for short), Various media that can store computer programs, such as mobile hard disks, magnetic disks, or optical disks.
  • An embodiment of the present invention also provides an electronic device including a memory and a processor, the memory is stored with a computer program, and the processor is configured to run the computer program to execute the steps in the above method embodiment.
  • modules or steps of the present invention can be implemented by a general computing device. They can be concentrated on a single computing device or distributed in a network composed of multiple computing devices. Above, alternatively, they can be implemented with program codes executable by the computing device, so that they can be stored in the storage device for execution by the computing device, and in some cases, can be executed in a different order than here. Perform the steps shown or described, or fabricate them into individual integrated circuit modules, or fabricate multiple modules or steps of them into a single integrated circuit module to achieve. In this way, the present invention is not limited to any specific combination of hardware and software.

Landscapes

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

Abstract

本发明提供了一种报文转发方法及装置，该方法包括：接收控制面下发的接口方向信息和路由表，其中，所述路由表中的路由携带有路由方向标记；当从接口接收到报文后，所述转发面根据所述接口方向信息确定所述报文的入接口的接口方向，并根据路由方向标记确定所述报文的路由方向；如果所述入接口的接口方向与所述路由方向相匹配，则转发所述报文，否则，则丢弃所述报文。在本发明中，根据网络拓扑，控制面下发接口的方向信息到转发面，同时控制面下发的路由表携带路由方向标记；当从某接口收到流量后，除了根据报文的目的地查找路由之外，还要匹配流量入接口的方向和路由的方向，从而可以避免形成环路。

Description

报文转发方法及装置 技术领域
本发明涉及通信领域，具体而言，涉及一种报文转发方法及装置。
背景技术
Spine-Leaf架构具有易扩容、能够极大程度的提高网络利用率、避免拥塞等特点，目前已经是数据中心网络事实的标准架构。新型城域网、接入网都可能将来广泛使用这种架构。
在Spine-Leaf架构中，指向Spine节点为北向，指向Leaf为南向，指向相同层的节点为东西向。为了节省单播路由表表项空间，节点往往会向南向通告默认路由，而向北向通告明细路由。当南向节点的明细路由下表慢或由于故障原因明细路由表下发失败时，就会发生环路。
例如，在图1中，Node111、Node112、Node121、Node122从Spine21和Spine22学习到一条0.0.0.0/0的默认路由，Leaf111、Leaf112从Node111和Node112学习到一条0.0.0.0/0的默认路由，Leaf121、Leaf122从Node121和Node122学习到一条0.0.0.0/0的默认路由。
假设Leaf111产生一条1.0.0.0/24明细路由，并通告到Node111、Node112，进而泛洪到Spine21、Spine22。为方便描述，假设Leaf121经过Node121、Spine21、Node111、Leaf111向目的地1.0.0.1发送报文。这时在控制面，Leaf111存在0.0.0.0/0路由指向Node111，Node111存在0.0.0.0/0路由指向Spine21，Spine21存在1.0.0.0/24路由指向Node111，Node111存在1.0.0.0/24路由指向Leaf111且存在0.0.0.0/0路由指向Spine21，Leaf111存在1.0.0.0/24路由指向Host1且存在0.0.0.0/0路由指向Node111。当Leaf111上1.0.0.0/24路由由于设备忙或异常还没有下发到转发面时，从Node111过来的目的地1.0.0.1的报文命中的还是0.0.0.0/0，重新投递到Node111，Node111又会投递到Leaf111，形成环路。Node111上1.0.0.0/24 路由下发转发面之前，同样会在Spine21和Node111之间形成环路。
由于存在大量等价多路径(Equal-Cost Multipath Routing，ECMP链路，实际情况可能是在相邻层间形成环路，不一定是固定的两台设备间，但造成的影响是相同的。
发明内容
本发明实施例提供了一种报文转发方法及装置，以至少解决相关技术中由于明细路由表下发失败，而形成环路的问题。
根据本发明的一个实施例，提供了一种报文转发方法，包括：接收控制面下发的接口方向信息和路由表，其中，所述路由表中的路由携带有路由方向标记；当从接口接收到报文后，所述转发面根据所述接口方向信息确定所述报文的入接口的接口方向，并根据路由方向标记确定所述报文的路由方向；如果所述入接口的接口方向与所述路由方向相匹配，则转发所述报文，否则，则丢弃所述报文。
其中，所述接口方向包括：东西向、南向和北向；所述路由方向包括：东西向、南向和北向；其中，在网络拓扑中，高层级节点往低层级节点为南向，低层级节点往高层级节点为北方向，同层级节点之间为东西向。
其中，接收控制面下发的接口方向信息之前，还包括：所述控制面通过配置或动态学习网络拓扑的接口方向信息，并下发至所述转发面。
其中，根据路由方向标记确定所述报文的路由方向，包括：根据所述报文中的目的地址查找所述路由表，将所查找到的路由所对应的路由方向标记作为所述报文的路由方向。
其中，所述路由表中的默认路由或聚合路由携带有路由方向标记。
其中，所述方法应设置为Spine-Leaf架构网络。
根据本发明的另一个实施例，提供了一种报文转发装置，包括：接收模块，设置为接收控制面下发的接口方向信息和路由表，其中，所述路由表中的路由携带有路由方向标记；确定模块，设置为当从接口接收到报 文后，所述转发面根据所述接口方向信息确定所述报文的入接口的接口方向，并根据路由方向标记确定所述报文的路由方向；转发模块，设置为在所述入接口的接口方向与所述路由方向相匹配的情况下，转发所述报文，否则，则丢弃所述报文。
其中，所述接口方向包括：东西向、南向和北向；所述路由方向包括：东西向、南向和北向；其中，在网络拓扑中，高层级节点往低层级节点为南向，低层级节点往高层级节点为北方向，同层级节点之间为东西向。
其中，所述装置还包括：下发模块，设置为通过配置或动态学习网络拓扑的接口方向信息，并下发至所述转发面。
其中，所述确定模块包括：查找单元，设置为根据所述报文中的目的地址查找所述路由表；确定单元，设置为将所查找到的路由所对应的路由方向标记作为所述报文的路由方向。
其中，所述路由表中的默认路由或聚合路由携带有路由方向标记。
根据本发明的又一个实施例，还提供了一种存储介质，所述存储介质中存储有计算机程序，其中，所述计算机程序被设置为运行时执行上述方法实施例中的步骤。
根据本发明的又一个实施例，还提供了一种电子装置，包括存储器和处理器，所述存储器中存储有计算机程序，所述处理器被设置为运行所述计算机程序以执行上述方法实施例中的步骤。
在本发明的上述实施例中，根据网络拓扑，控制面下发接口的方向信息到转发面，同时控制面下发的路由表携带路由方向标记；当从某接口收到流量后，除了根据报文的目的地查找路由之外，还要匹配流量入接口的方向和路由的方向，匹配才能转发报文，不匹配则丢弃，从而可以避免形成环路。
附图说明
此处所说明的附图用来提供对本发明的进一步理解，构成本申请的一 部分，本发明的示意性实施例及其说明设置为解释本发明，并不构成对本发明的不当限定。在附图中：
图1是根据相关技术的Spine-Leaf网络拓扑示意图；
图2是根据本发明实施例的报文转发方法流程图；
图3是根据本发明实施例的报文转发装置模块结构示意图；
图4是根据本发明另一实施例的报文转发装置模块结构示意图；
图5是根据本发明实施例的有南北向连接的Spine-Leaf网络拓扑示意图；
图6是根据本发明实施例的有东西向连接的Spine-Leaf网络拓扑示意图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本发明。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。
针对Spine-Leaf架构网络中，由于转发面明细路由下表慢或明细路由表下发失败，导致形成环路的问题，本实施例中提供了一种可以防止环路的报文转发方法，图2是根据本发明实施例的方法流程图，如图2所示，该流程包括如下步骤：
步骤S202，接收控制面下发的接口方向信息和路由表，其中，所述路由表中的路由携带有路由方向标记；
步骤S204，当从接口接收到报文后，所述转发面根据所述接口方向信息确定所述报文的入接口的接口方向，并根据路由方向标记确定所述报文的路由方向；
步骤S206，如果所述入接口的接口方向与所述路由方向相匹配，则转发所述报文，否则，则丢弃所述报文。
在上述实施例中，所述接口方向包括：东向、西向、南向和北向；所 述路由方向包括：东向、西向、南向和北向；其中，在网络拓扑中，高层级节点往低层级节点为南向，低层级节点往高层级节点为北方向，同层级节点之间为东向或西向。
在上述步骤S202之前，还包括：所述控制面通过配置或动态学习网络拓扑的接口方向信息，并下发至所述转发面。
在步骤S204中，可根据所述报文中的目的地址查找所述路由表，将所查找到的路由所对应的路由方向标记作为所述报文的路由方向。
在上述实施例中，所述路由表中的默认路由或聚合路由携带有路由方向标记。
需要说明的是，本实施例虽然以Spine-Leaf架构网络为例，但是，在存在区域划分或层级关系的网络中，例如，对于中间系统到中间系统(Intermediate System to Intermediate System，ISIS)不同Level的边界节点、开放式最短路径优先(Open Shortest Path First，OSPF)不同区域的边界节点，本实施例所提供的方案同样也是适用的。
在上述实施例中，首先根据网络拓扑，控制面下发接口的方向信息到转发面，同时控制面下发的路由表携带方向字段；当从某接口收到流量后，除了根据报文的目的地查找路由之外，还要匹配流量入接口的方向和路由的方向，匹配才能转发，不匹配则丢弃，从而避免形成环路。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本发明的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本发明各个实施例所述的方法。
在本实施例中还提供了一种可以防止环路的报文转发装置，该装置设 置为实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图3是根据本发明实施例的报文转发装置的结构框图，如图3所示，该装置包括接收模块10、确定模块20和转发模块30。
接收模块10设置为接收控制面下发的接口方向信息和路由表，其中，所述路由表中的路由携带有路由方向标记。确定模块20设置为当从接口接收到报文后，所述转发面根据所述接口方向信息确定所述报文的入接口的接口方向，并根据路由方向标记确定所述报文的路由方向。转发模块设置为在所述入接口的接口方向与所述路由方向相匹配的情况下，转发所述报文，否则，则丢弃所述报文。
图4是根据本发明另一实施例的报文转发装置的结构框图，如图4所示，该装置除包括图3所示的所有模块外，还包括下发模块40。下发模块40，设置为通过配置或动态学习网络拓扑的接口方向信息，并下发至所述转发面。所述确定模块20还进一步包括查找单元201和确定单元202。查找单元201设置为根据所述报文中的目的地址查找所述路由表。确定单元202设置为将所查找到的路由所对应的路由方向标记作为所述报文的路由方向。
需要说明的是，上述各个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述各个模块以任意组合的形式分别位于不同的处理器中。
为了便于进一步理解本发明，下面通过具体应用实施例进行详细描述。
实施例一
如图5所示，Spine21和Spine22为2层的节点，Node111、Node112、Node121、Node122为1层节点，Leaf111、Leaf112、Leaf121、Leaf122为0层节点；高层的节点为低层节点的北向，低层级节点为高层节点的南向， 相同层级成为东西向。
本实施例中，转发面匹配到默认路由则需要进行方向校验，如图5所示，为方便描述，假设Host1地址为1.0.0.1，连接Leaf111的接口网段为1.0.0.0/24,一个报文从Leaf121经Node121、Spine21、Node111、Leaf111到Host1。
首先在控制面通过人工配置或动态学习(例如thrift协议可以动态学习)接口的方向，并把接口方向下发到转发面。
以图5中的Node111为例，在Node111上，连接Leaf111和Leaf112的接口置南向标记，连接Spine21和Spine22的接口置北向标记。在Leaf111上，连接Node111和Node112的接口置北向标记，其他置南向标记。
Node111上有一条默认路由0.0.0.0/0，出接口指向Spine21和Spine22，有一条明细路由1.0.0.0/24，出接口指向Leaf111。Leaf111上有一条默认路由0.0.0.0/0，出接口指向Node111和Node112，有一条明细路由1.0.0.0/24，出接口指向Host1。
下发转发面的默认路由携带方向标记，命中后，只有路由的方向和流量入接口的方向匹配才允许转发，不匹配则丢弃。例如，图5中Node111下发的默认路由0.0.0.0/0置南向标记，命中后，从南向接口(和Leaf111、Leaf112连接的接口)过来的流量转发，其余丢弃。Leaf111下发的默认路由0.0.0.0/0置南向标记，命中后，从南向接口(和Host1连接的接口)过来的流量转发，其余丢弃。
假设Node111上1.0.0.0/24明细路由没有下发到转发面，则从Spine21过来的目的地为1.0.0.1的报文会匹配到默认路由，再进行方向检查，发现路由的方向标记为南向，而接口方向标记为北向，报文丢弃。这样可以有效防止报文再通过默认路由重新转发到Spine21。
假设Leaf111上1.0.0.0/24明细路由没有下发到转发面，则从Node111过来的目的地为1.0.0.1的报文会匹配到默认路由，再进行方向检查，发现路由的方向标记为南向，而接口方向标记为北向，报文丢弃。这样则可以 有效防止报文再通过默认路由重新转发到Node111。
需要说明的是，本实施例中如果默认路由替换成聚合路由，该转发方法也同样是可以有效的防止形成环路。
实施例二
本实施例中，转发面匹配到默认路由则需要进行方向校验，包含东西向路径转发的Spine-Leaf网络，如图6所示，为方便描述，假设Host1地址为1.0.0.1，连接Leaf111的接口网段为1.0.0.0/24,一个报文从Leaf121经Node121、Spine21、Node112、Node111、Leaf111到Host1。
首先在控制面通过人工配置或动态学习(例如thrift协议可以动态学习)接口的方向，并把接口方向下发到转发面。
例如，图6中Node111上，连接Leaf111和Leaf112的接口置南向标记，连接Node112的接口置东西向标记。
本实施例Leaf111上的行为和实施例一完全相同，不再重复描述。
Node111上有一条默认路由0.0.0.0/0，出接口指向Node112，有一条明细路由1.0.0.0/24，出接口指向Leaf111；
下发转发面的默认路由携带方向标记，命中后，只有路由的方向和流量入接口的方向匹配才允许转发，不匹配则丢弃；例如图6中Node111下发的默认路由0.0.0.0/0置南向标记，命中后，从南向接口(和Leaf111、Leaf112连接的接口)过来的流量转发，其余丢弃；
假设Node111上1.0.0.0/24明细路由没有下发到转发面，则从Node112过来的目的地为1.0.0.1的报文会匹配到默认路由，再进行方向检查，发现路由的方向标记为南向，而接口方向标记为东西向，报文丢弃，有效防止报文再通过默认路由重新转发到Node112；
需要说明的是，本实施例中如果默认路由替换成聚合路由，该转发方法也同样是可以有效的防止形成环路。
实施例三
本实施例中，转发面匹配到路由，携带方向标记则需要进行方向校验，如图6所示组网，为方便描述，假设Host1地址为1.0.0.1，连接Leaf111的接口网段为1.0.0.0/24,一个报文从Leaf121经Node121、Spine21、Node112、Node111、Leaf111到Host1。
首先在控制面通过人工配置或动态学习(例如thrift协议可以动态学习)接口的方向，并把接口方向下发到转发面。
例如，图6中Node111上，连接Leaf111和Leaf112的接口置南向标记，连接Node112的接口置东西向标记；Leaf111上，连接Node111和的接口置北向标记，其他置南向标记。
Node111上有一条默认路由0.0.0.0/0，出接口指向Node 112，有一条明细路由1.0.0.0/24，出接口指向Leaf111；Leaf111上有一条默认路由0.0.0.0/0，出接口指向Node111和Node112，有一条明细路由1.0.0.0/24，出接口指向Host1；
下发转发面的路由携带方向标记，命中后，只有路由的方向和流量入接口的方向匹配才允许转发，不匹配则丢弃；例如图6中Node111下发的默认路由0.0.0.0/0置南向标记，命中后，从南向接口(和Leaf111、Leaf112连接的接口)过来的流量转发，其余丢弃；Node111下发的明细路由1.0.0.0/24置东西向标记，命中后，从东西向接口(和Node112连接的接口)过来的流量转发，其余丢弃；Leaf111下发的默认路由0.0.0.0/0置南向标记，命中后，从南向接口(和Host1连接的接口)过来的流量转发，其余丢弃；Leaf111下发的明细路由1.0.0.0/24置南向标记，命中后，从南向接口(和Host1连接的接口)过来的流量转发，其余丢弃。
在上述实施例中，可以把方向作为关键字之一进行路由匹配，即流量进来后即从流量入接口获取方向，用虚拟专用网络标识(Virtual Private Network identity，vpnid)+方向+目的地查表。也可以实现为使用传统方式vpnid+目的地查表，命中后再比较流量入接口的标记和路由表的标记。
如果路由表中没有携带方向标记，则任意方向过来的流量都应该转发； 如果接口没有携带方向标记，则从接口收到的流量无论命中的表项是否携带方向标记，都要正常转发。
本发明的实施例还提供了一种存储介质，该存储介质中存储有计算机程序，其中，该计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
可选地，在本实施例中，上述存储介质可以包括但不限于：U盘、只读存储器(Read-Only Memory，简称为ROM)、随机存取存储器(Random Access Memory，简称为RAM)、移动硬盘、磁碟或者光盘等各种可以存储计算机程序的介质。
本发明的实施例还提供了一种电子装置，包括存储器和处理器，该存储器中存储有计算机程序，该处理器被设置为运行计算机程序以执行上述方法实施例中的步骤。
显然，本领域的技术人员应该明白，上述的本发明的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，可选地，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本发明不限制于任何特定的硬件和软件结合。
以上所述仅为本发明的优选实施例而已，并不设置为限制本发明，对于本领域的技术人员来说，本发明可以有各种更改和变化。凡在本发明的原则之内，所作的任何修改、等同替换、改进等，均应包含在本发明的保护范围之内。

Claims (13)

  1. 一种报文转发方法，包括：
    接收控制面下发的接口方向信息和路由表，其中，所述路由表中的路由携带有路由方向标记；
    从接口接收到报文后，所述转发面根据所述接口方向信息确定所述报文的入接口的接口方向，并根据所述路由方向标记确定所述报文的路由方向；
    如果所述入接口的接口方向与所述路由方向相匹配，则转发所述报文，否则，则丢弃所述报文。
  2. 根据权利要求1所述的方法，其中，所述接口方向包括：东西向、南向和北向；所述路由方向包括：东西向、南向和北向；其中，在网络拓扑中，高层级节点往低层级节点为南向，低层级节点往高层级节点为北方向，同层级节点之间为东西向。
  3. 根据权利要求1所述的方法，其中，接收控制面下发的接口方向信息之前，还包括：
    所述控制面通过配置或动态学习网络拓扑的接口方向信息，并下发至所述转发面。
  4. 根据权利要求1所述的方法，其中，根据路由方向标记确定所述报文的路由方向，包括：
    根据所述报文中的目的地址查找所述路由表，将所查找到的路由所对应的路由方向标记作为所述报文的路由方向。
  5. 根据权利要求1所述的方法，其中，所述路由表中的默认路由或聚合路由携带有路由方向标记。
  6. 根据权利要求1至5任一项所述的方法，其中，所述方法应用于Spine-Leaf架构网络。
  7. 一种报文转发装置，包括：
    接收模块，设置为接收控制面下发的接口方向信息和路由表，其中，所述路由表中的路由携带有路由方向标记；
    确定模块，设置为当从接口接收到报文后，所述转发面根据所述接口方向信息确定所述报文的入接口的接口方向，并根据路由方向标记确定所述报文的路由方向；
    转发模块，设置为在所述入接口的接口方向与所述路由方向相匹配的情况下，转发所述报文，否则，则丢弃所述报文。
  8. 根据权利要求7所述的装置，其中，所述接口方向包括：东西向、南向和北向；所述路由方向包括：东西向、南向和北向；其中，在网络拓扑中，高层级节点往低层级节点为南向，低层级节点往高层级节点为北方向，同层级节点之间为东西向。
  9. 根据权利要求7所述的装置，其中，还包括：
    下发模块，设置为通过配置或动态学习网络拓扑的接口方向信息，并下发至所述转发面。
  10. 根据权利要求7所述的装置，其中，所述确定模块包括：
    查找单元，设置为根据所述报文中的目的地址查找所述路由表；
    确定单元，设置为将所查找到的路由所对应的路由方向标记作为所述报文的路由方向。
  11. 根据权利要求10所述的装置，其中，所述路由表中的默认路由或聚合路由携带有路由方向标记。
  12. 一种存储介质，所述存储介质中存储有计算机程序，其中，所述计算机程序被设置为运行时执行所述权利要求1至6任一项中所述的方法。
  13. 一种电子装置，包括存储器和处理器，所述存储器中存储有计算机程序，所述处理器被设置为运行所述计算机程序以执行所述权利要求1至6任一项中所述的方法。
PCT/CN2020/083784 2019-07-01 2020-04-08 报文转发方法及装置 Ceased WO2021000619A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US17/624,380 US20220360519A1 (en) 2019-07-01 2020-04-08 Method and device for packet forwarding
EP20834672.6A EP3996334A4 (en) 2019-07-01 2020-04-08 PACKET TRANSFER METHOD AND DEVICE

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910591843.6 2019-07-01
CN201910591843.6A CN112187635B (zh) 2019-07-01 2019-07-01 报文转发方法及装置

Publications (1)

Publication Number Publication Date
WO2021000619A1 true WO2021000619A1 (zh) 2021-01-07

Family

ID=73915168

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/083784 Ceased WO2021000619A1 (zh) 2019-07-01 2020-04-08 报文转发方法及装置

Country Status (4)

Country Link
US (1) US20220360519A1 (zh)
EP (1) EP3996334A4 (zh)
CN (1) CN112187635B (zh)
WO (1) WO2021000619A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11418441B2 (en) * 2020-07-20 2022-08-16 Juniper Networks, Inc. High-level definition language for configuring internal forwarding paths of network devices
CN113259234B (zh) * 2021-05-31 2021-11-16 中兴通讯股份有限公司 路径保护方法、节点设备、控制器及存储介质
CN118171626B (zh) * 2024-03-21 2024-11-15 无锡众星微系统技术有限公司 一种Die间PCIe拓扑结构的路由实现方法和装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101127695A (zh) * 2006-08-17 2008-02-20 中兴通讯股份有限公司 一种减少网络流量无效传递的处理方法
US8176201B1 (en) * 2003-11-05 2012-05-08 Juniper Networks, Inc. Controlling the signaling of label-switched paths using a label distribution protocol employing messages which facilitate the use of external prefixes
CN106209518A (zh) * 2016-08-08 2016-12-07 合肥工业大学 一种基于“包‑电路”交换技术的动态转向路由算法

Family Cites Families (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100512321C (zh) * 2004-10-09 2009-07-08 中兴通讯股份有限公司 Atm通用测试操作接口总线上地址扩展的系统及其方法
KR100705593B1 (ko) * 2006-01-25 2007-04-09 삼성전자주식회사 라우팅 시스템 및 라우팅 시스템의 룰 엔트리 관리 방법
CN101374114B (zh) * 2008-09-26 2010-10-27 北京科技大学 一种基于方向信息的车载移动ad hoc网络路由选择方法
CN101753426B (zh) * 2008-12-03 2012-03-28 北京天融信网络安全技术有限公司 防火墙多出口智能选路方法
CN101527681B (zh) * 2009-03-31 2012-07-04 成都市华为赛门铁克科技有限公司 一种上行报文的处理方法、装置和系统
CN101640612B (zh) * 2009-09-07 2011-12-07 杭州华三通信技术有限公司 一种流量路径发现与故障快速定位的方法及装置
CN101945117A (zh) * 2010-09-28 2011-01-12 杭州华三通信技术有限公司 防止源地址欺骗攻击的方法及设备
EP2456137A1 (en) * 2010-11-22 2012-05-23 STMicroelectronics (Grenoble 2) SAS Switches and a network of switches
CN102347908B (zh) * 2011-11-18 2013-12-18 中国科学技术大学 一种基于网络编码的多播路由构造方法
CN103457756B (zh) * 2012-06-05 2016-08-03 华为技术有限公司 一种环路路径检测方法、装置及系统
CN106664235B (zh) * 2014-08-19 2019-12-06 华为技术有限公司 软件定义网络与传统网络的融合方法以及装置
CN104901899B (zh) * 2015-06-18 2018-03-06 西安电子科技大学 二维片上网络拓扑结构的自适应路由方法
US20170195222A1 (en) * 2015-12-30 2017-07-06 Qualcomm Incorporated Routing frames in shared medium networks
US10057193B2 (en) * 2015-12-31 2018-08-21 Fortinet, Inc. Cardinality based packet processing in software-defined networking (SDN) switches
CN105472486B (zh) * 2016-01-08 2019-02-22 烽火通信科技股份有限公司 一种pon接入系统防止路由环路的处理方法
CN108540385A (zh) * 2017-03-06 2018-09-14 中兴通讯股份有限公司 数据发送方法及装置、路由器
CN107018071B (zh) * 2017-03-29 2020-05-12 合肥工业大学 一种基于“包-电路”交换技术的路由模式切换配置器
GB2562520A (en) * 2017-05-17 2018-11-21 John Hamlin Derrick Digital processing connectivity
CN107094116B (zh) * 2017-05-26 2020-02-28 中国科学院计算技术研究所 一种包含跨维度链路的直接网络路由方法和系统
US10476817B2 (en) * 2017-05-31 2019-11-12 Juniper Networks, Inc. Transport LSP setup using selected fabric path between virtual nodes
CN109672594B (zh) * 2017-10-13 2021-12-03 中国电信股份有限公司 IPoE报文处理方法、装置及宽带远程接入服务器
CN108173765B (zh) * 2017-12-28 2020-09-15 新华三技术有限公司 一种报文转发方法和装置
CN110474792B (zh) * 2018-05-11 2021-01-29 华为技术有限公司 网络配置方法、设备及系统
CN110808913B (zh) * 2018-08-30 2021-02-23 华为技术有限公司 报文处理的方法、装置及相关设备
CN109547342B (zh) * 2018-11-30 2021-03-09 新华三技术有限公司 一种策略路由的下发方法及网络节点
CN111600797B (zh) * 2019-02-21 2022-12-30 华为技术有限公司 一种数据传输方法、节点以及系统
US11736195B2 (en) * 2019-04-23 2023-08-22 Ciena Corporation Universal sub slot architecture for networking modules

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8176201B1 (en) * 2003-11-05 2012-05-08 Juniper Networks, Inc. Controlling the signaling of label-switched paths using a label distribution protocol employing messages which facilitate the use of external prefixes
CN101127695A (zh) * 2006-08-17 2008-02-20 中兴通讯股份有限公司 一种减少网络流量无效传递的处理方法
CN106209518A (zh) * 2016-08-08 2016-12-07 合肥工业大学 一种基于“包‑电路”交换技术的动态转向路由算法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3996334A4 *

Also Published As

Publication number Publication date
EP3996334A1 (en) 2022-05-11
CN112187635A (zh) 2021-01-05
US20220360519A1 (en) 2022-11-10
EP3996334A4 (en) 2022-08-17
CN112187635B (zh) 2023-02-03

Similar Documents

Publication Publication Date Title
TWI819072B (zh) 在網路運算環境中用於避免環路衝突的系統、非暫態電腦可讀取儲存媒體及電腦實現方法
US9019814B1 (en) Fast failover in multi-homed ethernet virtual private networks
CN108259347B (zh) 一种报文传输方法和装置
CN107547243B (zh) 一种报文转发方法及装置
US10749799B2 (en) Data routing of extranet flows in fabric networks
CN103259725A (zh) 报文发送方法和网络设备
WO2019196562A1 (zh) 报文处理方法、装置、存储介质及处理器
US10904130B2 (en) Method for scalable computer network partitioning
US20210135980A1 (en) Best Path Computation Offload In A Network Computing Environment
US8855113B2 (en) Link state identifier collision handling
EP3806404A1 (en) Communication method, device and system for avoiding loop
WO2021000619A1 (zh) 报文转发方法及装置
CN106572012A (zh) 一种vpn frr的实现方法和pe设备
WO2017177794A1 (zh) 业务路径的建立方法、装置及系统
WO2016123904A1 (zh) 路由收敛方法、装置及虚拟专用网vpn系统
US20190334814A1 (en) Path establishment method and device, and network node
CN106789523B (zh) 一种逻辑隧道的创建方法及装置
WO2021057293A1 (zh) Evpn中报文转发方法、装置、设备及存储介质
CN112866107B (zh) Ip地址通告方法、流量引导方法及网络设备
US20180367627A1 (en) Fast roaming with shared services in enterprise fabric based networks
WO2020119317A1 (zh) 报文转发方法及装置、存储介质、电子装置
CN107078954B (zh) 用于计算机网络中的端点标识的方法
TWI868310B (zh) 網路運算環境之最佳路徑運算卸載系統及其方法與非暫態電腦可讀取儲存媒體
EP4307618A1 (en) Designating a primary multicast flow and a backup multicast flow for multicast traffic
US20250132972A1 (en) Bgp next-hop groups for multi-homed services in scaled service provider networks

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: 20834672

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2020834672

Country of ref document: EP

Effective date: 20220201