Abstract:
Systems, methods and transitory computer-readable storage media for constructing a loop free multicast tree. The methods include observing a network topology transition affecting a first path from the particular node to a root node, calculating a second path from the particular node to the root node and sending a message to an upstream node requesting that the upstream node be a root port in the calculated second path. If the upstream node agrees to be the root port in the calculated second path, the method further includes creating a new FTAG tree topology view that includes the upstream node as the root port in the second path.
Abstract:
Systems, methods, and non-transitory computer-readable storage media for a miscabling detection protocol. One or more switches can periodically send miscabling protocol (MCP) packets on non-fabric ports on all configured EPG VLANs. A first switch located at a network fabric receives a miscabling protocol (MCP) packet indicating an identity of an originating switch and a port number of an originating port of the MCP packet via a receiving port on the first switch, wherein the MCP packet is received from an external network connected to the receiving port, and wherein the originating switch and originating port are also located at the network fabric and connected to the external network. Based on the MCP packet, the first switch then detects a loop between the receiving port, the originating port, and the external network. Next, the first switch blocks the receiving port or the originating port in response to detecting the loop.
Abstract:
Systems, methods and non-transitory computer-readable storage media for determining interconnectivity in dense networks. The method includes generating, at a first network device in a data network, a traceroute packet that includes source and destination address information. The packet is encapsulated in an outer packet, and the encapsulated packet is forwarded to a second network device and to one or more intermediate network devices in the data network. A response packet is received from the second network device and each of the intermediate network devices that received the traceroute packet. The first network device determines, based on the responsive packets, an end-to-end path taken by the traceroute packet through the data network.
Abstract:
Systems, methods, and non-transitory computer-readable storage media for dynamic addressing of virtual port channels is described. In some implementations, a virtual IP address can be dynamically generated based on which links in a virtual port channel are active. If the numbers of active links in the virtual port channel changes, the virtual IP address can be dynamically changed. The virtual IP address can be dynamically adjusted by changing the values of individual bits in the virtual IP address that correspond to links in the virtual port channel. The virtual IP address can be used as a tunnel end point address in a VXLAN environment.
Abstract:
Systems, methods, and non-transitory computer-readable storage media for stage upgrades in a network. The system generates graph-data structured based representations of devices in the network, wherein respective attributes of the representations is selected based on respective services provided by the devices to tenants in the network and identities of respective tenants serviced by the devices. Next, the system generates a graph showing a distribution of the devices in the network according to the representations, wherein the representations are interconnected in the graph based on service roles of associated devices with respect to tenants in the network and other devices associated with the tenants. The system then schedules an upgrade of devices based on the graph, the upgrade being scheduled in stages, each stage including devices selected for upgrade in that stage, wherein the devices for each stage are selected by identifying devices having respective representations assigned to that specific stage.
Abstract:
Systems, methods, and non-transitory computer-readable storage media for dynamic host configuration protocol (DHCP) relay functionality in overlay networks. A system on a overlay network fabric can first receive a DHCP request from a host device, the system including a tunnel endpoint (TEP) configured to connect the host device to the overlay network fabric via a tunnel. The system then enables a relay agent information option for relaying the DHCP request with sub-options inserted into the DHCP request, and inserts information into to the sub-options in the DHCP request to yield a modified DHCP request. Here, the information can include an address of the system and an interface of a circuit associated with the system, etc. Next, the system forwards the modified DHCP request to a destination DHCP server based on an address of the destination DHCP server associated with the DHCP request.
Abstract:
Systems, methods and transitory computer-readable storage media for detecting one or more loops in a multicast tree. The method includes calculating a multicast tree radius for a first multicast tree, the multicast tree radius representing a maximum number of hops from a root node to a furthest edge node in the first multicast tree, forwarding, by the root node, a first packet to each edge node within the first multicast tree, the first packet having a time-to-live (TTL) value equal to twice the first multicast tree radius, receiving, at the root node, a copy of the forwarded first packet, and determining an existence of a loop in the first multicast tree based at least upon receiving the copy of the forwarded first packet.
Abstract:
Systems, methods, and non-transitory computer-readable storage media for stage upgrades in a network. The system generates graph-data structured based representations of devices in the network, wherein respective attributes of the representations is selected based on respective services provided by the devices to tenants in the network and identities of respective tenants serviced by the devices. Next, the system generates a graph showing a distribution of the devices in the network according to the representations, wherein the representations are interconnected in the graph based on service roles of associated devices with respect to tenants in the network and other devices associated with the tenants. The system then schedules an upgrade of devices based on the graph, the upgrade being scheduled in stages, each stage including devices selected for upgrade in that stage, wherein the devices for each stage are selected by identifying devices having respective representations assigned to that specific stage.
Abstract:
Systems, methods, and non-transitory computer-readable storage media for recovering from a partial failure of a virtual port chain (vPC) domain. The first and second vPC peers may be paired to create a vPC having a virtual address. An endpoint host may communicate with a network via the virtual port channel. The system may detect that the first virtual port channel peer is down. During or after the first vPC reboots, the reachability cost for the first vPC with regards to the virtual address can be set to an inflated value. The first vPC peer may also delay its bring up time while it synchronizes its vPC state information with the second vPC peer. The second vPC can continue to advertise the association between the endpoint host and the virtual address. Upon completion of the synchronization, the first vPC peer may bring up the link and restore the reachability cost.
Abstract:
Systems, methods, and non-transitory computer-readable storage media for recovering from a partial failure of a virtual port chain (vPC) domain. The first and second vPC peers may be paired to create a vPC having a virtual address. An endpoint host may communicate with a network via the virtual port channel. The system may detect that the first virtual port channel peer is down. During or after the first vPC reboots, the reachability cost for the first vPC with regards to the virtual address can be set to an inflated value. The first vPC peer may also delay its bring up time while it synchronizes its vPC state information with the second vPC peer. The second vPC can continue to advertise the association between the endpoint host and the virtual address. Upon completion of the synchronization, the first vPC peer may bring up the link and restore the reachability cost.