CA2209349C - Dynamic reconfiguration of network servers - Google Patents
Dynamic reconfiguration of network servers Download PDFInfo
- Publication number
- CA2209349C CA2209349C CA002209349A CA2209349A CA2209349C CA 2209349 C CA2209349 C CA 2209349C CA 002209349 A CA002209349 A CA 002209349A CA 2209349 A CA2209349 A CA 2209349A CA 2209349 C CA2209349 C CA 2209349C
- Authority
- CA
- Canada
- Prior art keywords
- server
- information
- client requests
- processing
- clients
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5083—Techniques for rebalancing the load in a distributed system
Abstract
One or more portions (221) of a database (220) which a primary server (106) uses to process client requests are duplicated (211) on one or more supplemental servers (105). As the clients demand for service increases and the processing load on the primary server becomes excessive (400), the primary server automatically off-loads the processing of those portions of the client requests that require one or more of the duplicated portions onto the supplemental servers by substituting (402) a secondary page (253) or a secondary object in its database that points to the one or more duplicated portions in the supplemental servers for a corresponding primary page (252) or a primary object in its database that points to the one or more duplicated portions in its database. The supplemental servers then serve the portions of the client requests that require the one or more of the duplicated portions. As demand for service decreases and the primary server becomes underloaded (404), it automatically restores (406) the primary page or the primary object in its database and resumes serving the entire client requests.
Description
DYNAMIC RECONFIGURATION OF NETWORK SERVERS
Technical Field This invention relates to information network architecture, such as the Internet or an intranet architecture.
Background of the Invention In an information network, such as the Internet, user's computers, referred to as clients, request information from information-providers' computers, referred to as servers, and the servers supply the requested information to the clients.
In the World Wide Web (WWW), which is a de-facto standard for storing, finding, and transferring information on the Internet, the information is supplied in the form of pages. A page is a display screen-full of information expressed in textual, graphical, scriptural, and/or other form. A page comprises one or more information objects. An object is an information element that has its own network address --preferably a unique single address-- called a URL (Uniform Resource Locator).
For example, a page may comprise one or more text objects, one or more picture objects, and one or more script objects that are presented on the display screen in a layout defined by a frame object.
Typically, a server has a main page that serves as the entry point to the information and services that the server provides. This page typically points to other pages and to objects (e.g., graphic images, video/audio/text files, etc.), which are typically served by the same server.
Generally, when a client accesses the server, the server provides the main page to the client and then interacts with the client to provide the client with desired additional information and/or services. As increasing numbers of clients access the server, the server's processing load increases and its performance eventually degrades, so that users experience increasing delays between the time at which they place a request to the server and the time at which their request is satisfied by the server.
To avoid overloading of a server, typically an administrator must manually reconfigure the server and redirect some of the requests to other servers in order to lessen the load on the subject server. Some service providers store replicas of the served information in a plurality of servers and have different ones of the servers serve different requests, e.g., on a round-robin basis, thereby spreading the load of requests over multiple servers. This has several disadvantages.
Firstly, an administrator's manual intervention is slow, inefficient, prone to error, and often not prompt. Secondly, using a plurality of servers to serve requests on a round-robin basis results in underutilization of the servers during periods when relatively few requests are being made, and hence it is inefficient. Furthermore, it requires all server information to be replicated on each server; the servers cannot take advantage of a common cache for common data.
Summary of the Invention This invention is directed to solving these and other problems and disadvantages of the prior art. Generally according to the invention, a portion of the information which a primary server uses to process client requests is replicated on one or more supplemental, stand-by, servers, and as the clients' demand for service increases and the processing load on the primary server becomes excessive, the primary server automatically off-loads the processing of those portions of the client requests that require the replicated portion of the information onto the supplemental servers. As demand for service decreases and the primary server becomes underloaded, preferably the primary server automatically resumes serving the entire client requests.
The advantages of the invention include the following: the load-shedding and load-sharing happen automatically, without human intervention, based on the present processing load. Only one server, or one group of servers, out of the entire server set serves an individual portion of the information (e.g., a page, or an object, or a group of pages or objects) at any one time, which allows for efficient caching of the information. And more uniform response times are provided to clients even as client demand for services varies greatly. Moreover, while a standby server is not serving the primary server's clients, its processing power may be used for other processing activities, such as serving other clients whose demand for service peaks at a time different from the primary server's clients, thereby resulting in efficient server utilization.
According to a first aspect of the invention, a client-server system comprises a plurality of servers for processing client requests, wherein at least one first server of the plurality of servers has first information and second information related to the first information, for processing portions of the client requests that require the first information and portions of the client requests that require the second information. The at least one first server processes both portions of the client requests while the processing load on the at least one server is not excessive, e.g., does not exceed a predetermined first limit. In response to the processing load on the at least one first server becoming excessive, the at least one first server processes the portions of the client requests which require the first information without also processing the portions of the client requests which require the second information, and automatically redirects the portions of the client requests which require the second information to at least one second server for processing. The at least one server of the plurality of servers has the second information and processes the redirected portions of the client requests which require the second information, automatically in response to the redirection. Preferably, the at least one first server automatically ceases redirecting the portions of the client requests that require the second information and resumes processing of both portions of the client requests in response to the processing load on the at least one first server ceasing to be excessive, e.g., falling below a predetermined second limit.
According to a second aspect of the invention, a method of operating a client-server system that includes a plurality of servers for processing client requests comprises the following steps. While a processing load on at least one first server of the plurality of servers is not excessive, the at least one first server processes both portions of client requests that require first information and portions of the client requests that require second information related to the first information; the at least one first server has both the first information and the second information. In ,response to the processing load on the at least one first server becoming excessive, the at least one server processes the portions of the client requests that require the first information without also processing the portions of the client requests that require the second information, and automatically redirects the portions of the client requests that require the second information to at least one second server of the plurality of servers. In response to the redirection, the at least one second server automatically processes the redirected portions of the client requests that require the second information; the at least one second server has the second information.
Preferably, when the processing load on the at least one server falls below a predetermined limit, the at least one server automatically ceases to redirect the portions of the client requests that require the second information and resumes processing both portions of the client requests.
These and other advantages and features of the invention will become more apparent from the following description of an illustrative embodiment of the invention taken together with the drawing.
Brief Description of the Drawing FIG. 1 is a block diagram of an information network that includes an illustrative embodiment of the invention;
FIG. 2 is a block diagram of partial contents of memories of servers of the information network of FIG. 1; and FIGS. 3-5 each are a flow diagram of partial operations of a different one of the servers of the information network of FIG. 1.
Detailed Description FIG. 1 shows an illustrative information network, which in this example is the Internet. It comprises a plurality of clients 100-101 and a plurality of servers 105-107 interconnected by the Internet network fabric 110. Each server 105 is a computer having a processor and a memory, wherein the processor executes control programs stored in the memory to provide services and data stored in the memory.
Each server 105-107 is a primary server for a database of information A-C, respectively. According to the invention, however, besides being a primary server for a database, each server 105-107 is also a secondary, or supporting, server for a portion of one or more other servers' databases. In the example of FIG. 1, server 105 is a supplemental server for a portion BZ of server's 106 database B;
server 106 is a supplemental server for a portion AY of server's 105 database A and a portion CW of server's 107 database C; and server 107 is a supplemental server for a portion AX of server's 105 database A.
FIG. 2 shows the data contents of memories 205-207 of servers 105-107, respectively, that are relevant to an understanding of this invention.
Memory 205 stores database A 210 and a duplicate 211 of portion BZ 221 of database B
220.
Memory 206 stores database B 220, a duplicate 222 of portion CW 231 of database C 230, and a duplicate 223 of portion AY 213 of database A 210. And memory 207 stores database C 230 and a duplicate 232 of portion AY 212 of database A 210.
Database A 210 comprises a primary main page Al 240 that includes links to other pages A2-A4 243-245 in database A 210. Pages A3 244 and A4 245 in turn include links to yet other pages A5 246 and A6-A7 247-248, respectively, in database A 210. Database A 210 further includes a secondary main page Al' 241 that includes links to pages A2-A3 243-244 in database 210, but instead of including a link to page A4 245 of portion AX 212 in memory 205, it includes a link to duplicate page A4 245 of duplicate portion AX 232 in memory 207. Database A
yet further includes a tertiary main page A1" 242 that includes a link to page in database 210, but instead of including links to pages A3 244 and A4 245 of portions AX 212 and AY 213 in memory 205, it includes links to duplicate pages 244 and A4 245 of duplicate portions AY 223 and AX 232, respectively, in memories 206 and 207, respectively.
Database B 220 comprises a main page B 1 250 that includes links to an object B2 251 and to another page B3 252 in database B 220. B3 252 is a primary page that in turn includes links to other objects and/or pages B4-B5 258-259 in database B 220. Database B 220 further includes a secondary page B3' 253 which, instead of including links to pages B4-B5 258-259 in portion BZ 221 of database B
220 in memory 206, includes links to duplicate objects and/or pages B4-B5 258-of duplicate portion BZ 211 in memory 205.
Database C 230 comprises a primary format-object C1 260 of a main page that includes a link to a data object C2 262 in portion CW 231 of database C
230. Database C 230 further includes a secondary format-object C1' 261 of the main page which, instead of including a link to data object C2 262 in portion CW
231 of database C 230 in memory 207, includes a link to duplicate object C2 262 of duplicate portion CW 222 in memory 206.
It is assumed that servers 105-107 experience their heaviest processing loads at different times. For example, server 105 may be most heavily used in the evenings, server 106 may be most heavily used on workdays, and server 107 may be most heavily used on weekends. Initially, all servers 105-107 operate conventionally. That is, server 105 initially serves all requests for information from database A 210, server 106 initially serves all requests for information from database B 220, and server 107 initially serves all requests for information from database C
230, in a conventional manner, using primary pages and/or objects 240, 252, and 260. As is also conventional, each server 105-107 keeps a record of its present processing load, for example, in the form of a number of accesses (requests) served per unit of time.
Operations of servers 105-107 that are relevant to an understanding of the invention are diagrammed in FIGS. 3-5, respectively. In addition to its conventional operations, each server 105-107 executes a load-control program that is initialized with predetermined load limits. As shown in FIG. 3, server 105 repeatedly checks if its present processing load exceeds a high-load upper limit "A1' high" at step 300. If not, it means that server 105 is not overloaded, and so server 105 remains at step 300; if so, it means that server 105 is overloaded, and server 105 therefore substitutes secondary page Al' 241 for primary page A1 240, at step 302.
This has the effect of causing all subsequent requests for information from portion AX 212 of database A 210 to be directed to server 107. Server 107 serves these requests in a conventional manner from duplicate portion AX 232. Hence, when server 105 becomes overloaded, some of its processing load is taken over by server 107.
Following step 302, server 105 checks if a high-load lower limit "Al' low" exceeds its present processing load, at step 304. If so, it means that server 105 is underloaded, and so server 105 substitutes primary page A1 240 for secondary page Al' 241, at step 306. This has the effect of resuming initial operation, where server 105 is serving all requests for information from database A 210. Server then returns to step 300.
If it is determined at step 304 that limit A1' low does not exceed the present load, server 105 checks whether the present load again exceeds the AI' high limit, at step 308. If not, it means that server 105 is not overloaded, and so server 105 returns to step 304; if so, it means that server 105 is again overloaded, and server 105 therefore substitutes tertiary page Al" 242 for secondary page A1' 241, at step 310. This has the additional effect of causing all subsequent requests for information from portion AY 213 of database A to be directed to server 106.
Server 106 serves these requests in a conventional manner from duplicate portion AY
223, thereby taking on some of the processing load that would otherwise have to be done by server 105, and hence reducing the load on server 105.
Following step 310, server 105 checks if the A1' low limit exceeds the present processing load of server 105, at step 312. If not, server 105 remains at step 312; if so, it means that server 105 is underloaded, and server 105 therefore substitutes secondary page A 1' 241 for tertiary page A 1 " 242, at step 314.
This has the effect of server 105 taking back the portion of the processing load that had been transferred to server 106 at step 310. Server 105 then returns to step 304.
The operation of servers 106 and 107 is similar. As shown in FIG. 4, server 106 repeatedly checks if its present processing load exceeds a high-load upper limit "B3' high", at step 400. If not, server 106 is not overloaded and remains at step 400; if so, server 106 is overloaded, and therefore it substitutes secondary page B3' 253 for primary page B3 252, at step 402. This has the effect of causing all subsequent requests for information from portion BZ 221 of database B 220 to be directed to server 105. Server 105 serves these requests in a conventional manner from duplicate portion BZ 21 l, thereby relieving the load on server 106.
Following step 402, server 106 checks if a high-load lower limit "B3' low" exceeds its present processing load at step 404. If not, server 106 remains at step 404; if so, it means that server 106 is underloaded, and therefore server substitutes primary page B3 252 for secondary page B3' 253, at step 406. This has the effect of resuming initial operation, where server 106 is serving all requests from database B220. Server 106 then returns to step 400.
As shown in FIG. 5, server 107 repeatedly checks if its present processing load exceeds a load limit "C1 "', at step 500. If not, server 107 is not overloaded and remains at step 500; if so, server 107 is overloaded, and therefore it substitutes secondary object CI' 261 for primary object Cl 260, at step 502, thereby _7_ transferring some of its processing load to server 106. Following step 502, server 107 repeatedly checks if the load limit "C 1 "' exceeds its present processing load, at step 504. If not, server 107 remains at step 504; if so, it means that server 107 is no longer overloaded, and therefore server 107 substitutes primary object Cl 260 for secondary object C1' 261, at step 506, thereby resuming its initial operation.
Server 107 then returns to step 500.
Of course, various changes and modifications to the illustrative embodiment described above will be apparent to those skilled in the art. For example, instead of storing both primary and secondary pages or objects, the primary pages or objects can be converted into the secondary pages or objects "on-the-fly"
(e.g., in real time), and vice versa. Likewise, instead of duplicate portions of the database being pre-stored on supplemental servers, the database portions may be duplicated and distributed to the supplemental servers "on-the-$y." Moreover, measurements and limits other than the number of accesses per unit of time can be used to determine whether to off-load or return processing from or to the primary server. These measurements and limits can be forward-looking, such as predictive algorithms which estimate future load based on load experienced at a similar time in the past. Furthermore, the main server can request present processing load data from the stand-by servers and incorporate these data into its decision of whether to off-load processing to those stand-by servers. Such changes and modifications can be made without departing from the spirit and the scope of the invention and without diminishing its attendant advantages. It is therefore intended that such changes and modifications be covered by the following claims.
Technical Field This invention relates to information network architecture, such as the Internet or an intranet architecture.
Background of the Invention In an information network, such as the Internet, user's computers, referred to as clients, request information from information-providers' computers, referred to as servers, and the servers supply the requested information to the clients.
In the World Wide Web (WWW), which is a de-facto standard for storing, finding, and transferring information on the Internet, the information is supplied in the form of pages. A page is a display screen-full of information expressed in textual, graphical, scriptural, and/or other form. A page comprises one or more information objects. An object is an information element that has its own network address --preferably a unique single address-- called a URL (Uniform Resource Locator).
For example, a page may comprise one or more text objects, one or more picture objects, and one or more script objects that are presented on the display screen in a layout defined by a frame object.
Typically, a server has a main page that serves as the entry point to the information and services that the server provides. This page typically points to other pages and to objects (e.g., graphic images, video/audio/text files, etc.), which are typically served by the same server.
Generally, when a client accesses the server, the server provides the main page to the client and then interacts with the client to provide the client with desired additional information and/or services. As increasing numbers of clients access the server, the server's processing load increases and its performance eventually degrades, so that users experience increasing delays between the time at which they place a request to the server and the time at which their request is satisfied by the server.
To avoid overloading of a server, typically an administrator must manually reconfigure the server and redirect some of the requests to other servers in order to lessen the load on the subject server. Some service providers store replicas of the served information in a plurality of servers and have different ones of the servers serve different requests, e.g., on a round-robin basis, thereby spreading the load of requests over multiple servers. This has several disadvantages.
Firstly, an administrator's manual intervention is slow, inefficient, prone to error, and often not prompt. Secondly, using a plurality of servers to serve requests on a round-robin basis results in underutilization of the servers during periods when relatively few requests are being made, and hence it is inefficient. Furthermore, it requires all server information to be replicated on each server; the servers cannot take advantage of a common cache for common data.
Summary of the Invention This invention is directed to solving these and other problems and disadvantages of the prior art. Generally according to the invention, a portion of the information which a primary server uses to process client requests is replicated on one or more supplemental, stand-by, servers, and as the clients' demand for service increases and the processing load on the primary server becomes excessive, the primary server automatically off-loads the processing of those portions of the client requests that require the replicated portion of the information onto the supplemental servers. As demand for service decreases and the primary server becomes underloaded, preferably the primary server automatically resumes serving the entire client requests.
The advantages of the invention include the following: the load-shedding and load-sharing happen automatically, without human intervention, based on the present processing load. Only one server, or one group of servers, out of the entire server set serves an individual portion of the information (e.g., a page, or an object, or a group of pages or objects) at any one time, which allows for efficient caching of the information. And more uniform response times are provided to clients even as client demand for services varies greatly. Moreover, while a standby server is not serving the primary server's clients, its processing power may be used for other processing activities, such as serving other clients whose demand for service peaks at a time different from the primary server's clients, thereby resulting in efficient server utilization.
According to a first aspect of the invention, a client-server system comprises a plurality of servers for processing client requests, wherein at least one first server of the plurality of servers has first information and second information related to the first information, for processing portions of the client requests that require the first information and portions of the client requests that require the second information. The at least one first server processes both portions of the client requests while the processing load on the at least one server is not excessive, e.g., does not exceed a predetermined first limit. In response to the processing load on the at least one first server becoming excessive, the at least one first server processes the portions of the client requests which require the first information without also processing the portions of the client requests which require the second information, and automatically redirects the portions of the client requests which require the second information to at least one second server for processing. The at least one server of the plurality of servers has the second information and processes the redirected portions of the client requests which require the second information, automatically in response to the redirection. Preferably, the at least one first server automatically ceases redirecting the portions of the client requests that require the second information and resumes processing of both portions of the client requests in response to the processing load on the at least one first server ceasing to be excessive, e.g., falling below a predetermined second limit.
According to a second aspect of the invention, a method of operating a client-server system that includes a plurality of servers for processing client requests comprises the following steps. While a processing load on at least one first server of the plurality of servers is not excessive, the at least one first server processes both portions of client requests that require first information and portions of the client requests that require second information related to the first information; the at least one first server has both the first information and the second information. In ,response to the processing load on the at least one first server becoming excessive, the at least one server processes the portions of the client requests that require the first information without also processing the portions of the client requests that require the second information, and automatically redirects the portions of the client requests that require the second information to at least one second server of the plurality of servers. In response to the redirection, the at least one second server automatically processes the redirected portions of the client requests that require the second information; the at least one second server has the second information.
Preferably, when the processing load on the at least one server falls below a predetermined limit, the at least one server automatically ceases to redirect the portions of the client requests that require the second information and resumes processing both portions of the client requests.
These and other advantages and features of the invention will become more apparent from the following description of an illustrative embodiment of the invention taken together with the drawing.
Brief Description of the Drawing FIG. 1 is a block diagram of an information network that includes an illustrative embodiment of the invention;
FIG. 2 is a block diagram of partial contents of memories of servers of the information network of FIG. 1; and FIGS. 3-5 each are a flow diagram of partial operations of a different one of the servers of the information network of FIG. 1.
Detailed Description FIG. 1 shows an illustrative information network, which in this example is the Internet. It comprises a plurality of clients 100-101 and a plurality of servers 105-107 interconnected by the Internet network fabric 110. Each server 105 is a computer having a processor and a memory, wherein the processor executes control programs stored in the memory to provide services and data stored in the memory.
Each server 105-107 is a primary server for a database of information A-C, respectively. According to the invention, however, besides being a primary server for a database, each server 105-107 is also a secondary, or supporting, server for a portion of one or more other servers' databases. In the example of FIG. 1, server 105 is a supplemental server for a portion BZ of server's 106 database B;
server 106 is a supplemental server for a portion AY of server's 105 database A and a portion CW of server's 107 database C; and server 107 is a supplemental server for a portion AX of server's 105 database A.
FIG. 2 shows the data contents of memories 205-207 of servers 105-107, respectively, that are relevant to an understanding of this invention.
Memory 205 stores database A 210 and a duplicate 211 of portion BZ 221 of database B
220.
Memory 206 stores database B 220, a duplicate 222 of portion CW 231 of database C 230, and a duplicate 223 of portion AY 213 of database A 210. And memory 207 stores database C 230 and a duplicate 232 of portion AY 212 of database A 210.
Database A 210 comprises a primary main page Al 240 that includes links to other pages A2-A4 243-245 in database A 210. Pages A3 244 and A4 245 in turn include links to yet other pages A5 246 and A6-A7 247-248, respectively, in database A 210. Database A 210 further includes a secondary main page Al' 241 that includes links to pages A2-A3 243-244 in database 210, but instead of including a link to page A4 245 of portion AX 212 in memory 205, it includes a link to duplicate page A4 245 of duplicate portion AX 232 in memory 207. Database A
yet further includes a tertiary main page A1" 242 that includes a link to page in database 210, but instead of including links to pages A3 244 and A4 245 of portions AX 212 and AY 213 in memory 205, it includes links to duplicate pages 244 and A4 245 of duplicate portions AY 223 and AX 232, respectively, in memories 206 and 207, respectively.
Database B 220 comprises a main page B 1 250 that includes links to an object B2 251 and to another page B3 252 in database B 220. B3 252 is a primary page that in turn includes links to other objects and/or pages B4-B5 258-259 in database B 220. Database B 220 further includes a secondary page B3' 253 which, instead of including links to pages B4-B5 258-259 in portion BZ 221 of database B
220 in memory 206, includes links to duplicate objects and/or pages B4-B5 258-of duplicate portion BZ 211 in memory 205.
Database C 230 comprises a primary format-object C1 260 of a main page that includes a link to a data object C2 262 in portion CW 231 of database C
230. Database C 230 further includes a secondary format-object C1' 261 of the main page which, instead of including a link to data object C2 262 in portion CW
231 of database C 230 in memory 207, includes a link to duplicate object C2 262 of duplicate portion CW 222 in memory 206.
It is assumed that servers 105-107 experience their heaviest processing loads at different times. For example, server 105 may be most heavily used in the evenings, server 106 may be most heavily used on workdays, and server 107 may be most heavily used on weekends. Initially, all servers 105-107 operate conventionally. That is, server 105 initially serves all requests for information from database A 210, server 106 initially serves all requests for information from database B 220, and server 107 initially serves all requests for information from database C
230, in a conventional manner, using primary pages and/or objects 240, 252, and 260. As is also conventional, each server 105-107 keeps a record of its present processing load, for example, in the form of a number of accesses (requests) served per unit of time.
Operations of servers 105-107 that are relevant to an understanding of the invention are diagrammed in FIGS. 3-5, respectively. In addition to its conventional operations, each server 105-107 executes a load-control program that is initialized with predetermined load limits. As shown in FIG. 3, server 105 repeatedly checks if its present processing load exceeds a high-load upper limit "A1' high" at step 300. If not, it means that server 105 is not overloaded, and so server 105 remains at step 300; if so, it means that server 105 is overloaded, and server 105 therefore substitutes secondary page Al' 241 for primary page A1 240, at step 302.
This has the effect of causing all subsequent requests for information from portion AX 212 of database A 210 to be directed to server 107. Server 107 serves these requests in a conventional manner from duplicate portion AX 232. Hence, when server 105 becomes overloaded, some of its processing load is taken over by server 107.
Following step 302, server 105 checks if a high-load lower limit "Al' low" exceeds its present processing load, at step 304. If so, it means that server 105 is underloaded, and so server 105 substitutes primary page A1 240 for secondary page Al' 241, at step 306. This has the effect of resuming initial operation, where server 105 is serving all requests for information from database A 210. Server then returns to step 300.
If it is determined at step 304 that limit A1' low does not exceed the present load, server 105 checks whether the present load again exceeds the AI' high limit, at step 308. If not, it means that server 105 is not overloaded, and so server 105 returns to step 304; if so, it means that server 105 is again overloaded, and server 105 therefore substitutes tertiary page Al" 242 for secondary page A1' 241, at step 310. This has the additional effect of causing all subsequent requests for information from portion AY 213 of database A to be directed to server 106.
Server 106 serves these requests in a conventional manner from duplicate portion AY
223, thereby taking on some of the processing load that would otherwise have to be done by server 105, and hence reducing the load on server 105.
Following step 310, server 105 checks if the A1' low limit exceeds the present processing load of server 105, at step 312. If not, server 105 remains at step 312; if so, it means that server 105 is underloaded, and server 105 therefore substitutes secondary page A 1' 241 for tertiary page A 1 " 242, at step 314.
This has the effect of server 105 taking back the portion of the processing load that had been transferred to server 106 at step 310. Server 105 then returns to step 304.
The operation of servers 106 and 107 is similar. As shown in FIG. 4, server 106 repeatedly checks if its present processing load exceeds a high-load upper limit "B3' high", at step 400. If not, server 106 is not overloaded and remains at step 400; if so, server 106 is overloaded, and therefore it substitutes secondary page B3' 253 for primary page B3 252, at step 402. This has the effect of causing all subsequent requests for information from portion BZ 221 of database B 220 to be directed to server 105. Server 105 serves these requests in a conventional manner from duplicate portion BZ 21 l, thereby relieving the load on server 106.
Following step 402, server 106 checks if a high-load lower limit "B3' low" exceeds its present processing load at step 404. If not, server 106 remains at step 404; if so, it means that server 106 is underloaded, and therefore server substitutes primary page B3 252 for secondary page B3' 253, at step 406. This has the effect of resuming initial operation, where server 106 is serving all requests from database B220. Server 106 then returns to step 400.
As shown in FIG. 5, server 107 repeatedly checks if its present processing load exceeds a load limit "C1 "', at step 500. If not, server 107 is not overloaded and remains at step 500; if so, server 107 is overloaded, and therefore it substitutes secondary object CI' 261 for primary object Cl 260, at step 502, thereby _7_ transferring some of its processing load to server 106. Following step 502, server 107 repeatedly checks if the load limit "C 1 "' exceeds its present processing load, at step 504. If not, server 107 remains at step 504; if so, it means that server 107 is no longer overloaded, and therefore server 107 substitutes primary object Cl 260 for secondary object C1' 261, at step 506, thereby resuming its initial operation.
Server 107 then returns to step 500.
Of course, various changes and modifications to the illustrative embodiment described above will be apparent to those skilled in the art. For example, instead of storing both primary and secondary pages or objects, the primary pages or objects can be converted into the secondary pages or objects "on-the-fly"
(e.g., in real time), and vice versa. Likewise, instead of duplicate portions of the database being pre-stored on supplemental servers, the database portions may be duplicated and distributed to the supplemental servers "on-the-$y." Moreover, measurements and limits other than the number of accesses per unit of time can be used to determine whether to off-load or return processing from or to the primary server. These measurements and limits can be forward-looking, such as predictive algorithms which estimate future load based on load experienced at a similar time in the past. Furthermore, the main server can request present processing load data from the stand-by servers and incorporate these data into its decision of whether to off-load processing to those stand-by servers. Such changes and modifications can be made without departing from the spirit and the scope of the invention and without diminishing its attendant advantages. It is therefore intended that such changes and modifications be covered by the following claims.
Claims (8)
1. A client-server system comprising:
a plurality of servers for processing client requests;
at least one first server of the plurality of servers having first information and further having second information related to the first information, for processing client requests for the first information by sending to the clients the first information along with a first link to the second information that causes client requests for the second information to be directed to the at least one first server and further processing client requests directed to the at least one first server for the second information by sending to the clients the second information of the at least one first server, while a processing load on the at least one server is not excessive, and for processing the client requests for the first information by sending to the clients the first information along with a second link to the second information that causes the client requests for the second information to be redirected to the at least one second server for processing, in response to the processing load on the at least one first server becoming excessive; and the at least one second server of the plurality of servers also having the second information, for processing the client requests redirected to the at least one second server for the second information by sending to the clients the second information of the at least one second server, automatically in response to the redirection.
a plurality of servers for processing client requests;
at least one first server of the plurality of servers having first information and further having second information related to the first information, for processing client requests for the first information by sending to the clients the first information along with a first link to the second information that causes client requests for the second information to be directed to the at least one first server and further processing client requests directed to the at least one first server for the second information by sending to the clients the second information of the at least one first server, while a processing load on the at least one server is not excessive, and for processing the client requests for the first information by sending to the clients the first information along with a second link to the second information that causes the client requests for the second information to be redirected to the at least one second server for processing, in response to the processing load on the at least one first server becoming excessive; and the at least one second server of the plurality of servers also having the second information, for processing the client requests redirected to the at least one second server for the second information by sending to the clients the second information of the at least one second server, automatically in response to the redirection.
2. The system of claim 1 wherein:
the at least one second server has the second information but does not have the first information, for processing the redirected client requests for the second information but not for processing the client requests for the first information.
the at least one second server has the second information but does not have the first information, for processing the redirected client requests for the second information but not for processing the client requests for the first information.
3. The system of claim 1 wherein:
the first information includes a primary page or object including the first link that points to the second information of the at least one first server while the processing load on the at least one first server is not excessive, and includes a secondary page or object including the second link that points to the second information of the at least one second server in response to the processing load on the at least one first server becoming excessive.
the first information includes a primary page or object including the first link that points to the second information of the at least one first server while the processing load on the at least one first server is not excessive, and includes a secondary page or object including the second link that points to the second information of the at least one second server in response to the processing load on the at least one first server becoming excessive.
4. The system of claim 2 wherein:
the at least one first server processes both client requests while the processing load on the at least one first server does not exceed a predetermined limit, and processes the client requests for the first information without also processing the client requests for the second information and causes the client requests for the second information to be redirected to the at least one second server in response to the processing load on the at least one first server exceeding the predetermined limit.
the at least one first server processes both client requests while the processing load on the at least one first server does not exceed a predetermined limit, and processes the client requests for the first information without also processing the client requests for the second information and causes the client requests for the second information to be redirected to the at least one second server in response to the processing load on the at least one first server exceeding the predetermined limit.
5. The system of claim 4 wherein:
said predetermined limit is a first predetermined first limit, and the at least one first server automatically ceases redirecting the client requests for the second information and resumes processing of both client requests in response to the processing load on the at least one first server falling below a predetermined second limit.
said predetermined limit is a first predetermined first limit, and the at least one first server automatically ceases redirecting the client requests for the second information and resumes processing of both client requests in response to the processing load on the at least one first server falling below a predetermined second limit.
6. The system of claim 1 wherein:
the at least one first server further has third information related to the first information, processes the client requests for the first information by sending to the clients the first information along with the first link and a third link to the third information that causes client requests for the third information to be directed to the at least one first server, processes the client requests for the second information by sending to the clients the second information of the first server, and processes client requests for the third information by sending to the clients the third information of the first server while the processing load on the at least one server does not exceed a predetermined first limit, processes the client requests for the first information by sending to the clients the first information along with the second link and the third link, and processes the client requests for the third information by sending to the clients the third information of the at least one first server in response to the processing load on the at least one first server exceeding the predetermined first limit for a first time, and processes the client requests for the first information by sending to the clients the first information along with the second link and a fourth link to the third information that causes the client requests for the third information be redirected to at least one third server of the plurality of servers for processing, in response to the processing load on the at least one first server exceeding the predetermined first limit for a second consecutive time;
the at least one third server of the plurality of servers also has the third information, for processing the client requests for the third information redirected to the at least one third server by sending to the clients the third information of the at least one third server upon the processing load on the at least one first server exceeding the predetermined first limit for the second consecutive time; and the at least one first server further automatically ceases causing redirection and resumes processing of the client requests for one of the second and the third information in response to the processing load on the at least one first server falling below a predetermined second limit for a first time, and automatically ceases causing redirection and resumes processing of the client requests for another of the second and the third information in response to the processing load on the at least one first server falling below the predetermined second limit for a second consecutive time.
the at least one first server further has third information related to the first information, processes the client requests for the first information by sending to the clients the first information along with the first link and a third link to the third information that causes client requests for the third information to be directed to the at least one first server, processes the client requests for the second information by sending to the clients the second information of the first server, and processes client requests for the third information by sending to the clients the third information of the first server while the processing load on the at least one server does not exceed a predetermined first limit, processes the client requests for the first information by sending to the clients the first information along with the second link and the third link, and processes the client requests for the third information by sending to the clients the third information of the at least one first server in response to the processing load on the at least one first server exceeding the predetermined first limit for a first time, and processes the client requests for the first information by sending to the clients the first information along with the second link and a fourth link to the third information that causes the client requests for the third information be redirected to at least one third server of the plurality of servers for processing, in response to the processing load on the at least one first server exceeding the predetermined first limit for a second consecutive time;
the at least one third server of the plurality of servers also has the third information, for processing the client requests for the third information redirected to the at least one third server by sending to the clients the third information of the at least one third server upon the processing load on the at least one first server exceeding the predetermined first limit for the second consecutive time; and the at least one first server further automatically ceases causing redirection and resumes processing of the client requests for one of the second and the third information in response to the processing load on the at least one first server falling below a predetermined second limit for a first time, and automatically ceases causing redirection and resumes processing of the client requests for another of the second and the third information in response to the processing load on the at least one first server falling below the predetermined second limit for a second consecutive time.
7. A method of operating a client-server system that comprises a plurality of servers for processing client requests, comprising the steps of:
processing client requests for first information by sending to the clients the first information along with a first link to second information that causes client requests for the second information to be directed to at least one first server, and processing client requests directed to the at least one first server for the second information related to the first information by sending to the clients the second information of the at least one server, in the at least one first server of the plurality of servers, which at least one first server has both the first information and the second information, while a processing load on the at least one first server is not excessive;
processing the client requests for the first information the second information in the at least one first server by sending to the clients the first information along with a second link to the second information that causes the client requests for the second information to be redirected to at least one second server of the plurality of servers, which at least one second server also has the second information, in response to the processing load on the at least one first server becoming excessive; and automatically processing the client requests redirected to the at least one second server for the second information in the at least one second server by sending to the clients the second information of the at least one second server, in response to the redirection.
processing client requests for first information by sending to the clients the first information along with a first link to second information that causes client requests for the second information to be directed to at least one first server, and processing client requests directed to the at least one first server for the second information related to the first information by sending to the clients the second information of the at least one server, in the at least one first server of the plurality of servers, which at least one first server has both the first information and the second information, while a processing load on the at least one first server is not excessive;
processing the client requests for the first information the second information in the at least one first server by sending to the clients the first information along with a second link to the second information that causes the client requests for the second information to be redirected to at least one second server of the plurality of servers, which at least one second server also has the second information, in response to the processing load on the at least one first server becoming excessive; and automatically processing the client requests redirected to the at least one second server for the second information in the at least one second server by sending to the clients the second information of the at least one second server, in response to the redirection.
8. The method of claim 7 further comprising the steps of:
automatically ceasing to redirect the client requests for the second information in response to the processing load on the at least one first server falling below a predetermined level; and automatically resuming processing of both client requests in the at least one server, in response to the processing load on the at least one first server falling below the predetermined level.
automatically ceasing to redirect the client requests for the second information in response to the processing load on the at least one first server falling below a predetermined level; and automatically resuming processing of both client requests in the at least one server, in response to the processing load on the at least one first server falling below the predetermined level.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US711,189 | 1996-09-09 | ||
| US08/711,189 US6240454B1 (en) | 1996-09-09 | 1996-09-09 | Dynamic reconfiguration of network servers |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2209349A1 CA2209349A1 (en) | 1998-03-09 |
| CA2209349C true CA2209349C (en) | 2001-10-30 |
Family
ID=24857107
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002209349A Expired - Fee Related CA2209349C (en) | 1996-09-09 | 1997-06-30 | Dynamic reconfiguration of network servers |
Country Status (4)
| Country | Link |
|---|---|
| US (1) | US6240454B1 (en) |
| EP (1) | EP0828214A3 (en) |
| JP (1) | JPH10105500A (en) |
| CA (1) | CA2209349C (en) |
Families Citing this family (58)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6564321B2 (en) | 1995-04-28 | 2003-05-13 | Bobo Ii Charles R | Systems and methods for storing, delivering, and managing messages |
| US7581006B1 (en) * | 1998-05-29 | 2009-08-25 | Yahoo! Inc. | Web service |
| US7143193B1 (en) * | 1998-05-29 | 2006-11-28 | Yahoo! Inc. | Content collection |
| US6279001B1 (en) | 1998-05-29 | 2001-08-21 | Webspective Software, Inc. | Web service |
| US6976093B2 (en) | 1998-05-29 | 2005-12-13 | Yahoo! Inc. | Web server content replication |
| US20030069968A1 (en) * | 1998-10-01 | 2003-04-10 | O'neil Kevin M. | System for balancing loads among network servers |
| US6601098B1 (en) * | 1999-06-07 | 2003-07-29 | International Business Machines Corporation | Technique for measuring round-trip latency to computing devices requiring no client-side proxy presence |
| US6516350B1 (en) * | 1999-06-17 | 2003-02-04 | International Business Machines Corporation | Self-regulated resource management of distributed computer resources |
| EP1061710B1 (en) * | 1999-06-17 | 2010-12-08 | Level 3 Communications, LLC | System and method for integrated load distribution and resource management on internet environment |
| US6957254B1 (en) * | 1999-10-21 | 2005-10-18 | Sun Microsystems, Inc | Method and apparatus for reaching agreement between nodes in a distributed system |
| US6820133B1 (en) * | 2000-02-07 | 2004-11-16 | Netli, Inc. | System and method for high-performance delivery of web content using high-performance communications protocol between the first and second specialized intermediate nodes to optimize a measure of communications performance between the source and the destination |
| US6658473B1 (en) | 2000-02-25 | 2003-12-02 | Sun Microsystems, Inc. | Method and apparatus for distributing load in a computer environment |
| CN1225882C (en) | 2000-03-27 | 2005-11-02 | 三洋电机株式会社 | Data distribution server, terminal, and data distribution system |
| US20110128972A1 (en) | 2000-04-17 | 2011-06-02 | Randy Thornton | Peer to peer dynamic network link acceleration |
| US8065399B2 (en) | 2000-04-17 | 2011-11-22 | Circadence Corporation | Automated network infrastructure test and diagnostic system and method therefor |
| US8996705B2 (en) | 2000-04-17 | 2015-03-31 | Circadence Corporation | Optimization of enhanced network links |
| US8898340B2 (en) | 2000-04-17 | 2014-11-25 | Circadence Corporation | Dynamic network link acceleration for network including wireless communication devices |
| US8510468B2 (en) | 2000-04-17 | 2013-08-13 | Ciradence Corporation | Route aware network link acceleration |
| US8024481B2 (en) | 2000-04-17 | 2011-09-20 | Circadence Corporation | System and method for reducing traffic and congestion on distributed interactive simulation networks |
| US8195823B2 (en) | 2000-04-17 | 2012-06-05 | Circadence Corporation | Dynamic network link acceleration |
| US7127518B2 (en) | 2000-04-17 | 2006-10-24 | Circadence Corporation | System and method for implementing application functionality within a network infrastructure |
| JP3601777B2 (en) | 2000-06-02 | 2004-12-15 | 日本電気株式会社 | Centralized management method and system for call control data for call agent |
| US6651121B1 (en) * | 2000-09-08 | 2003-11-18 | Corel Inc. | Method and apparatus for facilitating scalability during automated data processing |
| US7853833B1 (en) | 2000-09-08 | 2010-12-14 | Corel Corporation | Method and apparatus for enhancing reliability of automated data processing |
| US6961922B1 (en) | 2000-09-08 | 2005-11-01 | Corel Corporation | Method and apparatus for defining operations to be performed during automated data processing |
| US7747673B1 (en) | 2000-09-08 | 2010-06-29 | Corel Corporation | Method and apparatus for communicating during automated data processing |
| US6868193B1 (en) | 2000-09-08 | 2005-03-15 | Corel Inc. | Method and apparatus for varying automated data processing |
| US6938030B1 (en) | 2000-09-08 | 2005-08-30 | Corel Corporation | Method and apparatus for facilitating accurate automated processing of data |
| US6944865B1 (en) | 2000-09-08 | 2005-09-13 | Corel Corporation | Method and apparatus for saving a definition for automated data processing |
| US6850956B1 (en) | 2000-09-08 | 2005-02-01 | Corel Inc. | Method and apparatus for obtaining and storing data during automated data processing |
| US7296238B1 (en) | 2000-09-08 | 2007-11-13 | Corel Corporation | Method and apparatus for triggering automated processing of data |
| US7000223B1 (en) | 2000-09-08 | 2006-02-14 | Corel Corporation | Method and apparatus for preparing a definition to control automated data processing |
| US6925593B1 (en) | 2000-09-08 | 2005-08-02 | Corel Corporation | Method and apparatus for transferring data during automated data processing |
| JP3885865B2 (en) * | 2000-10-16 | 2007-02-28 | 日本電気株式会社 | Data distribution system and data distribution method |
| JP3885483B2 (en) * | 2000-10-30 | 2007-02-21 | 富士通株式会社 | Service execution method and apparatus |
| US20020107977A1 (en) * | 2000-12-07 | 2002-08-08 | Andrew Dunshea | Multi-server system dynamic re-configuration |
| US7174379B2 (en) * | 2001-08-03 | 2007-02-06 | International Business Machines Corporation | Managing server resources for hosted applications |
| US7734726B2 (en) * | 2001-11-27 | 2010-06-08 | International Business Machines Corporation | System and method for dynamically allocating processing on a network amongst multiple network servers |
| SE0200417D0 (en) * | 2002-02-13 | 2002-02-13 | Ericsson Telefon Ab L M | A method and apparatus for reconfiguring a server system |
| GB2385683A (en) * | 2002-02-22 | 2003-08-27 | Thirdspace Living Ltd | Distribution system with content replication |
| EP1394701A3 (en) * | 2002-07-31 | 2006-05-03 | Hewlett-Packard Development Company, L.P. | Establishment of network connections |
| US7624047B1 (en) | 2002-07-31 | 2009-11-24 | Amazon Technologies, Inc. | Managing server load by varying responses to requests for dynamically-generated web pages |
| US7386611B2 (en) * | 2002-12-10 | 2008-06-10 | International Business Machines Corporation | Apparatus and methods for co-location and offloading of web site traffic based on traffic pattern recognition |
| TW583556B (en) * | 2002-12-20 | 2004-04-11 | Inst Information Industry | Method for translating web page document into web service interface and storage medium storing computer program for executing the method |
| JP4357391B2 (en) * | 2004-09-02 | 2009-11-04 | 富士通株式会社 | Queue management device |
| US7853953B2 (en) * | 2005-05-27 | 2010-12-14 | International Business Machines Corporation | Methods and apparatus for selective workload off-loading across multiple data centers |
| CN101601204B (en) * | 2006-12-13 | 2014-01-22 | 日本电气株式会社 | Home network system and mobility anchor allocation method used in the home network system |
| US9112873B2 (en) * | 2007-04-10 | 2015-08-18 | Apertio Limited | Alias hiding in network data repositories |
| US8140676B2 (en) * | 2007-04-10 | 2012-03-20 | Apertio Limited | Data access in distributed server systems |
| US8402147B2 (en) * | 2007-04-10 | 2013-03-19 | Apertio Limited | Nomadic subscriber data system |
| US8782085B2 (en) | 2007-04-10 | 2014-07-15 | Apertio Limited | Variant entries in network data repositories |
| US9183560B2 (en) | 2010-05-28 | 2015-11-10 | Daniel H. Abelow | Reality alternate |
| US8539086B2 (en) | 2011-03-23 | 2013-09-17 | Color Labs, Inc. | User device group formation |
| US8327012B1 (en) | 2011-09-21 | 2012-12-04 | Color Labs, Inc | Content sharing via multiple content distribution servers |
| CN102708173B (en) * | 2012-05-02 | 2014-08-13 | 北京奇虎科技有限公司 | Method and system for processing user requests of accessing to web pages |
| US10671428B2 (en) * | 2015-09-08 | 2020-06-02 | Apple Inc. | Distributed personal assistant |
| US20220046036A1 (en) * | 2020-08-04 | 2022-02-10 | Oracle International Corporation | Mirage Instance of a Database Server |
| CN112907406B (en) * | 2021-02-07 | 2022-04-08 | 北京科技大学 | Online learning system based on cloud fusion multi-modal analysis |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5633999A (en) * | 1990-11-07 | 1997-05-27 | Nonstop Networks Limited | Workstation-implemented data storage re-routing for server fault-tolerance on computer networks |
| US5548724A (en) * | 1993-03-22 | 1996-08-20 | Hitachi, Ltd. | File server system and file access control method of the same |
| GB2281793A (en) | 1993-09-11 | 1995-03-15 | Ibm | A data processing system for providing user load levelling in a network |
| US6097882A (en) * | 1995-06-30 | 2000-08-01 | Digital Equipment Corporation | Method and apparatus of improving network performance and network availability in a client-server network by transparently replicating a network service |
| US5862348A (en) * | 1996-02-09 | 1999-01-19 | Citrix Systems, Inc. | Method and apparatus for connecting a client node to a server node based on load levels |
| US5835718A (en) * | 1996-04-10 | 1998-11-10 | At&T Corp | URL rewriting pseudo proxy server |
| US5828847A (en) * | 1996-04-19 | 1998-10-27 | Storage Technology Corporation | Dynamic server switching for maximum server availability and load balancing |
| US5894554A (en) * | 1996-04-23 | 1999-04-13 | Infospinner, Inc. | System for managing dynamic web page generation requests by intercepting request at web server and routing to page server thereby releasing web server to process other requests |
| US5918013A (en) * | 1996-06-03 | 1999-06-29 | Webtv Networks, Inc. | Method of transcoding documents in a network environment using a proxy server |
| US5818448A (en) * | 1996-07-02 | 1998-10-06 | Sun Microsystems, Inc. | Apparatus and method for identifying server computer aggregation topologies |
-
1996
- 1996-09-09 US US08/711,189 patent/US6240454B1/en not_active Expired - Lifetime
-
1997
- 1997-06-30 CA CA002209349A patent/CA2209349C/en not_active Expired - Fee Related
- 1997-09-02 EP EP97306778A patent/EP0828214A3/en not_active Withdrawn
- 1997-09-09 JP JP9243266A patent/JPH10105500A/en active Pending
Also Published As
| Publication number | Publication date |
|---|---|
| EP0828214A3 (en) | 1998-12-02 |
| EP0828214A2 (en) | 1998-03-11 |
| JPH10105500A (en) | 1998-04-24 |
| CA2209349A1 (en) | 1998-03-09 |
| US6240454B1 (en) | 2001-05-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2209349C (en) | Dynamic reconfiguration of network servers | |
| US7076553B2 (en) | Method and apparatus for real-time parallel delivery of segments of a large payload file | |
| US6360273B1 (en) | Method for collaborative transformation and caching of web objects in a proxy network | |
| CA2231810C (en) | Load balancing across the processors of a server computer | |
| EP0817020B1 (en) | A name service for a redundant array of internet servers | |
| US8185654B2 (en) | Systems and methods for content-aware load balancing | |
| US6681251B1 (en) | Workload balancing in clustered application servers | |
| US20030163734A1 (en) | Methods for managing and dynamically configuring resources at data center | |
| US8046458B2 (en) | Method and system for balancing the load and computer resources among computers | |
| US7127717B2 (en) | Hierarchical server system | |
| US8447757B1 (en) | Latency reduction techniques for partitioned processing | |
| US20050188055A1 (en) | Distributed and dynamic content replication for server cluster acceleration | |
| US20060123121A1 (en) | System and method for service session management | |
| CA2130411A1 (en) | Method and System for High Availability Document Image and Coded Data Processing | |
| US7716238B2 (en) | Systems and methods for server management | |
| Mourad et al. | Scalable web server architectures | |
| US20050021511A1 (en) | System and method for load balancing in database queries | |
| US9755897B1 (en) | Enhanced throttle management system | |
| US20020092012A1 (en) | Smart-caching system and method | |
| Wu et al. | Latency-sensitive hashing for collaborative Web caching | |
| WO2002017213A2 (en) | Server-side optimization of content delivery to clients by selective in-advance delivery | |
| Kurcewicz et al. | A distributed WWW cache | |
| KR100308705B1 (en) | Load balancing across the processors of a server computer | |
| US6463458B1 (en) | Information service using single-object servers | |
| CN117851352A (en) | Environment management system and method based on TiDB distributed cluster |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |