RECORD MEDIUM WITH A LOAD DISTRIBUTION PROGRAM RECORDED THEREON, LOAD DISTRIBUTION METHOD, AND LOAD DISTRIBUTION APPARATUS

• US 20100057935A1
• Filed: 11/09/2009
• Published: 03/04/2010
• Est. Priority Date: 05/24/2005
• Status: Abandoned Application

• Current Assignee: Fujitsu Limited
• Original Assignee: Fujitsu Limited
• Inventors: KAWAI, Tsutomu, Sekigulchi, Atsuji, Tsuchiya, Satoshi, Shimojima, Kazuki
• Application Number:
  US12/615,126
• Publication Number:
  US 20100057935A1
• Time in Patent Office: Days
• US Class Current: 709/241
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• 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/101 based on network conditions
• CPC Class Codes: H04L 67/1021 based on client or server locations
• CPC Class Codes: H04L 67/563 Data redirection of data network streams

Abstract

A record medium on which a load distribution program capable of dynamically determining a service providing server which can provide a service of high quality according to a place where a client is installed is recorded. A delay time determination section analyzes a request sent from a client, identifies a position on a network of the client, and determines processing delay time the client takes to receive a response from each data center on the basis of a communication path between the position of the client and a position on the network of each data center. An allocation determination section preferentially selects a data center which can provide a service to the client after shortest processing delay time as a recommended data center on the basis of the processing delay time determined by the delay time determination section. A service allocation section makes a server in the recommended data center provide the service to the client which outputted the request.

Claims

1. A computer-readable medium storing a load distribution program, which when executed by a computer, causes the computer to perform a method for dynamically allocating requests from clients to a plurality of data centers, the method comprising:

analyzing a request sent from a client to identify a position on a network of the client;

determining processing delay times representing an amount of time for the client to receive a response from each data center on the basis of a communication path between the position of the client and a position on the network of each data center;

selecting, preferentially, a data center which can provide a service to the client with a shortest processing delay time as a recommended data center on the basis of the determined processing delay times; and

making a server in the recommended data center provide the service to the client which outputted the request.

2. The computer-readable medium according to claim 1, the method further comprising:

specifying a client connection server to which the client is connected on the basis of a source address included in the request; and

the determining determines the processing delay times taken between the client and each data center on the basis of a position of the client connection server specified.

3. The computer-readable medium according to claim 2, the method further comprising:

referring to a delay time management table where communication delay times taken between the client connection server which provides an Internet connection service to the client and each data center are set in advance; and

the determining determines the processing delay times based on information obtained by referring to the delay time management table.

4. The computer-readable medium according to claim 1, the method further comprising:

enhancing processing capability of the recommended data center if an excess resource for performing a process corresponding to the request is not left in the recommended data center.

5. The computer-readable medium according to claim 4, wherein until completion of enhancement of the processing capability of the recommended data center, the making temporarily makes another data center provide the service to the client which outputted the request.

6. The computer-readable medium according to claim 1, wherein the selecting selects a data center for which a maximum value of permissible processing delay time is set in advance as permissible delay time, for which the permissible delay time is guaranteed, and in which an excess resource for performing a process corresponding to the request is left as the recommended data center.

7. The computer-readable medium according to claim 6, the method further comprising:

determining the permissible delay time which is set for each service class indicative of guaranteed service quality at the time of allocating the request on the basis of a service class to which a user who uses the client belongs.

8. The computer-readable medium according to claim 1, the method further comprising:

securing a resource by stopping the providing of a service to a user who belongs to a service class lower in priority than a service class to which a user who uses the client belongs if an excess resource for performing a process corresponding to the request is not left in the recommended data center.

9. The computer-readable medium according to claim 1, the method further comprising:

reallocating all users to which services are provided by the plurality of data centers to the plurality of data centers at specified times.

10. A load distribution method for dynamically allocating requests from clients to a plurality of data centers with a computer, the method comprising:

analyzing a request sent from a client to identify a position on a network of the client;

determining processing delay times representing an amount of time the client takes to receive a response from each data center on the basis of a communication path between the position of the client and a position on the network of each data center;

selecting, preferentially, a data center which can provide a service to the client with a shortest processing delay time as a recommended data center on the basis of the determined processing delay times; and

making a server in the recommended data center provide the service to the client which outputted the request.

11. A load distribution apparatus for dynamically allocating requests from clients to a plurality of data centers, the apparatus comprising:

a delay time determination section to analyze a request sent from a client in order to identify a position on a network of the client, and determine processing delay times representing an amount of time the client takes to receive a response from each data center on the basis of a communication path between the position of the client and a position on the network of each data center;

an allocation determination section to preferentially select a data center which can provide a service to the client with a shortest processing delay time as a recommended data center on the basis of the processing delay times determined by the delay time determination section; and

a service allocation section to make a server in the recommended data center provide the service to the client which outputted the request.