Abstract: In one embodiment, a device in a network sends Bidirectional Forwarding Detection (BFD) probes along a network tunnel associated with the device, to collect telemetry regarding the network tunnel. The device monitors an overhead associated with sending the BFD probes along the network tunnel. The device makes a determination that the overhead associated with sending the BFD probes along the network tunnel is unacceptable. The device switches, based on the determination, from sending BFD probes along the network tunnel to modifying data traffic sent via the network tunnel, to collect telemetry regarding the network tunnel.

Abstract: In one embodiment, a method comprises: receiving, by a transport layer executed by a processor circuit in an apparatus, a flow of application data having been originated by an executable application; storing, by the transport layer, the application data as transport layer packets in a buffer circuit in the apparatus, each transport layer packet having a corresponding transport sequence identifier identifying a corresponding position of the transport layer packet relative to a transmit order of the transport layer packets; and causing, by the transport layer, a plurality of deterministic network interface circuits to deterministically retrieve the transport layer packets, in the transmit order, from the buffer circuit for deterministic transmission across respective deterministic links, the transport sequence identifiers enabling a destination transport layer to recover the transmit order of the transport layer following the deterministic transmission across the deterministic links, regardless of order of rece

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 trans

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 device in a network sends Bidirectional Forwarding Detection (BFD) probes along a network tunnel associated with the device, to collect telemetry regarding the network tunnel. The device monitors an overhead associated with sending the BFD probes along the network tunnel. The device makes a determination that the overhead associated with sending the BFD probes along the network tunnel is unacceptable. The device switches, based on the determination, from sending BFD probes along the network tunnel to modifying data traffic sent via the network tunnel, to collect telemetry regarding the network tunnel.

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 device configures a plurality of subinterfaces for each of a plurality of physical ports of a software defined network (SDN). The device allocates a fixed amount of bandwidth to each of the subinterfaces. The device forms a plurality of midlays for the SDN by assigning subsets of the plurality of subinterfaces to each of the midlays. The device assigns a network slice to one or more of the midlays, based on a bandwidth requirement of the network slice.

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.

Abstract: In one embodiment, a method comprises: receiving, by a switching device in a deterministic network, a first data packet associated with an identified flow of data packets, and queuing the first data packet for deterministic transmission at a deterministic transmit instance to a next-hop device in the deterministic network; detecting, by the switching device, reception of a newest data packet associated with the identified flow and before the deterministic transmission of the first data packet; and prioritizing for the identified flow, by the switching device, the newest data packet based on deterministically transmitting, at the deterministic transmit instance, the newest data packet instead of the first data packet.

Abstract: In one embodiment, a supervisory device in a network receives a help request from a first node in the network indicative of a problem in the network detected by the first node. The supervisory device identifies a second node in the network that is hosting a repair walker agent able to address the detected problem. The supervisory device determines a network path via which the second node is to send repair walker agent to the first node. The supervisory device instructs the second node to send the repair walker agent to the first node via the determined path.

Abstract: In one embodiment, a service receives a feature availability report indicative of which telemetry variables are available at a device in a network and resource costs associated with data features that the device could compute from the telemetry variables. The service selects at least a subset of the data features for input to a machine learning model, based on their associated resource costs and on their respective impacts on one or more performance metrics for the machine learning model. The service trains the machine learning model to evaluate the selected data features. The service sends the trained machine learning model to the device. The device computes the selected data features from the telemetry variables available at the device and uses the computed data features as input to the machine learning model.

Abstract: In one embodiment, a device in a network receives a path computation agent configured to determine a path in the network that satisfies an objective function. The device executes the path computation agent to update state information regarding the network maintained by the path computation agent. The device selects a neighbor of the device in the network to execute the path computation agent based on the updated state information regarding the network. The device instructs the selected neighbor to execute the path computation agent with the updated state information regarding the network. The device unloads the path computation agent from the device after selecting the neighbor of the device to execute the path computation agent.

Abstract: In one embodiment, a device in a mesh network joins a source-destination oriented partial directed acyclic graph (SDO-PDAG) between a source node and a destination node in the network. The device receives operations, administration and maintenance (OAM) packets flooded along reverse paths of the SDO-PDAG. The device determines, based on the received OAM packets, packet drop rate (PDR) capacities of different paths between the device and the destination node. The device replicates a data packet sent from the source node to the destination node along two or more of the paths between the device and the destination node, based on the determined PDR capacities of those paths.

Abstract: In one embodiment, a method comprises: detecting, by a constrained network device in a low power and lossy network, a loss of synchronization with a neighboring network device based on a determined absence of a prescribed transmission activity by the neighboring network device within a prescribed listening interval that is limited to a prescribed guard time according to a wireless time-slotted transmission protocol; and executing, by the constrained network device, localized sync recovery based on shifting a next listening interval to a shifted listening interval based on selectively shifting, based on a selected shift amount, the prescribed guard time of a corresponding next instance of the prescribed listening interval, enabling the constrained network device to recover synchronization with the neighboring network device based on detecting the prescribed transmission activity that is outside the prescribed listening interval and within the shifted listening interval.

Abstract: In one embodiment, a parent device in an unaligned wireless network may determine a superframe comprising a header timeslot followed by a plurality of sub timeslots. The parent device may transmit, to a plurality of child devices in the unaligned wireless network, a beacon during the header timeslot, wherein the beacon comprises i) synchronization information used by the plurality of child devices to synchronize to the header timeslot and ii) reservation information that indicates one or more reserved sub timeslots of the plurality of sub timeslots. The parent device may receive, from a particular child device of the plurality of child devices, a message during a particular sub timeslot of the plurality of sub timeslots that is different than the one or more reserved sub timeslots.

Abstract: The aspects ensure redundancy by including at least two access points (APs), in an environment, that are capable of serving at least one station (STA). A first AP functions as a primary AP and a second AP functions as a secondary AP. The primary AP can send a layer 2 (L2) control message, for example, a Target Wait Time (TWT) response, to a STA. The primary AP may then wait for an indication (e.g., an Acknowledgement (ACK) signal) of receipt of the L2 control message. The primary AP can also provide the L2 control message to the secondary AP that covers the same room. In at least some configurations, the L2 control message includes metadata about when the secondary AP is to send the copy of the L2 control message over the air. The secondary AP can then relay the L2 control message to the STA.

Abstract: In one embodiment, a tracking device detects a first device connecting to a computer network, and forces an install of fake routing information on the first device that is unique to the first device. Upon detecting a second device connecting to the computer network, the second device having at least one identifying property in common with the first device and at least one identifying property differing from the first device, the tracking device may then query the second device to determine if the second device knows the fake routing information unique to the first device. As such, the tracking device may then determine that the second device is the first device in response to the second device knowing the fake routing information unique to the first device.

Abstract: Disclosed are systems, methods, and computer-readable media for integrating deterministic packet transmissions scheduling of short range local area networks (e.g., 6TiSCH networks) with deterministic packet transmission scheduling for wireless networks such as LTE/4G/5G networks. In one aspect, a wireless communication network includes a plurality of first nodes configured to communicate using a first communication protocol; and a second node configured to communicate with the plurality of first nodes using the first communication protocol and configured to communicate with a third node using a second communication protocol, the second node being further configured to map corresponding transmission schedule of the first communication protocol to a second transmission schedule for the second communication protocol.

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: receiving, by a switching device in a deterministic network, a first data packet associated with an identified flow of data packets, and queuing the first data packet for deterministic transmission at a deterministic transmit instance to a next-hop device in the deterministic network; detecting, by the switching device, reception of a newest data packet associated with the identified flow and before the deterministic transmission of the first data packet; and prioritizing for the identified flow, by the switching device, the newest data packet based on deterministically transmitting, at the deterministic transmit instance, the newest data packet instead of the first data packet.