Abstract: Various embodiments include methods and implementing computing devices, for distributing compute operation across connected wired or wireless computing devices. Various embodiments may include establishing an ad hoc communication connection with a second computing device, in which the ad hoc communication connection is part of a network of a plurality of wired or wireless computing devices communicatively connected via a plurality of ad hoc communication connections, receiving context information of the second wired or computing device via the ad hoc communication connection, selecting at least one sensor wired or wireless computing device from the plurality of wired or wireless computing devices, selecting at least one execution wired or wireless computing device from the plurality of wired or wireless computing devices, assigning a data gathering part of a work item to the sensor computing device, and assigning an execution part of the work item to the execution wired or wireless computing device.

Abstract: In one embodiment, a method includes generating a subgraph from a dependency graph. The subgraph includes one or more potential paths between an event interest node and an event generator node of the dependency graph. The method also includes activating the event interest node and assigning, in response to activating the event interest node, a color to nodes along the one or more potential paths of the subgraph from the event interest node to the event generator node. The method further includes modifying the event generator node and modifying, in response to modifying the event generator node, one or more of the nodes along the one or more potential paths of the subgraph from the event generator node to the event interest node.

Abstract: Differing operations of a wireless communication device benefit from different antenna configurations, such as for positioning, where closely spaced antennas are desirable, and data communication, where antenna diversity is desirable. A device is configured to receive a request for receive a request for determining a position of a user equipment (UE), select one of a first plurality of antennas or a second plurality of antennas for determining the position of the UE, receive wireless signals using the selected first plurality of antennas or the second plurality of antennas, and determine the position of the UE based at least in part on the received wireless signals.

Abstract: Technologies are provided for automatically prioritizing service requests (e.g., trouble tickets). More particularly, embodiments of the present invention automatically and dynamically order the tickets in the associates' queues to ensure multiple KPI objectives are met. To do so, several inputs are initially received at a prioritization engine. The inputs may comprise associate details, client inputs, ticket details, and KPI details. The inputs are processed by the prioritization engine to allocate the tickets to one or more associates. The prioritization engine automatically determines the priority of each ticket assigned to each associate. A prioritized list of tickets assigned to each associate is provided to a user interface.

Abstract: The relative position of a user equipment (UE) within a vehicle is determined using angular measurements, such as angle of arrival (AOA), and optionally ranging measurements, with respect to a number of wireless transceivers within the vehicle using wideband signals. The relative position of the UE with respect to a personal zone or the steering wheel may be determined based on known positions of the wireless transceivers. If the UE is determined to be within the personal zone, at least one functionality of the UE is restricted to avoid driver distraction and, optionally, the operation autonomous driving of the vehicle adjusted. If the UE is worn on the driver's wrist the relative position of the UE with respect to the steering wheel may be similarly determined and operation of the vehicle modified if the UE is determined to be outside a threshold distance from the steering wheel.

Abstract: Technologies are provided for automatically routing service requests (e.g., trouble tickets). More particularly, embodiments of the present invention provide a real-time routing system that helps reduce the wait time on the assignment of client logged support requests. To do so, a batch job may run regularly (e.g., every 5 minutes) to identify newly logged tickets by querying a ticket database corresponding to a ticket system. The smart routing systems utilizes an iterative process to identify the most appropriate associate on the most appropriate support team for assigning the ticket. Once the appropriate associate has been identified, the client as well as the associate may be notified regarding the ticket assignment.

Abstract: An interface circuit in an electronic device may contend for access to a shared communication channel on behalf of the electronic device and a recipient electronic device, where the access has a duration. Then, the electronic device may provide a schedule frame intended for the recipient electronic device that includes information that specifies one or more time slots during the duration that are associated with the recipient electronic device and one or more communication functions of the recipient electronic device in the one or more time slots. Moreover, the electronic device may provide a data frame with data intended for the recipient electronic device. In response, the electronic device may receive a response frame associated with the recipient electronic device, where the response frame is received during at least one of the one or more time slots.

Abstract: One embodiment performs longest prefix matching operations in one or more different manners that provides packet processing and/or memory efficiencies in the processing of packets. In one embodiment, a packet switching device determines a set of one or more mask lengths of a particular conforming entry of a multibit trie or other data structure that matches a particular address of a packet via a lookup operation in a mask length data structure. A conforming entry refers to an entry which has less than or equal to a maximum number of different prefix lengths, with this maximum number corresponding to the maximum number of prefix lengths which can be searched in parallel in the address space for a longest matching prefix by the implementing hardware. The packet switching device then performs corresponding hash table lookup operation(s) in parallel in determining an overall longest matching prefix for the particular address.

Abstract: An interface circuit in an electronic device may contend for access to a shared communication channel on behalf of the electronic device and a recipient electronic device, where the access has a duration. Then, the electronic device may provide a schedule frame intended for the recipient electronic device that includes information that specifies one or more time slots during the duration that are associated with the recipient electronic device and one or more communication functions of the recipient electronic device in the one or more time slots. Moreover, the electronic device may provide a data frame with data intended for the recipient electronic device. In response, the electronic device may receive a response frame associated with the recipient electronic device, where the response frame is received during at least one of the one or more time slots.

Abstract: One embodiment performs longest prefix matching operations in one or more different manners that provides packet processing and/or memory efficiencies in the processing of packets. In one embodiment, a packet switching device determines a set of one or more mask lengths of a particular conforming entry of a multibit trie or other data structure that matches a particular address of a packet via a lookup operation in a mask length data structure. A conforming entry refers to an entry which has less than or equal to a maximum number of different prefix lengths, with this maximum number corresponding to the maximum number of prefix lengths which can be searched in parallel in the address space for a longest matching prefix by the implementing hardware. The packet switching device then performs corresponding hash table lookup operation(s) in parallel in determining an overall longest matching prefix for the particular address.

Abstract: One embodiment performs longest prefix matching operations in one or more different manners that provides packet processing and/or memory efficiencies in the processing of packets. In one embodiment, a packet switching device determines a set of one or more mask lengths of a particular conforming entry of a multibit trie or other data structure that matches a particular address of a packet via a lookup operation in a mask length data structure. A conforming entry refers to an entry which has less than or equal to a maximum number of different prefix lengths, with this maximum number corresponding to the maximum number of prefix lengths which can be searched in parallel in the address space for a longest matching prefix by the implementing hardware. The packet switching device then performs corresponding hash table lookup operation(s) in parallel in determining an overall longest matching prefix for the particular address.

Abstract: In one embodiment, a method includes computing at a controller, a primary path and a backup path for transmittal of multicast data from service nodes in communication with the controller and a multicast source to access nodes in communication with multicast receivers, and transmitting from the controller, information for the primary path and the backup path to the access nodes for use by the access nodes in receiving the multicast data on the primary path and the backup path, and switching transmittal of the multicast data to the multicast receivers from the primary path to the backup path upon identifying a failure in the primary path to provide fast reroute at the access nodes. A multicast control plane runs in the controller without operating in the access nodes. An apparatus is also disclosed herein.

Abstract: In one embodiment, a method includes computing at a controller, a primary path and a backup path for transmittal of multicast data from service nodes in communication with the controller and a multicast source to access nodes in communication with multicast receivers, and transmitting from the controller, information for the primary path and the backup path to the access nodes for use by the access nodes in receiving the multicast data on the primary path and the backup path, and switching transmittal of the multicast data to the multicast receivers from the primary path to the backup path upon identifying a failure in the primary path to provide fast reroute at the access nodes. A multicast control plane runs in the controller without operating in the access nodes. An apparatus is also disclosed herein.

Abstract: The present invention provides a solar cooling system which is so small in size so that it can be used as a building material. The design based on absorption and adsorption refrigeration cycle has been developed to fulfill this objective. The design has been developed such that the system is completely independent and does not require any other source of energy apart from solar heat. Also an effort is made to design the system so that the cooling capacity is automatically increased or decreased based on available solar heat energy.

Abstract: In one embodiment, active links are added to, and removed from, a multichassis link bundle with one side of the multichassis link bundle terminated on multiple devices of a multichassis device. In one embodiment, adding active links includes selecting which particular device to which to add an active link to the multichassis link bundle based on a device priority of each of the multiple devices, with a device priority of a given device being based on a current number of active links associated with the given device.

Abstract: The embodiments herein relate to Near Field Communication and, more particularly, to facilitating one time readability of tags for secured near field communication. A tag with one time readability enabled provides encrypted data to any reader that request for data. Only an authorized reader that possesses a proprietary application can decode received data. Once the data is decoded, the authorized reader marks the tag as read. Once the tag is marked as “read”, it invalidates any further data access request from any reader. Further, the tag can be reused to write fresh data onto it.

Abstract: In one embodiment, active links are added to, and removed from, a multichassis link bundle with one side of the multichassis link bundle terminated on multiple devices of a multichassis device. In one embodiment, adding active links includes selecting which particular device to which to add an active link to the multichassis link bundle based on a device priority of each of the multiple devices, with a device priority of a given device being based on a current number of active links associated with the given device.

Abstract: In one embodiment, a method includes receiving a request message at a local node in a communications network from a remote node in the communication network. The request message holds data that indicates a request for a particular service from the local node. A load metric that indicates a current processing load at the local node is determined. A response delay time, for responding to the request message, is determined based on the load metric. A response message is sent after the response delay time. The response message indicates the local node is able to provide the particular service for the remote node. The delay time allows the local node to make it more likely that a less busy node will respond earlier in time to a request message from the same remote node and provide the particular service.

Abstract: In one embodiment, a method includes receiving a request message at a local node in a communications network from a remote node in the communication network. The request message holds data that indicates a request for a particular service from the local node. A load metric that indicates a current processing load at the local node is determined. A response delay time, for responding to the request message, is determined based on the load metric. A response message is sent after the response delay time. The response message indicates the local node is able to provide the particular service for the remote node. The delay time allows the local node to make it more likely that a less busy node will respond earlier in time to a request message from the same remote node and provide the particular service.