利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

144 条记录 (耗时 0.029 秒)

    Dual Channel Delivery
    82.
    发明申请
    Dual Channel Delivery 审中-公开

    公开(公告)号：US20180020068A1

    公开(公告)日：2018-01-18

    申请号：US15418923

    申请日：2017-01-30

    申请人： Apple Inc.

    发明人： Thomas P. Devanneaux ,  Nicholas J. Circosta ,  Daniel B. Pollack

    IPC分类号： H04L29/08 ,  H04L12/24 ,  H04W68/02

    CPC分类号： H04L67/26 ,  H04L41/0668 ,  H04L41/0686 ,  H04L67/02 ,  H04L67/1068 ,  H04L67/107 ,  H04L67/16 ,  H04W68/02

    摘要： Embodiments described herein relate to systems and methods for transmitting service related messages, e.g., via a reverse push connection. In some embodiments, a UE may be configured to receive a random value from a server, the random value based at least in part on a capacity of the server and/or network. The UE may be configured to compare the random value to a generated value, and determine, based at least in part on the comparison, to transmit a service related message over a reverse push connection rather than via a hypertext transport protocol (HTTP) request. In some embodiments, the service related message may be any message that relates to a service available between devices, such as an identity (ID) query request, a service (de-) registration request, and/or a device listing request, among other types of messages.

    Method for optimally utilizing a peer to peer network
    83.
    发明授权
    Method for optimally utilizing a peer to peer network 有权
    最佳利用对等网络的方法

    公开(公告)号：US08904015B2

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

    申请号：US13429949

    申请日：2012-03-26

    申请人： Samuel P. Hopkins

    发明人： Samuel P. Hopkins

    IPC分类号： G06F15/16 ,  H04L12/26 ,  H04L29/08 ,  H04N21/63 ,  H04L12/24

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

    摘要： In accordance with an embodiment of the invention, there is provided a method for splitting a load of monitoring a peer to peer network. The method has a first node in the peer to peer network receiving information reported by a second node in the peer to peer network, including information concerning which nodes are connected to the second node. The method further has the first node connecting to nodes different from the nodes that are connected to the second node using the received information. The method still further has the first node reporting information, including information concerning which nodes are connected to the first node, such that the second node also has access to the reported information, thereby splitting the load of monitoring the peer to peer network among the first and second nodes.

    摘要翻译： 根据本发明的实施例，提供了一种用于分割对等网络监视负载的方法。 该方法具有对等网络中的第一节点，接收对等网络中的第二节点报告的信息，包括关于哪些节点连接到第二节点的信息。 该方法还具有使用所接收的信息连接到不同于与第二节点连接的节点的节点的第一节点。 该方法还具有第一节点报告信息，包括关于哪些节点连接到第一节点的信息，使得第二节点也可以访问所报告的信息，从而分离在第一节点之间监视对等网络的负载 和第二个节点。

    Dynamic query response in a distributed network
    84.
    发明授权
    Dynamic query response in a distributed network 有权
    分布式网络中的动态查询响应

    公开(公告)号：US08886803B1

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

    申请号：US11858276

    申请日：2007-09-20

    申请人： Kunal Kandekar ,  Richard J. Walsh ,  James Evans

    发明人： Kunal Kandekar ,  Richard J. Walsh ,  James Evans

    IPC分类号： G06F15/173

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

    摘要： A dynamic query response scheme for a distributed network is provided. In one embodiment, the distributed network is a peer-to-peer (P2P) network including a number of peer nodes. In general, peer nodes delay their query responses, address their query responses, or both delay and address their query responses dynamically to avoid feedback implosion. In one embodiment, the peer nodes delay their query responses, address their query responses, or both delay and address their query responses based on one or more quality metrics calculated for their query responses.

    摘要翻译： 提供了分布式网络的动态查询响应方案。 在一个实施例中，分布式网络是包括多个对等节点的对等（P2P）网络。 一般来说，对等节点延迟他们的查询响应，解决他们的查询响应，或者同时延迟并且动态地寻址他们的查询响应以避免反馈内爆。 在一个实施例中，对等节点基于为其查询响应计算的一个或多个质量度量延迟其查询响应，寻址他们的查询响应或两者延迟并寻址他们的查询响应。

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

    公开(公告)号：US08798016B2

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

    申请号：US12537891

    申请日：2009-08-07

    申请人： Samuel P. Hopkins

    发明人： Samuel P. Hopkins

    IPC分类号： H04L12/28 ,  G06F15/16

    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 OPTIMALLY UTILIZING A PEER TO PEER NETWORK
    86.
    发明申请
    METHOD FOR OPTIMALLY UTILIZING A PEER TO PEER NETWORK 有权
    一种将对等方式用于对等网络的方法

    公开(公告)号：US20140195656A1

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

    申请号：US14152015

    申请日：2014-01-10

    申请人： Tiversa IP, Inc.

    发明人： Samuel P. Hopkins

    IPC分类号： H04L12/24

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

    摘要： In accordance with an embodiment of the invention, there is provided a method for splitting a load of monitoring a peer to peer network. The method has a first node in the peer to peer network receiving information reported by a second node in the peer to peer network, including information concerning which nodes are connected to the second node. The method further has the first node connecting to nodes different from the nodes that are connected to the second node using the received information. The method still further has the first node reporting information, including information concerning which nodes are connected to the first node, such that the second node also has access to the reported information, thereby splitting the load of monitoring the peer to peer network among the first and second nodes.

    摘要翻译： 根据本发明的实施例，提供了一种用于分割对等网络监视负载的方法。 该方法具有对等网络中的第一节点，接收对等网络中的第二节点报告的信息，包括关于哪些节点连接到第二节点的信息。 该方法还具有使用所接收的信息连接到不同于与第二节点连接的节点的节点的第一节点。 该方法还具有第一节点报告信息，包括关于哪些节点连接到第一节点的信息，使得第二节点也可以访问所报告的信息，从而分离在第一节点之间监视对等网络的负载 和第二个节点。

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

    公开(公告)号：US08386613B2

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

    申请号：US13149193

    申请日：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.

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

    METHOD AND APPARATUS FOR DECOMPOSING A PEER-TO-PEER NETWORK AND USING A DECOMPOSED PEER-TO-PEER NETWORK
    90.
    发明申请
    METHOD AND APPARATUS FOR DECOMPOSING A PEER-TO-PEER NETWORK AND USING A DECOMPOSED PEER-TO-PEER NETWORK 审中-公开
    用于分解对等网络并使用分解的对等网络的方法和装置

    公开(公告)号：US20110153737A1

    公开(公告)日：2011-06-23

    申请号：US12640049

    申请日：2009-12-17

    申请人： Thomas P. Chu ,  Ramesh Nagarajan

    发明人： Thomas P. Chu ,  Ramesh Nagarajan

    IPC分类号： G06F15/16

    CPC分类号： H04L67/104 ,  H04L67/1046 ,  H04L67/107 ,  H04L67/1076 ,  H04L67/2861

    摘要： A capability is provided for decomposing a P2P network into a plurality of sub-networks and, further, for using the decomposed P2P network. A P2P network is decomposed to form a plurality of sub-networks, where each of the sub-networks is a P2P network. A P2P network may be decomposed into sub-networks based on one or more decomposition criteria (e.g., geographic location, community of interest, and the like, as well as various combinations thereof). The decomposition of the P2P network is encoded in a network map. A node may use the network map to join the decomposed P2P network. A node may join one, some, or all of the sub-networks. The sub-networks of a decomposed P2P network may be arranged in any suitable number of hierarchical levels.

    摘要翻译： 提供了一种用于将P2P网络分解成多个子网络的能力，并且还用于使用分解的P2P网络。 P2P网络被分解以形成多个子网络，其中每个子网络是P2P网络。 基于一个或多个分解标准（例如，地理位置，感兴趣的社区等，以及其各种组合），P2P网络可以被分解成子网络。 P2P网络的分解在网络地图中进行编码。 节点可以使用网络映射来加入分解的P2P网络。 节点可以加入一个，一些或全部子网。 分解的P2P网络的子网络可以以任何合适数量的层级排列。