专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20060117026A1 Optimizing communication using scaleable peer groups 有权
公开(公告)号：US20060117026A1
公开(公告)日：2006-06-01
申请号：US11325693
申请日：2006-01-04
申请人： Christopher Kaler , Gopala Kakivaya , Hervey Wilson , Richard Hasha
发明人： Christopher Kaler , Gopala Kakivaya , Hervey Wilson , Richard Hasha
IPC分类号： G06F17/30
CPC分类号： H04L67/104 , H04L67/1046 , H04L67/1059 , H04L67/1063 , H04L67/1065 , H04L67/24 , H04L67/32
摘要： Implementations of the present invention relate in part to optimizations to peer-to-peer communication systems. For example, one implementation relates to use of a smart transceiver that creates, caches, and manages communication channels dynamically between peers. Another implementation relates to use of a central tracking object that can be used to efficiently register and distribute peer messages among the various peers. In one implementation, the central tracking object is shared amongst peers in the group. Still another implementation relates to associating peer groups with namespaces, and for including peer groups of one namespace within still other peer groups of different namespaces. These and other aspects of the invention can also be used to ensure delivery intent of a given peer message is preserved, and to ensure that optimal numbers of messages are communicated to any given peer at any given time.

2. 发明申请

US20060117024A1 Optimizing communication using scaleable peer groups 有权
公开(公告)号：US20060117024A1
公开(公告)日：2006-06-01
申请号：US11325690
申请日：2006-01-04
申请人： Christopher Kaler , Gopala Kakivaya , Hervey Wilson , Richard Hasha
发明人： Christopher Kaler , Gopala Kakivaya , Hervey Wilson , Richard Hasha
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30067 , H04L29/12132 , H04L29/12594 , H04L61/1552 , H04L61/3015 , Y10S707/99931 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944 , Y10S707/99945 , Y10S707/99948
摘要： Implementations of the present invention relate in part to optimizations to peer-to-peer communication systems. For example, one implementation relates to use of a smart transceiver that creates, caches, and manages communication channels dynamically between peers. Another implementation relates to use of a central tracking object that can be used to efficiently register and distribute peer messages among the various peers. In one implementation, the central tracking object is shared amongst peers in the group. Still another implementation relates to associating peer groups with namespaces, and for including peer groups of one namespace within still other peer groups of different namespaces. These and other aspects of the invention can also be used to ensure delivery intent of a given peer message is preserved, and to ensure that optimal numbers of messages are communicated to any given peer at any given time.

3. 发明申请

US20070150540A1 Presence and peer launch pad 审中-公开
标题翻译：存在和对等发射台
公开(公告)号：US20070150540A1
公开(公告)日：2007-06-28
申请号：US11318768
申请日：2005-12-27
申请人： Christopher Kaler , Gopala Kakivaya , Hervey Wilson , Richard Hasha
发明人： Christopher Kaler , Gopala Kakivaya , Hervey Wilson , Richard Hasha
IPC分类号： G06F15/16
CPC分类号： H04L67/104
摘要： Managing peer-to-peer application components. A method may be performed, for example, at a computer system that includes application components including peer-to-peer application components. The peer-to-peer application components allow the computer system to communicate with other agents, such as host computers, operating systems, frameworks, application code and the like, in a peer-to-peer fashion. The computer system includes a launch pad module for coordinating the peer-to-peer application components. The method includes providing an extensible interface that allows peer-to-peer application components to be registered with the launch pad module. Peer-to-peer application components are registered with the launch pad module. Requests are accepted from agents directed to the peer-to-peer application components registered with the launch pad module. Launch functions are performed for the peer-to-peer application components registered with the launch pad module in response to the requests.
摘要翻译：管理对等应用程序组件。例如，可以在包括包括对等应用组件在内的应用组件的计算机系统上执行方法。对等应用程序组件允许计算机系统以对等方式与其他代理（例如主机，操作系统，框架，应用程序代码等）进行通信。计算机系统包括用于协调对等应用组件的启动板模块。该方法包括提供允许对等应用组件向启动板模块注册的可扩展接口。对等应用程序组件在启动板模块中注册。代理人接受从针对发射台模块注册的对等应用组件的请求。响应于请求，对启动板模块注册的对等应用组件执行启动功能。

4. 发明申请

US20060117025A1 Optimizing communication using scaleable peer groups 失效
公开(公告)号：US20060117025A1
公开(公告)日：2006-06-01
申请号：US11325691
申请日：2006-01-04
申请人： Christopher Kaler , Gopala Kakivaya , Hervey Wilson , Richard Hasha
发明人： Christopher Kaler , Gopala Kakivaya , Hervey Wilson , Richard Hasha
IPC分类号： G06F17/30
CPC分类号： H04L67/104 , H04L67/1046 , H04L67/1059 , H04L67/1063 , H04L67/1065 , H04L67/24 , H04L67/32
摘要： Implementations of the present invention relate in part to optimizations to peer-to-peer communication systems. For example, one implementation relates to use of a smart transceiver that creates, caches, and manages communication channels dynamically between peers. Another implementation relates to use of a central tracking object that can be used to efficiently register and distribute peer messages among the various peers. In one implementation, the central tracking object is shared amongst peers in the group. Still another implementation relates to associating peer groups with namespaces, and for including peer groups of one namespace within still other peer groups of different namespaces. These and other aspects of the invention can also be used to ensure delivery intent of a given peer message is preserved, and to ensure that optimal numbers of messages are communicated to any given peer at any given time.

5. 发明申请

US20070133520A1 Dynamically adapting peer groups 审中-公开
标题翻译：动态调整对等组
公开(公告)号：US20070133520A1
公开(公告)日：2007-06-14
申请号：US11301745
申请日：2005-12-12
申请人： Gopala Kakivaya , Richard Hasha , Christopher Kaler
发明人： Gopala Kakivaya , Richard Hasha , Christopher Kaler
IPC分类号： H04L12/66
CPC分类号： H04L41/0893 , H04L41/026 , H04L41/046
摘要： Communicating a message using between networked agents. Some embodiments may be practiced, for example, in a network including one or more interconnected agents. A method facilities communicating a message to one or more of the interconnected agents. The method includes receiving feedback including information about the network. The information about the network is tracked. The method further includes consulting a set of policy rules. The policy rules include logic which takes into account the tracked information about the network. The policy rules further include information about how messages should be sent based on the logic which takes into account the tracked information about the network. The method also includes sending the message according to the information about how messages should be sent.
摘要翻译：使用联网代理之间的信息通信。一些实施例可以例如在包括一个或多个互连代理的网络中实施。将消息传递给一个或多个互连代理的方法设施。该方法包括接收包括关于网络的信息的反馈。跟踪有关网络的信息。该方法还包括咨询一组策略规则。策略规则包括考虑跟踪的关于网络的信息的逻辑。策略规则还包括关于如何基于考虑到关于网络的跟踪信息的逻辑来发送消息的信息。该方法还包括根据关于如何发送消息的信息发送消息。

6. 发明申请

US20080031246A1 ALLOCATING AND RECLAIMING RESOURCES WITHIN A RENDEZVOUS FEDERATION 失效
标题翻译：在一个RENDEZVOUS FEDERATION分配和重新分配资源
公开(公告)号：US20080031246A1
公开(公告)日：2008-02-07
申请号：US11752198
申请日：2007-05-22
申请人： Richard Hasha , Lu Xun , Gopala Kakivaya , Dahlia Malkhi
发明人： Richard Hasha , Lu Xun , Gopala Kakivaya , Dahlia Malkhi
IPC分类号： H04L12/28
CPC分类号： H04L45/00 , H04L29/12103 , H04L45/20 , H04L61/1535
摘要： The present invention extends to methods, systems, and computer program products for allocating and reclaiming resources within a rendezvous federation. Embodiments of the invention include formulating and routing messages in accordance with cached two-way agreements between adjacent nodes on a ring of nodes. Cached two-way agreements divide responsibility for at least unoccupied identifiers between the adjacent nodes on a ring. When a message is received at a node, the node can refer to a cached two-way agreement to determine if it or an adjacent node is responsible for the message. The node then sends the message to the next appropriate component in accordance with the cached two-way agreement.
摘要翻译：本发明扩展到用于在会合联盟内分配和回收资源的方法，系统和计算机程序产品。本发明的实施例包括根据节点环上的相邻节点之间的缓存的双向协议来制定和路由消息。缓存的双向协议将至少在空闲的相邻节点之间的未占用标识符的责任分开。当在节点处接收到消息时，节点可以参考缓存的双向协议来确定它或相邻节点是否对该消息负责。然后，节点根据缓存的双向协议将消息发送到下一个适当的组件。

7. 发明申请

US20060087990A1 Rendezvousing resource requests with corresponding resources 有权
标题翻译：使用相应的资源汇总资源请求
公开(公告)号：US20060087990A1
公开(公告)日：2006-04-27
申请号：US11220756
申请日：2005-09-07
申请人： Gopala Kakivaya , Richard Hasha , Thomas Rodeheffer
发明人： Gopala Kakivaya , Richard Hasha , Thomas Rodeheffer
IPC分类号： H04L5/22
CPC分类号： H04L45/04 , H04L45/02 , H04L45/54
摘要： The present invention extends to methods, systems, and computer program products for rendezvousing resource requests with corresponding resources. Doubly linked sorted lists are traversed using modulo arithmetic in both directions. Sorted lists can be partitioned based on a multiple proximity metrics. Node routing tables provide a logarithmic index to nodes within the ID space of the federation infrastructure to facilitate more efficient routing. Messages can be routed to nodes within a ring and proximally routed to nodes in other partitioned rings.
摘要翻译：本发明扩展到方法，系统和计算机程序产品，用于使资源请求与对应的资源进行会合。双向链接排序列表使用模数算术在两个方向上遍历。排序的列表可以基于多个邻近度量进行分区。节点路由表为联盟基础架构的ID空间内的节点提供了一个对数索引，以便于更有效的路由。消息可以路由到环内的节点，并向近端路由到其他分区环中的节点。

8. 发明申请

US20080005624A1 Maintaining routing consistency within a rendezvous federation 失效
标题翻译：在集合联盟中维护路由一致性
公开(公告)号：US20080005624A1
公开(公告)日：2008-01-03
申请号：US11549332
申请日：2006-10-13
申请人： Gopala Kakivaya , Richard Hasha , Lu Xun , Dahlia Malkhi
发明人： Gopala Kakivaya , Richard Hasha , Lu Xun , Dahlia Malkhi
IPC分类号： G06F11/00
CPC分类号： H04L67/104 , H04L67/1046 , H04L67/1048 , H04L67/1076
摘要： The present invention extends to methods, systems, and computer program products for appropriately detecting node failures in a rendezvous federation. A monitor node monitors a subject node. The subject node intermittently renews a time-to-live duration value with the monitor node to indicate the monitor node that the subject node has not failed. In some embodiments, each node in a pair of nodes monitors the other nodes in the pair of nodes. Thus, each node is a subject node and a monitor node. In further embodiments, an arbitration facility arbitrates failure reports.
摘要翻译：本发明扩展到用于适当地检测会合联盟中的节点故障的方法，系统和计算机程序产品。监视器节点监视主体节点。主体节点间歇地更新监视节点的生存时间值，以指示主节点未失败的监视节点。在一些实施例中，一对节点中的每个节点监视该对节点中的其他节点。因此，每个节点是主节点和监视节点。在进一步的实施例中，仲裁机构仲裁故障报告。

9. 发明申请

US20060282547A1 INTER-PROXIMITY COMMUNICATION WITHIN A RENDEZVOUS FEDERATION 失效
标题翻译：在联合联合会内的互相通信
公开(公告)号：US20060282547A1
公开(公告)日：2006-12-14
申请号：US11428133
申请日：2006-06-30
申请人： Richard Hasha , Lu Xun , Gopala Kakivaya
发明人： Richard Hasha , Lu Xun , Gopala Kakivaya
IPC分类号： G06F15/16
CPC分类号： H04L45/02 , H04L12/4637
摘要： The present invention extends to methods, systems, and computer program products for facilitating inter-proximity communication within a rendezvous federation. Nodes maintain collateral ring set entry tables that include collateral rings and corresponding entry nodes into the collateral rings. Nodes can exchange collateral ring set entry state to update one another on the configuration of rings within a tree of rings. Nodes can refer to collateral ring set entry tables, as well as to other nodes, to identify entry nodes into rings that are collateral rings of the node. Messages can be sent to entry nodes in collateral rings. A message can include an indication that an entry node in a target proximity ring is to resolve the message to the node in the target proximity ring which has a node ID closest to an indicated destination node.
摘要翻译：本发明扩展到方法，系统和计算机程序产品，以促进会合联盟内的邻近间通信。节点维护包括侧环和相应入口节点的附属环集入条目表。节点可以交换附加环集入条件状态，以便在环树中的环配置上相互更新。节点可以将附属环集入口表以及其他节点称为将节点标识为环节，该节点是该节点的侧环。消息可以发送到边缘环的入口节点。消息可以包括目标邻近环中的入口节点将消息发送到具有最接近所指示的目的地节点的节点ID的目标邻近环中的节点的指示。

10. 发明申请

US20060282505A1 INTER-PROXIMITY COMMUNICATION WITHIN A RENDEZVOUS FEDERATION 失效
公开(公告)号：US20060282505A1
公开(公告)日：2006-12-14
申请号：US11428146
申请日：2006-06-30
申请人： Richard Hasha , Lu Xun , Gopala Kakivaya
发明人： Richard Hasha , Lu Xun , Gopala Kakivaya
IPC分类号： G06F15/16
CPC分类号： H04L67/16 , H04L12/42 , H04L45/04 , H04L45/122 , H04L45/48 , H04L45/54 , H04L67/327
摘要： The present invention extends to methods, systems, and computer program products for facilitating inter-proximity communication within a rendezvous federation. Nodes maintain collateral ring set entry tables that include collateral rings and corresponding entry nodes into the collateral rings. Nodes can exchange collateral ring set entry state to update one another on the configuration of rings within a tree of rings. Nodes can refer to collateral ring set entry tables, as well as to other nodes, to identify entry nodes into rings that are collateral rings of the node. Messages can be sent to entry nodes in collateral rings. A message can include an indication that an entry node in a target proximity ring is to resolve the message to the node in the target proximity ring which has a node ID closest to an indicated destination node.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式