Abstract: In one embodiment, a method includes receiving energy efficiency data from a plurality of nodes within a network. The method also includes determining an energy efficiency node quotient for each of the plurality of nodes within the network to generate a plurality of energy efficiency node quotients and determining an energy efficiency path quotient for each of a plurality of paths within the network to generate a plurality of energy efficiency path quotients. The method further includes determining one or more policies associated with the plurality of paths and selecting a path from the plurality of paths based at least on the plurality of energy efficient path quotients and the one or more policies.

Abstract: Systems, methods, and computer-readable media are disclosed for validating multiple paths used for routing network traffic in a network. In one aspect, a network controller can identify one or more intermediate nodes on each of multiple paths in a network, wherein the multiple paths begin at a first network node and end at a last network node. The network controller can further generate a data packet with a label at the first network node, forward the test data packet from the first network node, along each of the one or more intermediate nodes, to the last network node, and perform a data plane validation process for validating packet forwarding from the first network node to the last network node based on the label(s) by determining if a number of the multiple paths equals to a number of packets received at the last network node.

Abstract: In one embodiment, a device receives, from a requestor, a query function that queries a dataset and an intended use schema associated with the query function. The device determines, using a policy ruleset, whether the intended use schema falls within an available schema for the dataset. The device executes the query function on the dataset to form a result data, when the intended use schema falls within the available schema for the dataset. The device provides the result data to the requestor.

Abstract: The present technology is directed to a system and method for application aware management and recovery of link failures resulting from excessive errors observed on the link. One aspect of the proposed technology is based on identification of link errors associated with application-specific data patterns traversing link. Other aspects involve corrective actions based on relocation or modification of specific application traffic to thereby alleviate the observed excessive link errors and prevent a link failure or shut down. Relocation may involve moving the source application to a different virtual machine/container/physical device or rerouting application traffic by updating relevant routing protocols. Modification may involve harmlessly changing payload data pattern to remove data-pattern dependent signal attenuation.

Abstract: A recommendation system can be configured to provide tailored software update relevance information for deployed software. The recommendation engine can obtain running state information for a current version of software running on a device, as well as build data for each of the current version of the software and a new version of the software. The recommendation engine can obtain software version difference information based on the build data and determine, based on at least the software version difference information and the running state information, a number of functions in the current version of software that are directly impacted by the new version. The recommendation engine can cause relevance information derived from this determination to be displayed on a computing device, and/or the recommendation engine can automatically cause an update to the new version of the software to be applied or rejected based on the determination.

Abstract: A verifier peer system transmits a request to an application of another peer system to obtain integrity data of the application. In response to the request, the verifier peer system obtains a response that includes kernel secure boot metrics of the other peer system and integrity data of the application and of any application dependencies. If the verifier peer system determines that the response is valid, the verifier peer system evaluates the integrity data and the kernel secure boot metrics against a set of Known Good Values to determine whether the integrity data and the kernel secure boot metrics are valid. If the integrity data and the kernel secure boot metrics are valid, the verifier peer system determines that the other peer system is trustworthy.

Abstract: An arrangement of three radios maybe provided. The three radios define first and second outer data links and a middle data link. Access to the arrangement of three radios can be biased to the middle data link in one direction upon a data transmission through the first and second outer data links being dominate in an opposite direction. Data transmission with enhanced multi-link single radio (eMLSR) client devices can be prioritized lower than data transmission with simultaneous transmit and receive radio (STR) client devices and non-simultaneous transmit and receive radio (NSTR) client devices. A radio can be configured for data transmission with a client device. The range of the radio is limited when the data traffic through the radio exceeds a determined number of bytes of data in a determined amount of time.

Abstract: Coordinated Orthogonal Frequency Division Multiple Access (C-OFDMA) in high density networks may be provided. A primary Access Point (AP) and a subordinate AP may be caused to use an omnidirectional antenna pattern during a synchronization period. Next, the primary AP and the subordinate AP may be caused to use an omnidirectional antenna pattern during a time in which the primary AP sends a subordinate Trigger Frame (TF) during a first C-OFDMA period. The primary AP and the subordinate AP may then be caused to use a directional antenna pattern during times in which the primary AP and the subordinate AP Uplink (UL) data during the first C-OFDMA period and Downlink (DL) data during the first C-OFDMA period.

Abstract: Provisioning User Equipment (UE) Route Selection Policies (URSP) may be provided. A policy of a user equipment (UE) may be updated by a Policy Control Function (PCF). Then, the PCF may create a UE route selection policy (URSP) based on the updated UE policy. Next, the PCF may set a flag in in the URSP that may indicate to the UE that the URSP is applicable for new sessions and inapplicable for ongoing sessions. The PCF may then send the URSP to the UE, wherein the UE applies the URSP for new sessions.

Abstract: A system may include a primary memory, a secondary memory, and a processor that may be communicatively coupled to one another. The processor may be configured to control data packet transmissions received via an input to the primary memory and the secondary memory. Further, the processor may be configured to monitor a current buffering level of the primary memory; and compare the first current buffering level to a first buffering threshold. The first buffering threshold may be indicative of a buffering capacity difference between a first buffering capacity of the primary memory and a second buffering capacity of the secondary memory. In response to determining that the current buffering level is equal to or greater than the first buffering threshold, pause the data packet transmissions via the input to the to the primary memory and the secondary memory.

Abstract: Systems and methods provide for optimizing video review using motion recap images. A video review system can identify background image data of a video clip including an amount of motion satisfying a motion threshold. The video review system can generate foreground mask data segmenting foreground image data, representing a moving object in the video clip, from the background image data. The video review system can select a set of instances of the moving object represented in the foreground image data. The video review system can generate a motion recap image by superimposing the set of instances of the moving object represented in the foreground image data onto the background data.

Abstract: Techniques for identifying a trusted SSID for a wireless network are disclosed. Prior to establishing a connection with a wireless network comprising a service set identifier (SSID), a network message is received at a wireless station (STA), from an access point (AP) associated with the wireless network. The STA identifies an encrypted identifier in the network message. The STA validates the encrypted identifier, and in response determines that the AP corresponds to a trusted wireless network. The SSID is designated as trusted, at the STA.

Abstract: A wireless client device communicates, to an access point over a secure channel, a mapping of a dynamic device address to a stable device address. By communicating the mapping, the access point is able to determine that packets received from two different device addresses originate from a common device. The access point is then able to maintain an association between the originating device and other network resources assigned or allocated to the originating device, such as IP addresses or infrastructure station address, which is used to identify the originating device to other devices outside the network in some embodiments.

Abstract: A computer executed process for mimicking human dialog, referred to herein as a “humanoid” or “humanoid system,” can be configured to provide automated customer support. The humanoid can identify a support issue for a customer, as well as a customer support campaign corresponding to the support issue. The humanoid can identify at least one machine learning model associated with the customer support campaign and can communicate with the customer using the at least one machine learning model. The humanoid can execute a support action to resolve the support issue.

Abstract: Intelligent distribution of packet flows may be provided. Compute resource data may be received. Next, packets may be classified into flows that may be persistently mapped to compute resources for a lifetime of the flows. Based on the compute resource data, the flows may then be allocated to the compute resources.

Abstract: Method for application control and Quality of Service (QoS) handling may be provided. A request may be received for scheduling a communication between an Access Point (AP) and a user device for sending data of an application. It may be determined that the request does not comprise network characteristics of the application. In response to determining that the request does not comprise the network characteristics of the application, the network characteristics may be requested from a Wireless Local Area Network (WLAN) controller. The network characteristics may be received from the WLAN controller. Schedules for the application may be determined based on the network characteristics. The schedules may be enabled.

Abstract: The present disclosure is directed to systems and methods for transparent Provider Backbone Bridge forwarding of MACsec key exchanges over public Ethernet provider backbones. The method includes the steps of receiving, at a first PBB device, an Ethernet frame from a first edge router for transmission to a second edge router via a MACsec connection, the Ethernet frame comprising a plurality of fields; performing a lookup of one or more fields of the plurality of fields to determine a match with one or more pre-defined values; determining that the one or more fields of the Ethernet frame match the one or more pre-defined values; rewriting the one or more fields of the Ethernet frame to one or more open values operable to allow the Ethernet frame to be transmitted to a next hop device; and transmitting the Ethernet frame to the next hop device.

Abstract: Techniques are described to provide for authentication and subscription management that are decoupled from a Home Subscriber Server (HSS).

Abstract: An approach to establish connections between clusters having overlapping IP address ranges. A method includes receiving, at a service discovery server, from a first node in a first cluster, a service discovery request including a unique name, determining, at the service discovery server, that the unique name resolves to a destination IP address of a second node in a second cluster, determining that the destination IP address overlaps with an IP address range associated with the first cluster, in response to determining that the destination IP address overlaps with the IP address range belonging to the first cluster, configuring a gateway to expect a network connection request from the first node that includes an IP address of the gateway, and sending a service discovery response to the first node, the service discovery response including the IP address of the gateway, but not the destination IP address.

Abstract: Techniques are presented herein to facilitate latency measurements in a networking environment. A first network device receives a packet for transport within a network domain that comprises a plurality of network devices. The plurality of network devices have a common time reference, that is, they are time synchronized. The first network device generates timestamp information indicating time of arrival of the packet at the first network device. The first network device inserts into the packet a tag that comprises at least a first subfield and a second subfield. The first subfield comprising a type indicator to signify to other network devices in the network domain that the tag includes timestamp information, and the second subfield includes the timestamp information. The first network device sends the packet from to into the network domain to another network device. Other network devices which receive that packet can make latency measurements.