Abstract: The invention relates to a method of masking data making up a user profile associated with a node of the network, a user profile consisting of a sub-set of elements present from among a set of possible elements. The masking method includes a step for obtaining an initial data structure including a pre-determined number of binary elements, a so-called binary element being able to have a value from two possible values, the initial data structure being representative of the elements present in the user profile, and, for at least one portion of said binary elements, a step for applying a probabilistic inversion operation of the value of said binary element, depending on a probability value calculated from a pre-determined confidentiality parameter, giving the possibility of obtaining a masked data structure representative of the elements present in the user profile.

Abstract: The present invention generally relates to distributed data storage systems. In particular, the present invention is related to a method of data storing in a distributed data storage system that comprises a clustering of data blocks and the use of random linear combinations of data blocks that makes the distributed data store system efficient in terms of storage space needed and inter-device communication costs, both for the storage method, as for the associated repair method.

Abstract: A method for determining the dynamics of a logical network, said network comprising a plurality of communication nodes (21, 24, 26, i, k). The method comprises obtaining (31), in a node (21) of the network, of at least one item of information (Li, Jk) relating to a modification of the neighborhood of said node, in the course of a predetermined period. The method also comprises determining (33), in said node of the network, of a local dynamics corresponding to at least one sum ( ? i ? L ? ? i , ? k ? J ? ? k ) of at least part of the information obtained.

Abstract: A method for determining the dynamics of a logical network, said network comprising a plurality of communication nodes (21, 24, 26, i, k). The method comprises obtaining (31), in a node (21) of the network, of at least one item of information (Li, Jk) relating to a modification of the neighborhood of said node, in the course of a predetermined period. The method also comprises determining (33), in said node of the network, of a local dynamics corresponding to at least one sum ( ? i ? L ? ? i , ? k ? J ? ? k ) of at least part of the information obtained.

Abstract: In an unstructured overlay network, each node in the network periodically tests logical network links among neighboring nodes to determine whether the links should be reorganized. A Metropolis scheme is used to determine the probability with which the links are reorganized. This probability is computed based on the change in link costs and/or node degrees that would be effected by a proposed reorganization. The Metropolis scheme tends to maintain a consistency among the degrees of the nodes, thereby providing strong failure resilience.

Abstract: In an unstructured overlay network, each node in the network periodically tests logical network links among neighboring nodes to determine whether the links should be reorganized. A Metropolis scheme is used to determine the probability with which the links are reorganized. This probability is computed based on the change in link costs and/or node degrees that would be effected by a proposed reorganization. The Metropolis scheme tends to maintain a consistency among the degrees of the nodes, thereby providing strong failure resilience.

Abstract: A system and method for the dissemination of information to a plurality of nodes, the nodes connected in a network environment. Each node maintains a partial view of the network that identifies some of the other network nodes. The act of sending the message to a plurality of nodes further comprises delivery of the message to all nodes identified in the partial view. The partial view is created through a decentralized subscription process.