SCALABLE REACHABILITY FOR MOVABLE DESTINATIONS ATTACHED TO A LEAF-SPINE SWITCHING ARCHITECTURE

    公开(公告)号:US20200322838A1

    公开(公告)日:2020-10-08

    申请号:US16372744

    申请日:2019-04-02

    Abstract: In one embodiment, a method comprises: determining, by a network switching device, whether the network switching device is configured as one of multiple leaf network switching devices, one of multiple Top-of-Fabric (ToF) switching devices, or one of multiple intermediate switching devices in a switched data network having a leaf-spine switching architecture; if configured as a leaf switching device, limiting flooding of an advertisement only to a subset of the intermediate switching devices in response to detecting a mobile destination is reachable; if configured as an intermediate switching device, flooding the advertisement, received from any one of the leaf network switching devices, to connected ToF switching devices without installing any routing information specified within the advertisement; if configured as a ToF switching device, installing from the flooded advertisement the routing information and tunneling a data packet, destined for the mobile destination, to the leaf switching device having transmitted the advertisement.

    REDUNDANT MULTICAST TREE IN A FAT TREE NETWORK TOPOLOGY

    公开(公告)号:US20200259678A1

    公开(公告)日:2020-08-13

    申请号:US16585839

    申请日:2019-09-27

    Abstract: In one embodiment, a method comprises identifying within a network topology, by an apparatus, a plurality of network devices; and establishing by the apparatus, a multiple tree topology comprising a first multicast tree and a second multicast tree, the first and second multicast trees operable as redundant trees for multicast traffic in the network topology, the establishing including: allocating a first of the network devices as a corresponding root of the first multicast tree, allocating a first group of intermediate devices from the network devices as first forwarding devices in the first multicast tree, allocating a second group of intermediate devices as belonging to first leaf devices in the first multicast tree, and allocating terminal devices of the network devices as belonging to the first leaf devices, and allocating a second of the network devices as the corresponding root of the second multicast tree, allocating the second group of intermediate devices as second forwarding devices in the second multicast tree, allocating the first group of intermediate devices as belonging to second leaf devices in the second multicast tree, and allocating the terminal devices as belonging to the second leaf devices.

    GENERATING TRUSTABLE RPL MESSAGES HAVING ROOT-SIGNED RANK VALUES

    公开(公告)号:US20200186362A1

    公开(公告)日:2020-06-11

    申请号:US16685058

    申请日:2019-11-15

    Abstract: In one embodiment, a method comprises: identifying, by a root network device of a directed acyclic graph (DAG) in a low power and lossy network, a child network device in the DAG, including identifying a first rank associated with the child network device; allocating, by the root network device, an allocated rank for the child network device, the allocated rank different from the first rank; and outputting, by the root network device, a message to the child network device specifying the allocated rank, the message causing the child network device to implement the allocated rank in the DAG, including causing the child network device to generate and output a Destination Oriented Directed Acyclic Graph (DODAG) information object (DIO) message specifying the child network device is using the allocated rank.

    FAST AND LOSS-FREE LOCAL RECOVERY BY A RPL PARENT DEVICE

    公开(公告)号:US20200053006A1

    公开(公告)日:2020-02-13

    申请号:US16657179

    申请日:2019-10-18

    Abstract: In one embodiment, a network device (e.g., a RPL router) executes fast local RPL recovery in a low power and lossy network (LLN). The network device, in response to becoming an orphan in a directed acyclic graph (DAG) topology, can utilize the data plane to maintain at least some data traffic by randomly forwarding the data traffic to identified neighbor devices, while eliminating children from the list of forwarders and by finding successors that can be used for re-parenting. Hence, when a RPL network device having lost its last feasible parent can avoid data loss and accelerate a re-parenting process using local repair in the data plane instead of the control plane of the routing protocol used to establish the DAG topology.

    FAST AND LOSS-FREE LOCAL RECOVERY BY A RPL PARENT DEVICE

    公开(公告)号:US20190081892A1

    公开(公告)日:2019-03-14

    申请号:US15922177

    申请日:2018-03-15

    Abstract: In one embodiment, a network device (e.g., a RPL router) executes fast local RPL recovery in a low power and lossy network (LLN). The network device, in response to becoming an orphan in a directed acyclic graph (DAG) topology, can utilize the data plane to maintain at least some data traffic by randomly forwarding the data traffic to identified neighbor devices, while eliminating children from the list of forwarders and by finding successors that can be used for re-parenting. Hence, when a RPL network device having lost its last feasible parent can avoid data loss and accelerate a re-parenting process using local repair in the data plane instead of the control plane of the routing protocol used to establish the DAG topology.

Patent Agency Ranking