公开(公告)号：US20090327817A1

公开(公告)日：2009-12-31

申请号：US12147763

申请日：2008-06-27

申请人： Arun Kwangil Iyengar ,  Thomas Repantis

发明人： Arun Kwangil Iyengar ,  Thomas Repantis

IPC分类号： G06F17/30 ,  G06F11/07

CPC分类号： G06F17/30348 ,  G06F2201/82

摘要： Techniques for coordinating updates to replicated data are disclosed. For example, in a system comprised of a plurality of nodes, a method for maintaining consistent copies of data across said nodes comprises the following steps. A copy of an object o1 is maintained by a plurality of nodes. In response to a request r1 to update a copy of object o1, a message is sent to at least some of said plurality of nodes instructing a node receiving the message to invalidate its copy of object o1. In response to a node n1 receiving an invalidation message arising from r1 wherein n1 is processing another request r2 to update object o1, requests r1 and r2 are coordinated to prevent the requests from causing conflicting updates or invalidations.

摘要翻译： 公开了用于协调对复制数据的更新的技术。 例如，在由多个节点组成的系统中，用于在所述节点之间维持一致的数据副本的方法包括以下步骤。 对象o1的副本由多个节点维护。 响应于更新对象o1的副本的请求r1，向所述多个节点中的至少一些节点发送消息，指示接收到该消息的节点使其对象o1的副本无效。 响应于接收到由r1产生的无效消息的节点n1，其中n1正在处理另一请求r2来更新对象o1，协调请求r1和r2以防止请求引起冲突的更新或无效。

公开(公告)号：US20090271798A1

公开(公告)日：2009-10-29

申请号：US12110813

申请日：2008-04-28

申请人： Arun Kwangil Iyengar ,  Hongbo Jiang ,  Erich Miles Nahum ,  Wolfgang Segmuller ,  Asser Nasreldin Tantawi ,  Charles P. Wright

发明人： Arun Kwangil Iyengar ,  Hongbo Jiang ,  Erich Miles Nahum ,  Wolfgang Segmuller ,  Asser Nasreldin Tantawi ,  Charles P. Wright

IPC分类号： G06F9/46

CPC分类号： G06F9/505 ,  G06F9/5033 ,  H04L65/1006 ,  H04L67/1002 ,  H04L67/1023 ,  H04L67/1027

摘要： Techniques are disclosed for load balancing in networks such as those networks handling telephony applications. By way of example, a method for directing requests associated with calls to servers in a system comprised of a network routing calls between a plurality of nodes wherein a node participates in a call as a caller or a receiver and wherein a load balancer sends requests associated with calls to a plurality of servers comprises the following steps. A request associated with a node belonging to a group including a plurality of nodes is received. A server is selected to receive the request. A subsequent request is received. A determination is made whether or not the subsequent request is associated with a node belonging to the group. The subsequent request is sent to the server based on determining that the subsequent request is associated with a node belonging to the group. By way of another example, a method for balancing requests among servers in a client server environment wherein a load balancer sends requests associated with a client to a plurality of servers comprises the following steps. Information is maintained regarding a weighted number of requests assigned to each server. The load balancer receives a request from a client. A server s1 is selected to receive the request by examining the maintained information and identifying a server with a least weighted number of requests assigned thereto. The load balancer sends the request to server s1 and increments a weighted number of requests assigned to server s1 in the maintained information. In response to receiving a notification from server s1 that the request has completed, a weighted number of requests assigned to server s1 is decremented in the maintained information.

摘要翻译： 公开了用于诸如处理电话应用的那些网络的网络中的负载平衡的技术。 作为示例，一种用于将与呼叫相关联的请求定向在由多个节点之间的网络路由呼叫组成的系统中的服务器的方法，其中节点作为呼叫者或接收者参与呼叫，并且其中负载平衡器发送相关联的请求 对多个服务器的呼叫包括以下步骤。 接收与属于包括多个节点的组的节点相关联的请求。 选择服务器接收请求。 接收到后续请求。 确定后续请求是否与属于该组的节点相关联。 基于确定后续请求与属于该组的节点相关联，将后续请求发送到服务器。 作为另一示例，用于在客户端服务器环境中的服务器之间平衡请求的方法，其中负载平衡器将与客户端相关联的请求发送到多个服务器包括以下步骤。 维护关于分配给每个服务器的加权数量的信息。 负载均衡器从客户端接收请求。 选择服务器s1以通过检查维护的信息并识别具有分配给其的最少加权数量的服务器来接收请求。 负载平衡器将请求发送到服务器s1，并在维护的信息中增加分配给服务器s1的加权数量。 响应于从服务器s1接收到请求已经完成的通知，分配给服务器s1的加权数量在维护的信息中减少。

公开(公告)号：US07574563B2

公开(公告)日：2009-08-11

申请号：US11502213

申请日：2006-08-10

申请人： James Robert Harold Challenger ,  Louis Ralph Degenaro ,  Robert Filepp ,  Arun Kwangil Iyengar ,  Richard Pervin King

发明人： James Robert Harold Challenger ,  Louis Ralph Degenaro ,  Robert Filepp ,  Arun Kwangil Iyengar ,  Richard Pervin King

IPC分类号： G06F12/00 ,  G06F13/00

CPC分类号： G06F17/30902 ,  G06F17/30451

摘要： Methods for serving data include maintaining an incomplete version of an object at a server and at least one fragment at the server. In response to a request for the object from a client, the incomplete version of the object, an identifier for a fragment comprising a portion of the object, and a position for the fragment within the object are sent to the client. After receiving the incomplete version of the object, the identifier, and the position, the client requests the fragment from the server using the identifier. The object is constructed by including the fragment in the incomplete version of the object in a location specified by the position.

摘要翻译： 用于服务数据的方法包括在服务器处维护对象的不完整版本以及在服务器处保留至少一个片段。 响应于来自客户端的对象的请求，对象的不完整版本，包含对象的一部分的片段的标识符和对象内的片段的位置被发送到客户端。 在接收到对象的不完整版本，标识符和位置后，客户端使用标识符从服务器请求片段。 该对象通过将该片段包含在该位置指定的位置的不完整版本的对象中来构造。

公开(公告)号：US20080276244A1

公开(公告)日：2008-11-06

申请号：US12173502

申请日：2008-07-15

申请人： Arun Kwangil Iyengar

发明人： Arun Kwangil Iyengar

IPC分类号： G06F9/46

CPC分类号： G06F11/3466 ,  G06F11/3409

摘要： A method for communicating information from a first computing node to at least one of the following: a storage device and a second computing node. The first computing node is monitored to collect at least one estimate of available resources, and based on this estimate, an amount of data collected is modified. Then, the modified data is sent to at least one of the following: the storage device and the second computing node. This invention also provides for the determination of an optimum batch size for aggregating data wherein, for a number of batch sizes, costs are estimated for sending batched information to persistent storage and for losing batched data. Then, the optimum batch size is selected from the number of different batch sizes based on sums of these costs. This invention also provides for selective compression of data, wherein it is determined which of a number of compression algorithms do not incur an overhead that exceeds available resources. Then, one of the determined algorithms is selected to maximize compression.

摘要翻译： 一种用于将信息从第一计算节点传送到以下的至少一个的方法：存储设备和第二计算节点。 监视第一计算节点以收集至少一个可用资源的估计，并且基于该估计，修改收集的数据量。 然后，将修改的数据发送到以下至少一个：存储设备和第二计算节点。 本发明还提供用于确定用于聚合数据的最佳批量大小，其中对于多个批量大小，估计用于将批量信息发送到持久存储器并丢失批量数据的成本。 然后，基于这些成本的总和，从不同批量大小的数量中选择最佳批量大小。 本发明还提供对数据的选择性压缩，其中确定多个压缩算法中的哪一个不会引起超出可用资源的开销。 然后，选择确定的算法之一以最大化压缩。

公开(公告)号：US20080235397A1

公开(公告)日：2008-09-25

申请号：US12132811

申请日：2008-06-04

申请人： Louis R. Degenaro ,  Lei Gao ,  Arun Kwangil Iyengar ,  Jian Yin

发明人： Louis R. Degenaro ,  Lei Gao ,  Arun Kwangil Iyengar ,  Jian Yin

IPC分类号： G06F15/173

CPC分类号： G06F9/5083 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1017 ,  H04L67/1023 ,  H04L2029/06054

摘要： Improved load balancing techniques are disclosed. For example, in one illustrative aspect of the invention, a method of satisfying requests in a system comprised of a plurality of servers comprises the following steps. At least one load balancer is provided for routing requests to the plurality of servers. At the at least one load balancer, a request sent from a client is obtained. At the at least one load balancer, the request is examined. Costs of satisfying the request by at least two of the plurality of servers are estimated. The estimation is based on at least one of a number and a cost of at least one remote access for satisfying the request. The request is routed to a server of the plurality of servers with a low estimated cost of satisfying the request.

摘要翻译： 公开了改进的负载平衡技术。 例如，在本发明的一个说明性方面，在由多个服务器构成的系统中满足请求的方法包括以下步骤。 提供至少一个负载平衡器用于将请求路由到多个服务器。 在至少一个负载均衡器上，获得从客户端发送的请求。 在至少一个负载均衡器上，检查该请求。 估计满足多个服务器中的至少两个的请求的成本。 该估计基于用于满足该请求的至少一个远程访问的数量和成本中的至少一个。 以满足请求的低估计成本将该请求路由到多个服务器的服务器。

公开(公告)号：US07395279B2

公开(公告)日：2008-07-01

申请号：US10715237

申请日：2003-11-17

申请人： Arun Kwangil Iyengar ,  Richard P. King ,  Lakshmish Macheeri Ramaswamy ,  Daniela Rosu ,  Karen Witting

发明人： Arun Kwangil Iyengar ,  Richard P. King ,  Lakshmish Macheeri Ramaswamy ,  Daniela Rosu ,  Karen Witting

IPC分类号： G06F17/30 ,  G06F12/00

CPC分类号： G06F17/30215 ,  Y10S707/99932 ,  Y10S707/99952

摘要： A system and method for maintaining consistency in a system where multiple copies of an object may exist is provided for maintaining consistent copies. Consistency is maintained using a plurality of consistency policies in which at least one consistency policy results in different performance than a second consistency policy. A consistency policy is selected from the plurality consistency policies for each object to improve system performance.

摘要翻译： 提供用于维持一个对象的多个副本可能存在的系统中的一致性的系统和方法，用于维持一致的副本。 使用多个一致性策略维护一致性，其中至少一个一致性策略导致与第二一致性策略不同的性能。 从每个对象的多个一致性策略中选择一致性策略以提高系统性能。

公开(公告)号：US07114032B2

公开(公告)日：2006-09-26

申请号：US10622209

申请日：2003-07-18

申请人： James Robert Harold Challenger ,  Louis Ralph Degenaro ,  Robert Filepp ,  Arun Kwangil Iyengar ,  Richard Pervin King

发明人： James Robert Harold Challenger ,  Louis Ralph Degenaro ,  Robert Filepp ,  Arun Kwangil Iyengar ,  Richard Pervin King

IPC分类号： G06F12/00 ,  G06F13/00

CPC分类号： G06F17/30902 ,  G06F17/30451

摘要： Methods for serving data include maintaining an incomplete version of an object at a server and at least one fragment at the server. In response to a request for the object from a client, the incomplete version of the object, an identifier for a fragment comprising a portion of the object, and a position for the fragment within the object are sent to the client. After receiving the incomplete version of the object, the identifier, and the position, the client requests the fragment from the server using the identifier. The object is constructed by including the fragment in the incomplete version of the object in a location specified by the position.

公开(公告)号：US06618751B1

公开(公告)日：2003-09-09

申请号：US09378264

申请日：1999-08-20

申请人： James Robert Harold Challenger ,  Cameron Donald Ferstat ,  Arun Kwangil Iyengar ,  Paul Reed ,  Karen A. Witting

发明人： James Robert Harold Challenger ,  Cameron Donald Ferstat ,  Arun Kwangil Iyengar ,  Paul Reed ,  Karen A. Witting

IPC分类号： G06F1300

CPC分类号： H04L67/325 ,  H04L67/28 ,  H04L67/2852 ,  H04L69/329

摘要： Systems and methods for publishing objects (e.g., pages and/or fragments) include assigning expiration times to different versions of objects and determining a plurality of objects which should be published atomically, that is, together in a single action. Then, the invention includes computing updated versions of the plurality of objects and atomically publishing the updated versions wherein the updated versions are not available until after expiration times corresponding to previously published versions of at least one of the plurality of objects (e.g., a cached object) have elapsed. Advantageously, clients attempting to access related cached objects over an information network such as the Internet will not be presented with versions of related objects that are inconsistent with one another.

摘要翻译： 用于发布对象（例如，页面和/或片段）的系统和方法包括将到期时间分配给对象的不同版本，并且确定应当以原子方式发布的多个对象，即，一起在单个动作中。 然后，本发明包括计算多个对象的更新版本并原子发布更新的版本，其中更新的版本不可用，直到对应于多个对象中的至少一个的先前发布的版本的到期时间（例如，高速缓存的对象 ）已经过去了 有利的是，尝试通过诸如因特网的信息网络访问相关缓存对象的客户端将不会呈现彼此不一致的相关对象的版本。

公开(公告)号：US06424992B2

公开(公告)日：2002-07-23

申请号：US08947361

申请日：1997-10-08

申请人： Murthy V. Devarakonda ,  Daniel Manuel Dias ,  German Sergio Goldszmidt ,  Guerney Douglass Holloway Hunt ,  Arun Kwangil Iyengar ,  Richard Pervin King ,  Rajat Mukherjee

发明人： Murthy V. Devarakonda ,  Daniel Manuel Dias ,  German Sergio Goldszmidt ,  Guerney Douglass Holloway Hunt ,  Arun Kwangil Iyengar ,  Richard Pervin King ,  Rajat Mukherjee

IPC分类号： G06F1300

CPC分类号： H04L67/1008 ,  H04L67/1002 ,  H04L67/1027

摘要： An affinity-based router and method for routing and load balancing in an encapsulated cluster of server nodes is disclosed. The system consists of a multi-node server, wherein any of the server nodes can handle a client request, but wherein clients have affinity to one or more of the server nodes that are preferred to handle a client request. Such affinity is due to state at the servers either due to previous routing requests, or data affinity at the server. At the multi-node server, a node may be designated as a TCP router. The address of the TCP router is given out to clients, and client requests are sent thereto. The TCP router selects one of the nodes in the multi-node server to process the client request, and routes the request to this server; in addition, the TCP router maintains affinity tables, containing affinity records, indicating which node a client was routed to. In processing the client request, the server nodes may determine that another node is better suited to handle the client request, and may reset the corresponding TCP router affinity table entry. The server nodes may also create, modify or delete affinity records in the TCP router affinity table. Subsequent requests from this client are routed to server nodes based on any affinity records, possibly combined on other information (such as load).

摘要翻译： 公开了一种基于亲和力的路由器和方法，用于在封装的服务器节点集群中进行路由和负载平衡。 该系统由多节点服务器组成，其中任何服务器节点可以处理客户端请求，但是其中客户端对于优先处理客户端请求的一个或多个服务器节点具有亲和力。 这种亲和力是由于在服务器处的状态是由于先前的路由请求或在服务器处的数据关联。 在多节点服务器上，可以将节点指定为TCP路由器。 将TCP路由器的地址发送给客户端，并向客户端发送客户端请求。 TCP路由器选择多节点服务器中的一个节点来处理客户端请求，并将请求路由到该服务器; 此外，TCP路由器维护包含亲和性记录的关联表，指示客户端被路由到哪个节点。 在处理客户端请求时，服务器节点可以确定另一个节点更适合处理客户机请求，并且可以重置对应的TCP路由器亲和性表项。 服务器节点还可以在TCP路由器亲和性表中创建，修改或删除关联记录。 来自该客户端的后续请求将基于任何关联记录路由到服务器节点，可能与其他信息（如加载）相结合。

公开(公告)号：US06266742B1

公开(公告)日：2001-07-24

申请号：US08958506

申请日：1997-10-27

申请人： James Robert Harold Challenger ,  Arun Kwangil Iyengar

发明人： James Robert Harold Challenger ,  Arun Kwangil Iyengar

IPC分类号： G06F1208

CPC分类号： G06F12/0888 ,  G06F12/123

摘要： In a computer system in which caching is utilized for improving performance, a method for determining whether an uncached object should be cached, and, if so, which objects, if any, should be removed from a cache to make room for the new uncached object. The method assigns a metric correlated with the desirability of caching an object, considering parameters such as access frequencies, object sizes, object lifetimes and times to calculate and/or to fetch the object. The metric weights more recent accesses more heavily than less recent accesses. The method can be used for improving the performance of an algorithm which utilizes priority queues and can additionally be applied when attempting to predict the expected frequency of an occurrence based upon past occurrences.

摘要翻译： 在用于提高性能的高速缓存的计算机系统中，用于确定是否应缓存未缓存的对象的方法，以及如果有的话，哪些对象（如果有的话）应该从高速缓存中移除以为新的未被缓存的对象腾出空间 。 该方法分配与缓存对象的可取性相关的度量，考虑诸如访问频率，对象大小，对象生命周期以及计算和/或获取对象的时间等参数。 度量权重更近的访问比较近的访问更重。 该方法可以用于改进利用优先级队列的算法的性能，并且当尝试基于过去的事件来预测出现的预期频率时，可以另外应用该方法。