公开(公告)号：US10715427B2

公开(公告)日：2020-07-14

申请号：US15965558

申请日：2018-04-27

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Anil Raj ,  Keshava Ayanur

IPC: H04L12/753 ,  H04L12/715 ,  H04L12/46 ,  H04L12/755 ,  H04L12/24

Abstract: Some examples relate to determining routing decisions in a SD-WAN overlay. In an example, a controller in a SD-WAN overlay comprising a plurality of network nodes may receive respective routing and link information from a respective routing agent present on each network node of the plurality of network nodes. The controller may generate a Prefix tree based on the respective routing and link information received from the respective routing agent. The prefix tree may store prefixes along with respective prefix information. The controller may determine, for each prefix in the Prefix tree, a respective routing decision for each network node in the plurality of network nodes. The controller may distribute the respective routing decision to each network node in the plurality of network nodes in the SD-WAN overlay.

公开(公告)号：US20200099608A1

公开(公告)日：2020-03-26

申请号：US16536028

申请日：2019-08-08

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Anil Raj ,  Anoop Govindan Nair ,  Venkatavaradhan Devarajan

IPC: H04L12/733 ,  H04L12/721 ,  H04L12/755

Abstract: Examples include determining a first hop for a preferred route from a networking device to a destination device, calculating a cumulative cost for the preferred route based on a cost of the first hop and an original cost of the preferred route, determining whether a secondary route is available, and, in response to a determination that the secondary route is available, determining a first hop in the secondary route. Examples also include determining a cost of the first hop in the secondary route, determining a new route from the networking device to the destination computing device based on the cumulative cost of the preferred route and the cost of the first hop in the secondary route, and entering the new route into a forwarding data structure of the networking device.

公开(公告)号：US10397092B2

公开(公告)日：2019-08-27

申请号：US15567043

申请日：2015-06-24

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Anoop Govindan Nair ,  Anil Raj

IPC: H04L12/757 ,  H04L12/715 ,  H04L12/751 ,  H04L12/759

Abstract: Examples disclosed herein relate to reducing flooding of route updates of a dynamic routing protocol. In an example, number of route updates received by a router from each neighbor router may be determined, wherein the router may be present in a network using a dynamic routing protocol. Each neighbor router may be classified into one of a plurality of groups of neighbor routers in such a manner that number of route updates originating from each group of neighbor routers is approximately same. A first route update interval may be determined for each group of neighbor routers for sending a respective first set of future route updates therefrom to the router. The respective first route update interval for sending the respective first set of future route updates may be notified to the respective member routers of each group of neighbor routers.

公开(公告)号：US20180097718A1

公开(公告)日：2018-04-05

申请号：US15567043

申请日：2015-06-24

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Anoop Govindan Nair ,  Anil Raj

IPC: H04L12/757 ,  H04L12/715 ,  H04L12/751 ,  H04L12/759

CPC classification number: H04L45/023 ,  H04L45/025 ,  H04L45/028 ,  H04L45/04

Abstract: Examples disclosed herein relate to reducing flooding of route updates of a dynamic routing protocol. In an example, number of route updates received by a router from each neighbor router may be determined, wherein the router may be present in a network using a dynamic routing protocol. Each neighbor router may be classified into one of a plurality of groups of neighbor routers in such a manner that number of route updates originating from each group of neighbor routers is approximately same. A first route update interval may be determined for each group of neighbor routers for sending a respective first set of future route updates therefrom to the router. The respective first route update interval for sending the respective first set of future route updates may be notified to the respective member routers of each group of neighbor routers.