System and method for directing clients to optimal servers in computer networks

• US 7,664,876 B2
• Filed: 09/10/2002
• Issued: 02/16/2010
• Est. Priority Date: 03/16/2000
• Status: Active Grant

• Current Assignee: Online Video Network, Inc.
• Original Assignee: ADARA Networks, Inc.
• Inventors: Garcia-Luna-Aceves, Jose J., Vutukury, Srinivas
• Primary Examiner(s): Barqadle; Yasin M
• Application Number:
  US10/241,321
• Publication Number:
  US 20030101278A1
• Time in Patent Office: 2,716 Days
• Field of Search: 709/223, 709/226, 709238-245, 709217-219
• US Class Current: 709/240
• CPC Class Codes: G06F 12/1483 using an access-table, e.g. matrix or list
• CPC Class Codes: G06F 16/9574 of access to content, e.g. by caching
• CPC Class Codes: H04L 12/18 for broadcast or conference , e.g. multicast
• CPC Class Codes: H04L 43/0805 by checking availability
• CPC Class Codes: H04L 43/0852 Delays
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 61/00 Network arrangements, protocols or services for addressing or naming
• CPC Class Codes: H04L 61/457 containing identifiers of data entities on a computer, e.g. file names
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/1006 with static server selection, e.g. the same server being selected for a specific client
• 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/1014 based on the content of a request
• CPC Class Codes: H04L 67/1023 based on a hash applied to IP addresses or costs
• CPC Class Codes: H04L 67/1038 Load balancing arrangements to avoid a single path through a load balancer
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching

Abstract

A communication protocol includes one or more messages passed between Web routers over a reliable transmission protocol used for inter-Web router communication. These messages include information that allows the Web routers to dynamically update mappings of client addresses or address ranges to information object repository addresses based on client-to-server distance and server load. The mappings are preferably optimal mappings of the client addresses or address ranges to the information object repository addresses and the messages report updated distances from these information object repository addresses to the client addresses or address ranges. For example, the messages may report, for each updated distance, an associated client address or address range and/or an associated anchor address of a Web router co-located with an information object repository that is the subject of the message.

Claims

1. A method, comprising:

constructing a virtual overlay network of Web routers defined on top of an internetwork communicatively coupled to one another via point-to-point links;

exchanging Web Information Locator by Distance (WILD) inter-Web router communication messages using a WILD protocol between neighbor Web routers by communicating between the neighbor Web routers, and not the other Web routers in the virtual overlay network;

constructing WILD tables containing client-to-server distance information, a WILD table constructed by each of the respective Web routers based on the WILD messages having client-to-server distance information received from other neighbor Web routers and each WILD table being stored in a computer-readable medium accessible by the corresponding Web router, wherein the client comprises any information object requesting device, or a group thereof, communicatively coupled to one or more of the Web routers and the server comprises any information object repository accessible by one or more clients; and

determining, using the client-to-server distance information contained in one or more of the WILD tables, a best server for servicing a request for a particular information object made by one of the clients.

2. The method of claim 1, wherein the best server is determined in terms of distance from the best server to the client making the request and a current load on the best server.

3. The method of claim 2, wherein the distance from the best server to the client making the request is measured in terms of network latency.

4. The method of claim 2, further comprising updating the tables in response to revised client-to-Web router distance information.

5. The method of claim 4, wherein the revised client-to-Web router distance information is included in the inter-Web router communication messages.

6. The method of claim 5, wherein the revised client-to-Web router distance information is determined, at least in part, from internetwork connectivity information received through an exchange of messages according to an inter-domain routing protocol.

7. The method of claim 6, wherein the inter-domain routing protocol comprises a Border Gateway Protocol.

8. The method of claim 2, further comprising updating the tables in response to revised server load information.

9. The method of claim 8, further comprising updating the tables in response to revised client-to-Web router distance information.

10. The method of claim 9, wherein the revised client-to-Web router distance information is included in the inter-Web router communication messages.

11. The method of claim 10, further comprising transmitting updated table information to one or more of the Web routers using one or more inter-Web router communication messages.

12. The method of claim 8, further comprising updating the tables in response to revised client-to-server distance information.

13. The method of claim 12, wherein the revised client-to-server distance information is included in one or more inter-Web router communication messages.

14. The method of claim 1, wherein a network service provider dynamical configures and updates a table of neighbor web routers.

15. The method of claim 1, wherein a web router dynamically selects a subset of all web routers in the virtual overlay network with the subset forming neighbor web routers.