公开(公告)号：US20090034537A1

公开(公告)日：2009-02-05

申请号：US11868317

申请日：2007-10-05

申请人： Carol Colrain ,  Michael Zoll ,  Rajkumar Irudayaraj

发明人： Carol Colrain ,  Michael Zoll ,  Rajkumar Irudayaraj

IPC分类号： H04L12/56

CPC分类号： H04L67/322 ,  H04L45/121 ,  H04L45/306 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/327

摘要： Techniques for routing client requests among a group of nodes offering a service are described. A coordinator determines that performance could be improved by using affinity-based routing. In one embodiment, the coordinator calculates a Time-to-Live (TTL) metric whereby clients benefit by returning to the same cache and posts this hint to subscribers. Client's start preserving locality data in an affinity context, such that later requests for a connection can be routed to the location last visited. The coordinator measures the system over subsequent intervals. If the gradient of the goodness (viz service quality and capacity) is stable or improving, then the coordinator continues to advise subscribers to use the affinity-based technique. Alternatively, if the gradient of the goodness is deteriorating, then the coordinator posts advice to the subscribers to stop using the affinity-based technique for any instance during the next intervals.

摘要翻译： 描述了在提供服务的一组节点之间路由客户端请求的技术。 协调者决定通过使用基于亲和性的路由可以提高性能。 在一个实施例中，协调器计算生存时间（TTL）度量，由此客户端通过返回到相同的高速缓存并且向用户发布该提示而受益。 客户端启动在亲和性上下文中保留位置数据，以便稍后的连接请求可以路由到上次访问的位置。 协调员在随后的时间间隔内测量系统。 如果善意的梯度（服务质量和容量）稳定或改善，协调员将继续建议用户使用基于亲和力的技术。 或者，如果善意的渐变正在恶化，则协调器向订阅者发布建议以在下一间隔期间停止对任何实例使用基于亲和力的技术。

公开(公告)号：US20070288463A1

公开(公告)日：2007-12-13

申请号：US11450179

申请日：2006-06-09

申请人： Eugene Ho ,  Kotaro Ono ,  Neil Macnaughton ,  Michael Zoll ,  Herbert van den Bergh

发明人： Eugene Ho ,  Kotaro Ono ,  Neil Macnaughton ,  Michael Zoll ,  Herbert van den Bergh

IPC分类号： G06F17/30

CPC分类号： G06F17/30362

摘要： Methods and apparatuses for providing access to data in a cluster database are described. Embodiments of the invention include identifying situations in which many nodes require relatively equal access to a data block, and taking appropriate measures to improve the performance of the system in these situations. For example, a node may automatically downgrade its lock from an X lock to an S lock as soon as it has finished a modification of the data. S locks are sent to other nodes in the system as soon as a modification is complete. Modifications to the data are also sent to other nodes in the system as soon as a modification is complete. Depending on the size of the data modification, the entire data block may be sent, or only the modifications to the data may be sent.

摘要翻译： 描述了用于提供对群集数据库中的数据的访问的方法和装置。 本发明的实施例包括识别许多节点需要对数据块相对相等的访问的情况，并且在这些情况下采取适当的措施来提高系统的性能。 例如，一旦节点完成数据的修改，节点就可以自动将其锁定从X锁降级到S锁。 一旦修改完成，S锁将被发送到系统中的其他节点。 一旦修改完成，对数据的修改也将发送到系统中的其他节点。 根据数据修改的大小，可以发送整个数据块，或者仅可以发送对数据的修改。