Abstract: A computing system for learning a device type and message formats used by a device is provided. The computing system includes an interface and a processor. The interface is receptive of documents describing identification information and communication and application protocols of devices. The processor is coupled with the interface to obtain rules of network packet analysis using document analytics and identify identification information and communication and application protocols of network messages from devices using the rules.

Abstract: Systems, methods, and computer program products are disclosed for dynamically determining an optimal node of an overlay network for client attachment. An optimal node can be selected from a group of potential attachment nodes in the overlay network through which a client can establish a connection to the overlay network. Network parameter training data can be determined and used to train a network optimization model. Once trained, the network optimization model can be used to determine—based on network parameter data associated with the group of potential attachment nodes—the optimal node for the client to attach to. If a different node than a current attachment node is determined to be a new optimal node, a connection path can be established between this new optimal node and the client, and an existing connection path between the client and the previous optimal node can be terminated or simultaneously maintained.

Abstract: A computing system for learning a device type and message formats used by a device is provided. The computing system includes an interface and a processor. The interface is receptive of documents describing identification information and communication and application protocols of devices. The processor is coupled with the interface to obtain rules of network packet analysis using document analytics and identify identification information and communication and application protocols of network messages from devices using the rules.

Abstract: Embodiments are directed to a computer-implemented method of optimizing performance of a computer network. The method includes receiving a request to transmit data from a first location. For each path in a set of paths, where each path comprises a connection allowing the transmission of data from the location, a set of performance measures for the path is determined. For each path in the set of paths, an incremental cost of transmitting the requested data using the path is determined. Thereafter, the performance measures and incremental cost for each path is used to determine which path to use to transmit data. Data is then transmitted using the determined path using multipath transmission control protocol techniques (MP-TCP).

Abstract: Systems, methods, and computer program products are disclosed for dynamically determining an optimal node of an overlay network for client attachment. An optimal node can be selected from a group of potential attachment nodes in the overlay network through which a client can establish a connection to the overlay network. Network parameter training data can be determined and used to train a network optimization model. Once trained, the network optimization model can be used to determine—based on network parameter data associated with the group of potential attachment nodes—the optimal node for the client to attach to. If a different node than a current attachment node is determined to be a new optimal node, a connection path can be established between this new optimal node and the client, and an existing connection path between the client and the previous optimal node can be terminated or simultaneously maintained.

Abstract: Embodiments are directed to a computer-implemented method of optimizing performance of a computer network. The method includes receiving a request to transmit data from a first location. For each path in a set of paths, where each path comprises a connection allowing the transmission of data from the location, a set of performance measures for the path is determined. For each path in the set of paths, an incremental cost of transmitting the requested data using the path is determined. Thereafter, the performance measures and incremental cost for each path is used to determine which path to use to transmit data. Data is then transmitted using the determined path using multipath transmission control protocol techniques (MP-TCP).

Abstract: There is a method and system for capability-based resource allocation in a software-defined environment that performs the following steps (not necessarily in the following order): (i) determining a set of capability characteristics for a plurality of workload resources within a software-defined environment; (ii) determining a set of workload components for a specified workload; and (iii) identifying a set of workload resources from the plurality of workload resources to allocate to the specified workload based, at least in part, on the set of capability characteristics corresponding to each workload within the set of workload resources. A workload component of the set of workload components has a unique set of workload characteristics.

Abstract: There is a method and system for capability-based resource allocation in a software-defined environment that performs the following steps (not necessarily in the following order): (i) determining a set of capability characteristics for a plurality of workload resources within a software-defined environment; (ii) determining a set of workload components for a specified workload; and (iii) identifying a set of workload resources from the plurality of workload resources to allocate to the specified workload based, at least in part, on the set of capability characteristics corresponding to each workload within the set of workload resources. A workload component of the set of workload components has a unique set of workload characteristics.

Abstract: A method of enabling a legacy interactive voice response unit to accept multiple forms of user input can include associating dual tone multi-frequency selectable options of the legacy interactive voice response unit with non-dual tone multi-frequency user inputs. A non-dual tone multi-frequency user input can be received and processed to determine at least one dual tone multi-frequency selectable option that is associated with the received user input. Dual tone multi-frequency signals can be generated for selecting the at least one dual-tone multi-frequency selectable option associated with the user input. The dual tone multi-frequency signals can be provided to the legacy interactive voice response unit.

Abstract: A method of enabling a legacy interactive voice response unit to accept multiple forms of user input can include associating dual tone multi-frequency selectable options of the legacy interactive voice response unit with non-dual tone multi-frequency user inputs. A non-dual tone multi-frequency user input can be received and processed to determine at least one dual tone multi-frequency selectable option that is associated with the received user input. Dual tone multi-frequency signals can be generated for selecting the at least one dual-tone multi-frequency selectable option associated with the user input. The dual tone multi-frequency signals can be provided to the legacy interactive voice response unit.

Abstract: The present invention uses a novel adaptation of a tree splitting algorithm applied to Radio Frequency (RF) tagging technology to identify many tags in the RF field of a base station.The invention uses the tree splitting algorithm to identify a single tag in a field of a plurality of radio frequency tags. Once the single tag is identified, the identified tag is placed in a Data.sub.-- Exchange state where the base station can access data from the tag memory by using information that identifies the tag.

Abstract: This invention provides a tag identification system and method for identifying tags in the range of a reader station where the tags are divided into smaller groups, where the tags are identified one group at a time so as to save power by powering off the tags that are not in the group currently being identified. Each tag puts itself in a group by performing calculations from parameters stored in itself and from parameters received from the reader station. In another variation of this invention, only tags which configure themselves to be activated at a final frequency are identified. The set of tags which configure themselves to be activated at the final frequency changes with each identification round until all tags in the range of the reader have been identified.

Abstract: A system and method for performing variable speed scanning or browsing, wherein a user controls the playout speed of a movie, which does not require additional disk or network bandwidth resources. In a preferred embodiment, the method provides for scanning operations for an Motion Picture Experts Group (MPEG) video stream. The method satisfies the constraints of the MPEG decoder (in the users set-top box) and require a minimum of additional system resources. The embodiments of the present invention include (a) a storage method, (b1) a segment sampling method, (b2) a segment placement method, and (c) a playout method, where (b1) and (b2) are two alternatives for segment selection. Thus, two sets of solutions are provided to support variable speed scanning in a disk-array-based video server: One using (a), (b1) and (c), and the other using (a), (b2) and (c).

Abstract: An interconnection network for a plurality of process nodes, each illustratively comprised of a processor-memory pair, utilizes an hexagonal mesh arrangement of size n which is wrapped in each of the x, y, and z directions. In accordance with the invention, a unique address value is assigned to each processor node in the network, beginning at a central processor node and continuing along the x direction, and via the wrapping links, until each such processor node has a unique sequential address. Each of the rows, having first and last processor nodes therein, is wrapped by coupling each of the last processor nodes in each row to a respective first processor node in a corresponding row which is n-1 rows away. Point-to-point communication is achieved using the unique addresses of only the source and destination processor nodes, without requiring each intermediate processor node to contain global information about the entire network.