Abstract:
In one embodiment, a method comprises receiving, by a network device, a data packet specifying alarm data generated by a sensor node; and outputting, by the network device, the data packet at an alarm level priority that is higher than any network-level priority of any wireless routing topology.
Abstract:
In one embodiment, a method comprises: detecting, by a wireless mirror device in a wireless data network, link layer transmission of a wireless data unit between a wireless access point (AP) device and a wireless client device on a first allocated frequency channel at a first transmission interval; and transmitting, by the wireless mirror device based on detecting the link layer transmission, the wireless data unit at a second transmission interval on a second allocated frequency channel that is allocated to the wireless mirror device for a mirror transmission between the wireless AP device and the wireless client device at the second transmission interval.
Abstract:
In one embodiment, a method comprises: receiving, by a constrained wireless network device comprising a local clock, a plurality of messages from respective neighboring wireless network devices advertising as available parent devices in a directed acyclic graph of a time-synchronized network that is synchronized to a master clock device; determining, by the constrained wireless network device, a corresponding timing error of the local clock relative to each message output by the corresponding available parent device; and executing, by the constrained wireless network device, a distributed time synchronization of the local clock with the master clock device based on correlating the respective timing errors relative to the local clock.
Abstract:
In one embodiment, a method comprises: determining, by a constrained network device in a low power and lossy network (LLN), a self-estimated density value of neighboring LLN devices based on wirelessly receiving an identified number of beacon message transmissions within an identified time interval from neighboring transmitting LLN devices in the LLN; setting, by the constrained network device, a first wireless transmit power value based on the self-estimated density value; and transmitting a beacon message at the first wireless transmit power value, the beacon message specifying the self-estimated density value, a corresponding trust metric for the self-estimated density value, and the first wireless transmit power value used by the constrained network device for transmitting the beacon message.
Abstract:
In one embodiment, a method comprises: receiving, by a parent network device providing at least a portion of a directed acyclic graph (DAG) according to a prescribed routing protocol in a low power and lossy network, a destination advertisement object (DAO) message, the DAO message specifying a target Internet Protocol (IP) address claimed by an advertising network device in the DAG and the DAO message further specifying a secure token associated with the target IP address; and selectively issuing a cryptographic challenge to the DAO message to validate whether the advertising network device generated the secure token.
Abstract:
In one embodiment, a method comprises: identifying, by a low power and lossy network (LLN) device in a low power and lossy network, a minimum distance value and a distance limit value for limiting multicast propagation, initiated at the LLN device, of a multicast data message in the LLN; and multicast transmitting, by the LLN device, the multicast data message with a current distance field specifying the minimum distance value and a distance limit field specifying the distance limit value, the multicast transmitting causing a receiving LLN device having a corresponding rank in the LLN to respond to the multicast data message by: (1) determining an updated distance based on adding to the current distance field a rank difference between the receiving LLN device and the LLN device, and (2) selectively retransmitting the multicast data message if the updated distance is less than the distance limit value.
Abstract:
In one embodiment, a method comprises: receiving, by a constrained wireless network device comprising a local clock, a plurality of messages from respective neighboring wireless network devices advertising as available parent devices in a directed acyclic graph of a time-synchronized network that is synchronized to a master clock device; determining, by the constrained wireless network device, a corresponding timing error of the local clock relative to each message output by the corresponding available parent device; and executing, by the constrained wireless network device, a distributed time synchronization of the local clock with the master clock device based on correlating the respective timing errors relative to the local clock.
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.
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.
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.