公开(公告)号：US08812801B2

公开(公告)日：2014-08-19

申请号：US13200021

申请日：2011-09-15

申请人： Alexandre Van Kempen ,  Erwan Le Merrer ,  Nicolas Le Scouarnec

发明人： Alexandre Van Kempen ,  Erwan Le Merrer ,  Nicolas Le Scouarnec

IPC分类号： G06F12/16 ,  G06F3/06 ,  H04L29/08

CPC分类号： G06F3/067 ,  G06F3/065 ,  G06F17/30215 ,  G06F17/30578 ,  H04L29/08 ,  H04L41/0668 ,  H04L43/0811

摘要： A replication set of k storage devices is defined, that stores a particular data item. Each device in the replication set has an associated timer for which a timeout value for disconnection is determined based on individual downtime data distribution of the device. A new device for storing the data item is added to the replication set when the timer expires for a device in the replication set, and if the number of devices in the replication set that are still connected is below a predetermined threshold. Timeout values are adapted according to a factor of criticalness determined for the replication set, resulting in a more reactive, or on the contrary, a less reactive replacement of devices in the replication set. The factor of criticalness is determined according to a difference between the connected devices in the replication set and the predetermined number k.

摘要翻译： 定义k个存储设备的复制集，其存储特定的数据项。 复制集中的每个设备都有一个关联的定时器，根据设备的个别停机时间数据分配，确定断开连接的超时值。 如果复制集中的设备的定时器到期，并且仍在连接的复制集中的设备数量低于预定阈值，则将新数据项存储的新设备添加到复制集中。 超时值根据为复制集确定的关键程度的因素进行调整，从而产生更多的反应性，或相反，复制集中设备的反应性较小。 关键性因素根据复制集中连接的设备与预定数量k之间的差异来确定。

公开(公告)号：US20120072689A1

公开(公告)日：2012-03-22

申请号：US13200021

申请日：2011-09-15

申请人： Alexandre Van Kempen ,  Erwan Le Merrer ,  Nicolas Le Scouarnec

发明人： Alexandre Van Kempen ,  Erwan Le Merrer ,  Nicolas Le Scouarnec

IPC分类号： G06F12/16

CPC分类号： G06F3/067 ,  G06F3/065 ,  G06F17/30215 ,  G06F17/30578 ,  H04L29/08 ,  H04L41/0668 ,  H04L43/0811

摘要： 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.

摘要翻译： 本发明一般涉及分布式数据存储系统。 特别地，本发明涉及根据确保期望的数据复制水平所需的数据副本的数量来优化分布式存储系统。

公开(公告)号：US07940197B2

公开(公告)日：2011-05-10

申请号：US12657636

申请日：2010-01-25

申请人： Nicolas Le Scouarnec ,  Mary-Luc Champel

发明人： Nicolas Le Scouarnec ,  Mary-Luc Champel

IPC分类号： H03M7/00

CPC分类号： H03M13/3761 ,  H03M13/1102 ,  H03M13/1111 ,  H04L1/0041 ,  H04L2001/0097

摘要： 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.

摘要翻译： 网络重编码装置旨在重新编码要发送到连接到网络的至少一个通信设备的编码符号。 该网络重新编码装置包括重新编码装置，其被重新编码由代表编码符号的LT代码符号定义的输出节点，分别代表定义其值必须是的解码符号的输入节点之间的XOR布尔运算结果 通过组合具有已知值的所选择的输入节点和/或输出节点来发现并将它们链接到Tanner图中，以便产生定义所准备好被发送的所生成的输出节点的新的LT代码符号。

公开(公告)号：US20100094938A1

公开(公告)日：2010-04-15

申请号：US12586694

申请日：2009-09-25

申请人： Nicolas Le Scouarnec ,  Mary-Luc Champel ,  Ludovic Jeanne

发明人： Nicolas Le Scouarnec ,  Mary-Luc Champel ,  Ludovic Jeanne

IPC分类号： G06F15/16

CPC分类号： H04L67/104 ,  H04L69/18

摘要： 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.

摘要翻译： 一种专用于能够通过通信设备（E1-E4）连接到提供对因特网的接入的第一通信网络（R1）的对等体（P1-P4）之间的对等模式中的数据传输的方法， 第二通信网络（R2）。 该方法包括：当在第一对等端（P1）中运行的对等类型（A）的通信应用必须向相同通信应用（A）运行的至少一个第二对等体（P3）发送数据时， i）根据被选择执行其传输的至少一个标准选择第一（R1）和第二（R2）网络中的一个，以及ii）在通过其设备（E1）将第一对等端（P1）连接到 网络被选择以经由所选网络将对等模式中的数据传输到第二对等端（P3）。

公开(公告)号：US09519800B2

公开(公告)日：2016-12-13

申请号：US13937176

申请日：2011-12-16

申请人： Luis Montalvo ,  Nicolas Le Scouarnec ,  Serge Defrance ,  Frederic Lefebvre ,  Patrick Perez

发明人： Luis Montalvo ,  Nicolas Le Scouarnec ,  Serge Defrance ,  Frederic Lefebvre ,  Patrick Perez

IPC分类号： H04L9/32 ,  G06F21/62 ,  G06F17/30 ,  G06F21/64

CPC分类号： G06F21/6245 ,  G06F17/30244 ,  G06F21/62 ,  G06F21/6218 ,  G06F21/6272 ,  G06F21/64 ,  G06F2221/2107 ,  H04L9/3236

摘要： 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.

摘要翻译： 用于在线存储的设备和方法，用于搜索类似内容的设备和方法，设备和传输方法以及设备和方法。 加密数据保存在在线服务提供商处。 使用加密数据，使用公钥保存加密散列数据，并使用加密散列对要保存的内容进行加密。 这有利于在网络服务提供商处的数据复制被阻止，同时保持服务用户的私人生活。 为了搜索类似于参考多媒体数据的内容，指纹也被保存在服务提供商处。 为了限制返回的误报数量，指纹还可以包含搜索指纹，加密的选择指纹。

公开(公告)号：US20100205245A1

公开(公告)日：2010-08-12

申请号：US12658126

申请日：2010-02-03

申请人： Nicolas Le Scouarnec ,  Mary-Luc Champel

发明人： Nicolas Le Scouarnec ,  Mary-Luc Champel

IPC分类号： G06F15/16

CPC分类号： H04L67/104 ,  H04L47/10 ,  H04L67/1082

摘要： 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.

摘要翻译： 一种专用于在能够连接到通信网络（R）的对等体（P1-P4）之间对等模式中的数据传输管理的方法，每个传输由对等体（P1）执行，在接收到请求之后 根据所选择的互惠机制，从另一个对等端（P2）。 该方法包括：当对等体（P2）想要从另一个对等体（P1）接收根据在一组至少两个不同优先级中选择的第一优先级Xk的N个数据块时，在向该对等体（P2）分配时， 根据在该集合中选择的第二优先级Xk'等于要发送到至少一个其他对等体（P1）的数据块数M的交换值，M等于N * mkk'，其中mkk'是 第一Xk和第二Xk'选择的优先级的预定值函数。

公开(公告)号：US20100188271A1

公开(公告)日：2010-07-29

申请号：US12657636

申请日：2010-01-25

申请人： Nicolas Le Scouarnec ,  Mary-Luc CHAMPEL

发明人： Nicolas Le Scouarnec ,  Mary-Luc CHAMPEL

IPC分类号： H03M7/34 ,  G06F15/16

CPC分类号： H03M13/3761 ,  H03M13/1102 ,  H03M13/1111 ,  H04L1/0041 ,  H04L2001/0097

摘要： 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.

摘要翻译： 网络重编码装置旨在重新编码要发送到连接到网络的至少一个通信设备的编码符号。 该网络重新编码装置包括重新编码装置，其被重新编码由代表编码符号的LT代码符号定义的输出节点，分别代表定义其值必须是的解码符号的输入节点之间的XOR布尔运算结果 通过组合具有已知值的所选择的输入节点和/或输出节点来发现并将它们链接到Tanner图中，以便产生定义所准备好被发送的所生成的输出节点的新的LT代码符号。

公开(公告)号：US08407283B2

公开(公告)日：2013-03-26

申请号：US12737295

申请日：2009-06-30

申请人： Nicolas Le Scouarnec ,  Mary-Luc Champel

发明人： Nicolas Le Scouarnec ,  Mary-Luc Champel

IPC分类号： G06F15/16

CPC分类号： H04L67/104 ,  H04L67/1059 ,  H04L67/1076

摘要： 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.

摘要翻译： 一种方法旨在在连接到至少一个通信网络的对等体之间以对等模式传播内容数据。 该方法包括以下步骤：i）使对等体在它们之间交换相邻信息，以构建包括第一组的双重对等层覆盖，包括具有要传播的完整内容的对等体，以及第二组，包括不具有该内容的对等体 其一部分并且在它们之间具有链接，ii）根据第二组的第二组的第一对等体，将定义内容（并且优选地由擦除校正码编码）的数据传播到第二组的第一对等体，iii）传播 所述第一对等体根据所述第二组对等体重叠向所述第二组的其他对等体接收的数据，以及iv）当所述第二组的对等方已经完全完成所述内容时，更新所述二分对等体覆盖。

公开(公告)号：US20120278371A1

公开(公告)日：2012-11-01

申请号：US13446268

申请日：2012-04-13

申请人： Luis Montalvo ,  Serge Defrance ,  Nicolas Le Scouarnec

发明人： Luis Montalvo ,  Serge Defrance ,  Nicolas Le Scouarnec

IPC分类号： G06F17/30 ,  G06F15/173

CPC分类号： H04L67/1097 ,  G06F16/1748 ,  G06F16/182 ,  H04L63/0428 ,  H04L63/10

摘要： 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.

摘要翻译： 本发明涉及一种在线存储系统中通过局域网从用户客户端设备通过连接到客户端设备的网关通过广域网向在线存储系统上载文件的方法。 在线存储系统包括耦合到要存储文件的目标存储设备的存储服务器。 网关从用户客户端设备接收上传的文件。 如果文件不存在于目标存储设备中，则网关将文件上传到目标存储设备，并且如果文件存在于目标存储设备中，则网关创建到存储在目标存储设备中的文件的链接。

公开(公告)号：US08219612B2

公开(公告)日：2012-07-10

申请号：US12658126

申请日：2010-02-03

申请人： Nicolas Le Scouarnec ,  Mary-Luc Champel

发明人： Nicolas Le Scouarnec ,  Mary-Luc Champel

IPC分类号： G06F15/16

CPC分类号： H04L67/104 ,  H04L47/10 ,  H04L67/1082

摘要： 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.

摘要翻译： 根据所选择的互易机制，专用于管理在对等体之间可连接到通信网络的对等体之间的数据传输的方法，每个传输由对等体执行，在接收到来自另一个对等体的请求之后。 当对等体希望从另一个对等体接收根据在至少两个不同优先级的集合中选择的第一优先级X k的N个数据块时，在向该对等体分配等价于数据块数量M的交换值时 根据在该集合中选择的第二优先级Xk'被发送到至少一个其他对等体，M等于N * mkk'，其中mkk'是第一Xk和第二Xk'选择优先级的预定值函数。