Cisco Technology, Inc.

Jining Tian

Jan Medved

Bruce Stuart Davie

Stefano Benedetto Previdi

Alfred C Lindem, Iii

Steven Vincent Luong

Ravi Kiran Chintallapudi

Manish Bhardwaj

Gaurav Shrivastava

Praleshkumar Gunvantray Patel

Steven Luong

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

In system of networks that are not fully meshed with each other and that are capable of processing distributed hash table (DHT) Put and Get messages, message flooding of GET messages is limited by maintaining a list of DHTs the GET has visited. Also, PUT messages include not only the storage location key in the home network but also a list of networks that the PUT has visited, in essence establishing a dynamically changing path within the PUT back to the home network.

Limited broadcast, peering among DHTs, broadcast put of limited content only

In a tiered system of networks capable of processing distributed hash table (DHT) Put and Get messages, if a sending network of a Put or Get is at a tier below a subject tier at which a subject network receiving the message is located, the message is forwarded to networks at tiers below the subject tier. On the other hand, if the sending network is at a tier equal to or above the subject tier, the message is forwarded to all networks in the system other than the sending network.

Hierarchical flooding among peering overlay networks

A node in an overlay network requests a ranked list of other nodes in multiple areas of the overlay network that can provide a desired piece of content or service to the requesting node. A separate node such as a router generates the ranked list using a routing algorithm, returning the list to the requesting node so that the requesting node may acquire the desired content or service from the nearest node in the overlay network.

Routing-based proximity for communication networks

A node in an overlay network requests a ranked list of other nodes in the overlay network that can provide a desired piece of content or service to the requesting node. A separate node such as a router generates the ranked list using a routing algorithm, returning the list to the requesting node so that the requesting node may acquire the desired content or service from the nearest node in the overlay network.

Growing community of inventors

Cupertino, CA, United States of America

Jining Tian