Weighted load balancing in a multistage network using hierarchical ECMP
US-9571400-B1 · Feb 14, 2017 · US
US9729473B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9729473-B2 |
| Application number | US-201514745488-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 22, 2015 |
| Priority date | Jun 23, 2014 |
| Publication date | Aug 8, 2017 |
| Grant date | Aug 8, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method in a network element that includes multiple interfaces for connecting to a communication network includes receiving via an ingress interface packets that are not allowed to undergo re-routing and that are addressed to a destination via a first egress interface. The packets are forwarded via the first egress interface when there is a valid path from the first egress interface to the destination. When there is no valid path from the first egress interface to the destination, a second egress interface is selected from a group of multiple egress interfaces that have respective paths to the destination and are assigned to packets for which re-routing is allowed, and the packets are forwarded via the second egress interface until recovering a path to the destination.
Opening claim text (preview).
The invention claimed is: 1. A method comprising: in a network element that comprises multiple interfaces for connecting to a communication network, receiving via an ingress interface packets that are not allowed to undergo re-routing and that are addressed to a destination via a first egress interface; forwarding the packets via the first egress interface when there is a valid path from the first egress interface to the destination; and in response to detecting, by the network element, that there is no valid path from the first egress interface to the destination, selecting a second egress interface from a group of multiple egress interfaces that have respective paths to the destination and are assigned to packets for which re-routing is allowed, and forwarding the packets via the second egress interface until recovering a path to the destination. 2. The method according to claim 1 wherein the first egress interface is additionally assigned within the group of multiple egress interfaces only for packets for which re-routing is allowed. 3. The method according to claim 1 , wherein the first egress interface is not assigned within the group of multiple egress interfaces for which re-routing is allowed. 4. The method according to claim 1 , wherein selecting the second egress interface comprises switching to the second egress interface in response to receiving from the communication network a notification indicating that a route to the destination that traverses the first egress interface has failed. 5. The method according to claim 1 , wherein recovering the path comprises re-configuring the network element based on a global, network-wide routing decision. 6. The method according to claim 1 , wherein forwarding the packets via the second interface comprises forwarding all the packets destined to the first egress interface via the second egress interface. 7. The method according to claim 1 , wherein selecting the second egress interface comprises choosing the second egress interface from among the multiple egress interfaces in the group, based on one or more fields in headers of the packets. 8. The method according to claim 7 , wherein choosing the second egress interface comprises holding a table that maps hash results calculated over the fields to respective egress interfaces in the group. 9. The method according to claim 8 , wherein choosing the second egress interface comprises calculating a hash function having a number of hash results equal to a number of entries of the table that are mapped to egress interfaces that have a valid path to the destination. 10. The method according to claim 8 , wherein choosing the second egress interface comprises removing from the table one or more entries that are mapped to one or more egress interfaces that have no valid paths to the destination, and calculating a hash function having a number of hash results equal to a remaining number of entries corresponding to egress interfaces that have valid paths to the destination. 11. The method according to claim 1 , wherein selecting the second egress interface comprises switching to the second egress interface once, and not re-switching again until recovering the path to the destination or until forwarding the packets via the second egress interface to the destination fails. 12. The method according to claim 1 , and comprising receiving via the ingress interface packets to be delivered to the destination via a third egress interface that belongs to the group, forwarding the packets via the third egress interface when there is a valid path from the third egress interface to the destination, and, when there is no valid path from the third egress interface to the destination, selecting a fourth egress interface within the group that has a valid path to the destination, and forwarding the packets via the fourth egress interface until recovering a path to the destination. 13. A network element, comprising: multiple interfaces, which are configured to connect to a communication network; and switching circuitry, which is configured to receive via an ingress interface packets that are not allowed to undergo re-routing and that are addressed to a destination via a first egress interface, to forward the packets via the first egress interface when there is a valid path from the first egress interface to the destination, and, in response to detecting that there is no valid path from the first egress interface to the destination, to select a second egress interface from a group of multiple egress interfaces that have respective paths to the destination and are assigned to packets for which re-routing is allowed, and to forward the packets via the second egress interface until recovering a path to the destination. 14. The network element according to claim 13 wherein the switching circuitry is configured to assign the first egress interface within the group of multiple egress interfaces only for packets for which re-routing is allowed. 15. The method according to claim 13 , wherein the switching circuitry is configured not to assign the first egress interface within the group of multiple egress interfaces for which re-routing is allowed. 16. The network element according to claim 13 , wherein the switching circuitry is configured to switch to the second egress interface in response to receiving from the communication network a notification indicating that a route to the destination that traverses the first egress interface has failed. 17. The network element according to claim 13 , wherein the switching circuitry is configured to recover the path by re-configuring the network element based on a global, network-wide routing decision. 18. The network element according to claim 13 , wherein the switching circuitry is configured to forward all the packets destined to the first egress interface via the second egress interface. 19. The network element according to claim 13 , wherein the switching circuitry is configured to choose the second egress interface from among the multiple egress interfaces in the group, based on one or more fields in headers of the packets. 20. The network element according to claim 19 , wherein the switching circuitry is configured to choose the second egress interface by holding a table that maps hash results calculated over the fields to respective egress interfaces in the group. 21. The network element according to claim 20 , wherein the switching circuitry is configured to choose the second egress interface by calculating a hash function having a number of hash results equal to a number of entries of the table that are mapped to egress interfaces that have a valid path to the destination. 22. The network element according to claim 20 , wherein the switching circuitry is configured to choose the second egress interface by removing from the table one or more entries that are mapped to one or more egress interfaces that have no valid paths to the destination, and to calculate a hash function having a number of hash results equal to a remaining number of entries corresponding to egress interfaces that have valid paths to the destination. 23. The network element according to claim 13 , wherein the switching circuitry is configured to switch to the second egress interface once, and to not re-switch again until recovering the path to the destination or until forwarding the packets via the second egress interface to the destination fails. 24. The network element a
Error correction, e.g. fault recovery or fault tolerance · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.