H04L67/1053

SYSTEMS AND METHODS FOR SEAMLESS HOST MIGRATION
20180013820 · 2018-01-11 ·

Systems and methods of the present invention for maintaining network data distribution are provided. Network data may be distributed in such as manner as to allow a network session to weather interrupted communications between host and clients without significant loss of data. Embodiments of the present invention provide for one or more clients to serve as backup host(s) for the network session. When the other clients transmit data to the host, they may also transmit the data to one or more backup hosts if there are any indications of interrupted communication.

Autonomous data routing in a peer-to-peer computer network
20230124157 · 2023-04-20 ·

A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes automatically updating a peer-to-peer computer network. The method includes automatically sending pulse messages from a first node to neighbor nodes and candidate nodes, receiving return pulses by the first node from at least some of the neighbor nodes and the candidate nodes, calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes based on the pulse messages and the return pulses, sorting the nodes in the neighbor nodes and the candidate nodes into orbital bins based on RTTs, and automatically selecting and adding a node from one of the orbital bins based on the RTTs to updated neighbor nodes for the first node, and routing data from the first node to a second node via a relay node in the peer-to-peer computer network.

Autonomous data routing in a peer-to-peer computer network
20230119531 · 2023-04-20 ·

A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes identifying a destination node to receive a data transfer, storing IDs of neighbor nodes sorted into orbital bins according to round-trip times (RTTs) between a source node and the neighbor nodes, sending one or more path packages from the source node to the destination node in a first direct data path from the source node to the destination node, sending path packages from the source node to the neighbor nodes, sending one or more path packages comprising updated hop information from a first hop node to the destination node, calculating total one-way latencies and performance metrics respectively for the path packages received by the destination node, and selecting a relayed data path for the data transfer from the source node to the destination node.

Autonomous data routing in a peer-to-peer computer network

A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes automatically updating a peer-to-peer computer network. The method includes automatically sending pulse messages from a first node to neighbor nodes and candidate nodes, receiving return pulses by the first node from at least some of the neighbor nodes and the candidate nodes, calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes based on the pulse messages and the return pulses, sorting the nodes in the neighbor nodes and the candidate nodes into orbital bins based on RTTs, and automatically selecting and adding a node from one of the orbital bins based on the RTTs to updated neighbor nodes for the first node, and routing data from the first node to a second node via a relay node in the peer-to-peer computer network.

Word cloud candidate management system

A method and apparatus for identifying a relative importance of words in a word cloud. A computer system identifies graphical features and locations for the words representing information in the word cloud based on a group of metrics for the information. The graphical features distinguish the words from each other based on a first number of first values for a first metric in the group of metrics. The locations of the words distinguish the words from each other based on a second number of second values for a second metric in the group of metrics. The word cloud is displayed on a display system using the graphical features and the locations for the words in the word cloud in graphical user interface, which enables identifying the relative importance of the words in the word cloud based on the group of metrics for the information represented by the words.

SYSTEMS AND METHODS FOR CLOUD TOPOLOGY MANAGEMENT DURING DEPLOYMENT OF VIRTUAL APPLICATIONS

A device may receive application information of an application to be deployed in a cloud computing environment. The application information may include requirement information including information defining a compute requirement of the application, a storage requirement of the application, and a network connectivity requirement of the application, and first capability information identifying requested capabilities of the first set of devices. The device may receive second capability information identifying actual capabilities of the second set of devices. The device may compare the first capability information and the second capability information to determine a measure of similarity between the first capability information and the second capability information. The device may generate deployment information for deploying the application on a device, of the second set of devices, based on the measure of similarity.

Dynamic inclusion thresholds for social network conversations

A social network conversation dynamic inclusion threshold is obtained that causes a first subset of social network group members of a social network group to be included in a social network conversation earlier than at least one other social network group member and that further causes the at least one other social network group member to be included in the social network conversation upon satisfaction of the obtained social network conversation dynamic inclusion threshold. In accordance with the obtained social network conversation dynamic inclusion threshold, social network posts of the social network conversation are contemporaneously distributed to the first subset of social network group members and delayed in distribution to the at least one other social network group member. Upon satisfaction of the social network conversation dynamic inclusion threshold, the social network posts of the social network conversation are distributed to the at least one other social network group member.

Systems and methods for seamless host migration

Systems and methods of the present invention for maintaining network data distribution are provided. Network data may be distributed in such as manner as to allow a network session to weather interrupted communications between host and clients without significant loss of data. Embodiments of the present invention provide for one or more clients to serve as backup host(s) for the network session. When the other clients transmit data to the host, they may also transmit the data to one or more backup hosts if there are any indications of interrupted communication.

Method of transmitting contents and user's interactions among multiple devices

A method for transmitting contents and user's interactions among multiple devices is provided. The method includes determining a group of object devices including a portion of the plurality of object devices, transmitting the data to the object devices of the determined group, receiving confirmation information from the object device which completes receiving of the data, among the object devices of the determined group, determining a clone device based on the received confirmation information. The transmitted clone information is used to transmit the data from the determined clone device to at least one object device which is not included in the object devices of the determined group among the plurality of object devices.

System and method for holistic application development and deployment in a distributed heterogeneous computing environment

A system and method of holistic application development and deployment in a distributed, heterogeneous computing environment. The method includes identifying an individual component from among a plurality of components in a target system as an identified component of a plurality of identified components, mapping each one of the identified components to respective ones of a target hardware node, generating intermediate code for each respective one of the target hardware nodes, generating serialization code for each respective communication interface between the target hardware nodes, transmitting the respective intermediate codes to each one of the target hardware nodes, and transmitting respective serialization codes to each communication interface of the target hardware nodes.