Abstract: In one embodiment, a method comprises: receiving, by a parent network device providing at least at 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 in a network identifies a node in the network that is not synchronized to a network time synchronization mechanism. The device determines a scheduled reception time for a particular deterministic traffic flow at which the device is to receive the traffic flow from the node. The device sends, prior to the scheduled reception time, a request to the node for the particular deterministic traffic flow. The request identifies the particular deterministic traffic flow and causes the node to send the traffic flow to the device. The device receives the particular deterministic traffic flow from the node at the scheduled reception time.

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 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: In one embodiment, a method comprises generating a switched link layer topology from a source device to a destination device, the switched link layer topology comprising a first sequence of switching devices, a second sequence of switching devices, and one or more bridging links between the first and second sequences of switching devices; generating first and second chains of resilient link layer segments for respective first and second multi-hop link layer connections based on generating a sequence of link layer loops overlying the switched link layer topology, and setting for each of the first and second multi-hop link layer connections a corresponding set of connection blocks in each link layer loop; and causing replication of a data packet across the first and second multi-hop link layer connections, enabling a failure in the switched link layer topology to be bypassed based on removing at least one of the connection blocks.

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 multicast listener device floods a path lookup request to search for a multicast tree, and may then receive path lookup responses from candidate nodes on the multicast tree, where each of the path lookup responses indicates a unicast routing cost from a respective candidate node to the multicast listener device, and where each of the candidate nodes is configured to suppress a path lookup response if a total path latency from a source of the multicast tree to the multicast listener device via that respective candidate node is greater than a maximum allowable path latency. The multicast listener device may then select a particular candidate node as a join point for the multicast tree based on the particular node having a lowest associated unicast routing cost to the multicast listener device from among the candidate nodes, and joins the multicast tree at the selected join point.

Abstract: Networking device serviceability may be provided. A networking device may be disposed in a rack between uprights. The networking device may comprise a first plurality of switch bars each comprising a first switch type arranged parallel to one another, a second plurality of switch bars each comprising a second switch type arranged parallel to one another, and a third plurality of switch bars each comprising a third switch type arranged parallel to one another. The first plurality of switch bars, the second plurality of switch bars, and the third plurality of switch bars may be arranged orthogonally. A hinge device associated with the networking device may be configured to allow the networking device to rotate at least a predetermined angle value from a first position between the uprights to a second position where both the first plurality of switch bars and the second plurality of switch bars are clear from the uprights.

Abstract: Connectors for a networking device may be provided. A networking device may comprise a first plurality of switch bars each comprising a first switch type arranged parallel to one another, a second plurality of switch bars each comprising a second switch type arranged parallel to one another, and a third plurality of switch bars each comprising a third switch type arranged parallel to one another. The first plurality of switch bars, the second plurality of switch bars, and the third plurality of switch bars may be arranged orthogonally. A first one of the first plurality of switch bars may be connected to a first one of the second plurality of switch bars via a retractable mechanical connector mechanism.

Abstract: A cooling system for a networking device may be provided. The networking device may comprise a first plurality of switch bars each comprising a first switch type arranged parallel to one another, a second plurality of switch bars each comprising a second switch type arranged parallel to one another, and a third plurality of switch bars each comprising a third switch type arranged parallel to one another. The first plurality of switch bars, the second plurality of switch bars, and the third plurality of switch bars may be arranged orthogonally. A plurality of cooling passages may be configured to supply a coolant to the apparatus and to exhaust the coolant from the apparatus. The coolant may pass through the first plurality of switch bars, the second plurality of switch bars, and the third plurality of switch bars.

Abstract: A networking device with orthogonal switch bars may be provided. The networking device may comprise a first plurality of switch bars comprising leaf switches arranged parallel to one another. In addition, the networking device may comprise a second plurality of switch bars comprising top of pod switches arranged parallel to one another. Furthermore, the networking device may comprise a third plurality of switch bars comprising top of fabric switches arranged parallel to one another. The first plurality of switch bars, the second plurality of switch bars, and the third plurality of switch bars may be arranged mutually orthogonally. The first plurality of switch bars may be adjacent to and connected to the second plurality of switch bars and the second plurality of switch bars may be adjacent to and connected to the third plurality of switch bars.

Abstract: Power supply for a networking device may be provided. The networking device may comprise a first plurality of switch bars each comprising a first switch type arranged parallel to one another and a second plurality of switch bars each comprising a second switch type arranged parallel to one another. The first plurality of switch bars and the second plurality of switch bars may be arranged orthogonally. A first plurality of power supplies may be fed by a first source. A second plurality of power supplies may be fed by a second source. Respective ones of a first portion of the first plurality of power supplies feed first respective pairs of the first plurality of switch bars and respective ones of a first portion of the second plurality of power supplies feed second respective pairs of the first plurality of switch bars. The first respective pairs of the first plurality of switch bars may be different from the second respective pairs of the first plurality of switch bars.

Abstract: A source access network device multicasts copies of a packet to multiple core switches, for switching to a same target access network device. The core switches are selected for the multicast based on a load balancing algorithm managed by a central controller. The target access network device receives at least one of the copies of the packet and generates at least metric indicative of a level of traffic congestion at the core switches and feeds back information regarding the recorded at least one metric to the controller. The controller adjusts the load balancing algorithm based on the fed back information for selection of core switches for a subsequent data flow.

Abstract: Techniques for providing a non-blocking fabric in a network are described. A network controller determines the network requirement for various network traffic types on the network and determines the allocation of resources across the network needed to establish a midlay, including midlay components on the network. The network controller then establishes the midlay on the network according to the determined allocation. At least one of the midlay components is a virtually non-blocking fabric for high-priority traffic or fully non-blocking fabric for deterministic traffic.

Abstract: In one embodiment, a supervisory device in a network forms a virtual access point (VAP) for a node in the network. A set of access points (APs) in the network are mapped to the VAP as part of a VAP mapping and the node treats the APs in the VAP mapping as a single AP for purposes of communicating with the network. The supervisory device receives measurements from the APs in the VAP mapping regarding communications associated with the node. The supervisory device identifies a movement of the node based on the received measurements from the APs in the VAP mapping. The supervisory device adjusts the set of APs in the VAP mapping based on the identified movement of the node.

Abstract: A wireless device can achieve higher predictability for its transmissions by inserting a placeholder frame in a transmission queue before RoCE data has been received. In addition, a contention countdown associated with the placeholder frame can start before the RoCE data is ready for transmission. Once the RoCE data is available, the device can insert the data into the payload of the placeholder frame, thereby reducing the wait time before the RoCE data can be transmitted wirelessly. Additionally, the device can improve reliability by transmitting RoCE data using multiple subcarrier RUs in a channel. The data blocks and the duplicative data can be transmitted in parallel using the subcarrier RUs. If a subset of the subcarrier RUs are blocked because of narrowband interference, the receiving device can nonetheless recover the data blocks and reconstruct the RoCe packet from the data transported on the RUs that did not have interference.

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 method includes: obtaining a multi-protocol schedule, wherein the multi-protocol schedule includes scheduling information characterizing packets associated with a plurality of wireless protocols, wherein each of the plurality of wireless protocols is associated with a respective virtual gateway of a plurality of virtual gateways; detecting, by a wireless transceiver, a first packet related to a first wireless protocol of the plurality of wireless protocols based on the multi-protocol schedule; and transmitting, by the wireless transceiver, the first packet related to the first wireless protocol to a first virtual gateway of the plurality of virtual gateways. According to some embodiments, the method is performed by a device (e.g., a MAC preprocessor) that includes a wireless transceiver, one or more processors, and non-transitory memory.

Abstract: In one embodiment, a method comprises identifying, by a controller device, first and second paths between an ingress network node and an egress network node in a deterministic network for an identified flow of data packets in an identified sequence, the identifying including identifying a replication node for replicating the identified flow into the first and second paths, and identifying an elimination node for receiving transmitted data packets along the first and second paths for the identified flow and transmitting the identified flow of data packets in the identified sequence; determining a jitter difference of the identified flow between the first and second paths, the jitter difference identifying a maximum jitter encountered in an average difference of latency between the first and second paths; and causing at least one of the elimination node or an upstream node along one of the first or second paths to absorb the jitter difference.

Abstract: In one embodiment, a supervisory service receives a registration message broadcast by a first vehicle and captured by a RSU in the network of RSUs. The supervisory service registers the first vehicle by validating a signature of the registration message without registering a media access control (MAC) address of the first vehicle and without causing to send a registration response to the first vehicle. The supervisory service receives a message broadcast by a second vehicle addressed to the first vehicle and captured by at least one RSU in the network of RSUs. The supervisory service selects one or more RSUs in the network of RSUs to re-broadcast the message. The supervisory service controls the one or more RSUs to re-broadcast the message.