A dynamic routing method in interconnected networks of connected objects is hereby proposed. The purpose of the method is the generation and maintenance, by a connection gateway of a network of connected objects, of a routing list used by said connection gateway for its routing functions. Additionally, the method enables a connection gateway to select the most appropriate transmission path for transmitting a message from a source connected object to a receiving connected object within a network infrastructure formed by at least two networks of connected objects and a data transport network interconnecting them.

In one aspect, machines in a managed network implements a set of rules that cause individual machines to directly interact with only a small number of machines in the network (i.e., a local neighborhood within the network), while the independent local actions of the individual machines collectively cause the individual machines to be self-organized into one or more communication orbits without any global control or coordination by a server or an administrator. The communication orbits are used for supporting network, security and system management communications in the managed network.

System, device, method, and computer program and computer program products for providing communicating between devices having similar or dissimilar characteristics and facilitating seamless interoperability between them. Computer program software and methods of and systems and devices for sharing of content, applications, resources and control across similar and dissimilar permanently or intermittently connected electronic devices. Devices, systems, appliances, and the like communicating and/or interoperating within the framework provided. A social synchronization interoperability method, such as a Dart Social Synchronization method provides an efficient and easy to administrate method for synchronizing specific sets of data and/or operations across any number of devices and protocols without the need for every device to contact a master device, or for any device to act as a master. Social synchronization of devices and content provides an advantageous alternative to mastered synchronization techniques.

A method includes determining a recommended aspect for content that includes at least one image. The recommended aspect is determined at least in part based on activity data that indicates aspects of other content authored by or interacted with by a plurality of authors in at least one social network, website, application software, or mobile application software (app). The method further includes generating the content including the at least one image according to the recommended aspect. The recommended aspect is an aspect of the at least one image.

In connection with a data distribution architecture, client-side deduplication techniques may be utilized for data transfers occurring among various file system nodes. In some examples, these deduplication techniques involve fingerprinting file system elements that are being shared and transferred, and dividing each file into separate units referred to as blocks or chunks. These separate units may be used for independently rebuilding a file from local and remote collections, storage locations, or sources. The deduplication techniques may be applied to data transfers to prevent unnecessary data transfers, and to reduce the amount of bandwidth, processing power, and memory used to synchronize and transfer data among the file system nodes. The described deduplication concepts may also be applied for purposes of efficient file replication, data transfers, and file system events occurring within and among networks and file system nodes.

Systems, apparatuses, and methods are directed to a first peer-to-peer (P2P) enabled device configured to wirelessly transmit a first request message and a second P2P-enabled device configured to wirelessly receive the first request message. In response to receiving the first request message, the second P2P-enabled device wirelessly transmits a second request message to the first P2P-enabled device, and if the first request message is rejected by the second P2P-enabled device, the second request message includes status control information indicating that the first request message is rejected. In addition, if the first request message is to be cancelled, the first P2P-enabled device transmits another request message to the second P2P-enabled device with status control information indicating that the first request message has been cancelled.

Localizing network traffic using network topology is provided. A request for content is received from a first peer of a peer-to-peer (P2P) network having a plurality of peers. In response to receiving a request for content, one or more peers to receive the requested content in the P2P network are determined. One or more nodes in a trace route from the first peer to a predetermined address that are common to the trace route from the one or more peers to the predetermined address are determined. The one or more common nodes are ordered by hops from the first peer. At least one peer is selected from the ordered one or more common nodes to recommend to the first peer. The selected at least one peer is recommended to the first peer. The first peer then connects with the recommended at least one peer and receive the content.

In connection with a data distribution architecture, client-side deduplication techniques may be utilized for data transfers occurring among various file system nodes. In some examples, these deduplication techniques involve fingerprinting file system elements that are being shared and transferred, and dividing each file into separate units referred to as blocks or chunks. These separate units may be used for independently rebuilding a file from local and remote collections, storage locations, or sources. The deduplication techniques may be applied to data transfers to prevent unnecessary data transfers, and to reduce the amount of bandwidth, processing power, and memory used to synchronize and transfer data among the file system nodes. The described deduplication concepts may also be applied for purposes of efficient file replication, data transfers, and file system events occurring within and among networks and file system nodes.

Among other things, participants who belong to a group/crowd or group of participants can provide indications of relative values of ideas that belong to a body of ideas. A rank ordering according to the relative values of at least some of the ideas of the body is derived based on the indications provided by the participants. The participants can provide the indications in two or more rounds. Each of at least some of the participants provide the indications with respect to fewer than all of the ideas in the body in each of the rounds. Between each of at least one pair of successive rounds, the set of ideas is updated to reduce the role of some of the ideas in the next round. Voting can by synchronous, i.e. more or less simultaneously, or asynchronous, i.e. where voting occurs as groups of voters are reaching a critical mass (min number) to allow distribution of ideas groups.

In one embodiment, a method for maintaining a blockchain in a blockchain system is disclosed. The method may include determining whether a number of blocks included in the blockchain satisfies a threshold block condition. The blocks comprise an initial genesis block and one or more subsequent blocks. The method may also include, responsive to determining the number of blocks in the blockchain satisfies the threshold block threshold condition, determining whether a number of nodes participating in the blockchain system satisfies a threshold node condition. The method may also include, responsive to determining the number of nodes participating in the blockchain satisfies the threshold node condition, generating a subsequent genesis block by hashing the blockchain including the genesis block and the one or more subsequent blocks.