System and method for server selection for mirrored sites

• US 6,115,752 A
• Filed: 05/21/1998
• Issued: 09/05/2000
• Est. Priority Date: 05/21/1998
• Status: Expired due to Term

• Current Assignee: Oracle America, Inc. (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Chauhan, Abhishek
• Primary Examiner(s): Maung, Zarni
• Assistant Examiner(s): CALDWELL, ANDREW T
• Application Number:
  US09/083,864
• Time in Patent Office: 838 Days
• Field of Search: 709/238, 709/241-242, 709/244
• US Class Current: 709/241
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 61/4511 using domain name system [DNS]
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/101 based on network conditions
• CPC Class Codes: H04L 67/1017 based on a round robin mechanism

Abstract

The present invention is a system and method for providing server selection for mirrored sites. In one embodiment, a user requests an address via a local name service (LNS), and the local name service requests the address from a server, examples of which include an authoritative name server, and a Optimizer Name Server (ONS). If the ONS has already calculated a best route which applies to this user, and a predetermined time applying to the best route has not yet expired, then the ONS replies to the user with the best route server. In one embodiment, the best route is determined by having the ONS server request from all the mirrored servers the round trip time to the LNS. This is accomplished by having each mirrored server respond to the LNS with a name query. In response, the LNS replies with an error message. The round trip time is measured from the time the name query was sent to the time the error message was received. Each mirrored server then sends the measured round trip time to the ONS. If, however, the best route has not been determined or the predetermined time for the best route has expired, then the ONS replies to the user via a selection scheme, such as a round robin scheme, and also initiates a best route determination to determine which is the best route for this user.

Claims

1. A method for computer server selection in a computer network including a plurality of servers, the method comprising:

determining whether a best route has been determined;

determining if a predetermined time has expired after the best route has been determined, and either;

selecting one of the plurality of servers as a best route server if the best route has been determined and the predetermined time has not expired;

or

selecting one of the plurality of servers as a selection scheme server if the best route has not been determined or if the predetermined time has expired, the selection of the selection scheme server being determined via a selection scheme, wherein the selection scheme does not include determining the best route.

2. The method of claim 1, wherein the selection scheme is a round robin scheme.

3. The method of claim 1, further including a step of determining the best route if the best route has not been determined.

4. The method of claim 3, wherein the determination of best route includes determining a round trip time from one of the plurality of servers to a local name server.

5. The method of claim 4, wherein the determination of the round trip time includes a step of sending a name query to the local name server.

6. The method of claim 5, wherein the determination of the round trip time includes a step of receiving an error message from the local name server.

7. The method of claim 4, wherein the determination of the round trip time includes a step of sending an echo packet to the local name server.

8. The method of claim 7, wherein the determination of the round trip time includes a step of receiving a returning echo packet from the local name server.

9. The method of claim 1, wherein the determination of best route includes determining a first round trip time from a first one of the plurality of servers to a local name server and a second round trip time from a second one of the plurality of servers to the local name server.

10. The method of claim 9, wherein the first round trip time and the second round trip time is compared to determine which one of the first and second servers has the best route.

11. The method of claim 1, wherein the best route includes a shortest round trip time between one of the plurality of servers and a local name server.

12. A system for computer server selection in a computer network including a plurality of servers, the system comprising:

means for determining whether a best route has been determined;

means for determining if a predetermined time has expired after the best route has been determined;

means for selecting one of the plurality of servers as a best route server if the best route has been determined and the predetermined time has not expired; and

means for selecting one of the plurality of servers as a selection scheme server if the best route has not been determined or if the predetermined time has expired, the selection of the selection scheme server being determined via a selection scheme, wherein the selection scheme does not include determining the best route.

13. A system for computer server selection in a computer network, the system comprising:

a plurality of servers; and

an authoritative name server coupled to the plurality of servers, wherein the authoritative name server determines whether a best route has been determined, and selects one of the plurality of servers as a best route server if the best route has been determined and if a predetermined time has expired after the best route has been determined;

or selects one of the plurality of servers as a selection scheme server, if the best route has not been determined or if the predetermined time has expired, wherein the selection scheme does not include determining the best route.

14. A computer program product for computer server selection in a computer network including a plurality of servers, comprising:

computer code determining whether a best route has been determined;

computer code determining if a predetermined time has expired after the best route has been determined; and

either;

computer code selecting one of the plurality of servers as a best route server if the best route has been determined and the predetermined time has not expired;

computer code selecting one of the plurality of servers as a selection scheme server if the best route has not been determined or if the predetermined time has expired, the selection of the selection scheme server being determined via a selection scheme, wherein the selection scheme does not include determining the best route; and

a computer readable medium that stores the computer codes.

15. The computer program product of claim 14, wherein the computer readable medium is selected from the group consisting of CD-ROM, floppy disk, tape, flash memory, system memory, hard drive, and data signal embodied in a carrier wave.

16. A method comprising the steps of:

receiving a request of service for one of a plurality of servers any which of one can process the request;

determining if a best route to a best server among the plurality of servers has previously been defined; and

either;

determining if the best route is valid by determining if a predetermined time period has lapsed since the best server was defined; and

routing the request to the best server if the best rout is valid;

or

selecting one of the plurality of servers to process the request using a selection scheme if either the best server has not been previously defined or if the predetermined time period has lapsed, the selection scheme not using a best route determining scheme in selecting the selected server.