公开(公告)号：US08976706B2

公开(公告)日：2015-03-10

申请号：US13582544

申请日：2010-03-12

申请人： Jouni Maenpaa ,  Jani Hautakorpi ,  Ari Keranen

发明人： Jouni Maenpaa ,  Jani Hautakorpi ,  Ari Keranen

IPC分类号： H04L12/28 ,  H04L29/08

CPC分类号： H04L67/104 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1046 ,  H04L67/1055 ,  H04L67/1065

摘要： System and method for balancing a number of incoming connections of nodes connected to a peer-to-peer network. The method includes receiving at a selecting node information about out-finger candidates. The information includes at least a quantifiable parameter for the out-finger candidates and the out-finger candidates are possible nodes to be connected to the selecting node. The method includes calculating in the selecting node, for each node of the out-finger candidates, a probability value by using a predetermined probability function that uses as input the corresponding quantifiable parameter; and selecting one node from the out-finger candidates to be an out-finger node for the selection node based on the probability value. The probability value is associated with a number of in-finger connections to the selected out-finger node.

摘要翻译： 用于平衡连接到对等网络的节点的多个传入连接的系统和方法。 该方法包括在选择节点处接收关于外拨候选的信息。 所述信息至少包括用于外拨候选的可量化参数，而手指外候选是可连接到选择节点的可能节点。 该方法包括：通过使用将预定概率函数作为输入使用相应的可量化参数，计算选择节点对于外拨候选的每个节点的概率值; 并且根据所述概率值，从所述输入外候选中选择一个节点作为所述选择节点的手指外节点。 概率值与到所选择的外手指节点的指状连接的数量相关联。

公开(公告)号：US20120110057A1

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

申请号：US13378883

申请日：2009-06-26

申请人： Jani Hautakorpi ,  Ari Keranen ,  Jouni Maenpaa

发明人： Jani Hautakorpi ,  Ari Keranen ,  Jouni Maenpaa

IPC分类号： G06F15/16

CPC分类号： H04L67/104 ,  H04L67/1065

摘要： This invention includes a method and a node (302) for locating objects in a structured overlay peer-to-peer network (500). Known distributed hash table DHT algorithms are not well suited for wild card searches. This problem has been solved by the current invention by using a node (302) configured with a finger table (310) and a stochastic selector (503) adapted to perform a stochastic search algorithm. In a preferred embodiment of the invention the stochastic search algorithm uses weighted probability values that are assigned to each established connection (312, 313, 314) between the node (302) and other nodes (303, 304, 305) in the overlay peer-to-peer network (500).

摘要翻译： 本发明包括用于定位结构化覆盖对等网络（500）中的对象的方法和节点（302）。 已知的分布式哈希表DHT算法不太适用于通配符搜索。 通过使用配置有手指表（310）的节点（302）和适于执行随机搜索算法的随机选择器（503），本发明已经解决了该问题。 在本发明的优选实施例中，随机搜索算法使用被分配给覆盖对等体中的节点（302）和其他节点（303,304,305）之间的每个建立的连接（312,313,314）的加权概率值， 对等网络（500）。

公开(公告)号：US09686353B2

公开(公告)日：2017-06-20

申请号：US13378883

申请日：2009-06-26

申请人： Jani Hautakorpi ,  Ari Keranen ,  Jouni Maenpaa

发明人： Jani Hautakorpi ,  Ari Keranen ,  Jouni Maenpaa

IPC分类号： G06F15/16 ,  H04L29/08

CPC分类号： H04L67/104 ,  H04L67/1065

摘要： This invention includes a method and a node (302) for locating objects in a structured overlay peer-to-peer network (500). Known distributed hash table DHT algorithms are not well suited for wild card searches. This problem has been solved by the current invention by using a node (302) configured with a finger table (310) and a stochastic selector (503) adapted to perform a stochastic search algorithm. In a preferred embodiment of the invention the stochastic search algorithm uses weighted probability values that are assigned to each established connection (312, 313, 314) between the node (302) and other nodes (303, 304, 305) in the overlay peer-to-peer network (500).

公开(公告)号：US20130028411A1

公开(公告)日：2013-01-31

申请号：US13394514

申请日：2012-01-13

申请人： Jari Arkko ,  Heidi-Maria Rissanen ,  Oscar Novo Diaz ,  Ari Keranen

发明人： Jari Arkko ,  Heidi-Maria Rissanen ,  Oscar Novo Diaz ,  Ari Keranen

IPC分类号： G06F21/24

CPC分类号： H04L9/0833 ,  H04L9/0866 ,  H04L9/3255 ,  H04L63/123 ,  H04L2209/805 ,  H04W4/08 ,  H04W4/70 ,  H04W12/0052 ,  H04W12/10

摘要： A group identity for a set of devices is generated by acquiring an identity for each one of the devices and joining the identities into a common identity data set. A group identity for the set of devices is created by performing a hash function on the common identity set and using a resulting hash value as the group identity. A group identity for a set of devices is verified by acquiring a first group identity from a trusted party. An identity is acquired from each device in the set and the identities are joined into a common identity data set and a second group identity is created for the set of devices by performing a hash function on the common identity data set. A determination is made whether there is a match between the first group identity and the second group identity.

摘要翻译： 通过获取每个设备的身份并将身份加入到公共身份数据集中来生成一组设备的组标识。 通过在公共标识集上执行散列函数并使用生成的散列值作为组标识来创建该组设备的组标识。 通过从可信方获取第一组身份来验证一组设备的组标识。 从集合中的每个设备获取身份，并且将身份连接到公共标识数据集中，并且通过在公共标识数据集上执行散列函数来为该组设备创建第二组标识。 确定第一组身份和第二组身份之间是否存在匹配。