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 device in a network receives a time-slotted channel hopping (TSCH) communication schedule. The TSCH communication schedule is divided into a plurality of macrocells, each macrocell comprising a plurality of TSCH cells. The device receives a packet from a routing protocol child node of the device during a particular macrocell of the TSCH communication schedule that is associated with propagation of the packet through the network. In response to receiving the packet, the device claims a token associated with the particular macrocell that authorizes the device to transmit during one or more cells of the macrocell. The device transmits the received packet to a second node in the network during the authorized one or more cells of the particular macrocell.

Abstract: Systems, methods, and computer-readable storage media for multi-destination TCP communications using bit indexed explicit replication (BIER). In some examples, a system can generate a TCP packet associated with a TCP session involving a set of destination devices, and encode an array of bits into the TCP packet to yield a TCP multicast packet. The array of bits can define the destination devices as destinations for the multicast packet. The system can transmit the TCP multicast packet towards the destination devices through a BIER domain. The system can receive acknowledgements from a first subset of the destination devices. Based on the acknowledgements, the system can determine that the first subset of the destination devices received the multicast packet and a second subset of the destination devices did not receive the multicast packet. The system can then retransmit the multicast packet to the second subset of the destination devices.

Abstract: In one embodiment, a supervisory device in a network receives from a plurality of access points (APs) in the network data regarding a network availability request broadcast by a node seeking to access the network and received by the APs in the plurality. The supervisory device uniquely associates the node with a virtual access point (VAP) for the node and forms a VAP mapping between the VAP for the node and a set of the APs in the plurality selected based on the received data regarding the network availability request. One of the APs in the mapping is designated as a primary access point for the node. The supervisory device instructs the primary AP to send a network availability response to the node that includes information for the VAP. The node uses the information for the VAP to access the network via the set of APs in the VAP mapping.

Abstract: Various implementations disclosed herein enable transforming mutable wireless coverage areas using network coverage vehicles (NVCs) that are orchestrated by a network coverage controller. In various implementations, the method includes receiving coverage area performance characterization values from NCVs configured to provide a plurality of mutable wireless coverage areas. In various implementations, an arrangement of the mutable wireless coverage areas mutably defines the service area, which changes in accordance with changes to the arrangement of the mutable wireless coverage areas. In various implementations, the method also includes determining NCV operation adjustments for some of the NCVs based on the received coverage area performance characterization values in accordance with a service performance metric; and, altering an arrangement of one or more of the plurality of mutable wireless coverage areas within the service area by providing the NCV operation adjustments to some of the NCVs.

Abstract: A method comprises: obtaining, at an apparatus, first voice data from a first user device associated with a first speaker participant in a communication session; detecting voice data loss or degradation in the first voice data; determining whether prediction probability of correctly compensating for the voice data loss or degradation is greater than a predetermined probability threshold; if the prediction probability is greater than the predetermined probability threshold, first compensating for the voice data loss or degradation using historical voice data received by the apparatus prior to receiving of the first voice data, the first compensating producing first compensated voice data; if the prediction probability is not greater than the predetermined probability threshold, second compensating for the voice data loss or degradation by inserting noise to the first voice data to produce second compensated voice data; and outputting the first compensated voice data or the second compensated voice data.

Abstract: In one embodiment, a method comprises identifying, by an apparatus in a deterministic network, a multicast forwarding tree comprising a single multicast source as a root of the multicast forwarding tree, a plurality of terminal destination devices as respective leaves of the multicast forwarding trees, and forwarding network devices configured for forwarding a message, transmitted by the root, to the terminal destination devices; and causing, by the apparatus, the forwarding network devices to deliver the message to each of the terminal destination devices simultaneously at a same arrival time.

Abstract: In one embodiment, a server instructs one or more networking devices in a local area network (LAN) to form virtual network overlay in the LAN that redirects traffic associated with a particular node in the LAN to the server. The server receives the redirected traffic associated with the particular node. The server determines a node profile for the particular node based in part on an analysis of the redirected traffic. The server configures the particular node based on the determined node profile for the particular node.

Abstract: In one embodiment, a method includes receiving current data, the current data including time series data representing a plurality of time instances. The method includes storing at least a recent portion of the current data in a buffer. The method includes reducing the dimensionality of the current data to generate dimensionality-reduced data. The method includes generating a reconstruction error based on the dimensionality-reduced data and a plurality of neural network metrics. At least one of a size of the recent portion of the current data stored in the buffer or an amount of the reducing the dimensionality of the current data is based on the reconstruction error.

Abstract: In one embodiment, a method comprises: a first network device in a deterministic network identifying at least one of first and second deterministic transmit opportunities for transmission of a data packet toward a destination device along a deterministic path of the deterministic network, the first deterministic transmit opportunity reserved for the first network device deterministically receiving the data packet from a second network device and the second deterministic transmit opportunity reserved for deterministic transmission by the first network device of the data packet toward the destination device along the deterministic path; the first network device detecting an absence of receiving the data packet from the second network device according to the first deterministic transmit opportunity; and the first network device selectively generating and deterministically transmitting according to the second deterministic transmit opportunity, in response to the absence of receiving the data packet, a management

Abstract: In one embodiment, a method comprises: determining access point devices providing network coverage for a mobile network device within a prescribed coverage area of a deterministic network; establishing a deterministic reception tree comprising a root and switching devices associated with the access point devices, the deterministic reception tree enabling any one or more of the switching devices to forward toward the root a data packet, transmitted by the mobile network device at a prescribed transmission time, for deterministic reception by the root at a prescribed reception time regardless of any distance of any of the access point devices from the root; and causing the switching devices to implement the deterministic reception tree enabling the root to deterministically receive the data packet, received by any one or more of the access point devices, at the prescribed reception time.

Abstract: In one embodiment, a method comprises determining a movable network device is moving along a repeatable sequence of access point devices in a deterministic network; and establishing a deterministic track along the repeatable sequence of access point devices, the deterministic track comprising insertion slots allocated for insertion of a data packet, by the movable network device, into the deterministic track via any one of the respective access point devices.

Abstract: In one embodiment, a device in a network receives a query walker agent configured to query information from a distributed set of devices in the network based on a query. The device executes the query walker agent to identify the query. The device updates state information of the executing query walker agent using local information from the device and based on the query. The device unloads the executing query walker agent after updating the state information. The device propagates the query walker agent with the updated state information to one or more of the distributed set of devices in the network, when the updated state information does not fully answer the query.

Abstract: In one embodiment, a device in an anchorless network receives an update message from a first neighbor of the device. The update message indicates a movement of a node in the network to a new position in the network. The device updates a forwarding table of the device to reverse a link direction associated with the node, in response to receiving the update message. The device sends the update message to a second neighbor of the device towards a prior position of the node in the network.

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node; identifying, within the loop-free routing topology, non-congruent paths for a source network node to reach the destination node; and determining, from the non-congruent paths, a non-congruent path pair providing no more than a prescribed difference of latency from the source network node to the destination node, enabling the source network node to forward a data packet in a first direction of the one non-congruent path pair and a bicasted copy of the data packet in a second direction of the one non-congruent path pair, for reception of the data packet and the bicasted copy by the destination node within the prescribed difference of latency.

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 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 network receives metrics regarding a node in the network. The device uses the metrics as input to a machine learning model. The device determines, using the machine learning model and based on the metrics, an indication of abnormality of the node oscillating between using a plurality of different routing parents in the network. The device provides a results notification based on the indication of abnormality of the node oscillating between using the plurality of different routing parents.

Abstract: In one embodiment, a method comprises receiving, by a network device in a deterministic data network comprising deterministic segments, a data packet comprising a packet header having a bit index, each bit in the bit index associated with a corresponding one of the deterministic segments; the network device identifying, from the bit index, a first bit for a corresponding first deterministic segment and a second bit for a corresponding second deterministic segment, wherein the network device is an endpoint for transmitting deterministic traffic into each of the first and second deterministic segments; the network device selectively executing a replication operation of the data packet for transmission of a replicated data packet into each of the first and second deterministic segments, based on the network device detecting the corresponding first and second bits set for replication.

Abstract: Systems, methods, and computer-readable storage media for multi-destination TCP communications using bit indexed explicit replication (BIER). In some examples, a system can generate a TCP packet associated with a TCP session involving a set of destination devices, and encode an array of bits into the TCP packet to yield a TCP multicast packet. The array of bits can define the destination devices as destinations for the multicast packet. The system can transmit the TCP multicast packet towards the destination devices through a BIER domain. The system can receive acknowledgements from a first subset of the destination devices. Based on the acknowledgements, the system can determine that the first subset of the destination devices received the multicast packet and a second subset of the destination devices did not receive the multicast packet. The system can then retransmit the multicast packet to the second subset of the destination devices.