Cisco Technology, Inc.

Telefonaktiebolaget Lm Ericsson (publ)

Ericsson Ab

Alfred C Lindem, Iii

Wenhu Lu

Abhay Kumar Roy

Alvaro E Retana

Ing-Wher Chen

Yi Yang

Peter Psenak

Sina Mirtorabi

Ravi Kiran Chintallapudi

Anand K Oswal

Uma S Chunduri

Syed Khalid Raza

James L Ng

Timothy M Gage

Ijsbrand Wijnands

Renhua Wen

Vengada Prasad Govindan

Gaurav Shrivastava

Manikandan Panchanathan

Vasant Shankargouda Patil

Lester C Ginsberg

Lars Ernstrom

Jining Tian

Sachin Desai

Chandru Sargor

Praleshkumar Gunvantray Patel

Keyur Patel

Samir D Thoria

Evgeny Tantsura

Laxmikantha Reddy Ponnuru

Derek Man-Kit Yeung

Satish Mahadevan

Jakob Heitz

Pramodh D'Souza

Arul Murugan Manickam

Torsha Das

Lars Ernström

Russ White

Roy Abhay

According to certain embodiments, a router comprises one or more processors and one or more computer-readable non-transitory storage media. The one or more computer-readable non-transitory storage media comprise instructions that, when executed by the one or more processors, cause one or more components of the router to perform operations comprising determining an occurrence of one or more network events associated with a multicast service, generating route exchange information associated with the multicast service locally by the router based on the one or more network events, and using the route exchange information locally to configure the router.

Optimized MVPN route exchange in SD-WAN environments

According to certain embodiments, a method by a router in a software-defined wide-area network (SDWAN) includes determining one or more replicators in the SDWAN and generating a multicast distribution tree that includes the determined one or more replicators. The method further includes receiving multicast traffic from a source and creating a (S,G) route for the received multicast traffic. The method further includes replicating the multicast traffic using the multicast distribution tree.

Systems and methods for providing SDWAN IP multicast without a rendezvous point

Techniques are described for providing a method and apparatus for determining source address validation of a data packet in a network in the presence of asymmetric routing. When a data packet is received by a node such as a router, a reverse path forwarding lookup is performed to determine if the data packet was received on a next-hop interface and if the reverse path forwarding fails, a Shortest Path First (SPF) computation at the router advertising the source route will be performed using the link state database to determine whether the data packet arrived from a valid path of the network.

Source address validation for asymmetric routing

The present disclosure is directed to a centralized control policy for multicast replicator selection. Methods include receiving multicast advertisements from a plurality of edge devices configured with multicast protocol, each multicast advertisement including information indicating whether an associated edge device is a replicator; analyzing multicast advertisements from the plurality of edge devices to identify one or more replicators; receiving a centralized policy configuration associated with at least one control policy that includes a preference related to selection of at least one replicator from the identified one or more replicators, the preference applicable to a defined set of edge devices from the plurality of edge devices; and updating at least one multicast advertisement with the control policy for transmission to the defined set of edge devices, the updated at least one multicast advertisement indicating the preference for replicator selection for the defined set of edge devices based on the control policy.

SD-WAN multicast replicator selection centralized policy

Techniques for ensuring symmetric forwarding between disparate networks. The techniques may include receiving a gateway preference order associated with a route advertised by an edge node, the edge node associated with a first network. The techniques may also include determining, based at least in part on the gateway preference order, that a gateway node is a more preferred gateway for the route than another gateway node, the gateway node configured to facilitate communications between the first network and a second network. In some examples, the techniques may also include converting the gateway preference order into a metric associated with an IP routing protocol that is in use in the second network. In some examples, the route including the metric may be distributed within the second network such that the gateway node is the more preferred gateway for return traffic of the route.

Symmetric routing in software-defined networks

The present disclosure is directed to systems and methods for auto-provisioning hubs and spokes in a SD-WAN network, and includes the performance of operations and/or the steps of receiving first information from a first network hub, the first network hub one of a plurality of network hubs, the first information indicating a first set of properties associated with the first network hub; publishing the first information to a plurality of network spokes, the plurality of network spokes determining whether to subscribe to the first network hub based on the first information; receiving subscription information from a first network spoke of the plurality of network spokes, the subscription information indicating the first network spoke subscribing to the first network hub; and creating at least one dynamic control policy to establish a forwarding path for the first network spoke through the first network hub.

Auto-provisioning of SD-WAN hubs and spokes

Techniques for updating a routing table based on a single message are described. One technique includes receiving at a first network device a node message from a second network device. The node message includes a sequence number and a list of link state(s) originated by the second network device. The first network device determines whether to withdraw one or more link states originated by the second network device and maintained in a routing table of the first network device based on the sequence number and the list of the link state(s) within the node message. The routing table is updated based on the determinations.

Link state addition and deletion based on reception of a single message in link state vector routing

Aspects of the embodiments are directed to synchronizing at least a portion of a link-state database. A network element can lose an adjacency. The network element can transmit a request to a neighboring network element for synchronization of a link-state database. The request can include a version number of a last synchronized link-state database from the neighboring network element. The neighboring network element can determine whether the version of the link-state database is greater than or less than a copy of the link-state database stored by the neighboring network element. If the requested version number is less than the neighboring network element's link-state database version number, then the neighboring network element can send changes to the link-state database since the requested link-state database version number.

Delta database synchronization

Various systems and methods for bypassing one or more non-capable nodes. For example, one method involves a capable node determining that an adjacent node is non-capable, where capable nodes are configured to implement a data plane capability and non-capable nodes are not. The method then involves identifying a downstream node that is capable. The downstream node is on a shortest path. The method also involves generating information that identifies a tunnel to the downstream node.

Capability aware routing

In one embodiment, a first router determines whether an interface coupling the first router to one or more second routers is transit-only. When the interface is transit-only, the first router generates an Open Shortest Path First (OSPF) Link State Advertisement (LSA) that includes an address for the interface and a designated network mask. The designated network mask operates as a transit-only identification that indicates the address should not be installed in a Routing Information Base (RIB) upon receipt of the OSPF LSA at the one or more second routers. When the network is not transit-only, the first router generates an OSPF LSA that includes the address for the interface but does not include the designated network mask, to permit installation of the address in a RIB upon receipt of the OSPF LSA at the one or more second routers.

Apparatus and method to hide transit only multi-access networks in OSPF

Growing community of inventors

Cary, NC, United States of America

Alfred C Lindem, Iii