Routing packets based on congestion of minimal and non-minimal routes
AssigneeHewlett Packard Enterprise Development LP
InventorsNicholas George McDonald, Michael Isaev
Life of this patent
Estimating the term…
Loading patent…
AssigneeHewlett Packard Enterprise Development LP
InventorsNicholas George McDonald, Michael Isaev
Estimating the term…
Examples relate to routing packets based on the actual congestion sensed in the minimal and the non-minimal candidate routes between a source network device and a destination network device. A packet is received at a network device in a network and all possible minimal and non-minimal candidate routes for the packet to be routed to the destination network device are determined. An adaptive weight is assigned to the non-minimal candidate routes, wherein the adaptive weight is a function of congestion of the minimal candidate routes and the non-minimal candidate routes. An optimal route is selected among the plurality of candidate routes and the packet is routed to the destination device using the optimal route.
A method, comprising:
A non-transitory machine readable storage medium comprising instructions executable by a routing engine of a network device to:
A network device comprising:
Dependencies are inferred from the claim text.