-
公开(公告)号：US08341263B2
公开(公告)日：2012-12-25
申请号：US12763667
申请日：2010-04-20
IPC分类号： G06F15/173
CPC分类号： G06F9/5083 , G06F11/3433 , G06F11/3495 , G06F2201/81 , G06F2201/86 , G06F2201/875
摘要： An approach is provided that transmits a load balance request from a first peer node to other peer nodes. Some of the peer nodes have assigned transaction tracking responsibilities. The transmitting is performed in response to identifying that the first peer node is performing at a non-optimal level. The first peer node receives responses from the other peer nodes. A determination is made as to whether to handover one or more of the first peer node's transaction tracking responsibilities. If a second peer node is identified to take some of the first peer node's responsibilities, then a handover message is sent from the first peer node to the second peer node that assigns at least one of the first peer node's assigned transaction responsibilities to the second peer node.
摘要翻译： 提供了一种将负载平衡请求从第一对等节点发送到其他对等节点的方法。 一些对等节点已经分配了事务跟踪责任。 响应于识别出第一对等节点正在非最佳级别执行发送。 第一对等节点接收来自其他对等节点的响应。 确定是否切换一个或多个第一对等节点的事务跟踪责任。 如果识别出第二对等节点采取一些第一对等节点的职责，则从第一对等节点向第二对等节点发送切换消息，该第二对等节点将第一对等节点的分配事务责任中的至少一个分配给第二对等体 节点。
-
公开(公告)号：US20120166640A1
公开(公告)日：2012-06-28
申请号：US13415696
申请日：2012-03-08
IPC分类号： G06F11/30 , G06F15/173
CPC分类号： G06F9/5083 , G06F11/3433 , G06F11/3495 , G06F2201/81 , G06F2201/86 , G06F2201/875
摘要： An approach is provided that transmits a load balance request from a first peer node to other peer nodes. Some of the peer nodes have assigned transaction tracking responsibilities. The transmitting is performed in response to identifying that the first peer node is performing at a non-optimal level. The first peer node receives responses from the other peer nodes. A determination is made as to whether to handover one or more of the first peer node's transaction tracking responsibilities. If a second peer node is identified to take some of the first peer node's responsibilities, then a handover message is sent from the first peer node to the second peer node that assigns at least one of the first peer node's assigned transaction responsibilities to the second peer node.
摘要翻译： 提供了一种将负载平衡请求从第一对等节点发送到其他对等节点的方法。 一些对等节点已经分配了事务跟踪责任。 响应于识别出第一对等节点正在非最佳级别执行发送。 第一对等节点接收来自其他对等节点的响应。 确定是否切换一个或多个第一对等节点的事务跟踪责任。 如果识别出第二对等节点采取一些第一对等节点的职责，则从第一对等节点向第二对等节点发送切换消息，该第二对等节点将第一对等节点的分配事务责任中的至少一个分配给第二对等体 节点。
-
公开(公告)号：US08346922B2
公开(公告)日：2013-01-01
申请号：US13415696
申请日：2012-03-08
IPC分类号： G06F15/173
CPC分类号： G06F9/5083 , G06F11/3433 , G06F11/3495 , G06F2201/81 , G06F2201/86 , G06F2201/875
摘要： An approach is provided that transmits a load balance request from a first peer node to other peer nodes. Some of the peer nodes have assigned transaction tracking responsibilities. The transmitting is performed in response to identifying that the first peer node is performing at a non-optimal level. The first peer node receives responses from the other peer nodes. A determination is made as to whether to handover one or more of the first peer node's transaction tracking responsibilities. If a second peer node is identified to take some of the first peer node's responsibilities, then a handover message is sent from the first peer node to the second peer node that assigns at least one of the first peer node's assigned transaction responsibilities to the second peer node.
摘要翻译： 提供了一种将负载平衡请求从第一对等节点发送到其他对等节点的方法。 一些对等节点已经分配了事务跟踪责任。 响应于识别出第一对等节点正在非最佳级别执行发送。 第一对等节点接收来自其他对等节点的响应。 确定是否切换一个或多个第一对等节点的事务跟踪责任。 如果识别出第二对等节点采取一些第一对等节点的职责，则从第一对等节点向第二对等节点发送切换消息，该第二对等节点将第一对等节点的分配事务责任中的至少一个分配给第二对等体 节点。
-
公开(公告)号：US20110258309A1
公开(公告)日：2011-10-20
申请号：US12763667
申请日：2010-04-20
IPC分类号： G06F15/173
CPC分类号： G06F9/5083 , G06F11/3433 , G06F11/3495 , G06F2201/81 , G06F2201/86 , G06F2201/875
摘要： An approach is provided that transmits a load balance request from a first peer node to other peer nodes. Some of the peer nodes have assigned transaction tracking responsibilities. The transmitting is performed in response to identifying that the first peer node is performing at a non-optimal level. The first peer node receives responses from the other peer nodes. A determination is made as to whether to handover one or more of the first peer node's transaction tracking responsibilities. If a second peer node is identified to take some of the first peer node's responsibilities, then a handover message is sent from the first peer node to the second peer node that assigns at least one of the first peer node's assigned transaction responsibilities to the second peer node.
摘要翻译： 提供了一种将负载平衡请求从第一对等节点发送到其他对等节点的方法。 一些对等节点已经分配了事务跟踪责任。 响应于识别出第一对等节点正在非最佳级别执行发送。 第一对等节点接收来自其他对等节点的响应。 确定是否切换一个或多个第一对等节点的事务跟踪责任。 如果识别出第二对等节点采取一些第一对等节点的职责，则从第一对等节点向第二对等节点发送切换消息，该第二对等节点将第一对等节点的分配事务责任中的至少一个分配给第二对等体 节点。
-
公开(公告)号：US20110082927A1
公开(公告)日：2011-04-07
申请号：US12573980
申请日：2009-10-06
申请人： Graeme Stanley Chambers , Robert Ching Kong Cheung , Ashley Neil Clementi , Luke Rowan McKenna , Andrew Wilkins , Tee Yen Ng
发明人： Graeme Stanley Chambers , Robert Ching Kong Cheung , Ashley Neil Clementi , Luke Rowan McKenna , Andrew Wilkins , Tee Yen Ng
IPC分类号： G06F15/16
CPC分类号： G06Q10/06 , G06F11/3466
摘要： An approach is provided that receives a set of tracking data from a monitored activity. The set of tracking data includes name-value pairs. The received set name-value pairs are compared with context masks. Each context mask include one or more name-filter pairs. One of the sets of context masks is selected in response to determining that the incoming name-value pairs matches the mask name-filter pairs of the selected context mask. Name-value pairs are selected based upon the selected context mask. The selected name-value pairs are then stored in an aggregate data store. If the received set of tracking data fails to match at least one of the name-filter pairs then the received set of tracking data is disregarded and none of the name-value pairs are stored in the aggregate data store.
摘要翻译： 提供了一种从受监视的活动接收一组跟踪数据的方法。 跟踪数据集包括名称 - 值对。 接收的集合名称 - 值对与上下文掩码进行比较。 每个上下文掩码包括一个或多个名称过滤器对。 响应于确定传入名称 - 值对与所选择的上下文掩码的掩码名称 - 过滤器对匹配，选择上下文掩码集合中的一个。 基于所选择的上下文掩码来选择名称 - 值对。 所选的名称 - 值对然后存储在聚合数据存储中。 如果接收到的一组跟踪数据未能匹配至少一个名称 - 过滤器对，则接收到的一组跟踪数据被忽略，并且没有一个名称 - 值对被存储在聚合数据存储中。
-
公开(公告)号：US08533318B2
公开(公告)日：2013-09-10
申请号：US12573980
申请日：2009-10-06
申请人： Graeme Stanley Chambers , Robert Ching Kong Cheung , Ashley Neil Clementi , Luke Rowan McKenna , Andrew Wilkins , Tee Yen Ng
发明人： Graeme Stanley Chambers , Robert Ching Kong Cheung , Ashley Neil Clementi , Luke Rowan McKenna , Andrew Wilkins , Tee Yen Ng
IPC分类号： G06F15/173
CPC分类号： G06Q10/06 , G06F11/3466
摘要： An approach is provided that receives a set of tracking data from a monitored activity. The set of tracking data includes name-value pairs. The received set name-value pairs are compared with context masks. Each context mask include one or more name-filter pairs. One of the sets of context masks is selected in response to determining that the incoming name-value pairs matches the mask name-filter pairs of the selected context mask. Name-value pairs are selected based upon the selected context mask. The selected name-value pairs are then stored in an aggregate data store. If the received set of tracking data fails to match at least one of the name-filter pairs then the received set of tracking data is disregarded and none of the name-value pairs are stored in the aggregate data store.
摘要翻译： 提供了一种从受监视的活动接收一组跟踪数据的方法。 跟踪数据集包括名称 - 值对。 接收的集合名称 - 值对与上下文掩码进行比较。 每个上下文掩码包括一个或多个名称过滤器对。 响应于确定传入名称 - 值对与所选择的上下文掩码的掩码名称 - 过滤器对匹配，选择上下文掩码集合中的一个。 基于所选择的上下文掩码来选择名称 - 值对。 所选的名称 - 值对然后存储在聚合数据存储中。 如果接收到的一组跟踪数据未能匹配至少一个名称 - 过滤器对，则接收到的一组跟踪数据被忽略，并且没有一个名称 - 值对被存储在聚合数据存储中。
-
公开(公告)号：US08134935B2
公开(公告)日：2012-03-13
申请号：US12470852
申请日：2009-05-22
CPC分类号： H04L41/12 , H04L41/024 , H04L41/142
摘要： Determining a transaction topology of a network through generating and solving an adjacency matrix. A transaction is performed in a network and a list of statistics generated by the transaction is collected. The statistics provide a calculation of the number of inbound transactions and the number of outbound transactions for each node. A matrix structure is composed with the statistic. Constraints are applied to the matrix structure and a solution set of topology structures for the network is determined. The solution set of topology structures may be refined as needed with application of additional constraints.
摘要翻译： 通过生成和求解邻接矩阵来确定网络的事务拓扑。 在网络中执行事务，并收集由事务生成的统计信息列表。 统计数据提供了入站事务数量和每个节点的出站事务数量的计算。 矩阵结构由统计量组成。 约束被应用到矩阵结构，并且确定用于网络的拓扑结构的解集。 可以根据需要改进拓扑结构的解决方案，并应用额外的约束。
-
公开(公告)号：US20100296411A1
公开(公告)日：2010-11-25
申请号：US12470852
申请日：2009-05-22
IPC分类号： H04L12/28
CPC分类号： H04L41/12 , H04L41/024 , H04L41/142
摘要： Determining a transaction topology of a network through generating and solving an adjacency matrix. A transaction is performed in a network and a list of statistics generated by the transaction is collected. The statistics provide a calculation of the number of inbound transactions and the number of outbound transactions for each node. A matrix structure is composed with the statistic. Constraints are applied to the matrix structure and a solution set of topology structures for the network is determined. The solution set of topology structures may be refined as needed with application of additional constraints.
摘要翻译： 通过生成和求解邻接矩阵来确定网络的事务拓扑。 在网络中执行事务，并收集由事务生成的统计信息列表。 统计数据提供了入站事务数量和每个节点的出站事务数量的计算。 矩阵结构由统计量组成。 约束被应用到矩阵结构，并且确定用于网络的拓扑结构的解集。 可以根据需要改进拓扑结构的解决方案，并应用额外的约束。
-
-
-
-
-
-
-
搜索结果
8 条记录 (耗时 0.02 秒)
