-
公开(公告)号：US20110231491A1
公开(公告)日：2011-09-22
申请号：US13063970
申请日：2009-01-08
申请人： Jani Hautakorpi , Arturo Salinas
发明人： Jani Hautakorpi , Arturo Salinas
IPC分类号： G06F15/16
CPC分类号： H04L29/12594 , H04L29/12094 , H04L61/1529 , H04L61/3085 , H04L65/1006 , H04L65/104 , H04L67/104 , H04L67/1091
摘要： A method of facilitating communication between users of a SIP-based network and SIP users external to that network. Each user of the SIP-based network possesses a SIP URI comprising a host name part belonging to the network and a user name part. The external users have access to a peer-to-peer network to resolve SIP URIs into contact IP addresses. The method comprises publishing into said peer-to-peer network a mapping between an identifier of a gateway to said SIP-based network and an IP address of the gateway. The identifier corresponds to or is derivable from said host name part. Upon receipt of a query at the gateway in respect of a URI associated with one of said users of said SIP-based network, the URI is resolved into a contact IP address. The contact IP address is returned to a node from which the query originated. Also provided is apparatus configured to provide a SIP user agent and gateway apparatus for facilitating communication between users of a SIP-based network and SIP users external to that network.
摘要翻译： 一种促进基于SIP的网络的用户与该网络外部的SIP用户之间的通信的方法。 基于SIP的网络的每个用户具有包括属于网络的主机名部分和用户名部分的SIP URI。 外部用户可以访问对等网络，将SIP URI解析为联系人IP地址。 该方法包括向所述对等网络发布网关到所述基于SIP的网络的标识符与网关的IP地址之间的映射。 标识符对应于或可从所述主机名部分导出。 在关于与所述基于SIP的网络的所述用户之一相关联的URI的网关处接收到查询后，将URI解析为联系人IP地址。 联系人IP地址返回到查询发起的节点。 还提供了用于提供用于促进基于SIP的网络的用户与该网络外部的SIP用户之间的通信的SIP用户代理和网关装置的装置。
-
公开(公告)号：US08965969B2
公开(公告)日：2015-02-24
申请号：US13063970
申请日：2009-01-08
申请人： Jani Hautakorpi , Arturo Salinas
发明人： Jani Hautakorpi , Arturo Salinas
CPC分类号： H04L29/12594 , H04L29/12094 , H04L61/1529 , H04L61/3085 , H04L65/1006 , H04L65/104 , H04L67/104 , H04L67/1091
摘要： A method and apparatus each facilitate communication between users of a SIP-based network and SIP users external to that network. Each user of the SIP-based network possesses a SIP URI comprising a host name part belonging to the network and a user name part. The external users have access to a peer-to-peer network to resolve SIP URIs into contact IP addresses. The method comprises publishing into said peer-to-peer network a mapping between an identifier of a gateway to said SIP-based network and an IP address of the gateway. The identifier corresponds to or is derivable from said host name part. Upon receipt of a query at the gateway in respect of a URI associated with one of said users of said SIP-based network, the URI is resolved into a contact IP address. The contact IP address is returned to a node from which the query originated.
摘要翻译： 一种方法和装置，每个促进基于SIP的网络的用户与该网络外部的SIP用户之间的通信。 基于SIP的网络的每个用户具有包括属于网络的主机名部分和用户名部分的SIP URI。 外部用户可以访问对等网络，将SIP URI解析为联系人IP地址。 该方法包括向所述对等网络发布网关到所述基于SIP的网络的标识符与网关的IP地址之间的映射。 标识符对应于或可从所述主机名部分导出。 在关于与所述基于SIP的网络的所述用户之一相关联的URI的网关处接收到查询后，将URI解析为联系人IP地址。 联系人IP地址返回到查询发起的节点。
-
公开(公告)号：US20120158756A1
公开(公告)日：2012-06-21
申请号：US12976808
申请日：2010-12-22
申请人： Jaime Jiménez , Jani Hautakorpi , Jouni Mäenpää
发明人： Jaime Jiménez , Jani Hautakorpi , Jouni Mäenpää
IPC分类号： G06F17/30
CPC分类号： H04L67/1065 , G06F16/1834 , G06F16/9014
摘要： Embodiments herein include a method and apparatus for searching a structured peer-to-peer (P2P) network. A requesting node obtains a search term and generates a Bloom filter using the search term. The Bloom filter is sent to a searching node, which compares the received Bloom filter with at least one further Bloom filter stored at a database accessible by the searching node. The further Bloom filter is associated a further node in the P2P network. In the event that the Bloom filter and the further Bloom filter match, the searching node sends towards the requesting node an identity of the further node. This allows the requesting node to query the further node for the required data.
摘要翻译： 本文的实施例包括用于搜索结构化对等（P2P）网络的方法和装置。 请求节点获得搜索项，并使用搜索项生成布隆过滤器。 Bloom过滤器被发送到搜索节点，该搜索节点将接收的Bloom过滤器与存储在可由搜索节点访问的数据库处的至少一个另外的Bloom过滤器进行比较。 进一步的Bloom过滤器与P2P网络中的另一个节点相关联。 在Bloom过滤器和进一步的Bloom过滤器匹配的情况下，搜索节点向请求节点发送另一个节点的标识。 这允许请求节点向另一个节点查询所需的数据。
-
公开(公告)号：US20120197962A1
公开(公告)日：2012-08-02
申请号：US13498323
申请日：2009-10-21
申请人： Jouni Mäenpää , Jani Hautakorpi , Ari Keränen
发明人： Jouni Mäenpää , Jani Hautakorpi , Ari Keränen
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L67/1065 , H04L67/1076
摘要： The present invention relates to methods and arrangements for locating services in a structured peer-to-peer distributed hash table, DHT, based, overlay communication network (310). The invention comprises two inter-related methods and nodes. The first method is used by a service node (321) to “advertise” to the overlay network (310) that it is providing a particular service (S1). This is done by distributing instances (351,352,353) of a service object (O1) that are stored in different nodes (331,332,333) in the overlay network (310) and where the instances (351,352,353) comprise an address to the service node (321). The other method is to locate at least one of these instances (351,352,353) with a predetermined probability and with a predetermined number of location request messages (390) from a user node (311) wishing to use the particular service (S1).
摘要翻译： 本发明涉及在结构化对等分布式散列表（基于DHT）的覆盖通信网络（310）中定位业务的方法和装置。 本发明包括两个相互关联的方法和节点。 服务节点（321）使用第一种方法来向覆盖网络（310）“通告”它提供特定服务（S1）。 这通过分配存储在覆盖网络（310）中的不同节点（331,332,333）中的服务对象（O1）的实例（351,352,353），并且实例（351,352,353）包括到服务节点（321）的地址。 另一种方法是以希望使用特定服务（S1）的用户节点（311）以预定概率和预定数量的位置请求消息（390）定位这些实例中的至少一个（351,352,353）。
-
公开(公告)号：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）。
-
公开(公告)号：US20110093615A1
公开(公告)日：2011-04-21
申请号：US12999917
申请日：2008-07-02
申请人： Oscar Novo Diaz , Jani Hautakorpi
发明人： Oscar Novo Diaz , Jani Hautakorpi
IPC分类号： G06F15/173
CPC分类号： H04L67/104 , H04L67/1002 , H04L67/1021 , H04L67/1068
摘要： A method and apparatus for selecting a peer node in a P2P network. A requesting peer node in the P2P network requests geographical location information relating to a plurality of target peer nodes. In response to the request, the requesting node receives geographical location information for each target peer node. The requesting node uses the geographical location information and other information to select a target peer node. The request may either be sent to each target peer node, or to a central resource record peer node that maintains geographic location information for each target peer node. This allows target peer nodes to be selected on the basis of their location, and provides advantages in terms of trust depending on location, and allowed content depending on location.
摘要翻译： 一种用于在P2P网络中选择对等节点的方法和装置。 P2P网络中的请求对等节点请求与多个目标对等节点相关的地理位置信息。 响应于该请求，请求节点接收每个目标对等节点的地理位置信息。 请求节点使用地理位置信息和其他信息来选择目标对等节点。 可以将请求发送到每个目标对等节点，或者发送到维护每个目标对等节点的地理位置信息的中央资源记录对等节点。 这允许基于其位置来选择目标对等节点，并且根据位置的信任和根据位置允许的内容提供优点。
-
公开(公告)号：US08976706B2
公开(公告)日：2015-03-10
申请号：US13582544
申请日：2010-03-12
申请人： Jouni Maenpaa , Jani Hautakorpi , Ari Keranen
发明人： Jouni Maenpaa , Jani Hautakorpi , Ari Keranen
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.
摘要翻译： 用于平衡连接到对等网络的节点的多个传入连接的系统和方法。 该方法包括在选择节点处接收关于外拨候选的信息。 所述信息至少包括用于外拨候选的可量化参数，而手指外候选是可连接到选择节点的可能节点。 该方法包括：通过使用将预定概率函数作为输入使用相应的可量化参数，计算选择节点对于外拨候选的每个节点的概率值; 并且根据所述概率值，从所述输入外候选中选择一个节点作为所述选择节点的手指外节点。 概率值与到所选择的外手指节点的指状连接的数量相关联。
-
公开(公告)号：US08817595B2
公开(公告)日：2014-08-26
申请号：US12867749
申请日：2009-01-14
IPC分类号： G01R31/08
CPC分类号： H04L67/104 , H04L45/22 , H04L45/28 , H04L45/64 , H04L67/1048 , H04L67/1065 , H04L69/40
摘要： An overlay network node is arranged to provide robust reply routing for requests and replies travelling over the network. Each node comprises first means which forwards each request originating in a source node and destined for destination node. The node comprises second means which redirect replies if the node from which the corresponding requests were received is no long accessible. The reply is, for example, turned into a request containing the reply as its payload and is returned towards the source node according to the rules used for forwarding the requests.
摘要翻译： 布置覆盖网络节点以为通过网络行进的请求和回复提供鲁棒的回复路由。 每个节点包括转发源于源节点并发往目的地节点的每个请求的第一装置。 如果从其接收到相应请求的节点不可长时间地访问，节点包括第二装置，其重定向回复。 例如，答复变成一个包含回复作为其有效负载的请求，并根据用于转发请求的规则返回到源节点。
-
公开(公告)号：US20100329268A1
公开(公告)日：2010-12-30
申请号：US12867749
申请日：2009-01-14
IPC分类号： H04L12/56
CPC分类号： H04L67/104 , H04L45/22 , H04L45/28 , H04L45/64 , H04L67/1048 , H04L67/1065 , H04L69/40
摘要： An overlay network node (12, 20, 30 to 32) is arranged to provide robust reply routing for requests and replies travelling over the network. Each node comprises first means (35) which forwards each request originating in a source node (S) and destined for destination node (D). The node comprises second means (20, 36) which redirect replies if the node from which the corresponding requests were received is no long accessible. The reply is, for example, turned into a request containing the reply as its payload and is returned towards the source node according to the rules used for forwarding the requests.
摘要翻译： 布置覆盖网络节点（12,20,30至32）以为通过网络行进的请求和回复提供鲁棒的应答路由。 每个节点包括转发源于源节点（S）并发往目的地节点（D）的每个请求的第一装置（35）。 该节点包括第二装置（20,36），如果从其接收相应的请求的节点不可长时间地访问，则重定向响应。 例如，答复变成一个包含回复作为其有效负载的请求，并根据用于转发请求的规则返回到源节点。
-
公开(公告)号：US09686353B2
公开(公告)日：2017-06-20
申请号：US13378883
申请日：2009-06-26
申请人： Jani Hautakorpi , Ari Keranen , Jouni Maenpaa
发明人： Jani Hautakorpi , Ari Keranen , Jouni Maenpaa
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).
-
-
-
-
-
-
-
-
-
搜索结果
21 条记录 (耗时 0.017 秒)
