公开(公告)号：WO2009036353A2

公开(公告)日：2009-03-19

申请号：PCT/US2008/076271

申请日：2008-09-12

Applicant: MICROSOFT CORPORATION

Inventor： SEN, Siddhartha ,  PETTER, Vladimir ,  D'AMATO, Andrea

IPC: G06F15/16

CPC classification number: G06F9/5033 ,  G06F9/505 ,  H04L67/1002 ,  H04L67/1006 ,  H04L67/1027 ,  H04L67/1029

Abstract: Aspects of the subject matter described herein relate to client affinity in distributed load balancing systems. In aspects, a request from a requestor is sent to each server of a cluster. Each server determines whether it has affinity to the requestor. If so, the server responds to the request. Otherwise, if the request would normally be load balanced to the server, the server queries the other servers in the cluster to determine whether any of them have affinity to the requestor. If one of them does, the server drops the request and allows the other server to respond to the request; otherwise, the server responds to the request.

Abstract translation: 本文描述的主题的方面涉及分布式负载平衡系统中的客户端亲和度。 在方面，来自请求者的请求被发送到集群的每个服务器。 每个服务器确定它是否对请求者具有亲和力。 如果是这样，则服务器响应该请求。 否则，如果通常将请求负载平衡到服务器，则服务器将查询群集中的其他服务器，以确定其中任何一个对请求者是否具有亲和力。 如果其中一个服务器丢失请求，则允许其他服务器响应该请求; 否则，服务器响应该请求。

公开(公告)号：WO2008033662A1

公开(公告)日：2008-03-20

申请号：PCT/US2007/076943

申请日：2007-08-28

Applicant: MICROSOFT CORPORATION

Inventor： SEN, Siddhartha

IPC: H04L12/24 ,  H04L12/56

CPC classification number: G06F9/505 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/101 ,  H04L67/1012 ,  H04L67/1019 ,  H04L67/1023

Abstract: Described is a technology by which a relative load of network traffic handling is determined between servers of a cluster, based upon time values that correspond to time taken by each server to handle a packet. Load may be transferred between the servers based upon the relative load, for example by having a less-loaded server take some of the responsibility for processing incoming traffic from a more-loaded server. For example, the processing time of a server may be determined by when a receiving server receives a request packet, and when that server sends a return packet. A round trip time for a request and return communication may also be established. A logical tree of nodes representing the servers may be constructed to select pairs of servers for balancing with one another, with the selection algorithm operating recursively, in parallel, and/or repeatedly, until the cluster is balanced.

Abstract translation: 描述了一种技术，其中基于与每个服务器处理分组所花费的时间相对应的时间值来确定群集的服务器之间的网络流量处理的相对负载。 可以基于相对负载在服务器之间传送负载，例如通过使负载较小的服务器承担处理来自较负载服务器的传入流量的一些责任。 例如，服务器的处理时间可以由接收服务器何时接收到请求分组以及当该服务器发送返回分组时确定。 还可以建立请求和返回通信的往返时间。 可以构造表示服务器的节点的逻辑树，以选择成对的服务器以彼此平衡，并且选择算法并行地和/或重复地进行递归运算，直到该集群被平衡。