Abstract: A computer-implemented system, computer-implemented method, and computer program product for facilitating in-kernel instrumentation of kernel-level processes are envisaged. The system, method, and computer program product implement the in-kernel instrumentation independent of the user space and without sharing any kernel-level processes-related information with the user space. A plurality of predetermined, customized eBPF maps are created and used to store information directed to kernel-level processes, including process ID, process namespace ID, process context, process parameters, and pointers directed to kernel-executable instrumentation-related directives.

Abstract: A network switching method includes transmitting, by an electronic device, data using a wireless local area network, when a data transmission delay of the wireless local area network is greater than a first threshold, switching, by the electronic device, to transmitting data using both the wireless local area network and a mobile network, and when the electronic device transmits data using both the wireless local area network and the mobile network, if the data transmission delay of the wireless local area network is greater than a second threshold, switching, by the electronic device, to transmitting data using the mobile network, where the first threshold is less than the second threshold.

Abstract: A data processing method and apparatus, where one or more applications run in an operating system of a first device, there is a plurality of paths between the first device and a second device, and the paths correspond to the one or more applications. In a data receiving process, the one or more applications obtain data on the paths through a system call, and further obtain data in a plurality of packets from at least one path. In a data sending process, the one or more applications distribute data to corresponding paths through a system call.

Abstract: The present disclosure relates to apparatus and methods for route invalidation. In one example method, a common ancestor node of a network determines switching of a parent node of a node based on an update message received from the node using a new routing path established based on the switching of the parent node. The common ancestor node generates a No-Path message based on the update message. The No-Path message is for invalidating a previous routing path associated with the node on the switching of the parent node. The update message comprises at least one bit authorizing generation of the No-Path message by the common ancestor node. The at least one bit is placed in a transit information option in the update message.

Abstract: A data processing method includes receiving, by an operating system of a device, a start instruction from an application in the device that includes an identifier of a socket connection, where the application is a latency-insensitive application, calling, by the operating system according to the start instruction, a monitoring system in the operating system to monitor buffering of data of the socket connection in a kernel buffer, where the data of the socket connection is from an underlying protocol stack, and generating, by the monitoring system, a data readable identifier when a time interval between a current moment and a start moment is greater than or equal to a timeout duration, where the start moment is when the operating system receives the start instruction, and the data readable identifier indicates that the data of the socket connection is readable by the application.

Abstract: This application discloses a route information storage method. The method is applied to a wireless mesh network, the wireless mesh network includes a first node, a second node, and at least two stations STAs, the first node is an upper-level node of the second node, the at least two STAs include a first STA and a second STA, and the first STA and the second STA are connected to the second node. In the method, the first node receives a routing request for access requested by the first STA, and if it is determined that a first route entry corresponding to the second STA already exists, the first node no longer generates a new route entry for the first STA, but reuses the first route entry.

Abstract: A network switching method includes transmitting, by an electronic device, data using a wireless local area network, when a data transmission delay of the wireless local area network is greater than a first threshold, switching, by the electronic device, to transmitting data using both the wireless local area network and a mobile network, and when the electronic device transmits data using both the wireless local area network and the mobile network, if the data transmission delay of the wireless local area network is greater than a second threshold, switching, by the electronic device, to transmitting data using the mobile network, where the first threshold is less than the second threshold.

Abstract: A data processing method and apparatus, where one or more applications run in an operating system of a first device, there is a plurality of paths between the first device and a second device, and the paths correspond to the one or more applications. In a data receiving process, the one or more applications obtain data on the paths through a system call, and further obtain data in a plurality of packets from at least one path. In a data sending process, the one or more applications distribute data to corresponding paths through a system call.

Abstract: A method and system for specifying and managing pre-defined policies for containerized workloads is provided.

Abstract: A network switching method includes transmitting, by an electronic device, data using a wireless local area network, when a data transmission delay of the wireless local area network is greater than a first threshold, switching, by the electronic device, to transmitting data using both the wireless local area network and a mobile network, and when the electronic device transmits data using both the wireless local area network and the mobile network, if the data transmission delay of the wireless local area network is greater than a second threshold, switching, by the electronic device, to transmitting data using the mobile network, where the first threshold is less than the second threshold.

Abstract: A data processing method and apparatus, where one or more applications run in an operating system of a first device, there is a plurality of paths between the first device and a second device, and the paths correspond to the one or more applications. In a data receiving process, the one or more applications obtain data on the paths through a system call, and further obtain data in a plurality of packets from at least one path. In a data sending process, the one or more applications distribute data to corresponding paths through a system call.

Abstract: The present disclosure relates to apparatus and methods for route invalidation. In one example method, a common ancestor node of a network determines switching of a parent node of a node based on an update message received from the node using a new routing path established based on the switching of the parent node. The common ancestor node generates a No-Path message based on the update message. The No-Path message is for invalidating a previous routing path associated with the node on the switching of the parent node. The update message comprises at least one bit authorizing generation of the No-Path message by the common ancestor node. The at least one bit is placed in a transit information option in the update message.

Abstract: Example apparatus and methods for optimized route invalidation using modified no-path Destination Oriented Directed Acyclic Graph Advertisement Object (DAO) signaling are disclosed. In one example method, a node switching its current parent is adapted to send a regular DAO message. Using the changed signaling, a common ancestor node generates a No-Path destination oriented directed acyclic graph advertisement object message (NPDAO) on behalf of the switching node on receiving a refreshed DAO from an alternate path. The common ancestor node reuses a same Path Sequence from the regular DAO based on which the NPDAO gets generated. The common ancestor node detects routing anomaly using next hop mismatch on reception of the DAO to generate the NPDAO on behalf of the target node. The No-Path DAO traverses downward/downstream along the previous path.

Abstract: A data processing method includes receiving, by an operating system of a device, a start instruction from an application in the device that includes an identifier of a socket connection, where the application is a latency-insensitive application, calling, by the operating system according to the start instruction, a monitoring system in the operating system to monitor buffering of data of the socket connection in a kernel buffer, where the data of the socket connection is from an underlying protocol stack, and generating, by the monitoring system, a data readable identifier when a time interval between a current moment and a start moment is greater than or equal to a timeout duration, where the start moment is when the operating system receives the start instruction, and the data readable identifier indicates that the data of the socket connection is readable by the application.

Abstract: A data processing method and apparatus, where one or more applications run in an operating system of a first device, there is a plurality of paths between the first device and a second device, and the paths correspond to the one or more applications. In a data receiving process, the one or more applications obtain data on the paths through a system call, and further obtain data in a plurality of packets from at least one path. In a data sending process, the one or more applications distribute data to corresponding paths through a system call.

Abstract: A network switching method includes transmitting, by an electronic device, data using a wireless local area network, when a data transmission delay of the wireless local area network is greater than a first threshold, switching, by the electronic device, to transmitting data using both the wireless local area network and a mobile network, and when the electronic device transmits data using both the wireless local area network and the mobile network, if the data transmission delay of the wireless local area network is greater than a second threshold, switching, by the electronic device, to transmitting data using the mobile network, where the first threshold is less than the second threshold.

Abstract: In one implementation, the present invention provides a mechanism for balanced ad-hoc network formation. To achieve the for balanced ad-hoc network formation, the present invention sends the metric information with DIO control message. A new metric container type is introduced in RPL to hold the metric information, and select the parent with minimum path cost, and switch the parent with minimum path cost, as per the defined logic. A stateless metric considers that the average traffic flow from each node is approximately same. The stateless metric directly uses the number of routing table entries (RTsize) to decide which path to use. A stateful metric, wherein the node keeps a track of packets processed per second by itself. For stateful metric, the node maintains packets processed rate (PPR) variable, which is then used as the metric.

Abstract: Apparatus and method for optimized route invalidation using modified no-path DAO signaling are disclosed. According to the present invention, a node switching its current parent is adapted to send a regular Destination Oriented Directed Acyclic Graph (DODAG) Advertisement Object (DAO) message. Using the changed signaling, the common ancestor node generates an NPDAO on behalf of the switching node on receiving a refreshed DAO from an alternate path. The common ancestor node according to the present invention reuses a same PathSequence from the regular DAO based on which the NPDAO gets generated. The common ancestor node detects routing anomaly using next hop mismatch on reception of the DAO to generate the NPDAO on behalf of the target node. The No-Path DAO traverses downward/downstream along the previous path, unlike any other DAO messages traverses upstream according to convention approaches. The present invention provides a new signaling mechanism for route invalidation in constrained networks.

Abstract: A method for detecting a presence of at least one face in at least one image is comprises creating an image patch map based on a plurality of face patches identified for at least one window in the in at least one image, estimating a bounding box, and searching within the bounding box to detect presence of the at least one face in the at least one image. The present disclosure discloses use of any classifier which works on top of any feature representation to identify face patches and then using a masking system to identify bounding boxes.

Abstract: In one implementation, the present invention provides a mechanism for balanced ad-hoc network formation. To achieve the for balanced ad-hoc network formation, the present invention sends the metric information with DIO control message. A new metric container type is introduced in RPL to hold the metric information, and select the parent with minimum path cost, and switch the parent with minimum path cost, as per the defined logic. A stateless metric considers that the average traffic flow from each node is approximately same. The stateless metric directly uses the number of routing table entries (RTsize) to decide which path to use. A stateful metric, wherein the node keeps a track of packets processed per second by itself. For stateful metric, the node maintains packets processed rate (PPR) variable, which is then used as the metric.