Dynamically adjusting route or link topology to minimize self-interference
US-2015341140-A1 · Nov 26, 2015 · US
US11206210B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11206210-B2 |
| Application number | US-201916663101-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 24, 2019 |
| Priority date | Sep 18, 2013 |
| Publication date | Dec 21, 2021 |
| Grant date | Dec 21, 2021 |
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).
What is claimed is: 1. A packet processing method comprising: based on a value carried in a packet and associated with a topology status at a specified time, 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 status 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 status 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 specified time is prior to a time of determining the plurality of service nodes. 5. A device comprising: a processor configured to: based on a value carried in a packet and associated with a topology status at a specified time, 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 an interface configured to send the packet to the selected service node. 6. The device according to claim 5 , wherein the topology status is determined based on a network topology of a time point at which a packet flow of the packet is generated. 7. The device according to claim 5 , wherein the topology status comprises service nodes of a same service, wherein the determined plurality of service nodes are of the service nodes of the same service. 8. The device according to claim 5 , wherein the specified time is prior to a time of determining the plurality of service nodes. 9. A non-transitory computer-readable medium having instruction stored therein, which when executed by a processor, cause the processor to perform a packet processing method, the method comprising: based on a value carried in a packet and associated with a topology status at a specified time, 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. 10. The non-transitory computer-readable medium according to claim 9 , wherein the topology status is determined based on a network topology of a time point at which a packet flow of the packet is generated. 11. The non-transitory computer-readable medium according to claim 9 , wherein the topology status comprises service nodes of a same service, wherein the determined plurality of service nodes are of the service nodes of the same service. 12. The non-transitory computer-readable medium according to claim 9 , wherein the specified time is prior to a time of determining the plurality of service nodes.
Hybrid transport · CPC title
Interaction among intermediate nodes, e.g. hop by hop · CPC title
using route fault recovery · CPC title
by balancing the load, e.g. traffic engineering · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.