Abstract: In one embodiment, a method is performed. A spine node in communication with a network may determine a subtree of a shadow cone of the spine node. The subtree may comprise a plurality of nodes and a plurality of links connecting pairs of the nodes. The spine node may determine a disaggregated route to a first leaf node to which a disaggregated prefix may be attached. The disaggregated route may be propagated to the plurality of the nodes of the subtree.

Abstract: In one embodiment, a device receives data indicative of packet arrival times at a plurality of nodes along a path in a deterministic network. The device compares the packet arrival times to their corresponding scheduled delivery intervals in a deterministic communication schedule used by the nodes along the path. The device detects, using a machine learning-based anomaly detector, a time synchronization anomaly based on the comparisons between the packet arrival times and their scheduled delivery intervals. The device causes performance of a mitigation action in the network based on the detected time synchronization anomaly.

Abstract: A network device receives a data packet sourced from a root of a tree-based topology and including a data structure identifying transmitted data packets transmitted by the root; in response to determining one or more absent transmitted data packets based on the data structure, the network device starts a deferred transmission timer requiring the network device to wait a first half of a selected minimum contention interval before attempting transmission to a parent at a randomized position within a second half of the selected minimum contention interval, the selected minimum contention interval based on the distance to the root and at least twice that of the parent; the network device selectively transmits a control message to the parent to request the absent transmitted data packets only if, upon reaching the corresponding randomized position of the deferred transmission timer, the network device has not received the absent transmitted data packets.

Abstract: In one embodiment, a supervisory device in a network assigns different access points in the network to different access point groupings. Each of the different access point groupings uses a different network path to communicate with a given endpoint in the network. The supervisory device selects at least one of the access points in each of the different access point groupings for mapping to a virtual access point (VAP) for a node in the network as part of a VAP mapping. The supervisory device instructs the selected access points to form a VAP for the node. The node treats the access points in the VAP mapping as a single access point for purposes of communicating with the network.

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 system for collision avoidance includes memory storing instructions which, when executed, cause one or more processors to perform determining a direction of flight of a first drone, causing broadcasting, in the direction of flight based, a beamformed signal of beacon frames, determining a new flight direction of the same first drone, in response to the new flight direction, causing broadcasting of the beacon frames in the new flight direction, detecting second beacon frames from a second drone associated with a direction from which the second beacon frames are arriving; in response, causing the first drone to perform, without input from a pilot, one or more of a change in elevation, heading, speed, or type of operation, directed toward causing the first drone to follow a flight path that is separated from the second drone.

Abstract: These techniques introduce various “walker” agents that may physically move between different executing nodes/devices within the network. More specifically, 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 receives data indicative of a routing topology of a network. The network includes a root node and each node in the network has an associated network depth relative to the root. The device selects a first subset of timeslots from a slotframe of a communication schedule based on the network depth of a particular node in the network. The device selects a second subset of timeslots from the first subset, based on a media access control (MAC) address of the particular node. The device assigns the second subset of timeslots to the particular node for reception in the slotframe of the communication schedule. The device sends the communication schedule to one or more nodes in the network.

Abstract: In one embodiment, a device receives data indicative of a routing topology of a network. The network comprises a root node and each node in the network has an associated network depth relative to the root node in the routing topology. The device assigns the nodes in the network to timeslots of a channel-hopping communication schedule in order of their associated network depths. The device assigns transmit and receive actions to the timeslots of the communication schedule for a particular time such that parent-to-child and child-to-parent communications alternate with network depth in the timeslots. The device sends the communication schedule with the node and action assignments to one or more of the nodes in the network.

Abstract: In one embodiment, a method comprises: detecting, by a transport layer executed by a processor circuit in an apparatus, a request message received via a non-deterministic data link from one of a plurality of deterministic network interface circuits, the request message for a transport layer packet having been stored in a buffer circuit storing a plurality of transport layer packets in the apparatus, the deterministic network interface circuits providing respective deterministic links for deterministic transmission of the transport layer packets in a deterministic data network, the request message specifying a first number identifying any missed transmission opportunities on the corresponding deterministic link; determining, by the transport layer, a cause of failure in one or more of the missed transmission opportunities; and selectively executing, by the transport layer based on determining the cause of failure, a corrective action for preventing an increase in latency of the transport layer packets.

Abstract: In one embodiment, a method comprises detecting, by a network device, an endpoint device attempting to access a data network via a data link; and generating, by the network device, a unique device signature for identifying the endpoint device based on the network device identifying a sequence of link layer data packets transmitted by the endpoint device upon connection to the data link, the unique device signature identifying a behavior of the endpoint device independent of any link layer address used by the endpoint device.

Abstract: A particular fat tree network node stores default routing information indicating that the particular fat tree network node can reach a plurality of parent fat tree network nodes of the particular fat tree network node. The particular fat tree network node obtains, from a first parent fat tree network node of the plurality of parent fat tree network nodes, a negative disaggregation advertisement indicating that the first parent fat tree network node cannot reach a specific destination. The particular fat tree network node determines whether the first parent fat tree network node is the only parent fat tree network node of the plurality of parent fat tree network nodes that cannot reach the specific destination. If so, the particular fat tree network node installs supplemental routing information indicating that every parent fat tree network node except the first parent fat tree network node can reach the specific destination.

Abstract: In one embodiment, a method comprises: receiving, by a switching device, one or more identified flows of data packets from first deterministic flows of a first deterministic segment in a first deterministic domain, the first deterministic segment established based on first deterministic attributes in the first deterministic domain; receiving, by the switching device, second deterministic attributes about second deterministic flows for a second deterministic segment in a second different deterministic domain, the second deterministic attributes different than the first deterministic attributes; and allocating, by the switching device based on the first deterministic attributes and the second deterministic attributes, at least a portion of the second deterministic flows for deterministic stitching of the one or more identified flows of data packets from the first deterministic segment in the first deterministic domain into the second deterministic segment in the second deterministic domain according to a guaran

Abstract: In one embodiment, a method comprises establishing, by a deterministic device interface circuit, a deterministic link with a peer deterministic interface circuit within a deterministic data network based on identifying a repeating deterministic schedule for transmitting each data packet, allocated to the deterministic schedule, at a corresponding transmission instance coinciding with a reception instance by the peer deterministic interface circuit; determining a latency between sending a request for data to a host device via a non-deterministic data link provided by a network switch, and receiving from the host device a transport layer packet responsive to the request; and sending an instruction to the host device for initiating transfer of the transport layer packet, the instruction correcting for the latency and enabling the deterministic device interface circuit to receive the transport layer packet for transmission of a corresponding data packet on the deterministic link at the corresponding transmission

Abstract: In one embodiment, a supervisory device in a network forms a first virtual access point (VAP) for a first node in the network. A plurality of access points (APs) in the network are mapped to the first VAP as part of a VAP mapping and the first node treats the APs in the VAP mapping as a single AP for purposes of communicating with the network. The supervisory device determines a communication schedule for the first node based on a radio chain of at least one of the APs in the VAP mapping for the first VAP being shared by the first VAP and a second VAP for a second node in the network. The supervisory device, according to the communication schedule for the first node, causes one or more of the APs in the VAP mapping for the first VAP to instruct the first node to stop transmitting for a period of time.

Abstract: Embodiments include technologies for creating a manifest for a conferencing event in a network, adding a name tag identifying the conferencing event to the manifest, receiving an interest packet including one or more parameters indicating a named flow being produced at a source node, adding content metadata of the named flow to the manifest, and sending the manifest to the source node. Further embodiments include adding, to the manifest, session-level metadata associated with a user of the source node. Embodiments include receiving a second interest packet with one or more second parameters identifying a user of a client node, where the second interest packet indicates a request to authorize the user of the client node to subscribe to the conferencing event. In further embodiments, session-level metadata associated with the user is added to the manifest if the user is authorized to subscribe to the conferencing event.

Abstract: In one embodiment, a processor receives observed node characteristics of a node in a network. The node characteristics include a link cost metric for a network link associated with the node. The processor uses a Bayesian learning model to estimate a virtual link cost metric based on the observed node characteristics. The model uses statistics regarding the observed link cost metric as background belief measures. The processor forms a routing path in the network that includes the network link in part based on an objective function that uses the virtual link cost metric as a parameter.

Abstract: In one embodiment, a method comprises: a network device, having attached to a first parent device in a tree-based network topology, attaching to a second parent device advertising better network performance than the first parent device; and the network device detaching from the second parent device, and reattaching to the first parent device, in response to the network device determining the corresponding network performance via the second parent device is worse than any one of the advertised better network performance, the corresponding network performance via the first parent device, or an expected network performance via the second network device.

Abstract: In one embodiment, a splitting device in a computer network transmits to a combining device first and second portions of a data stream via first and second tunnels, respectively, where packets of the data stream indicate a time of transmission of the packets from the splitting device, a first and second transmission rate of the packets on a respective one of the first and second tunnels, and sequencing information of the packets within the data stream. The splitting device receives from the combining device a first and second receive rate of the packets for each of the first and second tunnels, respectively. In response to the first receive rate being less than the first transmission rate, the splitting device reduces the first transmission rate and increases the second transmission rate.

Abstract: In one embodiment, an elimination point device in a network obtains a master secret from a network controller. The elimination point device assesses, using the master secret, whether an incoming packet received by the elimination point device from a redundant path between the elimination point device and a replication point device in the network includes a valid message integrity check (MIC). The elimination point device determines whether the incoming packet was injected maliciously into the redundant path, based on the assessment of the incoming packet. The elimination point device initiates performance of a mitigation action in the network, when the elimination point device determines that the incoming packet was injected maliciously into the redundant path.