Method for forwarding packet and network device
US-2024106743-A1 · Mar 28, 2024 · US
US10230623B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10230623-B2 |
| Application number | US-201615217819-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 22, 2016 |
| Priority date | Jul 22, 2016 |
| Publication date | Mar 12, 2019 |
| Grant date | Mar 12, 2019 |
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.
Disclosed are systems and methods for scaling Massively Scalable Data Center (MSDC) networks with a large number of end-point tunnels utilizing Equal-cost multi-path routing (ECMP). The systems and methods can use the NO-OP label operations to maintain single ECMP objects to switch a set of segment routing tunnels that share the same ECMP links. The forwarding engine can determine the use of the NO-OP label operation and update a received packet to enable the use of the single ECMP objects of the set of segment routing tunnels.
Opening claim text (preview).
What is claimed is: 1. A method for end-point scaling on a segment routing network, the method comprising: receiving, at a node of a segment routing tunnel, a packet and a label; pushing, to the label, a no-op label; determining a best next node of a plurality of nodes along a path of the segment routing tunnel corresponding to the label; transmitting the packet with the no-op label to the best next node; receiving, at the best next node, the packet; ignoring label operations for the packet if the best next node is not configured as a no-op node; and ignoring label operations for altering the label if the best next node is configured as a no-op node. 2. The method of claim 1 , further comprising: determining another best next node of the plurality of nodes along the path of the segment routing tunnel corresponding to the label if the best next node is not configured as the no-op node; and forwarding, without altering the label, the packet to the another best next node. 3. The method of claim 1 , further comprising: transmitting the packet to another best next node along the path of the segment routing tunnel based on the label and an equal cost multipath routing object if the best next node is configured as the no-op node. 4. The method of claim 1 , wherein the node utilizes equal cost multipath routing. 5. The method of claim 2 , wherein each of the node and best next nodes utilize equal cost multipath routing. 6. The method of claim 1 , wherein a no-op label operation is configured over an entire massively scalable data center network. 7. The method of claim 1 , wherein a no-op label operation is distributed by a control plane protocol for each segmented routed tunnel. 8. The method of claim 1 , wherein the node maintains a single equal cost multipath routing object configured to switch a set of segment routing tunnels that share equal cost multipath routing links in a massively scalable data center network. 9. The method of claim 1 , wherein the label is unique for the segment routing tunnel. 10. A method for end point scaling on a segment routing network, the method comprising: receiving, at a node of a segment routing tunnel, a packet and a label; ignoring label operations for altering the label at the node; determining a best next node of a plurality of nodes along a path of the segment routing tunnel corresponding to the label and an equal cost multipath routing object; transmitting, the packet and the label to the best next node along the path of the segment routing tunnel; receiving, at the best next node, the packet; ignoring label operations for the packet at the best node if the best next node is not configured as a no-op node; and ignoring label operations for altering the label if the best next node is configured as a no-op node. 11. The method of claim 10 , further comprising: transmitting the packet to another best next node along the path of the segment routing tunnel based on the label and the equal cost multipath routing object if the best next node is configured as the no-op node. 12. The method of claim 10 , further comprising: determining another best next node of the plurality of nodes along the path of the segment routing tunnel corresponding to the label if the best next node is not configured as the no-on node; and forwarding the packet to the another best next node. 13. The method of claim 10 , wherein each of the node and best next nodes utilize equal cost multipath routing. 14. The method of claim 11 , wherein the node utilizes equal cost multipath routing. 15. The method of claim 10 , wherein a no-op label operation is configured over an entire massively scalable data center network. 16. The method of claim 10 , wherein a no-op label operation is distributed by a control plane protocol for each segment of a routing tunnel of the segment routing tunnel. 17. The method of claim 10 , wherein the node maintains the equal cost multipath routing object is configured to switch a set of segment routing tunnels that share equal cost multipath routing links in a massively scalable data center network. 18. The method of claim 10 , wherein the label is unique for the segment routing tunnel.
Interconnection of networks using encapsulation techniques, e.g. tunneling · CPC title
using a combination of metrics · CPC title
Multipath · CPC title
using label swapping, e.g. multi-protocol label switch [MPLS] · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.