Patent Application
20220360519
The present disclosure claims priority to Chinese Patent Application No. 201910591843.6, filed to the China National Intellectual Property Administration on Jul. 1, 2019, the disclosure of which is hereby incorporated by reference in its entirety.
The present disclosure relates to the field of communications, and in particular, to a method and device for packet forwarding.
A Spine-Leaf architecture is characterized by being easy to expand and capable of greatly improving network utilization and avoiding congestion, and has been a standard architecture implemented by a data center network. New metropolitan area networks and access networks may use this architecture widely in the future.
In the Spine-Leaf architecture, nodes pointing to Spine are in a north direction, nodes pointing to Leaf are in a south direction, and nodes pointing to the same level are in an east-west direction. In order to save a unicast routing table entry space, nodes tend to notify default routes to the south direction and detailed routes to the north direction. A loop occurs when a detailed routing table of south nodes is slow in issuing or fails to be issued due to failure causes.
For example, in
It is assumed that Leaf111 generates a detailed route 1.0.0.0/24 and notifies to Node111 and Node112 and floods to Spine21 and Spine22. For ease of description, it is assumed that Leaf121 sends a packet to destination 1.0.0.1 via Node121, Spine21, Node111, and Leaf111. At this moment, on a control plane, Leaf111 has a route 0.0.0.0/0 to Node111, Node111 has a route 0.0.0.0/0 to Spine21, Spine21 has a route 1.0.0.0/24 to Node111, Node111 has a route 1.0.0.0/24 to Leaf111 and a route 0.0.0.0/0 to Spine21, and Leaf111 has a route 1.0.0.0/24 to Host1 and a route 0.0.0.0/0 to Node111. When the route 1.0.0.0/24 on Leaf111 has not been issued to a forwarding plane due to device busyness or exception, the packet of destination 1.0.0.1 from Node111 hits 0.0.0.0/0, which is re-delivered to Node111, and Node111 will deliver it to Leaf111 to form a loop. A loop is also formed between Spine21 and Node111 before the route 1.0.0.0/24 on Node111 is issued to the forwarding plane.
Due to the existence of a large number of Equal-Cost Multipath Routing (ECMP) links, it may be practical to form loops between adjacent levels, not necessarily between two fixed devices, but the effect is the same.
Embodiments of the present disclosure provide a method and device for packet forwarding, so as to at least solve the problem of forming a loop due to a failure in issuing a detailed routing table in the related art.
According to an embodiment of the present disclosure, a method for packet forwarding is provided. The method may include the following steps. Interface direction information and a routing table issued by a control plane are received, where a route in the routing table carries a routing direction identifier. When a packet is received from an interface, a forwarding plane determines the interface direction of an incoming interface of the packet according to the interface direction information, and determines a routing direction of the packet according to the routing direction identifier. If the interface direction of the incoming interface matches the routing direction, then the packet is forwarded, and if not, then the packet is discarded.
The interface direction includes: an east-west direction, a south direction and a north direction. The routing direction includes: an east-west direction, a south direction and a north direction. In a network topology, the south direction is from a high-level node to a low-level node, the north direction is from a low-level node to a high-level node and the east-west direction is between same-level nodes.
Before interface direction information issued by the control plane is received, the method may further include the following step. The control plane is configured or dynamic learns interface direction information of a network topology, and issues the interface direction information to the forwarding plane.
The step that the routing direction of the packet is determined according to the routing direction identifier includes the following step. The routing table is searched according to a destination address in the packet, and a routing direction identifier corresponding to the found route is taken as the routing direction of the packet.
A default route or an aggregated route in the routing table carries a route direction identifier.
The method should be set as a Spine-Leaf architecture network.
According to another embodiment of the present disclosure, a device for packet forwarding is provided. The device may include: a receiving module, configured to receive interface direction information and a routing table issued by a control plane, wherein a route in the routing table carries a routing direction identifier; a determination module, configured to determine, when a packet is received from an interface, an interface direction of an incoming interface of the packet by a forwarding plane according to the interface direction information, and determine a routing direction of the packet according to the routing direction identifier; and a forwarding module, configured to forward the packet if the interface direction of the incoming interface matches the routing direction, and discard the packet if not.
The interface direction includes: an east-west direction, a south direction and a north direction. The routing direction includes: an east-west direction, a south direction and a north direction. In a network topology, the south direction is from a high-level node to a low-level node, the north direction is from a low-level node to a high-level node and the east-west direction is between same-level nodes.
The device may further include: an issuing module, configured to configure or dynamic learn interface direction information of a network topology, and issue the interface direction information to the forwarding plane.
The determination module includes: a searching unit, configured to search the routing table according to a destination address in the packet; and a determination unit, configured to take a routing direction identifier corresponding to the found route as the routing direction of the packet.
A default route or an aggregated route in the routing table carries a route direction identifier.
According to yet another embodiment of the present disclosure, a storage medium is also provided. The storage medium stores a computer program that, when run, performs the steps in the above method embodiments.
According to yet another embodiment of the present disclosure, an electronic device is also provided, which includes a memory and a processor. The memory stores a computer program. The processor is configured to run the computer program to perform the steps in the above method embodiments.
In the above embodiments of the present disclosure, the control plane forwards the direction information of the interface to the forwarding plane according to a network topology, at the same time, the routing table issued by the control plane carries the routing direction identifier; when traffic is received from a certain interface, in addition to searching for a route according to the destination of the packet, the direction of the incoming interface of the traffic and the direction of the route also need to be matched, a packet can be forwarded if the directions are matched, and the packet will be discarded if not matched, thus preventing the formation of a loop.
The accompanying drawings described herein are used to provide a further understanding of the present disclosure, and constitute a part of the present application, and the exemplary embodiments of the present disclosure and the description thereof are configured to explain the present disclosure, but do not constitute improper limitations to the present disclosure. In the drawings:
The present disclosure will be described in detail below with reference to the drawings in conjunction with the 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 combined with each other.
With regard to the problem of forming a loop due to slow issuing of a detailed routing table or failure in issuing the detailed routing table by a forwarding plane in a Spine-Leaf architecture network, a method for packet forwarding capable of preventing a loop is provided in the present embodiment.
In step S202, interface direction information and a routing table issued by a control plane are received, where a route in the routing table carries a routing direction identifier.
In step S204, when a packet is received from an interface, a forwarding plane determines an interface direction of an incoming interface of the packet according to the interface direction information, and determines a routing direction of the packet according to the routing direction identifier.
In step S206, if the interface direction of the incoming interface matches the routing direction, then the packet is forwarded, and if not, then the packet is discarded.
In the above embodiment, the interface direction includes: an east direction, a west direction, a south direction and a north direction. The routing direction includes: an east-west direction, a south direction and a north direction. In a network topology, the south direction is from a high-level node to a low-level node, the north direction is from a low-level node to a high-level node and the east direction or the west direction is between same-level nodes.
Before step S202, the method further includes the following step. The control plane is configured or dynamic learns interface direction information of a network topology, and issues the interface direction information to the forwarding plane.
In step S204, the routing table may be searched according to a destination address in the packet, and a routing direction identifier corresponding to the found route may be taken as the routing direction of the packet.
In the above embodiment, a default route or an aggregated route in the routing table carries a route direction identifier.
It should be noted that although a Spine-Leaf architecture network is taken as an example in the present embodiment, the solution provided by the present embodiment is also applicable to, for example, boundary nodes in different levels of Intermediate System to Intermediate System (ISIS) and boundary nodes in different regions of Open Shortest Path First (OSPF) in a network with a regional division or level relationship.
In the above embodiments, the control plane firstly forwards the direction information of the interface to the forwarding plane according to a network topology, at the same time, the routing table issued by the control plane carries a direction field; when traffic is received from a certain interface, in addition to searching for a route according to the destination of the packet, the direction of the incoming interface of the traffic and the direction of the route also need to be matched, a packet can be forwarded if the directions are matched, and the packet will be discarded if not matched, thus preventing the formation of a loop.
Through the description of the above implementations, those skilled in the art can clearly understand that the method according to the above embodiment may be implemented by means of software plus a necessary general hardware platform, and of course, may also be implemented through hardware, but in many cases, the former is a better implementation. Based on such understanding, the technical solution of the present disclosure, which is essential or contributes to the conventional art, may be embodied in the form of a software product stored in a storage medium (such as a Read-Only Memory (ROM) or a Random Access Memory (RAM), a magnetic disk and an optical disc), including a number of instructions for causing a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform the methods described in various embodiments of the present disclosure.
In the present embodiment, a device for packet forwarding capable of preventing a loop is also provided. The device is configured to implement the above embodiments and preferred implementations. Those have not been described will not be elaborated. As used below, the term “module” may implement a combination of software and/or hardware of a predetermined function. Although the device described in the following embodiments is preferably implemented by software, hardware or a combination of software and hardware is also possible and conceived.
The receiving module 10 is configured to receive interface direction information and a routing table issued by a control plane. A route in the routing table carries a routing direction identifier. The determination module 20 is configured to determine, when a packet is received from an interface, an interface direction of an incoming interface of the packet by a forwarding plane according to the interface direction information, and determine a routing direction of the packet according to the routing direction identifier. The forwarding module is configured to forward the packet if the interface direction of the incoming interface matches the routing direction, and discard the packet if not.
It should be noted that each of the above modules may be implemented by software or hardware. For the latter, it may be implemented by, but not limited to, the following manners that the above modules are all located in the same processor; or, the above modules are located in different processors in any combination form respectively.
In order that the present disclosure may be more readily understood, a detailed description is made below with specific application embodiments.
As shown in
In the present embodiment, a forwarding plane matches a default route, and then direction check is required. As shown in
An interface direction is first manually configured or dynamically learned (e.g. dynamically learned by a thrift protocol) at a control plane, and the interface direction is issued to the forwarding plane.
Taking Node111 in
There is a default route 0.0.0.0/0 on Node111, with an outgoing interface pointing to Spine21 and Spine22, and there is a detailed route 1.0.0.0/24, with an outgoing interface pointing to Leaf111. There is a default route 0.0.0.0/0 on Leaf111, with an outgoing interface pointing to Node111 and Node112, and there is a detailed route 1.0.0.0/24, with an outgoing interface pointing to Host1.
The issued default route of the forwarding plane carries a direction identifier, and after hitting, forwarding is allowed only if the direction of the route matches the direction of an incoming interface of the traffic, and if not, then the packet is discarded. For example, the default route 0.0.0.0/0 issued by Node111 in
Assuming that a detailed route 1.0.0.0/24 on Node111 is not issued to the forwarding plane, a packet with a destination of 1.0.0.1 coming from Spine21 will be matched to the default route, and then the direction check is performed. It is found that the direction of the route is identified as a south direction, the direction of the interface is identified as a north direction, and the packet is discarded. The packet can be effectively prevented from being re-forwarded to Spine21 through the default route.
Assuming that a detailed route 1.0.0.0/24 on Leaf111 is not issued to the forwarding plane, a packet with a destination of 1.0.0.1 coming from Node111 will be matched to the default route, and then the direction check is performed. It is found that the direction of the route is identified as a south direction, the direction of the interface is identified as a north direction, and the packet is discarded. The packet can be effectively prevented from being re-forwarded to Node111 through the default route.
It should be noted that in the present embodiment, if the default route is replaced with an aggregated route, the forwarding method may also effectively prevent the formation of a loop.
In the present embodiment, a forwarding plane matches a default route, then direction check is required, and a Spine-Leaf network forwarding an east-west path is contained. As shown in
An interface direction is first manually configured or dynamically learned (e.g. dynamically learned by a thrift protocol) at a control plane, and the interface direction is issued to the forwarding plane.
For example, an interface connected with Leaf111 and Leaf112 is set with a south identifier and an interface connected with Node112 is set with an east-west identifier on Node111 in
The behavior on Leaf111 in the present embodiment is identical to that in Embodiment 1 and will not be repeated.
There is a default route 0.0.0.0/0 on Node111, with an outgoing interface pointing to Node112, and there is a detailed route 1.0.0.0/24, with an outgoing interface pointing to Leaf111.
The issued default route of the forwarding plane carries a direction identifier, and after hitting, forwarding is allowed only if the direction of the route matches the direction of an incoming interface of the traffic, and if not, then the packet is discarded. For example, the default route 0.0.0.0/0 issued by Node111 in
Assuming that a detailed route 1.0.0.0/24 on Node111 is not issued to the forwarding plane, a packet with a destination of 1.0.0.1 coming from Node112 will be matched to the default route, and then the direction check is performed. It is found that the direction of the route is identified as a south direction, the direction of the interface is identified as an east-west direction, and the packet is discarded, thereby effectively preventing the packet from being re-forwarded to Node112 through the default route.
It should be noted that in the present embodiment, if the default route is replaced with an aggregated route, the forwarding method may also effectively prevent the formation of a loop.
In the present embodiment, a forwarding plane matches a route carrying a direction identifier, and then direction check is required. As shown in
An interface direction is first manually configured or dynamically learned (e.g. dynamically learned by a thrift protocol) at a control plane, and the interface direction is issued to the forwarding plane.
For example, an interface connected with Leaf111 and Leaf112 is set with a south identifier and an interface connected with Node112 is set with an east-west identifier on Node111 in
There is a default route 0.0.0.0/0 on Node111, with an outgoing interface pointing to Node112, and there is a detailed route 1.0.0.0/24, with an outgoing interface pointing to Leaf111. There is a default route 0.0.0.0/0 on Leaf111, with an outgoing interface pointing to Node111 and Node112, and there is a detailed route 1.0.0.0/24, with an outgoing interface pointing to Host1.
The issued route of the forwarding plane carries a direction identifier, and after hitting, forwarding is allowed only if the direction of the route matches the direction of an incoming interface of the traffic, and if not, then the packet is discarded. For example, the default route 0.0.0.0/0 issued by Node111 in
In the above embodiments, route matching can be performed by using the direction as one of the keys, i.e., after the traffic enters, the direction is acquired from the incoming interface of the traffic, and a table is searched by using a Virtual Private Network Identity (vpnid)+direction+destination. The table may also be searched by using a vpnid+destination in a conventional manner, and after hitting, the identifier of the incoming interface of the traffic is compared with the identifier of the routing table.
If the routing table does not carry a direction identifier, then traffic coming from any direction should be forwarded. If the interface does not carry a direction identifier, then traffic received from the interface is forwarded normally regardless of whether the hit entry carries a direction identifier.
An embodiment of the present disclosure also provides a storage medium. The storage medium stores a computer program. he computer program is configured to perform the steps in any one of the above method embodiments when run.
Optionally, in the present embodiment, the storage medium may include, but is not limited to, various media capable of storing a computer program such as a U disk, a ROM, a RAM, a mobile hard disk, a magnetic disk or an optical disc.
An embodiment of the present disclosure also provides an electronic device, which includes a memory and a processor. The memory stores a computer program. The processor is configured to run the computer program to perform the steps in the above method embodiments.
It is apparent that a person skilled in the art shall understand that all of the above-mentioned modules or steps in the present disclosure may be implemented by using a general calculation device, may be centralized on a single calculation device or may be distributed on a network composed of multiple calculation devices. Optionally, they may be implemented by using executable program codes of the calculation devices. Thus, they may be stored in a storage device and executed by the calculation devices, the shown or described steps may be executed in a sequence different from this sequence under certain conditions, or they are manufactured into each integrated circuit module respectively, or multiple modules or steps therein are manufactured into a single integrated circuit module. Thus, the present disclosure is not limited to the combination of any specific hardware and software.
The above descriptions are only the preferred embodiments of the present disclosure and are not intended to limit the present disclosure. As will occur to those skilled in the art, the present disclosure is susceptible to various modifications and changes. Any modifications, equivalent replacements, improvements and the like made within the spirit and principle of the present disclosure should be included within the scope of protection of the present disclosure.
| Number | Date | Country | Kind |
|---|---|---|---|
| 201910591843.6 | Jul 2019 | CN | national |
| Filing Document | Filing Date | Country | Kind |
|---|---|---|---|
| PCT/CN2020/083784 | 4/8/2020 | WO |
