利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

143 条记录 (耗时 0.029 秒)

    Method and apparatus for locating services within peer-to-peer networks
    1.
    发明授权
    Method and apparatus for locating services within peer-to-peer networks 有权

    公开(公告)号：US10084856B2

    公开(公告)日：2018-09-25

    申请号：US12640072

    申请日：2009-12-17

    申请人： Thomas P. Chu ,  Ramesh Nagarajan

    发明人： Thomas P. Chu ,  Ramesh Nagarajan

    IPC分类号： G06F17/30 ,  H04L29/08

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

    摘要： A capability is provided for supporting a service location capability in a peer-to-peer network (P2P), such as a Chord network or other P2P network. In one embodiment, a method for locating a service within a P2P network is provided. The P2P network includes a plurality of nodes, including a target node which performs the method for locating the service within the P2P network. The target node includes a search table including a plurality of entries identifying a respective plurality of nodes of the P2P network. The method includes detecting a request to search for the service within the P2P network and initiating, toward at least one of the nodes of the search table, a service search request. The service search request is a request to identify at least one node of the P2P network that supports the service. The service search request includes information indicative of the service and a search range for use by the node receiving the service search request.

    MULTI-HOP WIRELESS PEER-TO-PEER DISCOVERY PROTOCOL
    2.
    发明申请
    MULTI-HOP WIRELESS PEER-TO-PEER DISCOVERY PROTOCOL 审中-公开
    多重无线对等发现协议

    公开(公告)号：US20160127460A1

    公开(公告)日：2016-05-05

    申请号：US14531329

    申请日：2014-11-03

    申请人： Qualcomm Technologies Inc.

    发明人： Gang Ding ,  Richard Oliver Farley ,  Md Sazzadur Rahman

    IPC分类号： H04L29/08 ,  H04W4/06 ,  H04W8/00

    CPC分类号： H04L67/107 ,  H04W4/06 ,  H04W8/005 ,  H04W40/246

    摘要： A method is disclosed for discovering communication devices. The method includes broadcasting, with a first communication device, a message that can be detected by one-hop neighbors. The first communication device listens for data indicating that it has at least one two-hop neighbor, and constructs and stores a list of its one-hop and two-hop neighbors. In addition, the method may also include selecting a subset of the set of one-hop neighbors such that all of the two-hop neighbors of the first communication device can be reached by the first communication device through the subset of one-hop neighbors. Then the selected subset is stored on a list on the first communication device. Next, the first communication device broadcasts to one-hop neighbors in the selected subset, the data indicating that a one-hop neighbor is part of the selected subset. The method also allows the discovery of multi-hop neighbors by utilizing the selected subset.

    摘要翻译： 公开了一种用于发现通信设备的方法。 该方法包括利用第一通信设备广播可以由一跳邻居检测的消息。 第一通信设备侦听指示其具有至少一个两跳邻居的数据，并构建并存储其一跳和两跳邻居的列表。 另外，该方法还可以包括选择一跳邻居集合的子集，使得第一通信设备的所有二跳邻居都可以由第一通信设备通过一跳邻居的子集达到。 然后，所选择的子集存储在第一通信设备上的列表上。 接下来，第一通信设备向所选子集中的一跳邻居广播，指示一跳邻居是所选子集的一部分的数据。 该方法还允许通过利用所选择的子集来发现多跳邻居。

    Method and apparatus for increasing the search space or peer-to-peer networks using time-to-live boosting
    3.
    发明授权
    Method and apparatus for increasing the search space or peer-to-peer networks using time-to-live boosting 失效
    使用实时升级来增加搜索空间或对等网络的方法和装置

    公开(公告)号：US08650259B2

    公开(公告)日：2014-02-11

    申请号：US11049808

    申请日：2005-02-03

    申请人： Raymond B. Jennings, III ,  Jason D. LaVoie

    发明人： Raymond B. Jennings, III ,  Jason D. LaVoie

    IPC分类号： G06F15/16

    CPC分类号： H04L67/16 ,  H04L67/104 ,  H04L67/1068 ,  H04L67/107 ,  H04L69/28

    摘要： Disclosed are methods and systems for expanding the search space in a Peer-to-Peer (“P2P”) network. In one embodiment, the search space is expanded by increasing the time-to-live value of the search request message. The P2P network may include a plurality of nodes, and the method for increasing the search space in the network includes the steps of receiving a search request message; changing a time-to-live value carried by the message; and forwarding the message to at least one peer node.

    摘要翻译： 公开了用于扩展对等（“P2P”）网络中的搜索空间的方法和系统。 在一个实施例中，通过增加搜索请求消息的生存时间值来扩展搜索空间。 P2P网络可以包括多个节点，并且用于增加网络中的搜索空间的方法包括以下步骤：接收搜索请求消息; 改变消息携带的生存时间价值; 并将该消息转发到至少一个对等节点。

    Method for monitoring and providing information over a peer to peer network
    4.
    发明授权
    Method for monitoring and providing information over a peer to peer network 有权

    公开(公告)号：US08468250B2

    公开(公告)日：2013-06-18

    申请号：US13118960

    申请日：2011-05-31

    申请人： Samuel P. Hopkins

    发明人： Samuel P. Hopkins

    IPC分类号： G06F15/16 ,  G06F15/173

    CPC分类号： H04L41/0816 ,  H04L41/042 ,  H04L43/50 ,  H04L67/104 ,  H04L67/1063 ,  H04L67/107 ,  H04L67/1093 ,  H04L67/145 ,  H04N21/632 ,  Y10S707/99956

    摘要： The present invention relates to a pseudonode used for deployment on a peer to peer network which pseudonode comprises an IP address and client ID that is changeable upon the occurrence of a preselected event and includes a list containing at least one searchable data object. The pseudonode is programmed for monitoring the network to receive search requests therefrom and to compare each said received search with said list of data objects and to respond to such request. The invention also provides a method for monitoring search requests for selected objects by nodes on a peer to peer network. The method includes interposing the pseudonodes on the network in which it is configured to provide at least one IP address and optionally at least one client ID. The pseudonode has at least one stored object corresponding to a request object stored at said pseudonode; and monitors the network to detect requests matching at least one of the stored objects and acquires a unique ID generated by any network node requesting the object matching that stored object on the pseudonode and responding to substantially each node representing an acquired ID.

    Method for improving peer to peer network communication
    6.
    发明授权
    Method for improving peer to peer network communication 有权
    改善对等网络通信的方法

    公开(公告)号：US08358641B2

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

    申请号：US13163256

    申请日：2011-06-17

    申请人： Samuel P. Hopkins

    发明人： Samuel P. Hopkins

    IPC分类号： H04L12/26 ,  H04J1/16 ,  G08C15/00 ,  G06F11/00 ,  G01R31/08

    CPC分类号： H04L41/0816 ,  H04L41/042 ,  H04L43/50 ,  H04L67/104 ,  H04L67/1063 ,  H04L67/107 ,  H04L67/1093 ,  H04L67/145 ,  H04N21/632 ,  Y10S707/99956

    摘要： The present invention relates to a node for deployment on a peer to peer network. The node is programmed for monitoring the network to receive communication messages therefrom and to forward the communication messages, optionally changing the communications radius parameters to an optimal or near optimal value. The node can forward messages from one network to another or from one network to the same network. The invention also provides a method for monitoring communication messages for selected objects by nodes on a peer to peer network. The method includes interposing the node on the network. The node has at least one stored object corresponding to a communication message object stored the node; and monitors the network to detect communication messages matching at least one of the stored objects and decides whether or not to forward or change communication message radius parameters based on some defined programming or configuration.

    摘要翻译： 本发明涉及一种用于部署在对等网络上的节点。 节点被编程用于监视网络以从其接收通信消息并转发通信消息，可选地将通信半径参数改变为最佳或近似最优值。 节点可以将消息从一个网络转发到另一个网络或从一个网络转发到同一个网络。 本发明还提供了一种用于通过对等网络上的节点监视所选对象的通信消息的方法。 该方法包括在网络上插入节点。 所述节点具有与存储所述节点的通信消息对象相对应的至少一个存储对象; 并监视网络以检测与至少一个存储的对象匹配的通信消息，并且基于某些定义的编程或配置来决定是否转发或改变通信消息半径参数。

    Method for monitoring and providing information over a peer to peer network
    8.
    发明授权
    Method for monitoring and providing information over a peer to peer network 有权
    通过对等网络监控和提供信息的方法

    公开(公告)号：US08122133B2

    公开(公告)日：2012-02-21

    申请号：US12814889

    申请日：2010-06-14

    申请人： Samuel P. Hopkins

    发明人： Samuel P. Hopkins

    IPC分类号： G06F15/16 ,  G06F15/173

    CPC分类号： H04L41/0816 ,  H04L41/042 ,  H04L43/50 ,  H04L67/104 ,  H04L67/1063 ,  H04L67/107 ,  H04L67/1093 ,  H04L67/145 ,  H04N21/632 ,  Y10S707/99956

    摘要： The present invention relates to a pseudonode used for deployment on a peer to peer network which pseudonode comprises an IP address and client ID that is changeable upon the occurrence of a preselected event and includes a list containing at least one searchable data object. The pseudonode is programmed for monitoring the network to receive search requests therefrom and to compare each said received search with said list of data objects and to respond to such request. The invention also provides a method for monitoring search requests for selected objects by nodes on a peer to peer network. The method includes interposing the pseudonodes on the network in which it is configured to provide at least one IP address and optionally at least one client ID. The pseudonode has at least one stored object corresponding to a request object stored at said pseudonode; and monitors the network to detect requests matching at least one of the stored objects and acquires a unique ID generated by any network node requesting the object matching that stored object on the pseudonode and responding to substantially each node representing an acquired ID.

    摘要翻译： 本发明涉及用于部署在对等网络上的伪节点，该伪节点包括IP地址和客户端ID，所述IP地址和客户端ID在预先选择的事件发生时是可变的，并且包括包含至少一个可搜索数据对象的列表。 伪代码被编程用于监视网络以从其接收搜索请求，并且将每个所述接收到的搜索与所述数据对象列表进行比较并且响应于该请求。 本发明还提供了一种用于监视对等网络上的节点对所选对象的搜索请求的方法。 该方法包括在网络上插入伪节点，其中它被配置成提供至少一个IP地址和可选地至少一个客户端ID。 伪代码具有与存储在所述伪代码中的请求对象相对应的至少一个存储对象; 并监视网络以检测与至少一个所存储的对象匹配的请求，并且获取由任何网络节点生成的唯一ID，所述网络请求与伪代码上匹配该存储对象的对象，并且基本上响应表示所获取的ID的每个节点。

    Method for Monitoring and Providing Information Over A Peer to Peer Network
    9.
    发明申请
    Method for Monitoring and Providing Information Over A Peer to Peer Network 有权
    对等网络监控和提供信息的方法

    公开(公告)号：US20110035488A1

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

    申请号：US12814889

    申请日：2010-06-14

    申请人： Samuel P. Hopkins

    发明人： Samuel P. Hopkins

    IPC分类号： G06F15/173

    CPC分类号： H04L41/0816 ,  H04L41/042 ,  H04L43/50 ,  H04L67/104 ,  H04L67/1063 ,  H04L67/107 ,  H04L67/1093 ,  H04L67/145 ,  H04N21/632 ,  Y10S707/99956

    摘要： The present invention relates to a pseudonode used for deployment on a peer to peer network which pseudonode comprises an IP address and client ID that is changeable upon the occurrence of a preselected event and includes a list containing at least one searchable data object. The pseudonode is programmed for monitoring the network to receive search requests therefrom and to compare each said received search with said list of data objects and to respond to such request. The invention also provides a method for monitoring search requests for selected objects by nodes on a peer to peer network. The method includes interposing the pseudonodes on the network in which it is configured to provide at least one IP address and optionally at least one client ID. The pseudonode has at least one stored object corresponding to a request object stored at said pseudonode; and monitors the network to detect requests matching at least one of the stored objects and acquires a unique ID generated by any network node requesting the object matching that stored object on the pseudonode and responding to substantially each node representing an acquired ID.

    摘要翻译： 本发明涉及用于部署在对等网络上的伪节点，该伪节点包括IP地址和客户端ID，所述IP地址和客户端ID在预选事件发生时是可变的，并且包括包含至少一个可搜索数据对象的列表。 伪代码被编程用于监视网络以从其接收搜索请求，并且将每个所述接收到的搜索与所述数据对象列表进行比较并且响应于该请求。 本发明还提供了一种用于监视对等网络上的节点对所选对象的搜索请求的方法。 该方法包括在网络上插入伪节点，其中它被配置成提供至少一个IP地址和可选地至少一个客户端ID。 伪代码具有与存储在所述伪代码中的请求对象相对应的至少一个存储对象; 并监视网络以检测与至少一个所存储的对象匹配的请求，并且获取由任何网络节点生成的唯一ID，所述网络请求与伪代码上匹配该存储对象的对象，并且基本上响应表示所获取的ID的每个节点。

    LIMITED BROADCAST, PEERING AMONG DHTs, BROADCAST PUT OF LIMITED CONTENT ONLY
    10.
    发明申请
    LIMITED BROADCAST, PEERING AMONG DHTs, BROADCAST PUT OF LIMITED CONTENT ONLY 有权
    有限公司，仅限有限公司的内容广告

    公开(公告)号：US20100293295A1

    公开(公告)日：2010-11-18

    申请号：US12467737

    申请日：2009-05-18

    申请人： Jining Tian ,  Jan Medved ,  Bruce Stuart Davie

    发明人： Jining Tian ,  Jan Medved ,  Bruce Stuart Davie

    IPC分类号： G06F15/173

    CPC分类号： H04L67/104 ,  H04L45/32 ,  H04L67/1065 ,  H04L67/107 ,  H04L67/1091

    摘要： In system of networks that are not fully meshed with each other and that are capable of processing distributed hash table (DHT) Put and Get messages, message flooding of GET messages is limited by maintaining a list of DHTs the GET has visited. Also, PUT messages include not only the storage location key in the home network but also a list of networks that the PUT has visited, in essence establishing a dynamically changing path within the PUT back to the home network.

    摘要翻译： 在没有完全互相关联并且能够处理分布式散​​列表（DHT）Put和Get消息的网络系统中，GET消息的消息泛滥受到GET访问的DHT列表的限制。 此外，PUT消息不仅包括家庭网络中的存储位置密钥，而且还包括PUT访问的网络列表，其本质上在PUT内建立动态改变的路径回到家庭网络。