Traffic distribution over multiple paths in a network while maintaining flow affinity
US-9716592-B1 · Jul 25, 2017 · US
US11743176B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11743176-B2 |
| Application number | US-202117532400-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 22, 2021 |
| Priority date | Sep 18, 2013 |
| Publication date | Aug 29, 2023 |
| Grant date | Aug 29, 2023 |
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 is a packet processing method and system, and a device. A status value used to identify a topology status of service nodes at a specified time is preconfigured for a packet in a packet flow, so that when a service node in a next hop is selected for the packet, selection is performed not based on a topology status of current actual service nodes in the next hop, but based on the topology status, which is identified by the status value, of the service nodes at the specified time. As long as status values carried in packets in a same packet flow are the same, even if a topology status of service nodes changes, a same service node can still be selected for the packets in the same packet flow, thereby avoiding a problem of diversion of the packets in the same packet flow.
Opening claim text (preview).
The invention claimed is: 1. A packet processing method comprising: based on a dynamically-generated value carried in a packet and associated with a topology, determining a plurality of service nodes associated with the value as candidate next hops of the packet; selecting a service node from the determined plurality of service nodes as a next hop of the packet; and sending the packet to the selected service node. 2. The packet processing method according to claim 1 , wherein the topology is determined based on a network topology of a time point at which a packet flow of the packet is generated. 3. The packet processing method according to claim 1 , wherein the topology comprises service nodes of a same service, wherein the determined plurality of service nodes are of the service nodes of the same service. 4. The packet processing method according to claim 1 , wherein the value carried in the packet is added by a flow classification module. 5. The packet processing method according to claim 1 , wherein the selecting a service node from the determined plurality of service nodes as a next hop of the packet comprises: performing a load balancing operation based on the plurality of service nodes, and selecting one service node according to an operation result of the load balancing operation. 6. The packet processing method of according to claim 1 , wherein the packet is one of a plurality of packets in a packet flow, wherein each of the plurality of packets carries the same value. 7. The packet processing method of according to claim 1 , wherein the value is added to a packet of a backward flow, such that the packet of the backward flow is processed in the topology identified by the value. 8. A device comprising: a memory storing instructions; and a processor coupled to the memory to execute the instructions to cause the device to: based on a dynamically-generated value carried in a packet and associated with a topology, determine a plurality of service nodes associated with the value as candidate next hops of the packet; select a service node from the determined plurality of service nodes as a next hop of the packet; and send the packet to the selected service node. 9. The device according to claim 8 , wherein the topology is determined based on a network topology of a time point at which a packet flow of the packet is generated. 10. The device according to claim 8 , wherein the topology comprises service nodes of a same service, wherein the determined plurality of service nodes are of the service nodes of the same service. 11. The device according to claim 8 , wherein the value carried in the packet is added by a flow classification module. 12. The device according to claim 8 , wherein the processor coupled to the memory to execute the instructions to cause the device to: perform a load balancing operation based on the plurality of service nodes, and select one service node according to an operation result of the load balancing operation. 13. The device according to claim 8 , wherein the packet is one of a plurality of packets in a packet flow, wherein each of the plurality of packets carries the same value. 14. The device according to claim 8 , wherein the value is added to a packet of a backward flow, such that the packet of the backward flow is processed in the topology identified by the value. 15. A non-transitory computer-readable medium having instructions stored therein, which when executed by a processor of a device, cause the device to perform a packet processing method, the packet processing method comprising: based on a dynamically-generated value carried in a packet and associated with a topology, determining a plurality of service nodes associated with the value as candidate next hops of the packet; selecting a service node from the determined plurality of service nodes as a next hop of the packet; and sending the packet to the selected service node. 16. The non-transitory computer-readable medium according to claim 15 , wherein the topology is determined based on a network topology of a time point at which a packet flow of the packet is generated. 17. The non-transitory computer-readable medium according to claim 15 , wherein the topology comprises service nodes of a same service, wherein the determined plurality of service nodes are of the service nodes of the same service. 18. The non-transitory computer-readable medium according to claim claim 15 , wherein the value carried in the packet is added by a flow classification module. 19. The non-transitory computer-readable medium according to claim 15 , wherein the packet processing method further comprises: performing a load balancing operation based on the plurality of service nodes, and selecting one service node according to an operation result of the load balancing operation. 20. The non-transitory computer-readable medium according to claim 15 , wherein the packet is one of a plurality of packets in a packet flow, wherein each of the plurality of packets carries the same value.
using route fault recovery · CPC title
Hybrid transport · CPC title
by balancing the load, e.g. traffic engineering · CPC title
Interaction among intermediate nodes, e.g. hop by hop · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.