Abstract:
In one embodiment, a mobile node in a wireless network determines a physical location of the mobile node. The mobile node obtains telemetry data. The mobile node makes a comparison between the physical location of the mobile node and a location-based telemetry reporting policy. The mobile node sends, based on the comparison, the telemetry data via the wireless network.
Abstract:
In one embodiment, a controller identifies access points forming an overhead mesh of access points in an area, each access point comprising one or more directional transmitters each configured to transmit a beam cone in a substantially downward direction towards a floor of the area. The controller assigns the access points to access point groups. The controller generates communication schedules for the access points such that each access point in an access point group is on a common channel and only one of neighboring directional transmitters of access points in that group is able to transmit at any given time. The controller sends the communication schedules to the access points forming the overhead mesh of access points in the area.
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 method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching multicast listeners from a multicast source, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for receiving from each of the first and second network devices a copy of a multicast packet originated from the multicast source; and causing the multicast packet to be propagated throughout the loop-free routing topology based on the first and second ends of each routing arc forwarding the corresponding copy into the corresponding routing arc.
Abstract:
Techniques and apparatus for performing sticky client detection and/or remediation with machine learning are described. An example technique includes determining one or more parameters associated with roaming activity of a client station (STA) within a wireless network. The one or more parameters are evaluated with a machine learning model to predict a sliding boundary associated with the client STA, a first access point (AP) within the wireless network, and a second AP within the wireless network. Information associated with the sliding boundary is transmitted to the first AP. A frame including a request for the client STA to roam to the second AP and the information associated with the sliding boundary is transmitted to the client STA.
Abstract:
In one embodiment, a device identifies a plurality of paths in a wireless backhaul network between a gateway and a plurality of access points that provide wireless connectivity to a mobile system. The device determines a movement of the mobile system. The device determines, based on the movement of the mobile system, that a particular path in the plurality of paths is not needed to provide wireless connectivity to the mobile system. The device causes one or more networking nodes along the particular path to enter into a power saving mode.
Abstract:
Time Sensitive Networking (TSN) in wireless environments may be provided. First, a Radio Frequency (RF) profile associated with a station may be received by a computing device. Next, a number of Transmit Opportunities (TxOPs) to use for transmitting data between an Access Point (AP) and the station based on the received RF profile may be determined. The determined number of TxOPs may then be provided to a wireless controller associated with the AP.
Abstract:
Providing for time sensitive networking (TSN) traffic in high density deployments is described. An access point (AP) is a high density deployment receives a message identifying another AP as a TSN neighbor and also detects a TSN device within an area covered by the APs. This arrangement may cause traffic interruptions for the TSN traffic between the TSN device and the APs. In order to prevent disruption in TSN traffic, a TSN time slot and a resource unit (RU) is determined for each of the APs, and the TSN traffic is communicated between the various devices in network according to the determined TSN time slot and RU.
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, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, at least one of the first, second, or third network nodes are implemented as a ring-based network having a prescribed ring topology; and establishing loop-free label switched paths for reaching the destination network node via the routing arcs of the loop-free routing topology, the label switched paths independent and distinct from any attribute of the prescribed ring topology.
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, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, the loop-free routing topology providing first and second non-congruent paths; and forwarding bicasting data, comprising a data packet in a first direction from a network node and a bicasted copy of the data packet in a second direction from the network node, concurrently to the destination node respectively via the first and second non-congruent paths.