Abstract: Embodiments are provided for partially replicating endpoint routing information, and comprise calculating a first shard interval of a key space based, at least in part, on capacities of a plurality of spine nodes in a network fabric. Embodiments also include mapping the first shard interval to a first spine node of the plurality of spine nodes, communicating shard mapping information associated with the mapping to a set of leaf nodes in the network fabric, and populating an endpoint repository in the first spine node with routing information for one or more endpoints corresponding to the first shard interval. More specific embodiments include calculating respective shard intervals for other spine nodes of the plurality of spine nodes based, at least in part, on the capacities of the plurality of spine nodes. In specific embodiments, the calculating the first shard interval is based, in part, on one or more dynamic parameters.

Abstract: Embodiments are provided for partially replicating endpoint routing information, and comprise calculating a first shard interval of a key space based, at least in part, on capacities of a plurality of spine nodes in a network fabric. Embodiments also include mapping the first shard interval to a first spine node of the plurality of spine nodes, communicating shard mapping information associated with the mapping to a set of leaf nodes in the network fabric, and populating an endpoint repository in the first spine node with routing information for one or more endpoints corresponding to the first shard interval. More specific embodiments include calculating respective shard intervals for other spine nodes of the plurality of spine nodes based, at least in part, on the capacities of the plurality of spine nodes. In specific embodiments, the calculating the first shard interval is based, in part, on one or more dynamic parameters.

Abstract: Embodiments are provided for partially replicating endpoint routing information, and comprise calculating a first shard interval of a key space based, at least in part, on capacities of a plurality of spine nodes in a network fabric. Embodiments also include mapping the first shard interval to a first spine node of the plurality of spine nodes, communicating shard mapping information associated with the mapping to a set of leaf nodes in the network fabric, and populating an endpoint repository in the first spine node with routing information for one or more endpoints corresponding to the first shard interval. More specific embodiments include calculating respective shard intervals for other spine nodes of the plurality of spine nodes based, at least in part, on the capacities of the plurality of spine nodes. In specific embodiments, the calculating the first shard interval is based, in part, on one or more dynamic parameters.

Abstract: A first network device receives a first data packet from a registry device. The first data packet includes a destination of a first host coupled to the first network device and reachability information for a second host coupled to a second network device. The first network device stores the reachability information for the second host, which indicates that the second host is coupled to the second network device. The first network device transmits the first data packet without the reachability information to the first host. Using the reachability information for the second host, a tunnel is created from the first network device to the second network device.

Abstract: An example method for to inter-pod traffic redirection and handling in a multi-pod network environment is provided and includes receiving a packet with an overlay header outgoing from a first pod, identifying the packet as redirected based on a source address in the overlay header indicating a second pod and a destination address in the overlay header indicating a third pod, the first pod being distinct from the second pod and the third pod, setting a redirection bit in the overlay header tagging the packet as redirected, and transmitting the packet to the third pod.

Abstract: An example method for to multicast traffic distribution in a multi-pod network environment is provided and includes provisioning a block of multicast group addresses for broadcast, unknown unicast and multicast (BUM) traffic distribution between pods in the multi-pod network, calculating a hash corresponding to a bridge domain (BD) extending across a plurality of pods in the multi-pod network, the hash being identically calculated at each one of the plurality of pod, indexing with the hash into the block of multicast group addresses designated for inter-pod BUM traffic to derive a global multicast group identical for the broadcast domain across the plurality of pods, and associating a local multicast group at the translator with the derived global multicast group.

Abstract: Embodiments are provided for partially replicating endpoint routing information, and comprise calculating a first shard interval of a key space based, at least in part, on capacities of a plurality of spine nodes in a network fabric. Embodiments also include mapping the first shard interval to a first spine node of the plurality of spine nodes, communicating shard mapping information associated with the mapping to a set of leaf nodes in the network fabric, and populating an endpoint repository in the first spine node with routing information for one or more endpoints corresponding to the first shard interval. More specific embodiments include calculating respective shard intervals for other spine nodes of the plurality of spine nodes based, at least in part, on the capacities of the plurality of spine nodes. In specific embodiments, the calculating the first shard interval is based, in part, on one or more dynamic parameters.

Abstract: A first network device receives a first data packet from a registry device. The first data packet includes a destination of a first host coupled to the first network device and reachability information for a second host coupled to a second network device. The first network device stores the reachability information for the second host, which indicates that the second host is coupled to the second network device. The first network device transmits the first data packet without the reachability information to the first host. Using the reachability information for the second host, a tunnel is created from the first network device to the second network device.

Abstract: An example method for to multicast traffic distribution in a multi-pod network environment is provided and includes provisioning a block of multicast group addresses for broadcast, unknown unicast and multicast (BUM) traffic distribution between pods in the multi-pod network, calculating a hash corresponding to a bridge domain (BD) extending across a plurality of pods in the multi-pod network, the hash being identically calculated at each one of the plurality of pod, indexing with the hash into the block of multicast group addresses designated for inter-pod BUM traffic to derive a global multicast group identical for the broadcast domain across the plurality of pods, and associating a local multicast group at the translator with the derived global multicast group.

Abstract: An example method for to inter-pod traffic redirection and handling in a multi-pod network environment is provided and includes receiving a packet with an overlay header outgoing from a first pod, identifying the packet as redirected based on a source address in the overlay header indicating a second pod and a destination address in the overlay header indicating a third pod, the first pod being distinct from the second pod and the third pod, setting a redirection bit in the overlay header tagging the packet as redirected, and transmitting the packet to the third pod.