-
公开(公告)号：US07636939B2
公开(公告)日：2009-12-22
申请号：US11009926
申请日：2004-12-10
申请人： Christopher G. Kaler , Douglas A. Walter , Giovanni M. Della-Libera , Melissa W. Dunn , Richard L. Hasha , Tomasz Janczuk
发明人： Christopher G. Kaler , Douglas A. Walter , Giovanni M. Della-Libera , Melissa W. Dunn , Richard L. Hasha , Tomasz Janczuk
CPC分类号： H04L63/0428 , H04L63/16
摘要： A data structure with endpoint address and security information. The data structure includes an address field that includes one or more endpoint addresses for an entity. The data structure further includes a security field that includes one or more keys for facilitating secure communications with the entity. The data structure may also be such that the contents of the address field and the security field are serialized in the data structure. The data structure may be extensible such that new address fields and security fields may be added.
摘要翻译： 具有端点地址和安全信息的数据结构。 该数据结构包括一个包含一个或多个实体端点地址的地址字段。 数据结构进一步包括安全领域，其包括用于促进与实体的安全通信的一个或多个密钥。 数据结构还可以使得地址字段和安全字段的内容在数据结构中被序列化。 数据结构可以是可扩展的，使得可以添加新的地址字段和安全字段。
-
公开(公告)号：US07496602B2
公开(公告)日：2009-02-24
申请号：US11325690
申请日：2006-01-04
IPC分类号： G06F17/00
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.
摘要翻译： 本发明的实现部分地涉及对等通信系统的优化。 例如，一个实现涉及在对等体之间动态地创建，高速缓存和管理通信信道的智能收发器的使用。 另一实现涉及使用可用于在各个对等体之间有效地注册和分发对等消息的中央跟踪对象。 在一个实现中，中心跟踪对象在组中的对等体之间共享。 另一个实现涉及将对等体组与命名空间相关联，并且用于将不同命名空间的另一个对等体组内的一个命名空间的对等体组包括在内。 本发明的这些和其它方面也可用于确保给定对等体消息的传送意图被保留，并确保在任何给定时间将最佳数量的消息传送给任何给定的对等体。
-
公开(公告)号：US08250230B2
公开(公告)日：2012-08-21
申请号：US11325693
申请日：2006-01-04
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.
摘要翻译： 本发明的实现部分地涉及对等通信系统的优化。 例如，一个实现涉及在对等体之间动态地创建，高速缓存和管理通信信道的智能收发器的使用。 另一实现涉及使用可用于在各个对等体之间有效地注册和分发对等消息的中央跟踪对象。 在一个实现中，中心跟踪对象在组中的对等体之间共享。 另一个实现涉及将对等体组与命名空间相关联，并且用于将不同命名空间的另一个对等体组内的一个命名空间的对等体组包括在内。 本发明的这些和其它方面也可用于确保给定对等体消息的传送意图被保留，并确保在任何给定时间将最佳数量的消息传送给任何给定的对等体。
-
公开(公告)号：US07693807B2
公开(公告)日：2010-04-06
申请号：US11304298
申请日：2005-12-15
CPC分类号： G06F9/546
摘要： The present invention extends to methods, systems, and computer program products for mapping between anonymous modules in an event environment. Through the use of one or more event type to executable module bindings, a binding/dispatch manager maps events, for example, peer-to-peer, grid, or parallel processing computing events, to appropriate methods for processing the events. When an event is received from an event infrastructure, the binding/dispatch manager refers to annotations (e.g., based on the shape of the parameters) to identify an appropriate method for processing the event. Parameters are transferred to the appropriate method, which processes the parameters and returns any results to the binding/dispatch manager. In some embodiments, the binding/dispatch manager then forwards a response to the event infrastructure.
摘要翻译： 本发明扩展到用于在事件环境中的匿名模块之间进行映射的方法，系统和计算机程序产品。 通过将一个或多个事件类型用于可执行模块绑定，绑定/分派管理器将事件（例如，对等，网格或并行处理计算事件）映射到用于处理事件的适当方法。 当从事件基础设施接收到事件时，绑定/调度管理器引用注释（例如，基于参数的形状）来标识用于处理事件的适当方法。 参数传递到适当的方法，该方法处理参数并将任何结果返回给绑定/调度管理器。 在一些实施例中，绑定/调度管理器然后将响应转发到事件基础设施。
-
公开(公告)号：US07640299B2
公开(公告)日：2009-12-29
申请号：US11325691
申请日：2006-01-04
IPC分类号： G06F15/16
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.
摘要翻译： 本发明的实现部分地涉及对等通信系统的优化。 例如，一个实现涉及在对等体之间动态地创建，高速缓存和管理通信信道的智能收发器的使用。 另一实现涉及使用可用于在各个对等体之间有效地注册和分发对等消息的中央跟踪对象。 在一个实现中，中心跟踪对象在组中的对等体之间共享。 另一个实现涉及将对等体组与命名空间相关联，并且用于将不同命名空间的另一个对等体组内的一个命名空间的对等体组包括在内。 本发明的这些和其它方面也可用于确保给定对等体消息的传送意图被保留，并确保在任何给定时间将最佳数量的消息传送给任何给定的对等体。
-
6.发明授权Organizing resources into collections to facilitate more efficient and reliable resource access 有权将资源组织到集合中，以促进更高效和可靠的资源访问公开(公告)号：US09244926B2
公开(公告)日：2016-01-26
申请号：US13599681
申请日：2012-08-30
IPC分类号： G06F15/16 , G06F15/177 , G06F15/173 , G06F17/30 , H04L29/12
CPC分类号： G06F17/30067 , H04L29/12132 , H04L29/12594 , H04L61/1552 , H04L61/3015 , Y10S707/99931 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944 , Y10S707/99945 , Y10S707/99948
摘要： Resources are organized into collections to facilitate more efficient and reliable resource access. Namespace managers communicate with one another to form a federation namespace infrastructure. The infrastructure can efficiently route, migrate, and process namespace requests, such as, for example, namespace registration requests from providers requesting to manage portions of namespaces and lookup requests from consumers requesting access to managed resources. Resources can be registered in and made accessible from multiple different namespaces. Resources can be identified using nested queries that filter results at multiple levels of a hierarchical namespace.
摘要翻译： 资源被组织成集合以促进更高效和可靠的资源访问。 命名空间管理员彼此进行通信，形成联合命名空间基础结构。 基础设施可以有效地路由，迁移和处理命名空间请求，例如，提供者的命名空间注册请求，请求管理命名空间的部分和查询请求访问被管理资源的消费者的请求。 资源可以在多个不同的命名空间中注册并可访问。 可以使用在层次命名空间的多个级别过滤结果的嵌套查询来识别资源。
-
公开(公告)号：US20120036237A1
公开(公告)日：2012-02-09
申请号：US13221635
申请日：2011-08-30
IPC分类号： G06F15/177
CPC分类号： H04L67/1095 , G06F11/1425 , G06F17/30215 , G06F17/30578 , H04L67/104 , H04L67/1046
摘要： A primary node is elected from among a plurality of nodes in a replica set of nodes. The primary node accepts and processes client data access requests. The replica set includes the primary node and other secondary nodes. The primary node receives client data access requests and assigns a data sequence number to each client data access request that mutates state in the order the client data access requests are received. The data sequence numbers include a linearized processing order that is followed by each of the nodes in the replica set. The primary node sends the mutating client data access requests including any corresponding data sequence numbers to the secondary nodes. The primary node receives, from a threshold number of secondary nodes, an acknowledgement indicating reception of the client data access request. The primary node commits the data mutating access request.
摘要翻译： 在节点的副本集合中的多个节点中选择主节点。 主节点接受并处理客户端数据访问请求。 副本集包括主节点和其他辅助节点。 主节点接收客户端数据访问请求，并为每个客户端数据访问请求分配一个数据序列号，该请求按接收到客户端数据访问请求的顺序进行突变。 数据序列号包括复制集合中每个节点之后的线性化处理顺序。 主节点向次要节点发送包括任何对应的数据序列号的变化客户端数据访问请求。 主节点从阈值数量的次要节点接收到指示接收客户端数据访问请求的确认。 主节点提交数据突变访问请求。
-
公开(公告)号：US20110235551A1
公开(公告)日：2011-09-29
申请号：US13155113
申请日：2011-06-07
IPC分类号： H04L12/28
摘要： 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空间内的节点提供了一个对数索引，以便于更有效的路由。 消息可以路由到环内的节点，并向近端路由到其他分区环中的节点。
-
公开(公告)号：US07624194B2
公开(公告)日：2009-11-24
申请号：US11015460
申请日：2004-12-17
IPC分类号： G06F15/173 , G06F15/16
CPC分类号： H04L12/42 , H04L29/12066 , H04L29/12113 , H04L61/1511 , H04L61/1541 , H04L67/104 , H04L67/1046 , H04L67/1048
摘要： The present invention extends to methods, systems, and computer program products for establishing and maintaining membership within a federation infrastructure. A joining node submits a join message to an existing federation infrastructure. The federation infrastructure routes the join message to a processing node. The processing node facilitates identification of predecessor, successor, neighborhood, and routing nodes (for the joining node) within a ring of nodes. The joining node exchanges messages with identified nodes to obtain state information for the identified nodes and other nodes within the ring. Nodes periodically exchange state information, including state information for other nodes, such that state information for the ring is efficiently propagated to all nodes in the ring even when communication between some nodes is lost. Instance IDs, phase values, and freshness values are used to determine when state information is stale and/or is to be updated.
摘要翻译： 本发明扩展到用于在联盟基础设施内建立和维护成员资格的方法，系统和计算机程序产品。 加入节点向现有的联合基础设施提交加入消息。 联盟基础架构将加入消息路由到一个处理节点。 处理节点有助于识别节点环内的前导，后继，邻域和路由节点（对于加入节点）。 加入节点与已识别的节点交换消息，以获得所识别的节点和环内的其他节点的状态信息。 节点周期性地交换状态信息，包括其他节点的状态信息，使得即使在一些节点之间的通信丢失时，环的状态信息也被有效地传播到环中的所有节点。 实例ID，阶段值和新鲜度值用于确定何时状态信息过时和/或要更新。
-
公开(公告)号：US20080288659A1
公开(公告)日：2008-11-20
申请号：US11936589
申请日：2007-11-07
IPC分类号： G06F15/173
CPC分类号： H04L67/1095 , G06F11/1425 , G06F16/1844 , G06F16/273 , H04L67/104 , H04L67/1046
摘要： The present invention extends to methods, systems, and computer program products for a joining node to join a ring of nodes within a rendezvous federation. Embodiments include detecting a neighborhood of nodes on the ring of nodes. The joining node indicates its intent to take id-space ownership for a portion of the id-space between the joining node and a selected immediately adjacent node. The joining node indicates an intent to monitor the selected node. The joining node receives three indications, the first indicating acceptance of the joining node's intent to take id-space ownership for a portion of the id-space between the joining node and the selected node, the second indicating acceptance of the joining node's intent to monitor the selected node, the third indicating the first selected node's intent to monitor the joining node. The joining node indicates acceptance of the selected node's intent to monitor the joining node.
摘要翻译： 本发明扩展到用于加入节点加入会合联盟内的节点环的方法，系统和计算机程序产品。 实施例包括检测节点环上的节点的邻域。 加入节点表示意图为加入节点和所选择的紧邻节点之间的id空间的一部分获取id空间所有权。 加入节点指示监视所选节点的意图。 加入节点接收三个指示，第一个指示加入节点意图对加入节点和所选节点之间的id空间的一部分采用id-space所有权的意图，第二个指示接收加入节点监视的意图 所选择的节点，第三个指示第一选择节点意图监视加入节点。 加入节点表示接受所选节点监视加入节点的意图。
-
-
-
-
-
-
-
-
-
搜索结果
47 条记录 (耗时 0.063 秒)
