Method and apparatus for load balancing work on a network of servers based on the probability of being serviced within a service time goal

• US 20050071844A1
• Filed: 09/26/2003
• Published: 03/31/2005
• Est. Priority Date: 09/26/2003
• Status: Active Grant

• Current Assignee: Avaya Incorporated
• Original Assignee: Avaya Incorporated
• Inventors: Flockhart, Andrew D., Steiner, Robert C., Roybal, Larry John
• Granted Patent: US 7,770,175 B2
• Time in Patent Office: Days
• US Class Current: 718/105
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/10015 Access to distributed or replicated servers, e.g. using brokers
• CPC Class Codes: H04L 67/1008 based on parameters of servers, e.g. available memory or workload monitoring of computer activity G06F11/30
• CPC Class Codes: H04L 67/1023 based on a hash applied to IP addresses or costs
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

The present invention is directed to balancing resource loads. In particular, the present invention is directed to assigning work to service locations having the greatest probability of servicing the work within a target time. Because an average wait time is not necessarily equal to a probability of servicing work within a target time, the present invention is useful in meeting service target goals. Because the present invention operates by comparing the probability of a defined set of service locations to one another, absolute probabilities need not be calculated. Instead, relative probabilities may be used in assigning work.

Claims