Abstract: A map reduce frame work for large scale data processing is optimized by the method of the invention that can be implemented by a master node. The method comprises reception of data from worker nodes on read pointer locations pointing to input data of tasks executed by these worker nodes and stealing of work from these tasks, the work being stolen being applied to input data that have not yet been processed by the task from which work is stolen.

Abstract: The invention proposes a method and device for adding redundancy data in a distributed data storage system. Among others, the invention allows to keep impact on network resources low through the use of coordinated regenerating codes according to the invention.

Abstract: The invention relates to a device and a method for online storage, device and method for searching for similar content, a device and a method of transmission and a device and a method. Encrypted data is saved at a provider of online services. With the encrypted data, encrypted hashing data is saved with a public key and the content to save is encrypted with the encrypted hash. This advantageously enables data duplication at the online service provider to be prevented while preserving the private life of the users of the service. In order to search for content similar to reference multimedia data, fingerprints are also saved at the service provider. In order to limit the number of false positives returned, the fingerprint can further contain a search fingerprint, an encrypted selection fingerprint.

Abstract: A method is intended for disseminating content data in a peer-to-peer mode between peers connected to at least one communication network. This method comprises the steps of: i) making peers exchange neighboring information between them to build a bipartite peer overlay comprising a first group, comprising peers having a complete content to be disseminated, and a second group, comprising peers having not this content or only a part of it and having links therebetween, ii) disseminating the data defining the content (and preferably encoded with erasure correcting codes) from peers of the first group to first peers of the second group according to the bipartite peer overlay, iii) disseminating the data received by the first peers to other peers of the second group according to the bipartite peer overlay, and iv) updating the bipartite peer overlay when a peer of the second group has fully completed the content.

Abstract: The present invention relates to a method for uploading in an on-line storage system a file from a user client device through a gateway connected to the client device through a local area network and to the on-line storage system through a wide area network. The on-line storage system comprises a storage server coupled to a target storage device in which the file is to be stored. A gateway receives from the user client device an uploaded file. If the file is not present in the target storage device, the gateway uploads the file to the target storage device, and if the file is present in the target storage device, the gateway creates a link to the file stored in the target storage device.

Abstract: A method dedicated to the management of data transmission in peer to peer mode between peers that can connect to a communication network, each transmission being carried out by a peer, following the reception of a request from another peer, according to a selected reciprocity mechanism. When a peer wants to receive from another peer N blocks of data according to a first priority level Xk selected in a set of at least two different priority levels, in assigning to this peer an exchange value equivalent to a number M of blocks of data to be transmitted to at least one other peer according to a second priority level Xk? selected in this set, M being equal to N*mkk?, where mkk? is a predetermined value function of the first Xk and second Xk? selected priority levels.

Abstract: The present invention concerns a method of transferring content from a first communication device to a second communication device in a communication network, comprising the following steps: defining a first probability, according to which a content can be encoded; defining a second probability, according to which a content can be chosen; upon request of content from said second communication device to said first communication device: encoding content with another content according to said first probability, said content being chosen with said second probability, and transferring content z=x XOR y from said first communication device to said second communication device, or according to probability 1-pe transferring unencoded content x from said first communication device to said second communication device.

Abstract: The present invention generally relates to distributed data storage systems. In particular, the present invention relates to optimization of the distributed storage system in terms of number of data replicas needed to ensure a desired level of data replication.

Abstract: The invention proposes a method and device for adding redundancy data in a distributed data storage system. Among others, the invention allows to keep impact on network resources low through the use of coordinated regenerating codes according to the invention.

Abstract: A method is intended for disseminating content data in a peer-to-peer mode between peers connected to at least one communication network. This method comprises the steps of: i) making peers exchange neighboring information between them to build a bipartite peer overlay comprising a first group, comprising peers having a complete content to be disseminated, and a second group, comprising peers having not this content or only a part of it and having links therebetween, ii) disseminating the data defining the content (and preferably encoded with erasure correcting codes) from peers of the first group to first peers of the second group according to the bipartite peer overlay, iii) disseminating the data received by the first peers to other peers of the second group according to the bipartite peer overlay, and iv) updating the bipartite peer overlay when a peer of the second group has fully completed the content.

Abstract: A network re-encoding device is intended for re-encoding encoded symbols to be transmitted to at least one communication equipment connected to a network. This network re-encoding device comprises a re-encoding means arranged for re-encoding output nodes, defined by LT code symbols representative of encoded symbols and representative respectively of the results of XOR Boolean operation between input nodes defining decoded symbols whose values have to be discovered and to which they are linked into a Tanner graph, by combining chosen input node and/or output node having known values, in order to produce new LT code symbols defining generated output nodes ready to be transmitted.

Abstract: A method dedicated to the management of data transmission in peer to peer mode between peers (P1-P4) that can connect to a communication network (R), each transmission being carried out by a peer (P1), following the reception of a request from another peer (P2), according to a selected reciprocity mechanism. This method consists, when a peer (P2) wants to receive from another peer (P1) N blocks of data according to a first priority level Xk selected in a set of at least two different priority levels, in assigning to this peer (P2) an exchange value equivalent to a number M of blocks of data to be transmitted to at least one other peer (P1) according to a second priority level Xk? selected in this set, M being equal to N*mkk?, where mkk? is a predetermined value function of the first Xk and second Xk? selected priority levels.

Abstract: A network re-encoding device is intended for re-encoding encoded symbols to be transmitted to at least one communication equipment connected to a network. This network re-encoding device comprises a re-encoding means arranged for re-encoding output nodes, defined by LT code symbols representative of encoded symbols and representative respectively of the results of XOR Boolean operation between input nodes defining decoded symbols whose values have to be discovered and to which they are linked into a Tanner graph, by combining chosen input node and/or output node having known values, in order to produce new LT code symbols defining generated output nodes ready to be transmitted.

Abstract: A method is dedicated to data transmission in peer-to-peer mode between peers (P1-P4) being able to connect by means of communication equipment (E1-E4) to a first communication network (R1) providing access to the Internet and to a second communication network (R2). This method consists, when a communication application of the peer-to-peer type (A) running in a first peer (P1) must transmit data to at least one second peer (P3) in which the same communication application (A) runs, i) in choosing one of the first (R1) and second (R2) networks according to at least one criterion chosen to perform its transmission, and ii) in connecting the first peer (P1), via its equipment (E1), to the network chosen to transmit the data in peer-to-peer mode to the second peer (P3), via this chosen network.