公开(公告)号：US07738404B2

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

申请号：US11656465

申请日：2007-01-23

申请人： Supratim Deb ,  Srinivas Kashyap ,  Naidu K V M ,  Rajeev Rastogi ,  Anand Srinivasan

发明人： Supratim Deb ,  Srinivas Kashyap ,  Naidu K V M ,  Rajeev Rastogi ,  Anand Srinivasan

IPC分类号： H04L12/28

CPC分类号： H04L67/104 ,  H04L45/46 ,  H04L67/1046 ,  H04L67/1051 ,  H04L67/12

摘要： A method of grouping nodes within a distributed network is provided. The example method includes performing a leader node self determination operation by which each node within the distributed network determines whether to become a leader node or a non-leader node, each leader node being the leader of a group including at least one node. Next, requests are sent, from each leader node, requesting at least one non-leader node to join the group associated with the leader node. First received requests are accepted, at each non-leader node, such that accepting non-leader nodes transition from a non-leader node to a dependent node dependent upon the requesting leader node. A next set of requests are sent, from each remaining non-leader node, requesting to join the group associated with at least one leader node. A determination is made, at each requested leader node, as to whether to accept the non-leader node into the group associated with the requested leader node. Based on the determination, at each requested leader node, the non-leader node is either accepted into the group associated with the requested leader node, or is alternatively rejected from the group.

摘要翻译： 提供了一种在分布式网络内对节点进行分组的方法。 示例性方法包括执行前导节点自我确定操作，通过该前导节点自我确定操作，分布式网络内的每个节点确定是否成为领导节点或非前导节点，每个首领节点是包括至少一个节点的组的首领。 接下来，从每个领导节点发送请求，请求至少一个非前导节点加入与该领导节点相关联的组。 在每个非前导节点处接收第一接收的请求，使得接受非前导节点从非前导节点到依赖于请求的领导节点的依赖节点的转换。 从每个剩余的非前导节点发送下一组请求，请求加入与至少一个前导节点相关联的组。 在每个请求的领导节点处，确定是否将非前导节点接受到与所请求的领导节点相关联的组中。 基于确定，在每个请求的领导节点处，非前导节点被接受到与所请求的领导节点相关联的组中，或者被替代地从组中被拒绝。

公开(公告)号：US20080175169A1

公开(公告)日：2008-07-24

申请号：US11656465

申请日：2007-01-23

申请人： Supratim Deb ,  Srinivas Kashyap ,  Naidu K V M ,  Rajeev Rastogi ,  Anand Srinivasan

发明人： Supratim Deb ,  Srinivas Kashyap ,  Naidu K V M ,  Rajeev Rastogi ,  Anand Srinivasan

IPC分类号： H04L12/28

CPC分类号： H04L67/104 ,  H04L45/46 ,  H04L67/1046 ,  H04L67/1051 ,  H04L67/12

摘要： A method of grouping nodes within a distributed network is provided. The example method includes performing a leader node self determination operation by which each node within the distributed network determines whether to become a leader node or a non-leader node, each leader node being the leader of a group including at least one node. Next, requests are sent, from each leader node, requesting at least one non-leader node to join the group associated with the leader node. First received requests are accepted, at each non-leader node, such that accepting non-leader nodes transition from a non-leader node to a dependent node dependent upon the requesting leader node. A next set of requests are sent, from each remaining non-leader node, requesting to join the group associated with at least one leader node. A determination is made, at each requested leader node, as to whether to accept the non-leader node into the group associated with the requested leader node. Based on the determination, at each requested leader node, the non-leader node is either accepted into the group associated with the requested leader node, or is alternatively rejected from the group.

摘要翻译： 提供了一种在分布式网络内对节点进行分组的方法。 示例性方法包括执行前导节点自我确定操作，通过该前导节点自我确定操作，分布式网络内的每个节点确定是否成为领导节点或非前导节点，每个首领节点是包括至少一个节点的组的首领。 接下来，从每个领导节点发送请求，请求至少一个非前导节点加入与该领导节点相关联的组。 在每个非前导节点处接收第一接收的请求，使得接受非前导节点从非前导节点到依赖于请求的领导节点的依赖节点的转换。 从每个剩余的非前导节点发送下一组请求，请求加入与至少一个前导节点相关联的组。 在每个请求的领导节点处，确定是否将非前导节点接受到与所请求的领导节点相关联的组中。 基于确定，在每个请求的领导节点处，非前导节点被接受到与所请求的领导节点相关联的组中，或者被替代地从组中被拒绝。

公开(公告)号：US20060149753A1

公开(公告)日：2006-07-06

申请号：US11026550

申请日：2004-12-30

申请人： Muriel Medard ,  Supratim Deb ,  Ralf Koetter

发明人： Muriel Medard ,  Supratim Deb ,  Ralf Koetter

IPC分类号： G06F17/30

CPC分类号： H04L67/1095 ,  G06F17/30209 ,  H04L67/104

摘要： A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is detrmined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.

摘要翻译： 提出了一种用于向分布式数据存储提供随机线性编码方法的方法和计算机程序产品。 文件被分成多个部分。 对于每个对等体（对等体意味着具有有限存储空间的存储位置），确定对等体可以存储的编码的数量。 每个编码器通过采用整个文件的所有片段的随机线性组合来确定。 为每个编码块存储关联码矢量。 通过收集来自对等体的代码矢量和编码块并以收集的码矢量作为矩阵来检索文件。 当矩阵的维数等于文件的数量时，使用矩阵中的代码向量的集合来恢复文件。