-
1.发明申请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.
摘要翻译： 本发明扩展到用于在会合联盟内分配和回收资源的方法，系统和计算机程序产品。 本发明的实施例包括根据节点环上的相邻节点之间的缓存的双向协议来制定和路由消息。 缓存的双向协议将至少在空闲的相邻节点之间的未占用标识符的责任分开。 当在节点处接收到消息时，节点可以参考缓存的双向协议来确定它或相邻节点是否对该消息负责。 然后，节点根据缓存的双向协议将消息发送到下一个适当的组件。
-
公开(公告)号：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.
摘要翻译： 本发明扩展到用于适当地检测会合联盟中的节点故障的方法，系统和计算机程序产品。 监视器节点监视主体节点。 主体节点间歇地更新监视节点的生存时间值，以指示主节点未失败的监视节点。 在一些实施例中，一对节点中的每个节点监视该对节点中的其他节点。 因此，每个节点是主节点和监视节点。 在进一步的实施例中，仲裁机构仲裁故障报告。
-
公开(公告)号：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的目标邻近环中的节点的指示。
-
公开(公告)号：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.
-
公开(公告)号：US20070002774A1
公开(公告)日：2007-01-04
申请号：US11465316
申请日：2006-08-17
申请人： Richard Hasha , Lu Xun , Gopala Kakivaya
发明人： Richard Hasha , Lu Xun , Gopala Kakivaya
IPC分类号： H04L12/28
CPC分类号： H04L45/122 , H04L12/1854 , H04L12/42 , H04L45/04 , H04L67/2814
摘要： The present invention extends to methods, systems, and computer program products for broadcasting communication within a rendezvous federation. Embodiments of the invention include inter-ring and intra-ring communication. Inter-ring communication includes sending a message to destination rings included in a node's Collateral Ring Set entry table. When a node identifies a destination ring that has not yet received a message, the node can send a ring notification message. The ring notification message propagates towards a publishing node until a responsible node in the message path to the publishing node is identified. The responsible node updates its entry table to include the ring and forwards the message to the destination ring. Intra-ring communication can include recursively partitioning ranges of nodes within a ring and forwarding the message to nodes included the partitioned ranges.
摘要翻译： 本发明扩展到用于在会合联盟内广播通信的方法，系统和计算机程序产品。 本发明的实施例包括环形和环内通信。 环网间通信包括将消息发送到包含在节点的Collateral Ring Set条目表中的目的地环。 当节点识别尚未接收到消息的目的地环时，节点可以发送振铃通知消息。 环通知消息向发布节点传播，直到发布节点的消息路径中的负责节点被识别为止。 负责节点更新其入口表以包括环，并将消息转发到目标环。 环内通信可以包括循环内的节点的递归分区范围，并将消息转发到包括分区范围的节点。
-
公开(公告)号：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.
摘要翻译： 在节点的副本集合中的多个节点中选择主节点。 主节点接受并处理客户端数据访问请求。 副本集包括主节点和其他辅助节点。 主节点接收客户端数据访问请求，并为每个客户端数据访问请求分配一个数据序列号，该请求按接收到客户端数据访问请求的顺序进行突变。 数据序列号包括复制集合中每个节点之后的线性化处理顺序。 主节点向次要节点发送包括任何对应的数据序列号的变化客户端数据访问请求。 主节点从阈值数量的次要节点接收到指示接收客户端数据访问请求的确认。 主节点提交数据突变访问请求。
-
公开(公告)号：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所有权的意图，第二个指示接收加入节点监视的意图 所选择的节点，第三个指示第一选择节点意图监视加入节点。 加入节点表示接受所选节点监视加入节点的意图。
-
公开(公告)号：US08090880B2
公开(公告)日：2012-01-03
申请号：US11936556
申请日：2007-11-07
IPC分类号： G06F15/16 , G06F15/173 , G06F17/00 , G06F11/16
CPC分类号： H04L67/1095 , G06F11/1425 , G06F17/30215 , G06F17/30578 , H04L67/104 , H04L67/1046
摘要： In some embodiments, it is determined that a primary node has been 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. The primary node 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 to be 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.
摘要翻译： 在一些实施例中，确定在节点的副本集合中的多个节点中已经选择了主节点。 主节点接受并处理客户端数据访问请求。 副本集包括主节点和其他辅助节点。 主节点接收客户端数据访问请求。 主节点为每个客户端数据访问请求分配一个数据序列号，该请求以接收到客户端数据访问请求的顺序进行突变。 数据序列号包括复制集合中每个节点应遵循的线性化处理顺序。 主节点向次要节点发送包括任何对应的数据序列号的变化客户端数据访问请求。 主节点从阈值数量的次要节点接收到指示接收客户端数据访问请求的确认。 主节点提交数据突变访问请求。
-
公开(公告)号：US07958262B2
公开(公告)日：2011-06-07
申请号：US11752198
申请日：2007-05-22
IPC分类号： G06F15/173 , H04L12/28 , H04L12/56
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.
摘要翻译： 本发明扩展到用于在会合联盟内分配和回收资源的方法，系统和计算机程序产品。 本发明的实施例包括根据节点环上的相邻节点之间的缓存的双向协议来制定和路由消息。 缓存的双向协议将至少在空闲的相邻节点之间的未占用标识符的责任分开。 当在节点处接收到消息时，节点可以参考缓存的双向协议来确定它或相邻节点是否对该消息负责。 然后，节点根据缓存的双向协议将消息发送到下一个适当的组件。
-
公开(公告)号：US07694167B2
公开(公告)日：2010-04-06
申请号：US11549332
申请日：2006-10-13
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.
摘要翻译： 本发明扩展到用于适当地检测会合联盟中的节点故障的方法，系统和计算机程序产品。 监视器节点监视主体节点。 主体节点间歇地更新监视节点的生存时间值，以指示主节点未失败的监视节点。 在一些实施例中，一对节点中的每个节点监视该对节点中的其他节点。 因此，每个节点是主节点和监视节点。 在进一步的实施例中，仲裁机构仲裁故障报告。
-
-
-
-
-
-
-
-
-
搜索结果
42 条记录 (耗时 0.05 秒)
