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

• US 8,423,666 B2
• Filed: 12/22/2009
• Issued: 04/16/2013
• Est. Priority Date: 03/16/2000
• Status: Expired due to Fees

• 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:
  US12/645,442
• Publication Number:
  US 20100198913A1
• Time in Patent Office: 1,211 Days
• Field of Search: 709201-203, 709226-232, 709238-245
• US Class Current: 709/242
• 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:

passing one or more messages between Web routers over a reliable transmission protocol used for inter-Web router communication, said messages including information which allows said Web routers to dynamically update mappings of client addresses or address ranges to information object repository addresses based on a client-to-server map that includes network latency from a respective Web router to the client and server load latency from a respective server to the client with the latencies being in common units that are added together to determine a best server for servicing the client, wherein the term client refers to any information object requesting device, or a group thereof, communicatively coupled to one or more of the Web routers and the term server refers to any information object repository accessible by one or more clients;

updating a network latency map, which provides the network latency from the respective Web router to the client, with a better mapping than a previous network latency map based on map precedence rules for a comparison of the network latency maps, wherein the map precedence rules are based on comparing at least three parameters of the network latency maps with the at least three parameters including Web router addresses, anchor addresses, sequence numbers, distances, and hash functions for the respective network latency maps; and

updating the client-to-server map when the network latency map updates.

2. The method of claim 1 wherein the mappings of the client-to-server map are optimal mappings of the client addresses or address ranges to the information object repository addresses.

3. The method of claim 1 wherein the messages report updated distances from said information object repository addresses to said client addresses or address ranges.

4. The method of claim 3 wherein the messages further report, for each updated distance, an associated client address or address range.

5. The method of claim 4 wherein said messages further report, for each updated distance, an associated anchor address of a Web router co-located with an information object repository that is the subject of the message.

6. The method of claim 1, wherein the reliable transmission protocol comprises a web information locator by distance (WILD) protocol used for inter-Web router communication, said messages including information which allows said Web routers to dynamically update WILD mappings of client addresses or address ranges to information object repository addresses.

7. The method of claim 6, wherein the client-to-server map comprises a WILD table for determining the best server for servicing the client.

8. The method of claim 1, wherein the respective server is local with respect to the respective Web router.