Method and apparatus for managing a plurality of servers in a content delivery network

• US 20020083118A1
• Filed: 05/18/2001
• Published: 06/27/2002
• Est. Priority Date: 10/26/2000
• Status: Active Grant

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Sim, Siew Yong
• Granted Patent: US 7,181,523 B2
• Time in Patent Office: Days
• US Class Current: 718/105
• CPC Class Codes: G06F 16/182 Distributed file systems
• CPC Class Codes: G06F 16/188 Virtual file systems
• CPC Class Codes: H04L 47/125 by balancing the load, e.g. traffic engineering
• 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/1017 based on a round robin mechanism
• CPC Class Codes: H04L 67/1019 Random or heuristic server selection
• CPC Class Codes: H04L 67/1023 based on a hash applied to IP addresses or costs
• CPC Class Codes: H04L 67/1027 Persistence of sessions during load balancing
• CPC Class Codes: H04L 67/1034 Reaction to server failures by a load balancer
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 69/14 Multichannel or multilink protocols
• CPC Class Codes: Y02D 30/50 in wire-line communication networks, e.g. low power modes or reduced link rate

Abstract

Large payload files are selectively partitioned in blocks and the blocks distributed to a plurality of distribution stations at the edge of the network qualified to have the data. Each qualified station decides how much and what portion of the content to save locally, based on information such as network location and environment, usage, popularity, and other distribution criteria defined by the content provider. Different pieces of a large payload file may be available from different nodes, however, when a user requests access to the large payload file, for example, through an application server, a virtual file control system creates an illusion that the entire file is present at the connected node. However, since only selective portions of the large payload file may actually be resident at that node'"'"'s storage at the time of request, a cluster of distribution servers at the distribution station may download the non-resident portions of the file as the application server is servicing the user. The download may be in parallel and usually from the least congested nodes. New nodes added to the network learn from other nodes in the network what content they should have and download the required content, in a desired amount, onto their local storage devices from the nearest and least congested nodes without interrupting network operation. Each node manages its local storage and decides what content to prune based on information such as usage patterns.

Claims

1. A method for managing a plurality of servers in a content delivery network comprising:

distributing one or more incoming tasks to one or more available servers in a network node, said network node having a plurality of servers capable of processing said one or more incoming tasks, wherein said one or more available servers comprises a functioning subset of said plurality of servers;

maintaining a list of tasks for each of said one or more available servers of said network node, said list of tasks comprising all tasks from said one or more incoming tasks distributed to said each of said one or more available servers;

distributing said all tasks from said list of tasks of a server of said plurality of servers that becomes designated as an unavailable server to said one or more available servers.

2. The method of claim 1, wherein said all tasks are treated as jobs to be executed and said list of tasks comprises a job queue.

3. The method of claim 1, wherein said one or more available servers vote for a master server at power up.

4. The method of claim 3, wherein each one of said one or more available servers registers a heartbeat in a database.

5. The method of claim 4, wherein said one or more available servers watch each other'"'"'s heartbeat and uses said heartbeat to determine when at least one server of said plurality of servers becomes designated as said unavailable server.

6. The method of claim 5, wherein if said unavailable server is said master server, said one or more available servers vote for a new master server.

7. The method of claim 5, wherein said distributing said all tasks from said list of tasks is performed by said master server.

8. The method of claim 5, wherein one of said one or more available servers is designated as said unavailable server if said one of said one or more available servers misses a number of heartbeats.

9. A method for managing a plurality of servers in a content delivery network comprising:

selecting a master server amongst a plurality of servers in a network node, said selecting being performed by said plurality of servers, wherein said plurality of servers are configured to execute one or more incoming tasks;

distributing said one or more incoming tasks to one or more available servers of said plurality of servers, said one or more incoming tasks comprising jobs to be executed by at least one of said one or more available servers, wherein said one or more available servers comprises a functioning subset of said plurality of servers;

maintaining a job queue for each of said one or more available servers of said network node, said job queue comprising all tasks from said one or more incoming tasks distributed to said each of said one or more available servers;

distributing, by said master server to said one or more available servers, all jobs from said job queue of each of said plurality of servers that becomes designated as an unavailable server.

10. A method for managing a plurality of servers in a content delivery network comprising:

selecting a master server amongst a plurality of servers in a network node, said selecting being performed by said plurality of servers, wherein said plurality of servers are configured to perform a set of tasks;

distributing one or more incoming tasks to one or more available servers in said node, said tasks being treated as jobs by each of said one or more available servers, wherein said one or more available servers is a functioning subset of said plurality of servers;

maintaining a job queue for each of said one or more available servers of said network node, said job queue comprising all tasks from said one or more incoming tasks distributed to said each of said one or more available servers;

registering a heartbeat in a database associated with said one or more available servers, wherein said one or more available servers watch each other'"'"'s heartbeat and use said heartbeat to declare a server as an unavailable server when said server misses a number of heartbeats;

distributing, by said master server to said one or more available servers, all jobs from said job queue of each of said plurality of servers that becomes designated as an unavailable server.

11. A computer program product comprising:

a computer usable medium comprising computer readable code for managing a plurality of servers in a content delivery network, said computer readable program code configured to;

distribute one or more incoming tasks to one or more available servers in a network node, said network node having a plurality of servers capable of processing said one or more incoming tasks, wherein said one or more available servers comprises a functioning subset of said plurality of servers;

maintain a list of tasks for each of said one or more available servers of said network node, said list of tasks comprising all tasks from said one or more incoming tasks distributed to said each of said one or more available servers;

distribute said all tasks from said list of tasks of a server of said plurality of servers that becomes designated as an unavailable server to said one or more available servers.

12. The computer program product of claim 11, wherein said all tasks are treated as jobs to be executed and said list of tasks comprises a job queue.

13. The computer program product of claim 11, wherein said one or more available servers vote for a master server at power up.

14. The computer program product of claim 13, wherein each one of said one or more available servers registers a heartbeat in a database.

15. The computer program product of claim 14, wherein said one or more available servers watch each other'"'"'s heartbeat and uses said heartbeat to determine when at least one server of said plurality of servers becomes designated as said unavailable server.

16. The computer program product of claim 15, wherein if said unavailable server is said master server, said one or more available servers vote for a new master server.

17. The computer program product of claim 15, wherein said distribute said all tasks from said list of tasks is performed by said master server.

18. The computer program product of claim 15, wherein one of said one or more available servers is designated as said unavailable server if said one of said one or more available servers misses a number of heartbeats.

20. The apparatus of claim 19, wherein said all tasks are treated as jobs to be executed and said list of tasks comprises a job queue.

21. The apparatus of claim 19, wherein said one or more available servers vote for said master server at power up.

22. The apparatus of claim 21, wherein each one of said one or more available servers registers a heartbeat in a database.

23. The apparatus of claim 22, wherein said one or more available servers watch each other'"'"'s heartbeat and uses said heartbeat to determine when at least one server of said plurality of servers becomes designated as said unavailable server.

24. The apparatus of claim 23, wherein if said unavailable server is said master server, said one or more available servers vote for a new master server.

25. The apparatus of claim 23, wherein one of said one or more available servers is designated as said unavailable server if said one of said one or more available servers misses a number of heartbeats.

19. An apparatus for managing a plurality of servers in a content delivery network comprising:

a network node having a plurality of servers capable of performing identical tasks;

a load balancer distributing one or more incoming tasks to one or more available servers in said network node, wherein said one or more available servers is a functioning subset of said plurality of servers, each of said plurality of servers maintaining a list of tasks containing said incoming tasks distributed to it;

a master server distributing to said one or more available servers all tasks from said list of tasks of a server of said plurality of servers that becomes designated as an unavailable server.