US 7,054,935 B2Grant
Internet content delivery network
Issue Date:2006-05-30
•18 Claims
•7 Drawing Sheets
Abstract
Resource requests made by clients of origin servers in a network are intercepted by reflector mechanisms and selectively reflected to other servers called repeaters. The reflectors select a best repeater from a set of possible repeaters and redirect the client to the selected best repeater. The client then makes the request of the selected best repeater. The resource is possibly rewritten to replace at least some of the resource identifiers contained therein with modified resource identifiers designating the repeater instead of the origin server.
Metadata
Assignee
- Savvis Communications Corporation
Inventors
- David A. Farber
- Richard E. Greer
- Andrew D. Swart
- James A. Balter
Application Information
Application Number:US 10/095,811
Filing Date:2002-03-13
Priority Date:1998-02-10
Art Unit:2142
Classifications
IPC:
G06F15/173
Patent Drawings (7 sheets)
Description
[0001] This is a Continuation of National application Ser. No. 09/612,598 filed Jul. 7, 2000, now abandoned which is a Continuation of National application Ser. No. 09/021,506 filed Feb. 10, 1998 now U.S. Pat. No. 6,185,598. Which also claims the benefit of Provisional Application No. 60/092710, filed Jul. 14, 1998.
Field of the Invention
[0002] This invention relates to replication of resources in computer networks.
Background of the Invention
[0003] The advent of global computer networks, such as the Internet, have led to entirely new and different ways to obtain information. A user of the Internet can now access information from anywhere in the world, with no regard for the actual location of either the user or the information. A user can obtain information simply by knowing a network address for the information and providing that address to an appropriate application program such as a network browser.
[0004] The rapid growth in popularity of the Internet has imposed a heavy traffic burden on the entire network. Solutions to problems of demand (e.g., better accessibility and faster communication links) only increase the strain on the supply. Internet Web sites (referred to here as“publishers”) must handle ever-increasing bandwidth needs, accommodate dynamic changes in load, and improve performance for distant browsing clients, especially those overseas. The adoption of content-rich applications, such as live audio and video, has further exacerbated the problem.
[0005] To address basic bandwidth growth needs, a Web publisher typically subscribes to additional bandwidth from an Internet service provider (ISP), whether in the form of larger or additional “pipes” or channels from the ISP to the publisher's premises, or in the form of large bandwidth commitments in an ISP's remote hosting server collection. These increments are not always as fine-grained as the publisher needs, and quite often lead times can cause the publisher's Web site capacity to lag behind demand.
[0006] To address more serious bandwidth growth problems, publishers may develop more complex and costly custom solutions. The solution to the most common need, increasing capacity, is generally based on replication of hardware resources and site content (known as mirroring), and duplication of bandwidth resources. These solutions, however, are difficult and expensive to deploy and operate. As a result, only the largest publishers can afford them, since only those publishers can amortize the costs over many customers (and Web site hits).
[0007] A number of solutions have been developed to advance replication and mirroring. In general, these technologies are designed for use by a single Web site and do not include features that allow their components to be shared by many Web sites simultaneously.
[0008] Some solution mechanisms offer replication software that helps keep mirrored servers up-to-date. These mechanisms generally operate by making a complete copy of a file system. One such system operates by transparently keeping multiple copies of a file system in synch. Another system provides mechanisms for explicitly and regularly copying files that have changed. Database systems are particularly difficult to replicate, as they are continually changing. Several mechanisms allow for replication of databases, although there are no standard approaches for accomplishing it. Several companies offering proxy caches describe them as replication tools. However, proxy caches differ because they are operated on behalf of clients rather than publishers.
[0009] Once a Web site is served by multiple servers, a challenge is to ensure that the load is appropriately distributed or balanced among those servers. Domain name-server-based round-robin address resolution causes different clients to be directed to different mirrors.
[0010] Another solution, load balancing, takes into account the load at each server (measured in a variety of ways) to select which server should handle a particular request.
[0011] Load balancers use a variety of techniques to route the request to the appropriate server. Most of those load-balancing techniques require that each server be an exact replica of the primary Web site. Load balancers do not take into account the “network distance” between the client and candidate mirror servers.
[0012] Assuming that client protocols cannot easily change, there are two major problems in the deployment of replicated resources. The first is how to select which copy of the resource to use. That is, when a request for a resource is made to a single server, how should the choice of a replica of the server (or of that data) be made. We call this problem the “rendezvous problem”. There are a number of ways to get clients to rendezvous at distant mirror servers. These technologies, like load balancers, must route a request to an appropriate server, but unlike load balancers, they take network performance and topology into account in making the determination.
[0013] A number of companies offer products which improve network performance by prioritizing and filtering network traffic. Proxy caches provide a way for client aggregators to reduce network resource consumption by storing copies of popular resources close to the end users. A client aggregator is an Internet service provider or other organization that brings a large number of clients operating browsers to the Internet. Client aggregators may use proxy caches to reduce the bandwidth required to serve web content to these browsers. However, traditional proxy caches are operated on behalf of Web clients rather than Web publishers.
[0014] Proxy caches store the most popular resources from all publishers, which means they must be very large to achieve reasonable cache efficiency. (The efficiency of a cache is defined as the number of requests for resources which are already cached divided by the total number of requests.)
[0015] Proxy caches depend on cache control hints delivered with resources to determine when the resources should be replaced. These hints are predictive, and are necessarily often incorrect, so proxy caches frequently serve stale data. In many cases, proxy cache operators instruct their proxy to ignore hints in order to make the cache more efficient, even though this causes it to more frequently serve stale data.
[0016] Proxy caches hide the activity of clients from publishers. Once a resource is cached, the publisher has no way of knowing how often it was accessed from the cache.
Summary of the Invention
[0017] This invention provides a way for servers in a computer network to off-load heir processing of requests for selected resources by determining a different server (a “repeater”) to process those requests. The selection of the repeater can be made dynamically, based on information about possible repeaters.
[0018] If a requested resource contains references to other resources, some or all of these references can be replaced by references to repeaters.
[0019] Accordingly, in one aspect, this invention is a method of processing resource requests in a computer network. First a client makes a request for a particular resource from an origin server, the request including a resource identifier for the particular resource, the resource identifier sometimes including an indication of the origin server. Requests arriving at the origin server do not always include an indication of the origin server; since they are sent to the origin server, they do not need to name it. A mechanism referred to as a reflector, co-located with the origin server, intercepts the request from the client to the origin server and decides whether to reflect the request or to handle it locally. If the reflector decides to handle the request locally, it forwards it to the origin server, otherwise it selects a “best” repeater to process the request. If the request is reflected, the client is provided with a modified resource identifier designating the repeater.
[0020] The client gets the modified resource identifier from the reflector and makes a request for the particular resource from the repeater designated in the modified resource identifier.
[0021] When the repeater gets the client's request, it responds by returning the requested resource to the client. If the repeater has a local copy of the resource then it returns that copy, otherwise it forwards the request to the origin server to get the resource, and saves a local copy of the resource in order to serve subsequent requests.
[0022] The selection by the reflector of an appropriate repeater to handle the request can be done in a number of ways. In the preferred embodiment, it is done by first pre-partitioning the network into “cost Groups” and then determining which cost group the client is in. Next, from a plurality of repeaters in the network, a set of repeaters is selected, the members of the set having a low cost relative to the cost group which the client is in. In order to determine the lowest cost, a table is maintained and regularly updated to define the cost between each group and each repeater. Then one member of the set is selected, preferably randomly, as the best repeater.
[0023] If the particular requested resource itself can contain identifiers of other resources, then the resource may be rewritten (before being provided to the client). In particular, the resource is rewritten to replace at least some of the resource identifiers contained therein with modified resource identifiers designating a repeater instead of the origin server. As a consequence of this rewriting process, when the client requests other resources based on identifiers in the particular requested resource, the client will make those requests directly to the selected repeater, bypassing the reflector and origin server entirely.
[0024] Resource rewriting must be performed by reflectors. It may also be performed by repeaters, in the situation where repeaters “peer” with one another and make copies of resources which include rewritten resource identifiers that designate a repeater.
[0025] In a preferred embodiment, the network is the Internet and the resource identifier is a uniform resource locator (URL) for designating resources on the Internet, and the modified resource identifier is a URL designating the repeater and indicating the origin server (as described in step B3 below), and the modified resource identifier is provided to the client using a REDIRECT message. Note, only when the reflector is “reflecting” a request is the modified resource identifier provided using a REDIRECT message.
[0026] In another aspect, this invention is a computer network comprising a plurality of origin servers, at least some of the origin servers having reflectors associated therewith, and a plurality of repeaters.
Brief Description of the Drawings
[0027] The above and other objects and advantages of the invention will be apparent upon consideration of the following detailed description, taken in conjunction with the accompanying drawings, in which the reference characters refer to like parts throughout and in which:
[0028] FIG. 1 depicts a portion of a network environment according to the present invention; and
[0029] FIGS. 2–6 are flow charts of the operation of the present invention.
Detailed Description of the Presently Preferred Exemplary Embodiments
[0030] Overview
[0031] FIG. 1 shows a portion of a network environment 100 according to the present invention, wherein a mechanism (reflector 108, described in detail below) at a server (herein origin server 102) maintains and keeps track of a number of partially replicated servers or repeaters 104a, 104b, and 104c. Each repeater 104a, 104b, and 104c replicates some or all of the information available on the origin server 102 as well as information available on other origin servers in the network 100. Reflector 108 is connected to a particular repeater known as its “contact” repeater (“Repeater B” 104b in the system depicted in FIG. 1 ). Preferably each reflector maintains a connection with a single repeater known as its contact, and each repeater maintains a connection with a special repeater known as its master repeater (e.g., repeater 104m for repeaters 104a, 104b and 104c in FIG. 1 ).
[0032] Thus, a repeater can be considered as a dedicated proxy server that maintains a partial or sparse mirror of the origin server 102, by implementing a distributed coherent cache of the origin server. A repeater may maintain a (partial) mirror of more than one origin server. In some embodiments, the network 100 is the Internet and repeaters mirror selected resources provided by origin servers in response to clients' HTTP (hypertext transfer protocol) and FTP (file transfer protocol) requests.
[0033] A client 106 connects, via the network 100, to origin server 102 and possibly to one or more repeaters 104a etc.
[0034] Origin server 102 is a server at which resources originate. More generally, the origin server 102 is any process or collection of processes that provide resources in response to requests from a client 106. Origin server 102 can be any off-the-shelf Web server. In a preferred embodiment, origin server 102 is typically a Web server such as the Apache server or Netscape Communications Corporation's Enterprise™ server.
[0035] Client 106 is a processor requesting resources from origin server 102 on behalf of an end user. The client 106 is typically a user agent (e.g., a Web browser such as Netscape Communications Corporation's Navigator™) or a proxy for a user agent. Components other than the reflector 108 and the repeaters 104a, 104b, etc., may be implemented using commonly available software programs. In particular, this invention works with any HTTP client (e.g., a Web browser), proxy cache, and Web server. In addition, the reflector 108 might be fully integrated into the data server 112 (for instance, in a Web Server). These components might be loosely integrated based on the use of extension mechanisms (such as so-called add-in modules) or tightly integrated by modifying the service component specifically to support the repeaters.
[0036] Resources originating at the origin server 102 may be static or dynamic. That is, the resources may be fixed or they may be created by the origin server 102 specifically in response to a request. Note that the terms “static” and “dynamic” are relative, since a static resource may change at some regular, albeit long, interval.
[0037] Resource requests from the client 106 to the origin server 102 are intercepted by reflector 108 which for a given request either forwards the request on to the origin server 102 or conditionally reflects it to some repeater 104a, 104b, etc. in the network 100. That is, depending on the nature of the request by the client 106 to the origin server 102, the reflector 108 either serves the request locally (at the origin server 102), or selects one of the repeaters (preferably the best repeater for the job) and reflects the request to the selected repeater. In other words, the reflector 108 causes requests for resources from origin server 102, made by client 106, to be either served locally by the origin server 102 or transparently reflected to the best repeater 104a, 104b, etc. The notion of a best repeater and the manner in which the best repeater is selected are described in detail below.
[0038] Repeaters 104a, 104b, etc. are intermediate processors used to service client requests thereby improving performance and reducing costs in the manner described herein. Within repeaters 104a, 104b, etc., are any processes or collections of processes that deliver resources to the client 106 on behalf of the origin server 102. A repeater may include a repeater cache 110, used to avoid unnecessary transactions with the origin server 102.
[0039] The reflector 108 is a mechanism, preferably a software program, that intercepts requests that would normally be sent directly to the origin server 102. While shown in the drawings as separate components, the reflector 108 and the origin server 102 are typically co-located, e.g., on a particular system such as data server 112. (As discussed below, the reflector 108 may even be a “plug in” module that becomes part of the origin server 102.
[0040] FIG. 1 shows only a part of a network 100 according to this invention. A complete operating network consists of any number of clients, repeaters, reflectors, and origin servers. Reflectors communicate with the repeater network, and repeaters in the network communicate with one another.
[0041] Uniform Resource Locators
[0042] Each location in a computer network has an address which can generally be specified as a series of names or numbers. In order to access information, an address for that information must be known. For example, on the World Wide Web (“the Web”) which is a subset of the Internet, the manner in which information address locations are provided has been standardized into Uniform Resource Locators (URLs). URLs specify the location of resources (information, data files, etc.) on the network.
[0043] The notion of URLs becomes even more useful when hypertext documents are used. A hypertext document is one which includes, within the document itself, links (pointers or references) to the document itself or to other documents. For example, in an on-line legal research system, each case may be presented as a hypertext document. When other cases are cited, links to those cases can be provided. In this way, when a person is reading a case, they can follow cite links to read the appropriate parts of cited cases.
[0044] In the case of the Internet in general and the World Wide Web specifically, documents can be created using a standardized form known as the Hypertext Markup Language (HTML). In HTML, a document consists of data (text, images, sounds, and the like), including links to other sections of the same document or to other documents. The links are generally provided as URLs, and can be in relative or absolute form. Relative URLs simply omit the parts of the URL which are the same as for the document including the link, such as the address of the document (when linking to the same document), etc. In general, a browser program will fill in missing parts of a URL using the corresponding parts from the current document, thereby forming a fully formed URL including a filly qualified domain name, etc.
[0045] A hypertext document may contain any number of links to other documents, and each of those other documents may be on a different server in a different part of the world. For example, a document may contain links to documents in Russia, Africa, China and Australia. A user viewing that document at a particular client can follow any of the links transparently (i.e., without knowing where the document being linked to actually resides). Accordingly, the cost (in terms of time or money or resource allocation) of following one link versus another may be quite significant.
[0046] URLs generally have the following form (defined in detail in T. Berners-Lee et al, Uniform Resource Locators (URL), Network Working Group, Request for Comments: 1738, Category: Standards Track, December 1994, located at “http://ds.internic.net/rfc/rfc1738.txt”, which is hereby incorporated herein by reference):
scheme://host[:port]/url-path
where “scheme” can be a symbol such as “file” (for a file on the local system), “ftp” (for a file on an anonymous FTP file server), “http” (for a file on a file on a Web server), and “telnet” (for a connection to a Telnet-based service). Other schemes, can also be used and new schemes are added every now and then. The port number is optional, the system substituting a default port number (depending on the scheme) if none is provided. The “host” field maps to a particular network address for a particular computer. The “url-path” is relative to the computer specified in the “host” field. A url-path is typically, but not necessarily, the pathname of a file in a web server directory.
scheme://host[:port]/url-path
where “scheme” can be a symbol such as “file” (for a file on the local system), “ftp” (for a file on an anonymous FTP file server), “http” (for a file on a file on a Web server), and “telnet” (for a connection to a Telnet-based service). Other schemes, can also be used and new schemes are added every now and then. The port number is optional, the system substituting a default port number (depending on the scheme) if none is provided. The “host” field maps to a particular network address for a particular computer. The “url-path” is relative to the computer specified in the “host” field. A url-path is typically, but not necessarily, the pathname of a file in a web server directory.
[0047] For example, the following is a URL identifying a file “F” in the path “A/B/C” on a computer at “www.uspto.gov”:
http://www.uspto.gov/A/B/C/F
http://www.uspto.gov/A/B/C/F
[0048] In order to access the file “F” (the resource) specified by the above URL, a program (e.g., a browser) running on a user's computer (i.e., a client computer) would have to first locate the computer (i.e., a server computer) specified by the host name. I.e., the program would have to locate the seer “www.uspto.gov”. To do this, it would access a Domain Name Server (DNS), providing the DNS with the host name (“www.uspto.gov.”). The DNS acts as a kind of centralized directory for resolving addresses from names. If the DNS determines that there is a (remote server) computer corresponding to the name “www.uspto.gov”, it will provide the program with an actual computer network address for that server computer. On the Internet this is called an Internet Protocol (or IP) address and it has the form “123.345.456.678”. The program on the user's (client) computer would then use the actual address to access the remote (server) computer.
[0049] The program opens a connection to the HTTP server (Web server) on the remote computer “www.uspto.gov” and uses the connection to send a request message to the remote computer (using the HTTP scheme). The message is typically an HTTP GET request which includes the url-path of the requested resource, “A/B/C/F”. The HTTP server receives the request and uses it to access the resource specified by the url-path “A/B/C/F”. The server returns the resource over the same connection.
[0050] Thus, conventionally HTTP client requests for Web resources at an origin server 102 are processed as follows (see FIG. 2 ) (This is a description of the process when no reflector 108 is installed.):
-
- [0051] A1. A browser (e.g., Netscape's Navigator) at the client receives a resource identifier (i.e., a URL) from a user.
- [0052] A2. The browser extracts the host (origin server) name from the resource identifier, and uses a domain name server (DNS) to look up the network (IP) address of the corresponding server. The browser also extracts a port number, if one is present, or uses a default port number (the default port number for http requests is 80).
- [0053] A3. The browser uses the server's network address and port number to establish a connection between the client 106 and the host or origin server 102.
- [0054] A4. The client 106 then sends a (GET) request over the connection identifying the requested resource.
- [0055] A5. The origin server 102 receives the request and
- [0056] A6. locates or composes the corresponding resource.
- [0057] A7. The origin server 102 then sends back to the client 106 a reply containing the requested resource (or some form of error indicator if the resource is unavailable). The reply is sent to the client over the same connection as that on which the request was received from the client.
- [0058] A8. The client 106 receives the reply from the origin server 102.
[0059] There are many variations of this basic model. For example, in one variation, instead of providing the client with the resource, the origin server can tell the client to re-request the resource by another name. To do so, in A7 the server 102 sends back to the client 106 a reply called a “REDIRECT” which contains a new URL indicating the other name. The client 106 then repeats the entire sequence, normally without any user intervention, this time requesting the resource identified by the new URL.
[0060] System Operation
[0061] In this invention reflector 108 effectively takes the place of an ordinary Web server or origin server 102. The reflector 108 does this by taking over the origin server's IP address and port number. In this way, when a client tries to connect to the origin server 102, it will actually connect to the reflector 108. The original Web server (or origin server 102) must then accept requests at a different network (IP) address, or at the same IP address but on a different port number. Thus, using this invention, the server referred to in A3–A7 above is actually a reflector 108.
[0062] Note that it is also possible to leave the origin server's network address as it is and to let the reflector run at a different address or on a different port. In this way the reflector does not intercept requests sent to the origin server, but can still be sent requests addressed specifically to the reflector. Thus the system can be tested and configured without interrupting its normal operation.
[0063] The reflector 108 supports the processing as follows (see FIG. 3 ): upon receipt of a request,
-
- [0064] B1 The reflector 108 analyzes the request to determine whether or not to reflect the request To do this, first the reflector determines whether the sender (client 106) is a browser or a repeater. Requests issued by repeaters must be served locally by the origin server 102. This determination can be made by looking up the network (IP) address of the sender in a list of known repeater network (IP) addresses. Alternatively, this determination could be made by attaching information to a request to indicate that the request is from a specific repeater, or repeaters can request resources from a special port other than the one used for ordinary clients.
- [0065] B2 If the request is not from a repeater, the reflector looks up the requested resource in a table (called the “rule base”) to determine whether the resource requested is “repeatable”. Based on this determination, the reflector either reflects the request (B3, described below) or serves the request locally (B4, described below).
- [0066] The rule base is a list of regular expressions and associated attributes. (Regular expressions are well-known in the field of computer science. A small bibliography of their use is found in Aho, et al., “Compilers, Principles, techniques and tools”, Addison-Wesley, 1986, pp. 157–158.) The resource identifier (URL) for a given request is looked up in the rule base by matching it sequentially with each regular expression. The first match identifies the attributes for the resource, namely repeatable or local. If there is no match in the rule base, a default attribute is used. Each reflector has its own rule base, which is manually configured by the reflector operator.
- [0067] B3. To reflect a request, (to serve a request locally go to B4), as shown in
FIG. 4 , the reflector determines (B3-1) the best repeater to reflect the request to, as described in detail below. The reflector then creates (B3-2) a new resource identifier (URL) (using the requested URL and the best repeater) that identifies the same resource at the selected repeater. - [0068] It is necessary that the reflection step create a single URL containing the URL of the original resource, as well as the identity of the selected repeater. A special form of URL is created to provide this information. This is done by creating a new URL as follows:
- [0069] D1. Given a repeater name, scheme, origin server name and path, create a new URL. If the scheme is “http”, the preferred embodiment uses the following format:
http://<repeater>/<server>/<path> - [0070] If the form used is other than “http”, the preferred embodiment uses the following format:
http://<repeater>/<server>@proxy=<scheme>@/<path> - [0071] The reflector can also attach a MIME type to the request, to cause the repeater to provide that MIME type with the result. This is useful because many protocols (such as FTP) do not provide a way to attach a MIME type to a resource. The format is
http://<repeater>/<server>@proxy=<scheme>:<type>@/<path> - [0072] This URL is interpreted when received by the repeater.
- [0073] The reflector then sends (B3-3) a REDIRECT reply containing this new URL to the requesting client. The HTTP REDIRECT command allows the reflector to send the browser a single URL to retry the request.
- [0074] B4. To serve a request locally, the request is sent by the reflector to (“forwarded to”) the origin server 102. In this mode, the reflector acts as a reverse proxy server. The origin server 102 processes the request in the normal manner (A5–A7). The reflector then obtains the origin server's reply to the request which it inspects to determine if the requested resource is an HTML document, i.e., whether the requested resource is one which itself contains resource identifiers.
- [0075] B5. If the resource is an HTML document then the reflector rewrites the HTML document by modifying resource identifiers (URLs) within it, as described below. The resource, possibly as modified by rewriting, is then returned in a reply to the requesting client 106.
- [0076] If the requesting client is a repeater, the reflector may temporarily disable any cache-control modifiers which the origin server attached to the reply. These disabled cache-control modifiers are later re-enabled when the content is served from the repeater. This mechanism makes it possible for the origin server to prevent resources from being cached at normal proxy caches, without affecting the behavior of the cache at the repeater.
- [0077] B6. Whether the request is reflected or handled locally, details about the transaction, such as the current time, the address of the requester, the URL requested, and the type of response generated, are written by the reflector to a local log file.
[0078] By using a rule base (B2), it is possible to selectively reflect resources. There are a number of reasons that certain particular resources cannot be effectively repeated (and therefore should not be reflected), for instance:
-
- [0079] the resource is composed uniquely for each request;
- [0080] the resource relies on a so-called cookie (browsers will not send cookies to repeaters with different domain names);
- [0081] the resource is actually a program (such as a Java applet) that will run on the client and that wishes to connect to a service (Java requires that the service be running on the same machine that provided the applet).
[0082] In addition, the reflector 108 can be configured so that requests from certain network addresses (e.g., requests from clients on the same local area network as the reflector itself) are never reflected. Also, the reflector may choose not to reflect requests because the reflector is exceeding its committed aggregate information rate, as described below.
[0083] A request which is reflected is automatically mirrored at the repeater when the repeater receives and processes the request
[0084] The combination of the reflection process described here and the caching process described below effectively creates a system in which repeatable resources are migrated to and mirrored at the selected reflector, while non-repeatable resources are not mirrored.
[0085] Alternate Approach
[0086] Placing the origin server name in the reflected URL is generally a good strategy, but it may be considered undesirable for aesthetic or (in the case, e.g., of cookies) certain technical reasons.
[0087] It is possible to avoid the need for placing both the repeater name and the server name in the URL. Instead, a “family” of names may be created for a given origin server, each name identifying one of the repeaters used by that server.
[0088] For instance, if www.example.com is the origin server, names for three repeaters might be created:
[0089] wr1.example.com
[0090] wr2.example.com
[0091] wr3.example.com
[0092] The name “wr1.example.com” would be an alias for repeater 1, which might also be known by other names such as “wr1.anotherExample.com” and “wr1.example.edu”.
[0093] If the repeater can determine by which name it was addressed, it can use this information (along with a table that associates repeater alias names with origin server names) to determine which origin server is being addressed. For instance, if repeater 1 is addressed as wr1.example.com, then the origin server is “www.example.com”; if it is addressed as “wr1.anotherExample.com”, then the origin server is “www.anotherExample.com”.
[0094] The repeater can use two mechanisms to determine by which alias it is addressed:
-
- [0095] 1. Each alias can be associated with a different IP address. Unfortunately, this solution does not scale well, as IP addresses are currently scarce, and the number of IP addresses required grows as the product of origin servers and repeaters.
- [0096] 2. The repeater can attempt to determine the alias name used by inspecting the “host:” tag in the HTTP header of the request. Unfortunately, some old browsers still in use do not attach the “host:” tag to a request. Reflectors would need to identify such browsers (the browser identity is a part of each request) and avoid this form of reflection.
[0097] How a Repeater Handles a Request
[0098] When a browser receives a REDIRECT response (as produced in B3), it reissues a request for the resource using the new resource identifier (URL) (A1–A5). Because the new identifier refers to a repeater instead of the origin server, the browser now sends a request for the resource to the repeater which processes a request as follows, with reference to FIG. 5 :
-
- [0099] C1. First the repeater analyzes the request to determine the network address of the requesting client and the path of the resource requested. Included in the path is an origin server name (as described above with reference to B3).
- [0100] C2. The repeater uses an internal table to verify that the origin server belongs to a known “subscriber”. A subscriber is an entity (e.g., a company) that publishes resources (e.g., files) via one or more origin servers. When the entity subscribes, it is permitted to utilize the repeater network. The subscriber tables described below include the information that is used to link reflectors to subscribers.
- [0101] If the request is not for a resource from a known subscriber, the request is rejected. To reject a request, the repeater returns a reply indicating that the requested resource does not exist.
- [0102] C3. The repeater then determines whether the requested resource is cached locally. If the requested resource is in the repeater's cache it is retrieved. On the other hand, if a valid copy of the requested resource is not in the repeater's cache, the repeater modifies the incoming URL, creating a request that it issues directly to the originating reflector which processes it (as in B1–B6). Because this request to the originating reflector is from a repeater, the reflector always returns the requested resource rather than reflecting the request (Recall that reflectors always handle requests from repeaters locally.) If the repeater obtained the resource from the origin server, the repeater then caches the resource locally.
- [0103] If a resource is not cached locally, the cache can query its “peer caches” to see if one of them contains the resource, before or at the same time as requesting the resource from the reflector/origin server. If a peer cache responds positively in a limited period of time (preferably a small fraction of a second), the resource will be retrieved from the peer cache.
- [0104] C4. The repeater then constructs a reply including the requested resource (which was retrieved from the cache or from the origin server) and sends that reply to the requesting client.
- [0105] C5. Details about the transaction, such as the associated reflector, the current time, the address of the requester, the URL requested, and the type of response generated, are written to a local log file at the repeater.
[0106] Note that the bottom row of FIG. 2 refers to an origin server, or a reflector, or a repeater, depending on what the URL in step A1 identifies.
[0107] Selecting the Best Repeater
[0108] If the reflector 108 determines that it will reflect the request, it must then select the best repeater to handle that request (as referred to in step B3-1). This selection is performed by the Best Repeater Selector (BRS) mechanism described here.
[0109] The goal of the BRS is to select, quickly and heuristically, an appropriate repeater for a given client given only the network address of the client. An appropriate repeater is one which is not too heavily loaded and which is not too far from the client in terms of some measure of network distance. The mechanism used here relies on specific, compact, pre-computed data to make a fast decision. Other, dynamic solutions can also be used to select an appropriate repeater.
[0110] The BRS relies on three pre-computed tables, namely the Group Reduction Table, the Link Cost Table, and the Load Table. These three tables (described below) are computed off-line and downloaded to each reflector by its contact in the repeater network.
[0111] The Group Reduction Table places every network address into a group, with the goal that addresses in a group share relative costs, so that they would have the same best repeater under varying conditions (i.e., the BRS is invariant over the members of the group).
[0112] The Link Cost Table is a two dimensional matrix which specifies the current cost between each repeater and each group. Initially, the link cost between a repeater and a group is defined as the “normalized link cost” between the repeater and the group, as defined below. Over time, the table will be updated with measurements which more accurately reflect the relative cost of transmitting a file between the repeater and a member of the group. The format of the link Cost Table is <Group ID> <Group ID> <link cost>, where the Group ID's are given as AS numbers.
[0113] The Load Table is a one dimensional table which identifies the current load at each repeater. Because repeaters may have different capacities, the load is a value that represents the ability of a given repeater to accept additional work Each repeater sends its current load to a central master repeater at regular intervals, preferably at least approximately once a minute. The master repeater broadcasts the Load Table to each reflector in the network, via the contact repeater.
[0114] A reflector is provided entries in the Load Table only for repeaters which it is assigned to use. The assignment of repeaters to reflectors is performed centrally by a repeater network operator at the master repeater. This assignment makes it possible to modify the service level of a given reflector. For instance, a very active reflector may use many repeaters, whereas a relatively inactive reflector may use few repeaters.
[0115] Tables may also be configured to provide selective repeater service to subscribers in other ways, e.g., for their clients in specific geographic regions, such as Europe or Asia.
[0116] Measuring Load
[0117] In the presently preferred embodiments, repeater load is measured in two dimensions, namely
-
- [0118] 1. requests received by the repeater per time interval (RRPT), and
- [0119] 2. bytes sent by the repeater per time interval (BSPT).
[0120] For each of these dimensions, a maximum capacity setting is set. The maximum capacity indicates the point at which the repeater is considered to be fully loaded. A higher RRPT capacity generally indicates a faster processor, whereas a higher BSPT capacity generally indicates a wider network pipe. This form of load measurement assumes that a given server is dedicated to the task of repeating.
[0121] Each repeater regularly calculates its current RRPT and BSPT, by accumulating the number of requests received and bytes sent over a short time interval. These measurements are used to determine the repeater's load in each of these dimensions. If a repeater's load exceeds its configured capacity, an alarm message is sent to the repeater network administrator.
[0122] The two current load components are combined into a single value indicating overall current load. Similarly, the two maximum capacity components are combined into a single value indicating overall maximum capacity. The components are combined as follows:
current-load=B×current RRPT+(1−B)×current BSPT
max-load=B×max RRPT+(1−B)×max BSPT
current-load=B×current RRPT+(1−B)×current BSPT
max-load=B×max RRPT+(1−B)×max BSPT
[0123] The factor B, a value between 0 and 1, allows the relative weights of RRPT and BSPT to be adjusted, which favors consideration of either processing power or bandwidth.
[0124] The overall current load and overall maximum capacity values are periodically sent from each repeater to the master repeater, where they are aggregated in the Load Table, a table summarizing the overall load for all repeaters. Changes in the Load Table are distributed automatically to each reflector.
[0125] While the preferred embodiment uses a two-dimensional measure of repeater load, any other measure of load can be used.
[0126] Combining Link Costs and Load
[0127] The BRS computes the cost of servicing a given client from each eligible repeater. The cost is computed by combining the available capacity of the candidate repeater with the cost of the link between that repeater and the client. The link cost is computed by simply looking it up in the Link Cost table.
[0128] The cost is determined using the following formula:
threshold=K*max-load
capacity=max(max-load−current-load, e)
capacity=min(capacity, threshold)
cost=link-cost*threshold/capacity
threshold=K*max-load
capacity=max(max-load−current-load, e)
capacity=min(capacity, threshold)
cost=link-cost*threshold/capacity
[0129] In this formula, e is a very small number (epsilon) and K is a tuning factor initial set to 0.5. This formula causes the cost to a given repeater to be increased, at a rate defined by K, if its capacity falls below a configurable threshold.
[0130] Given the cost of each candidate repeater, the BRS selects all repeaters within a delta factor of the best score. From this set, the result is selected at random.
[0131] The delta factor prevents the BRS from repeatedly selecting a single repeater when scores are similar. It is generally required because available information about load and link costs loses accuracy over time. This factor is tunable.
[0132] Best Repeater Selector (BRS)
[0133] The BRS operates as follows, with reference to FIG. 6 :
[0134] Given a client network address and the three tables described above:
-
- [0135] E1. Determine which group the client is in using the Group Reduction Table.
- [0136] E2. For each repeater in the Link Cost Table and Load Table, determine that repeater's combined cost as follows:
- [0137] E2a. Determine the maximum and current load on the repeater (using the Load Table).
- [0138] E2b. Determine the link cost between the repeater and the client's group (using the Link Cost Table).
- [0139] E2c. Determine the combined cost as described above.
- [0140] E3. Select a small set of repeaters with the lowest cost.
- [0141] E4. Select a random member from the set.
[0142] Preferably the results of the BRS processing are maintained in a local cache at the reflector 108. Thus, if the best repeater has recently been determined for a given client (i.e., for a given network address), that best repeater can be reused quickly without being re-determined. Since the calculation described above is based on statically, pre-computed tables, if the tables have not changed then there is no need to re-determine the best repeater.
[0143] Determining the Group Reduction and Link Cost Tables
[0144] The Group Reduction Table and Link Cost Table used in BRS processing are created and regularly updated by an independent procedure referred to herein as NetMap. The NetMap procedure is run by executing several phases (described below) as needed.
[0145] The term Group is used here to refers to an IP “address group”.
[0146] The term Repeater Group refers to a Group that contains the IP address of a repeater.
[0147] The term link cost refers to a statically determined cost for transmitting data between two Groups. In a presently preferred implementation, this is the minimum of go the sums of the costs of the links along each path between them. The link costs of primary concern here are link costs between a Group and a Repeater Group.
[0148] The term relative link cost refers to the link cost relative to other link costs for the same Group which is calculated by subtracting the minimum link cost from a Group to any Repeater Group from each of its link costs to a Repeater Group. The term Cost Set refers to a set of Groups that are equivalent in regard to Best Repeater Selection. That is, given the information available, the same repeater would be selected for any of them.
[0149] The NetMap procedure first processes input files to create an internal database called the Group Registry. These input files describe groups, the IP addresses within groups, and links between groups, and come a variety of sources, including publicly available Internet Routing Registry (IRR) databases, BGP router tables, and probe services that are located at various points around the Internet and use publicly available tools (such as “traceroute”) to sample data paths. Once this processing is complete, the Group Registry contains essential information used for further processing, namely (1) the identity of each group, (2) the set of IP addresses in a given group, (3) the presence of links between groups indicating paths over which information may travel, and (4) the cost of sending data over a given link.
[0150] The following processes are then performed on the Group Registry file.
[0151] Calculate Repeater Group Link Costs
[0152] The NetMap procedure calculates a “link cost” for transmission of data between each Repeater Group and each Group in the Group Registry. This overall link cost is defined as the minimum cost of any path between the two groups, where the cost of a path is equal to the sum of the costs of the individual links in the path. The link cost algorithm presented below is essentially the same as algorithm #562 from ACM journal Transactions on Mathematical Software: “Shortest Path From a Specific Node to All Other Nodes in a Network” by U. Pape, ACM TOMS 6 (1980) pp. 450–455, http://www.netlib.org/toms/562.
[0153] In this processing, the term Repeater Group refers to a Group that contains the IP address of a repeater. A group is a neighbor of another group if the Group Registry indicates that there is a link between the two groups.
For each target Repeater Group T:
-
- [0154] Initialize the link cost between T and itself to zero.
- [0155] Initialize the link cost between T and every other Group to infinity.
- [0156] Create a list L that will contain Groups that are equidistant from the target Repeater Group T.
- [0157] Initialize the list L to contain just the target Repeater Group T itself.
- [0158] While the list L is not empty:
- [0159] Create an empty list L′ of neighbors of members of the list L.
- [0160] For each Group G in the list L:
- [0161] For each Group N that is a neighbor of G:
- [0162] Let cost refer to the sum of the link cost between T and G, and the link cost between G and N. The cost between T and G was determined in the previous pass of the algorithm; the link cost between G and N is from the Group Registry.
- [0163] If cost is less than the link cost between T and N:
- [0164] Set the link cost between T and N to cost.
- [0165] Add N to L′ if it is not already on it
- [0161] For each Group N that is a neighbor of G:
- [0166] Set L to L′.
[0167] Calculate Cost Sets
[0168] A Cost Set is a set of Groups that are equivalent with respect to Best Repeater Selection. That is, given the information available, the same repeater would be selected for any of them.
[0169] The “cost profile” of a Group G is defined herein as the set of costs between G and each Repeater. Two cost profiles are said to be equivalent if the values in one profile differ from the corresponding values in the other profile by a constant amount.
[0170] Once a client Group is known, the Best Repeater Selection algorithm relies on the cost profile for information about the Group. If two cost profiles are equivalent, the BRS algorithm would select the same repeater given either profile.
[0171] A Cost Set is then a set of groups that have equivalent cost profiles.
[0172] The effectiveness of this method can be seen, for example, in the case where all paths to a Repeater from some Group A pass through some other Group B. The two Groups have equivalent cost profiles (and are therefore in the same Cost Set) since whatever Repeater is best for Group A is also going to be best for Group B, regardless of what path is taken between the two Groups.
[0173] By normalizing cost profiles, equivalent cost profiles can be made identical. A normalized cost profile is a cost profile in which the minimum cost has the value zero. A normalized cost profile is computed by finding the minimum cost in the profile, and subtracting that value from each cost in the profile.
[0174] Cost Sets are then computed using the following algorithm:
-
- [0175] For each Group G:
- [0176] Calculate the normalized cost profile for G
- [0177] Look for a Cost Set with the same normalized cost profile.
- [0178] If such as set is found, add G to the existing Cost Set;
- [0179] otherwise, create a new Cost Set with the calculated normalized cost profile, containing only G.
- [0175] For each Group G:
[0180] The algorithm for finding Cost Sets employs a hash table to reduce the time necessary to determine whether the desired Cost Set already exists. The hash table uses a hash value computed from cost profile of G.
[0181] Each Cost Set is then numbered with a unique Cost Sent Index number. Cost Sets are then used in a straightforward manner to generate the Link Cost Table, which gives the cost from each Cost Set to each Repeater.
[0182] As described below, the Group Reduction Table maps every IP address to one of these Cost Sets.
[0183] Build IP Map
[0184] The IP Map is a sorted list of records which map IP address ranges to Link Cost Table keys. The format of the IP map is:
<base IP address> <max IP address> <Link Cost Table key>
where IP addresses are presently represented by 32-bit integers. The entries are sorted by descending base address, and by ascending maximum address among equal base addresses, and by ascending Link Cost Table key among equal base addresses and maximum addresses. Note that ranges may overlap.
<base IP address> <max IP address> <Link Cost Table key>
where IP addresses are presently represented by 32-bit integers. The entries are sorted by descending base address, and by ascending maximum address among equal base addresses, and by ascending Link Cost Table key among equal base addresses and maximum addresses. Note that ranges may overlap.
[0185] The NetMap procedure generates an intermediate IP map containing a map between IP address ranges and Cost Set numbers as follows:
-
- [0186] For each Cost Set S:
- [0187] For each Group G in S:
- [0188] For each IP address range in G:
- [0189] Add a triple low address, high address, Cost Set number of S) to the IP map.
- [0188] For each IP address range in G:
- [0187] For each Group G in S:
- [0186] For each Cost Set S:
[0190] The IP map file is then sorted by descending base address, and by ascending maximum address among equal base addresses, and by ascending Cost Set number among equal base addresses and maximum addresses. The sort order for the base address and maximum address minimizes the time to build the Group Reduction Table and produces the proper results for overlapping entries.
[0191] Finally, the NetMap procedure creates the Group Reduction Table by processing the sorted IP map. The Group Reduction Table maps IP addresses (specified by ranges) into Cost Set numbers. Special processing of the IP map file is required in order to detect overlapping address ranges, and to merge adjacent address ranges in order to minimize the size of the Group Reduction Table.
[0192] An ordered list of address range segments is maintained, each segment consisting of a base address B and a Cost Set number N, sorted by base address B. (The maximum address of a segment is the base address of the next segment minus one.)
[0193] The following algorithm is used:
-
- [0194] Initialize the list with the elements [−infinity, NOGROUP], [+infinity, NOGROUP].
- [0195] For each entry in the IP map, in sorted order, consisting of (b, m, s),
- [0196] Insert (b, m, s) in the list (recall that IP map entries are of the form (low address, high address Cost Set number of S))
- [0197] For each reserved LAN address range (b, m): Insert (b, m, LOCAL) in the list.
- [0198] For each Repeater at address a: Insert (a, a, REPEATER) in the list.
- [0199] For each segment S in the ordered list:
- [0200] Merge S with following segments with the same Cost Set
- [0201] Create a Group Reduction Table entry with base address from the base address of S,
- [0202] max address=next segment's base−1,
- [0203] group ID=Cost Set number of S.
- [0195] For each entry in the IP map, in sorted order, consisting of (b, m, s),
- [0194] Initialize the list with the elements [−infinity, NOGROUP], [+infinity, NOGROUP].
[0204] A reserved LAN address range is an address range reserved for use by LANs which should not appear as a global Internet address. LOCAL is a special Cost Set index different from all others, indicating that the range maps to a client which should never be reflected. REPEATER is a special Cost Set index different from all others, indicating that the address range maps to a repeater. NOGROUP is a special Cost Set index different from all others, indicating that this range of addresses has no known mapping.
-
- [0205] Given (B, M, N), insert an entry in the ordered address list as follows:
- [0206] Find the last segment (AB, AN) for which AB is less than or equal to B.
- [0207] If AB is less than B, insert a new segment (B, N) after (AB, AN).
- [0208] Find the last segment (YB, YN) for which YB is less than or equal to M.
- [0209] Replace by (XB, N) any segment XB, NOGROUP) for which XB is greater than B and less than YB.
- [0210] If YN is not N, and either YN is NOGROUP or YB is less than or equal to B,
- [0211] Let (ZB, ZN) be the segment following (YB, YN).
- [0212] If M+1 is less than ZB, insert a new segment (M+1, YN) before (ZB, ZN).
- [0213] Replace (YB, YN) by (YB, N).
[0214] Rewriting HTML Resources
[0215] As explained above with reference to FIG. 3 (B5), when a reflector or repeater serves a resource which itself includes resource identifiers (e.g., a HTML resource), that resource is modified (rewritten) to pre-reflect resource identifiers (URLs) of repeatable resources that appear in the resource. Rewriting ensures that when a browser requests repeatable resources identified by the requested resource, it gets them from a repeater without going back to the origin server, but when it requests nonrepeatable resources identified by the requested resource, it will go directly to the origin server. Without this optimization, the browser would either make all requests at the origin server (increasing traffic at the origin server and necessitating far more redirections from the origin server), or it would make all requests at the repeater (causing the repeater to redundantly request and copy resources which could not be cached, increasing the overhead of serving such resources).
[0216] Rewriting requires that a repeater has been selected (as described above with reference to the Best Repeater Selector). Rewriting uses a so-called BASE directive. The BASE directive lets the HTML identify a different base server. (The base address is normally the address of the HTML resources.)
[0217] Rewriting is performed as follows:
-
- [0218] F1. A BASE directive is added at the beginning of the HTML resource, or modified where necessary. Normally, a browser interprets relative URLs as being relative to the default base address, namely, the URL of the HTML resource (page) in which they are encountered. The BASE address added specifies the resource at the reflector which originally served the resource. This means that unprocessed relative URLs (such as those generated by Javascript™ programs) will be interpreted as relative to the reflector. Without this BASE address, browsers would combine relative addresses with repeater names to create URLs which were not in the form required by repeaters (as described above in step D1).
- [0219] F2. The rewriter identifies directives, such as embedded images and anchors, containing URLs. If the rewriter is running in a reflector, it must parse the HTML file to identify these directives. If it is running in a repeater, the rewriter may have access to pre-computed information that identifies the location of each URL (placed in the HTML file in step F4).
- [0220] F3. For each URL encountered in the resource to be re-written, the rewriter must determine whether the URL is repeatable (as in steps B1–B2). If the URL is not repeatable, it is not modified. On the other hand, if the URL is repeatable, it is modified to refer to the selected repeater.
- [0221] F4. After all URLs have been identified and modified, if the resource is being served to a repeater, a table is appended at the beginning of the resource that identifies the location and content of each URL encountered in the resource. (This step is an optimization which eliminates the need for parsing HTML resources at the repeater.)
- [0222] F5. Once all changes have been identified, a new length is computed for the resource (page). The length is inserted in the HTTP header prior to serving the resource.
[0223] An extension of HTML, known as XML, is currently being developed. The process of rewriting URLs will be similar for XML, with some differences in the mechanism that parses the resource and identifies embedded URLs.
[0224] Handling Non-HTTP Protocols
[0225] This invention makes it possible to reflect references to resources that are served by protocols other than HTTP, for instance, the File Transfer Protocol (FTP) and audio/video stream protocols. However, many protocols do not provide the ability to redirect requests. It is, however, possible to redirect references before requests are actually made by rewriting URLs embedded in HTML pages. The following modifications to the above algorithms are used to support this capability.
[0226] In F4, the rewriter rewrites URLs for servers if those servers appear in a configurable table of cooperating origin server or so-called co-servers. The reflector operator can define this table to include FTP servers and other servers. A rewritten URL that refers to a non-HTTP resource takes the form:
http://<repeater>/<origin server>@proxy=<scheme>[:<type>]@/resource
where <scheme> is a supported protocol name such as “ftp”. This URL format is an alternative to the form shown in B3.
http://<repeater>/<origin server>@proxy=<scheme>[:<type>]@/resource
where <scheme> is a supported protocol name such as “ftp”. This URL format is an alternative to the form shown in B3.
[0227] In C3, the repeater looks for a protocol embedded in the arriving request. If a protocol is present and the requested resource is not already cached, the repeater uses the selected protocol instead of the default HTTP protocol to request the resource when serving it and storing it in the cache.
[0228] System Configuration and Management
[0229] In addition to the processing described above, the repeater network requires various mechanisms for system configuration and network management. Some of these mechanisms are described here.
[0230] Reflectors allow their operators to synchronize repeater caches by performing publishing operations. The process of keeping repeater caches synchronized is described below. Publishing indicates that a resource or collection of resources has changed.
[0231] Repeaters and reflectors participate in various types of log processing. The results of logs collected at repeaters are collected and merged with logs collected at reflectors, as described below.
[0232] Adding Subscribers to the Repeater Network
[0233] When a new subscriber is added to the network, information about the subscriber is entered in a Subscriber Table at the master repeater and propagated to all repeaters in the network. This information includes the Committed Aggregate Information Rate (CAIR) for servers belonging to the subscriber, and a list of the repeaters that may be used by servers belonging to the subscriber.
[0234] Adding Reflectors to the Repeater Network
[0235] When a new reflector is added to the network, it simply connects to and announces itself to a contact repeater, preferably using a securely encrypted certificate including the repeater's subscriber identifier.
[0236] The contact repeater determines whether the reflector network address is permitted for this subscriber. If it is, the contact repeater accepts the connection and updates the reflector with all necessary tables (using version numbers to determine which tables are out of date).
[0237] The reflector processes requests during this time, but is not “enabled” (allowed to reflect requests) until all of its tables are current.
[0238] Keeping Repeater Caches Synchronized
[0239] Repeater caches are coherent, in the sense that when a change to a resource is identified by a reflector, all repeater caches are notified, and accept the change in a single transaction.
[0240] Only the identifier of the changed resource (and not the entire resource) is transmitted to the repeaters; the identifier is used to effectively invalidate the corresponding cached resource at the repeater. This process is far more efficient than broadcasting the content of the changed resource to each repeater.
[0241] A repeater will load the newly modified resource the next time it is requested.
[0242] A resource change is identified at the reflector either manually by the operator, or through a script when files are installed on the server, or automatically through a change detection mechanism (e.g., a separate process that checks regularly for changes).
[0243] A resource change causes the reflector to send an “invalidate” message to its contact repeater, which forwards the message to the master repeater. The invalidate message contains a list of resource identifiers (or regular expressions identifying patterns of resource identifiers) that have changed. (Regular expressions are used to invalidate a directory or an entire server.) The repeater network uses a two-phase commit process to ensure that all repeaters correctly invalidate a given resource.
[0244] The invalidation process operates as follows:
[0245] The master broadcasts a “phase 1” invalidation request to all repeaters indicating the resources and regular expressions describing sets of resources to be invalidated.
[0246] When each repeater receives the phase 1 message, it first places the resource identifiers or regular expressions into a list of resource identifiers pending invalidation.
[0247] Any resource requested (in C3) that is in the pending invalidation list may not be served from the cache. This prevents the cache from requesting the resource from a peer cache which may not have received an invalidation notice. Were it to request a resource in this manner, it might replace the newly invalidated resource by the same, now stale, data.
[0248] The repeater then compares the resource identifier of each resource in its cache against the resource identifiers and regular expressions in the list.
[0249] Each match is invalidated by marking it stale and optionally removing it from the cache. This means that a future request for the resource will cause it to retrieve a new copy of the resource from the reflector.
[0250] When the repeater has completed the invalidation, it returns an acknowledgment to the master. The master waits until all repeaters have acknowledged the invalidation request.
[0251] If a repeater fails to acknowledge within a given period, it is disconnected from the master repeater. When it reconnects, it will be told to flush its entire cache, which will eliminate any consistency problem. (To avoid flushing the entire cache, the master could keep a log of all invalidations performed, sorted by date, and flush only files invalidated since the last time the reconnecting repeater successfully completed an invalidation. In the presently preferred embodiments this is not done since it is believed that repeaters will seldom disconnect.)
[0252] When all repeaters have acknowledged invalidation (or timed out) the repeater broadcasts a “phase 2” invalidation request to all repeaters. This causes the repeaters to remove the corresponding resource identifiers and regular expressions from the list of resource identifiers pending invalidation.
[0253] In another embodiment, the invalidation request will be extended to allow a “server push”. In such requests, after phase 2 of the invalidation process has completed, the repeater receiving the invalidation request will immediately request a new copy of the invalidated resource to place in its cache.
[0254] Logs and Log Processing
[0255] Web server activity logs are fundamental to monitoring the activity in a Web site. This invention creates “merged logs” that combine the activity at reflectors with the activity at repeaters, so that a single activity log appears at the origin server showing all Web resource requests made on behalf of that site at any repeater.
[0256] This merged log can be processed by standard processing tools, as if it had been generated locally.
[0257] On a periodic basis, the master repeater (or its delegate) collects logs from each repeater. The logs collected are merged, sorted by reflector identifier and timestamp, and stored in a dated file on a per-reflector basis. The merged log for a given reflector represents the activity of all repeaters on behalf of that reflector. On a periodic basis, as configured by the reflector operator, a reflector contacts the master repeater to request its merged logs. It downloads these and merges them with its locally maintained logs, sorting by timestamp. The result is a merged log that represents all activity on behalf of repeaters and the given reflector.
[0258] Activity logs are optionally extended with information important to the repeater network, if the reflector is configured to do so by the reflector operator. In particular, an “extended status code” indicates information about each request, such as:
-
- [0259] 1. request was served by a reflector locally;
- [0260] 2. request was reflected to a repeater;*
- [0261] 3. request was served by a reflector to a repeater;*
- [0262] 4. request for non-repeatable resource was served by repeater;*
- [0263] 5. request was served by a repeater from the cache;
- [0264] 6. request was served by a repeater after filling cache;
- [0265] 7. request pending invalidation was served by a repeater.
(The activities marked with “*” represent intermediate states of a request and do not normally appear in a final activity log.)
[0266] In addition, activity logs contain a duration, and extended precision timestamps. The duration makes it possible to analyze the time required to serve a resource, the bandwidth used, the number of requests handled in parallel at a given time, and other quite useful information. The extended precision timestamp makes it possible to accurately merge activity logs.
[0267] Repeaters use the Network Time Protocol (NTP) to maintain synchronized clocks. Reflectors may either use NTP or calculate a time bias to provide roughly accurate timestamps relative to their contact repeater.
[0268] Enforcing Committed Aggregate Information Rate
[0269] The repeater network monitors and limits the aggregate rate at which data is served on behalf of a given subscriber by all repeaters. This mechanism provides the following benefits:
-
- [0270] 1. provides a means of pricing repeater service;
- [0271] 2. provides a means for estimating and reserving capacity at repeaters;
- [0272] 3. provides a means for preventing clients of a busy site from limiting access to other sites.
[0273] For each subscriber, a “threshold aggregate information rate” (TAIR) is configured and maintained at the master repeater. This threshold is not necessarily the committed rate, it may be a multiple of committed rate, based on a pricing policy.
[0274] Each repeater measures the information rate component of each reflector for which it serves resources, periodically (typically about once a minute), by recording the number of bytes transmitted on behalf of that reflector each time a request is delivered. The table thus created is sent to the master repeater once per period. The master repeater combines the tables from each repeater, summing the measured information of each reflector over all repeaters that serve resources for that reflector, to determine the “measured aggregate information rate” (MAIR) for each reflector.
[0275] If the MAIR for a given reflector is greater than the TAIR for that reflector, the MAIR is transmitted by the master to all repeaters and to the respective reflector.
[0276] When a reflector receives a request, it determines whether its most recently calculated MAIR is greater than its TAIR. If this is the case, the reflector probabilistically decides whether to suppress reflection, by serving the request locally (in B2). The probability of suppressing the reflection increases as an exponential function of the difference between the MAIR and the CAIR.
[0277] Serving a request locally during a peak period may strain the local origin server, but it prevents this subscriber from taking more than allocated bandwidth from the shared repeater network.
[0278] When a repeater receives a request for a given subscriber (in C2), it determines whether the subscriber is running near its threshold aggregate information rate. If this is the case, it probabilistically decides whether to reduce its load by redirecting the request back to the reflector. The probability increases exponentially as the reflector's aggregate information rate approaches its limit.
[0279] If a request is reflected back to a reflector, a special character string is attached to the resource identifier so that the receiving reflector will not attempt to reflect it again. In the current system, this string has the form
[0280] “src=overload”.
[0281] The reflector tests for this string in B2.
[0282] The mechanism for limiting Aggregate Information Rate described above is fairly coarse. It limits at the level of sessions with clients (since once a client has been reflected to a given repeater, the rewriting process tends to keep the client coming back to that repeater) and, at best, individual requests for resources. A more fine-grained mechanism for enforcing TAIR limits within repeaters operates by reducing the bandwidth consumption of a busy subscriber when other subscribers are competing for bandwidth.
[0283] The fine-grained mechanism is a form of data “rate shaping”. It extends the mechanism that copies resource data to a connection when a reply is being sent to a client When an output channel is established at the time a request is received, the repeater identifies which subscriber the channel is operating for, in C2, and records the subscriber in a data field associated with the channel. Each time a “write” operation is about to be made to the channel, the Metered Output Stream first inspects the current values of the MAIR and TAIR, calculated above, for the given subscriber. If the MAIR is larger than the TAIR, then the mechanism pauses briefly before performing the write operation. The length of the pause is proportional to the amount the MAIR exceeds the TAIR. The pause ensures that tasks sending other resources to other clients, perhaps on behalf of other subscribers, will have an opportunity to send their data.
[0284] Repeater Network Resilience
[0285] The repeater network is capable of recovering when a repeater or network connection fails.
[0286] A repeater cannot operate unless it is connected to the master repeater. The master repeater exchanges critical information with other repeaters, including information about repeater load, aggregate information rate, subscribers, and link cost.
[0287] If a master fails, a “succession” process ensures that another repeater will take over the role of master, and the network as a whole will remain operational. If a master fails, or a connection to a master fails through a network problem, any repeater attempting to communicate with the master will detect the failure, either through an indication from TCP/IP, or by timing out from a regular “heartbeat” message it sends to the master.
[0288] When any repeater is disconnected from its master, it immediately tries to reconnect to a series of potential masters based on a configurable file called its “succession list”.
[0289] The repeater tries each system on the list in succession until it successfully connects to a master. If in this process, it comes to its own name, it takes on the role of master, and accepts connections from other repeaters. If a repeater which is not at the top of the list becomes the master, it is called the “temporary master”.
[0290] A network partition may cause two groups of repeaters each to elect a master. When the partition is corrected, it is necessary that the more senior master take over the network. Therefore, when a repeater is temporary master, it regularly tries to reconnect to any master above it in the succession list. If it succeeds, it immediately disconnects from all of the repeaters connected to it. When they retry their succession lists, they will connect to the more senior master repeater.
[0291] To prevent losses of data, a temporary master does not accept configuration changes and does not process log files. In order to take on these tasks, it must be informed that it is primary master by manual modification of its successor list. Each repeater regularly reloads its successor list to determine whether it should change its idea of who the master is.
[0292] If a repeater is disconnected from the master, it must resynchronize its cache when it reconnects to the master. The master can maintain a list of recent cache invalidations and send to the repeater any invalidations it was not able to process while disconnected. If this list is not available for some reason (for instance, because the reflector has been disconnected too long), the reflector must invalidate its entire cache.
[0293] A reflector is not permitted to reflect requests unless it is connected to a repeater. The reflector relies on its contact repeater for critical information, such as load and Link Cost Tables, and current aggregate information rate. A reflector that is not connected to a repeater can continue to receive requests and handle them locally.
[0294] If a reflector loses its connection with a repeater, due to a repeater failure or network outage, it continues to operate while it tries to connect to a repeater.
[0295] Each time a reflector attempts to connect to a repeater, it uses DNS to identify a set of candidate repeaters given a domain name that represents the repeater network. The reflector tries each repeater in this set until it makes a successful contact Until a successful contact is made, the reflector serves all requests locally. When a reflector connects to a repeater, the repeater can tell it to attempt to contact a different repeater; this allows the repeater network to ensure that no individual repeater has too many contacts.
[0296] When contact is made, the reflector provides the version number of each of its tables to its contact repeater. The repeater then decides which tables should be updated and sends appropriate updates to the reflector. Once all tables have been updated, the repeater notifies the reflector that it may now start reflecting requests.
[0297] Using a Proxy Cache within a Repeater
[0298] Repeaters are intentionally designed so that any proxy cache can be used as a component within them. This is possible because the repeater receives HTTP requests and converts them to a form recognized by the proxy cache.
[0299] On the other hand, several modifications to a standard proxy cache have been or may be made as optimizations. This includes, in particular, the ability to conveniently invalidate a resource, the ability to support cache quotas, and the ability to avoid making an extra copy of each resource as it passes from the proxy cache through the repeater to the requester.
[0300] In a preferred embodiment, a proxy cache is used to implement C3. The proxy cache is dedicated for use only by one or more repeaters. Each repeater requiring a resource from the proxy cache constructs a proxy request from the inbound resource request. A normal HTTP GET request to a server contains only the pathname part of the URL—the scheme and server name are implicit. (In an HTTP GET request to a repeater, the pathname part of the URL includes the name of the origin server on behalf of which the request is being made, as described above.) However, a proxy agent GET request takes an entire URL. Therefore, the repeater must construct a proxy request containing the entire URL from the path portion of the URL it receives. Specifically, if the incoming request takes the form:
GET/<origin server>/<path>
then the repeater constructs a proxy request of the form:
GET http://<origin server>/<path>
and if the incoming request takes the form:
GET<origin server>@proxy=<scheme>:<type>@/<path>
then the repeater constructs a proxy request of the form:
GET<scheme>://<origin server>/<path>
GET/<origin server>/<path>
then the repeater constructs a proxy request of the form:
GET http://<origin server>/<path>
and if the incoming request takes the form:
GET<origin server>@proxy=<scheme>:<type>@/<path>
then the repeater constructs a proxy request of the form:
GET<scheme>://<origin server>/<path>
[0301] Cache Control
[0302] HTTP replies contain directives called cache control directives, which are used to indicate to a cache whether the attached resource may be cached and if so, when it should expire. A Web site administrator configures the Web site to attach appropriate directives. Often, the administrator will not know how long a page will be fresh, and must define a short expiration time to try to prevent caches from serving stale data. In many cases, a Web site operator will indicate a short expiration time only in order to receive the requests (or hits) that would otherwise be masked by the presence of a cache. This is known in the industry as “cache-busting”. Although some cache operators may consider cache-busting to be impolite, advertisers who rely on this information may consider it imperative.
[0303] When a resource is stored in a repeater, its cache directives can be ignored by the repeater, because the repeater receives explicit invalidation events to determine when a resource is stale. When a proxy cache is used as the cache at the repeater, the associated cache directives may be temporarily disabled. However, they must be re-enabled when the resource is served from the cache to a client, in order to permit the cache-control policy (including any cache-busting) to take effect.
[0304] The present invention contains mechanisms to prevent the proxy cache within a repeater from honoring cache control directives, while permitting the directives to be served from the repeater.
[0305] When a reflector serves a resource to a repeater in B4, it replaces all cache directives by modified directives that are ignored by the repeater proxy cache. It does this by prefixing a distinctive string such as “wr-” to the beginning of the HTTP tag. Thus, “expires” becomes “wr-expires”, and “cache-control” becomes “wr-cache-control”. This prevents the proxy cache itself from honoring the directives. When a repeater serves a resource in C4, and the requesting client is not another repeater, it searches for HTTP tags beginning with “wr-” and removes the “wr-”. This allows the clients retrieving the resource to honor the directives.
[0306] Resource Revalidation
[0307] There are several cases where a resource may be cached so long as the origin server is consulted each time it is served. In one case, the request for the resource is attached to a so-called “cookie”. The origin server must be presented with the cookie to record the request and determine whether the cached resource may be served or not. In another case, the request for the resource is attached to an authentication header (which identifies the requester with a user id and password). Each new request for the resource must be tested at the origin server to assure that the requester is authorized to access the resource.
[0308] The HTTP 1.1 specification defines a reply header titled “Must-Revalidate” which allows an origin server to instruct a proxy cache to “revalidate” a resource each time a request is received. Normally, this mechanism is used to determine whether a resource is still fresh. In the present invention, Must-Revalidate makes it possible to ask an origin server to validate a request that is otherwise served from a repeater.
[0309] The reflector rule base contains information that determines which resources may be repeated but must be revalidated each time they are served. For each such resource, in B4, the reflector attaches a Must-Revalidate header. Each time a request comes to a repeater for a cached resource marked with a Must-Revalidate header, the request is forwarded to the reflector for validation prior to serving the requested resource.
[0310] Cache Quotas
[0311] The cache component of a repeater is shared among those subscribers that reflect clients to that repeater. In order to allow subscribers fair access to storage facilities, the cache may be extended to support quotas.
[0312] Normally, a proxy cache may be configured with a disk space threshold T. Whenever more than T bytes are stored in the cache, the cache attempts to find resources to eliminate.
[0313] Typically a cache uses the least-recently-used (LRU) algorithm to determine which resources to eliminate; more sophisticated caches use other algorithms. A cache may also support several threshold values—for instance, a lower threshold which, when reached, causes a low priority background process to remove items from the cache, and a higher threshold which, when reached, prevents resources from being cached until sufficient free disk space has been reclaimed.
[0314] If two subscribers A and B share a cache, and more resources of subscriber A are accessed during a period of time than resources of subscriber B, then fewer of B's resources will be in the cache when new requests arrive. It is possible that, due to the behavior of A, B's resources will never be cached when they are requested. In the present invention, this behavior is undesirable. To address this issue, the invention extends the cache at a repeater to support cache quotas.
[0315] The cache records the amount of space used by each subscriber in DS, and supports a configurable threshold TS for each subscriber.
[0316] Whenever a resource is added to the cache (C3), the value DS is updated for the subscriber providing the resource. If DS is larger than TS, the cache attempts to find resources to eliminate, from among those resources associated with subscriber S. The cache is effectively partitioned into separate areas for each subscriber.
[0317] The original threshold T is still supported. If the sum of reserved segments for each subscriber is smaller than the total space reserved in the cache, the remaining area is “common” and subject to competition among subscribers.
[0318] Note, this mechanism might be implemented by modifying the existing proxy cache discussed above, or it might also be implemented without modifying the proxy cache—if the proxy cache at least makes it possible for an external program to obtain a list of resources in the cache, and to remove a given resource from the cache.
[0319] Rewriting from Repeaters
[0320] When a repeater receives a request for a resource, its proxy cache may be configured to determine whether a peer cache contains the requested resource. If so, the proxy cache obtains the resource from the peer cache, which can be faster than obtaining it from the origin server (the reflector). However, a consequence of this is that rewritten HTML resources retrieved from the peer cache would identify the wrong repeater. Thus, to allow for cooperating proxy caches, resources are preferably rewritten at the repeater.
[0321] When a resource is rewritten for a repeater, a special tag is placed at the beginning of the resource. When constructing a reply, the repeater inspects the tag to determine whether the resource indicates that additional rewriting is necessary. If so, the repeater modifies the resource by replacing references to the old repeater with references to the new repeater.
[0322] It is only necessary to perform this rewriting when a resource is served to the proxy cache at another repeater.
[0323] Repeater-Side Include
[0324] Sometimes, an origin server constructs a custom resource for each request (for instance, when inserting an advertisement based on the history of the requesting client). In such a case, that resource must be served locally rather than repeated. Generally, a custom resource contains, along with the custom information, text and references to other, repeatable, resources.
[0325] The process that assembles a “page” from a text resource and possibly one or more image resources is performed by the Web browser, directed by HTML. However, it is not possible using HTML to cause a browser to assemble a page using text or directives from a separate resource. Therefore, custom resources often necessarily contain large amounts of static text that would otherwise be repeatable.
[0326] To resolve this potential inefficiency, repeaters recognize a special directive called a “repeater side include”. This directive makes it possible for the repeater to assemble a custom resource, using a combination of repeatable and local resources. In this way, the static text can be made repeatable, and only the special directive need be served locally by the reflector.
[0327] For example, a resource X might consist of custom directives selecting an advertising banner, followed by a large text article. To make this resource repeatable, the Web site administrator must break out a second resource, Y, to select the banner. Resource X is modified to contain a repeater-side include directive identifying resource Y, along with the article. Resource Y is created and contains only the custom directives selecting an ad banner. Now resource X is repeatable, and only resource Y, which is relatively small, is not repeatable.
[0328] When a repeater constructs a reply, it determines whether the resource being served is an HTML resource, and if so, scans it for repeater-side include directives. Each such directive includes a URL, which the repeater resolves and substitutes in place of the directive. The entire resource must be assembled before it is served, in order to determine its final size, as the size is included in a reply header ahead of the resource.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
The invention claimed is:
1. A system comprising:
a repeater server network comprising a plurality of repeater servers, the repeater server network supporting a plurality of subscribers being entities that publish resources to the repeater server network via one or more origin servers, and
wherein at least some of the repeater servers replicate information available on at least some of the one or more origin servers, and
wherein a request for a resource may be handled by the repeater server network in order for the resource to be served, and
wherein the request for the resource is rejected if the requested resource is not from a subscriber to the repeater server network.
2. A system as in claim 1, wherein the resource is a Hypertext Transfer Protocol (HTTP) document.
3. A system as in claim 1, wherein at least one repeater server in the repeater server network is addressed by more than one name, and wherein the repeater server network determines whether a request is for a resource from the subscriber based at least in part on a name by which at least one repeater server handling the request was addressed.
4. A system as in claim 1, wherein the repeater server network determines whether the request is for the resource from the subscriber based at least in part on an origin server name in the Uniform Resource Locator (URL) used to make the request.
5. A system as in claim 3, wherein the at least one repeater server uses information in an Hypertext Transfer Protocol (HTTP) header to determine the name by which it was addressed.
6. A system as in claim 1, wherein the subscriber is an entity that publishes resources via at least one of the one or more origin servers.
7. In a computer network which includes (a) a plurality of origin servers, and (b) a plurality of repeater servers forming at least one repeater server network, and in which at least some of the repeater servers replicate information available on at least some of the plurality of origin servers, and in which a request for information may be handled by the repeater server network in order for the requested information to be served, a method comprising:
assigning a repeater server more than one name;
upon receiving the request, determining a name by which the repeater server was addressed; and
based at least in part on said determination, attempting to serve the information if the name by which the repeater server was addressed corresponds to a known subscriber, otherwise rejecting the request.
8. A method as in claim 7, further comprising using information in an Hypertext Transfer Protocol (HTTP) header to determine the name by which the repeater server was addressed.
9. In a computer network which includes (a) a plurality of origin servers, and (b) a plurality of repeater servers making up at least one repeater server network, and in which at least one of the repeater servers replicates information available on at least some of the plurality of origin servers, and in which requests for content may be handled by the repeater server network in order for that content to be served, a method comprising:
assigning a repeater server more than one name;
upon receipt of a request from a client for content, using at least the name by which the repeater server was addressed in order to ascertain whether the request is for content from a subscriber to the repeater server network; and
causing the request to be rejected when the request is for content that is not from a subscriber to the repeater server network.
10. A system comprising:
(a) a plurality of origin servers, and
(b) a plurality of repeater servers forming a repeater server network, and in which at least one of the repeater servers replicate information available on at least one of the plurality of origin servers, and in which client requests for content may be handled by the repeater server network in order for that content to be served, wherein the at least one repeater server is adapted and programmed to:
(i) obtain a client request for information;
(ii) determine if the client request is for information from a subscriber to the repeater server network;
(iii) attempt to serve the information to the client when it is determined that the request is for information from the subscriber; and
(iv) causing the request to be rejected when it is determined that the request is for information not from any subscriber to the repeater server network.
11. A system as in claim 10 wherein the at least one repeater server is further adapted and programmed to:
determine whether the information is stored locally, and,
based at least in part on said determining, if the information is stored locally, retrieve the information; and
when the information is determined not to be stored locally, attempt to obtain the information either from an origin server of the plurality of origin servers or from another repeater server.
12. A system as in claim 11 wherein the at least one repeater server is assigned multiple names and wherein the at least one repeater server is further adapted and programmed to:
determine which origin server to use based at least in part upon a name by which the at least one repeater server was addressed.
13. A system as in claim 11 wherein the at least one repeater server is further adapted and programmed to:
determine which origin server to use based at least in part on an origin server name in the Uniform Resource Locator (URL) used to make the request.
14. A system as in claim 1, wherein at least one repeater server in the repeater server network is addressed by more than one address, and wherein the repeater server network determines whether a request is for a resource from the subscriber based at least in part on an address by which at least one repeater server handling the request was addressed.
15. A system as in claim 14 wherein the addresses by which the at least one repeater server is addressed are IP (Internet Protocol) addresses.
16. A method as in claim 7 wherein a name is selected from the group consisting of: host names and IP (Internet Protocol) addresses.
17. A system as in claim 11 wherein the other repeater server is a peer cache.
18. In a computer network which includes (a) a plurality of origin servers, and (b) a plurality of repeater servers making up at least one repeater server network, and in which at least one of the repeater servers replicates information available on at least some of the plurality of origin servers, and in which a request for a resource may be handled by the repeater server network in order for the resource to be provided, a method comprising:
assigning a repeater server more than one name or address;
upon receipt of a request from a client for a resource, using at least the name or address by which the repeater server was addressed in order to ascertain whether the request is for a resource from a subscriber to the repeater server network; and
rejecting the client request when it is not for a resource from a subscriber to the repeater server network.
Patent Citations (152)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4495570(A) | 1985-01-01 | Kitajima et al. | Applicant |
| US4594704(A) | 1986-06-01 | Ollivier | Applicant |
| US4726017(A) | 1988-02-01 | Krum et al. | Applicant |
| US4839798(A) | 1989-06-01 | Eguchi et al. | Applicant |
| US4920432(A) | 1990-04-01 | Eggers | Applicant |
| US4922417(A) | 1990-05-01 | Churm et al. | Applicant |
| US4949187(A) | 1990-08-01 | Cohen | Applicant |
| US4949248(A) | 1990-08-01 | Caro | Applicant |
| US5172413(A) | 1992-12-01 | Bradley | Applicant |
| US5253341(A) | 1993-10-01 | Rozmanith | Applicant |
| US5287499(A) | 1994-02-01 | Nemes | Applicant |
| US5287537(A) | 1994-02-01 | Newmark et al. | Applicant |
| US5291554(A) | 1994-03-01 | Morales | Applicant |
| US5341477(A) | 1994-08-01 | Pitkin et al. | Applicant |
| US5371532(A) | 1994-12-01 | Gelman | Applicant |
| US5410343(A) | 1995-04-01 | Coddington | Applicant |
| US5414455(A) | 1995-05-01 | Hooper | Applicant |
| US5442389(A) | 1995-08-01 | Blahut | Applicant |
| US5442390(A) | 1995-08-01 | Hooper | Applicant |
| US5442749(A) | 1995-08-01 | Northcutt | Applicant |
| US5471622(A) | 1995-11-01 | Eadline | Applicant |
| US5475615(A) | 1995-12-01 | Lin | Applicant |
| US5508732(A) | 1996-04-01 | Bottomley | Applicant |
| US5515511(A) | 1996-05-01 | Nguyen | Applicant |
| US5519435(A) | 1996-05-01 | Anderson | Applicant |
| US5528281(A) | 1996-06-01 | Grady | Applicant |
| US5539621(A) | 1996-07-01 | Kikinis | Applicant |
| US5542087(A) | 1996-07-01 | Neimat et al. | Applicant |
| US5544313(A) | 1996-08-01 | Shachnai | Applicant |
| US5544327(A) | 1996-08-01 | Dan | Applicant |
| US5550577(A) | 1996-08-01 | Verbiest | Applicant |
| US5550863(A) | 1996-08-01 | Yurt | Applicant |
| US5550982(A) | 1996-08-01 | Long | Applicant |
| US5557317(A) | 1996-09-01 | Nishio | Applicant |
| US5572643(A) | 1996-11-01 | Judson | Applicant |
| US5590288(A) | 1996-12-01 | Castor | Applicant |
| US5592611(A) | 1997-01-01 | Midgely | Applicant |
| US5594910(A) | 1997-01-01 | Filepp et al. | Applicant |
| US5603026(A) | 1997-02-01 | Demers et al. | Applicant |
| US5619648(A) | 1997-04-01 | Canale | Applicant |
| US5623656(A) | 1997-04-01 | Lyons | Applicant |
| US5625781(A) | 1997-04-01 | Cline | Applicant |
| US5627829(A) | 1997-05-01 | Gleeson et al. | Applicant |
| US5630067(A) | 1997-05-01 | Kindell | Applicant |
| US5633999(A) | 1997-05-01 | Clowes | Applicant |
| US5634006(A) | 1997-05-01 | Baugher et al. | Applicant |
| US5638443(A) | 1997-06-01 | Stefik et al. | Applicant |
| US5644714(A) | 1997-07-01 | Kikinis | Applicant |
| US5646676(A) | 1997-07-01 | Dewkett et al. | Applicant |
| US5649186(A) | 1997-07-01 | Ferguson | Applicant |
| US5659729(A) | 1997-08-01 | Nielsen | Applicant |
| US5666362(A) | 1997-09-01 | Chen | Applicant |
| US5671279(A) | 1997-09-01 | Elgamai | Applicant |
| US5682512(A) | 1997-10-01 | Tetrick | Applicant |
| US5699513(A) | 1997-12-01 | Feigen et al. | Applicant |
| US5712979(A) | 1998-01-01 | Graber et al. | Applicant |
| US5715453(A) | 1998-02-01 | Stewart | Applicant |
| US5721914(A) | 1998-02-01 | DeVries | Applicant |
| US5734831(A) | 1998-03-01 | Sanders | Applicant |
| US5740423(A) | 1998-04-01 | Logan et al. | Applicant |
| US5742762(A) | 1998-04-01 | Scholl | Applicant |
| US5751961(A) | 1998-05-01 | Smyk | Applicant |
| US5761507(A) | 1998-06-01 | Govett | Applicant |
| US5761663(A) | 1998-06-01 | Lagarde | Applicant |
| US5774660(A) | 1998-06-01 | Brendel et al. | Applicant |
| US5774668(A) | 1998-06-01 | Choquier et al. | Applicant |
| US5777989(A) | 1998-07-01 | McGarvey | Applicant |
| US5784058(A) | 1998-07-01 | LaStrange et al. | Applicant |
| US5796952(A) | 1998-08-01 | Davis | Applicant |
| US5799141(A) | 1998-08-01 | Galipeau et al. | Applicant |
| US5802291(A) | 1998-09-01 | Balick et al. | Applicant |
| US5812769(A) | 1998-09-01 | Graber et al. | Applicant |
| US5826031(A) | 1998-10-01 | Nielsen | Examiner |
| US5828847(A) | 1998-10-01 | Gehr | Applicant |
| US5832506(A) | 1998-11-01 | Kuzma | Applicant |
| US5835718(A) | 1998-11-01 | Blewett | Applicant |
| US5838906(A) | 1998-11-01 | Doyle et al. | Examiner |
| US5856974(A) | 1999-01-01 | Gervais et al. | Applicant |
| US5862339(A) | 1999-01-01 | Bonnaure et al. | Applicant |
| US5867706(A) | 1999-02-01 | Martin et al. | Examiner |
| US5867799(A) | 1999-02-01 | Lang et al. | Applicant |
| US5870546(A) | 1999-02-01 | Kirsch | Applicant |
| US5870559(A) | 1999-02-01 | Leshem et al. | Applicant |
| US5878212(A) | 1999-03-01 | Civanlar et al. | Applicant |
| US5884038(A) | 1999-03-01 | Kapoor | Applicant |
| US5890171(A) | 1999-03-01 | Blumer et al. | Applicant |
| US5896533(A) | 1999-04-01 | Ramos et al. | Applicant |
| US5903723(A) | 1999-05-01 | Beck et al. | Applicant |
| US5907704(A) | 1999-05-01 | Gudmundson et al. | Applicant |
| US5913028(A) | 1999-06-01 | Wang et al. | Applicant |
| US5913033(A) | 1999-06-01 | Grout | Applicant |
| US5918010(A) | 1999-06-01 | Appleman et al. | Applicant |
| US5919247(A) | 1999-07-01 | Van Hoff et al. | Applicant |
| US5920701(A) | 1999-07-01 | Miller et al. | Examiner |
| US5933832(A) | 1999-08-01 | Suzuoka et al. | Applicant |
| US5945989(A) | 1999-08-01 | Freishtat et al. | Applicant |
| US5956716(A) | 1999-09-01 | Kenner et al. | Applicant |
| US5958008(A) | 1999-09-01 | Pogrebisky et al. | Applicant |
| US5961596(A) | 1999-10-01 | Takubo et al. | Applicant |
| US5968121(A) | 1999-10-01 | Logan et al. | Applicant |
| US5983214(A) | 1999-11-01 | Lang et al. | Applicant |
| US5983227(A) | 1999-11-01 | Nazem | Applicant |
| US5991809(A) | 1999-11-01 | Kriegsman | Applicant |
| US6006264(A) | 1999-12-01 | Colby et al. | Applicant |
| US6012090(A) | 2000-01-01 | Chung et al. | Applicant |
| US6029175(A) | 2000-02-01 | Chow et al. | Applicant |
| US6035332(A) | 2000-03-01 | Ingrassia, Jr. et al. | Applicant |
| US6038610(A) | 2000-03-01 | Belfiore et al. | Applicant |
| US6041307(A) | 2000-03-01 | Ahuja et al. | Examiner |
| US6041324(A) | 2000-03-01 | Earl et al. | Applicant |
| US6052718(A) | 2000-04-01 | Gifford | Applicant |
| US6052730(A) | 2000-04-01 | Felciano et al. | Applicant |
| US6065051(A) | 2000-05-01 | Steele et al. | Applicant |
| US6065062(A) | 2000-05-01 | Periasamy et al. | Applicant |
| US6070191(A) | 2000-05-01 | Narendran et al. | Applicant |
| US6081829(A) | 2000-06-01 | Sidana | Applicant |
| US6092112(A) | 2000-07-01 | Fukushige | Applicant |
| US6108673(A) | 2000-08-01 | Brandt et al. | Applicant |
| US6108703(A) | 2000-08-01 | Leighton et al. | Applicant |
| US6112231(A) | 2000-08-01 | DeSimone et al. | Applicant |
| US6112240(A) | 2000-08-01 | Pogue et al. | Applicant |
| US6128601(A) | 2000-10-01 | Van Horne et al. | Applicant |
| US6128660(A) | 2000-10-01 | Grimm et al. | Applicant |
| US6144375(A) | 2000-11-01 | Jain et al. | Applicant |
| US6163779(A) | 2000-12-01 | Mantha et al. | Examiner |
| US6173311(B1) | 2001-01-01 | Hassett et al. | Examiner |
| US6178160(B1) | 2001-01-01 | Bolton et al. | Applicant |
| US6185598(B1) | 2001-02-01 | Farber et al. | Examiner |
| US6185619(B1) | 2001-02-01 | Joffe et al. | Applicant |
| US6189030(B1) | 2001-02-01 | Kirsch et al. | Applicant |
| US6226642(B1) | 2001-05-01 | Beranek et al. | Examiner |
| US6282569(B1) | 2001-08-01 | Wallis et al. | Applicant |
| US6484204(B1) | 2002-11-01 | Rabinovich | Examiner |
| US6502215(B1) | 2002-12-01 | Raad et al. | Applicant |
| US6654807(B1) | 2003-11-01 | Farber et al. | Examiner |
| CA2202572 | 1998-10-01 | Applicant | |
| EP801487 | 1997-04-01 | Applicant | |
| EP801487(A) | 1997-10-01 | Applicant | |
| EP824236(A2) | 1998-02-01 | Applicant | |
| EP865180(A2) | 1998-09-01 | Applicant | |
| GB2281793 | 1995-03-01 | Applicant | |
| GB2281793(A) | 1995-03-01 | Applicant | |
| GB2281793(A) | 1995-03-01 | Applicant | |
| JP5162529 | 1993-06-01 | Applicant | |
| JP8328583 | 1996-09-01 | Applicant | |
| WO96/42041 | 1996-12-01 | Applicant | |
| WO96/42041 | 1996-12-01 | Applicant | |
| WO97/11429 | 1997-03-01 | Applicant | |
| WO97/11429 | 1997-03-01 | Applicant | |
| WO97/29423 | 1997-08-01 | Applicant | |
| WO9729423(A) | 1997-08-01 | Applicant | |
| WO9804985 | 1998-02-01 | Applicant |
Non-Patent Literature (59)
- Pultar, Giray; “USENIX, Automatically Selecting a Close Mirror Based on Network Topology,” Proceedings of the Twelfth Systems Administraion Conference; Boston, Massachusetts, Dec. 1998, p. 159-166.Examiner
- Vixie, Paul; “Name Server Operations Guide for BIND,” Internet Software Consortium; La Honda, CA; p. SMM:10-2—SMM:10-30.Examiner
- Schuba, Christoph; “Addressing Weaknesses in the Domain Name System Protocol,” COAST Laboratory, Dept. of Computer Sciences, Purdue University; West Layfayette, IN; Aug. 1993, p. 1-87.Examiner
- Bestavros, Azer, “Speculative Data Dissermination and Service to Reduce Server Load, Network Traffic and Service Time in Distributed Information Systems.” In Proceedings of ICDE '96: The 1996 International Conference on Data Engineering, Mar. 1996, 4 pgs.Applicant
- Carter, J. Lawrence, et al. “Universal Classes of Hash Functions.” Journal of Computer and System Sciences, vol. 18, No. 2, Apr. 1979, pp. 143-154.Applicant
- Chankhunthood, Anawat, et al. “A Hierarchical Internet Object Cache.” In USENIX Proceedings, Jan. 1996, pp. 153-163.Applicant
- Cormen, Thomas H., et al. Introduction to Algorithms, The MIT Press, Cambridge, Massachusetts, 1994, pp. 219-243, 991-993.Applicant
- Deering, Stephen, et al. “Multicast Routing in Datagram Internetworks and Extended LANs.” ACM Transactions on Computer Systems, vol. 8, No. 2, May 1990, pp. 85-110.Applicant
- Devine, Robert. “Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm.” In Proceedings of 4th International Conference on Foundations of Data Organizations and Algorithms, 1993, pp. 101-114.Applicant
- Grigni, Michelangelo, et al. “Tight Bounds on Minimum Broadcasts Networks.” SIAM Journal of Discrete Mathematics, vol. 4, No. 2, May 1991, pp. 207-222.Applicant
- Gwertzman, James, et al. “The Case for Geographical Push-Caching.” Technical Report HU TR 34-94 (excerpt), Harvard University, DAS, Cambridge, MA 02138, 1994, 2 pgs.Applicant
- Gwertzman, James, et al. “World-Wide Web Cache Consistency.” In Proceedings of the 1996 USENIX Technical Conference, Jan. 1996, 8 pgs.Applicant
- Feeley, Michael, et al. “Implementing Global Memory Management in a Workstation Cluster.” In Proceedings of the 15th ACM Symposium on Operating Systems Principles, 1995, pp. 201-212.Applicant
- Floyd, Sally, et al. “A reliable Multicast Framework for Light-Weight Sessions and Application Level Framing.” In Proceeding of ACM SIGCOMM '95, pp. 342-356.Applicant
- Fredman, Michael, et al. “Storing a Sparse Table with 0(1) Worst Case Access Time.” Journal of the Association for Computing Machinery, vol. 31, No. 3, Jul. 1984, pp. 538-544.Applicant
- Karger, David, et al. “Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web.” In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, May 1997, pp. 654-663.Applicant
- Litwin, Wlthold, et al. “LH-A Scaleable, Distributed Data Structure.” ACM Transactions on Database Systems, vol. 21, No. 4, Dec. 1996, pp. 480-525.Applicant
- Malpani, Radhika, et al. “Making World Wide Web Caching Servers Cooperate.” In Proceedings of World Wide Web Conference, 1996, 6 pgs.Applicant
- Naor, Moni, et al. “The Load, Capacity and Availability of Quorum Systems.” In Proceedings of the 35th IEEE Sympoium on Foundations of Computer Science, Nov. 1994, pp. 214-225.Applicant
- Nisan, Noam. “Psuedorandom Generators for Space-Bounded Computation.” In Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, May 1990, pp. 204-212.Applicant
- Palmer, Mark, et al. “Fido: A Cache that Learns to Fetch.” In Proceedings of the 17th International Conference on Very Large Data Bases, Sep. 1991, pp. 255-264.Applicant
- Panigrahy, Rina. Relieving Hot Spots on the World Wide Web. Massachusetts Institute of Technology, Jun. 1997, pp. 1-66.Applicant
- Peleg, David, et al. “The Availability of Quorum Systems.” Information and Computation 123, 1995, 210-223.Applicant
- Plaxton, C. Greg, et al. “Fast Fault-Tolerant Concurrent Access to Shared Objects.” In Proceedings of 37th IEEE Symposium of Foundations of Computer Science, 1996, pp. 570-579.Applicant
- Rabin, Michael. “Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance.” Journal of the ACM, vol. 36, No. 2, Apr. 1989, pp. 335-348.Applicant
- Ravi, R., “Rapid Rumor Ramification: Approximating the Minimum Broadcast Time.” In Proceedings of the 35th IEEE Symposium on Foundation of Computer Science, Nov. 1994, pp. 202-213.Applicant
- Schmidt, Jeanette, et al. “Chernoff-Hoeffding Bounds for Applications with Limited Independence.” In Proceedings of the 4th ACS-SIAM Symposium on Discrete Algorithms, 1993, pp. 331-340.Applicant
- Tarjan, Robert Endre, et al. “Storing a Sparse Table.” Communications of the ACM, vol. 22, No. 11, Nov. 1979, pp. 606-611.Applicant
- Vitter, Jeffrey Scott, et al. “Optimal Prefetching via Data Compression.” In Proceedings of 32nd IEEE Symposium on Foundations of Computer Science, Nov. 1991, pp. 121-130.Applicant
- Wegman, Mark, et al. “New Hash Functions and Their Use in Authentication and Set Equality.” Journal of Computer and System Sciences vol. 22, Jun. 1981, pp. 265-279.Applicant
- Yao, Andrew Chi-Chih. “Should Tables be Sorted?” Journal of the Association for Computing Machinery, vol. 28, No. 3, Jul. 1981, pp. 615-628.Applicant
- Patent Abstracts of Japan, Method and Device for Repeating and Converting Information, Sep. 1996, JP 08328583.Applicant
- Cisco Distributed Director, Cisco Systems Inc., pp. 1-15, http://www.cisco.com/warp/public/751/distdir/dd—wp.htm, 1997.Applicant
- “Cisco Local Director Product Overview.” Cisco Systems Inc., 1997, pp. 1-4, http://www.cisco.com/warp/public/751/lodir/lodir—ds.htm.Applicant
- “Local Director.” Cisco Systems Inc., pp. 1-3.Applicant
- “Excite Chooses Cisco LocalDirector to Support its Growing Service.” Cisco Systems Inc., 1997, pp. 1-2, http://www.cisco.com/warp/public/146/1857.html.Applicant
- “Cisco Systems Ships Cisco LocalDirector to Meet Demands of High-Volume Web Traffic.” Cisco Systems Inc., 1996, pp. 1-2, http://www.cisco.com/warp/public/146/323.html.Applicant
- “Scaling the Internet News Service.” Cisco Systems Inc., 1997, pp. 1-11, http://www.cisco.com/warp/public/751/lodir/news—wp.htm.Applicant
- “Scaling the World Wide Web.” Sisco Systems Inc., 1996, pp. 1-7, http://www.cisco.com/wapr/public/751/lodir/swww—wp.html.Applicant
- “How to Cost-Effectively Scale Web Servers.” Cisco Systems Inc., 1996, pp. 1-5, http://www.cisco.com/warp/public/784/5.html.Applicant
- “Cisco Cache Engine.” Cisco Systems Inc., 1 pg, http://www.cisco.com/warp/public/751/cache/index.shtml.Applicant
- “Cisco Introduces Web Cache Product for Scaling the Internet.” Cisco Systems Inc., 1997, 1 pg, http://www.cisco.com/warp.public/146/1947.html.Applicant
- “Cache Director System.” Cisco Systems Inc., 1997, pp. 1-5, http://www.cisco.com/warp/public/751/cache/cds—ov.htm.Applicant
- “Local Director.” 2 pgs, http://www.cisco.com/warp/public/751/lodir/index.html.Applicant
- “Cisco Takes Global Route.” PC Week News, Feb. 17, 1997, p. 23.Applicant
- “Global IP/IPX Service Should Keep Network Delays Down.” INFOWORLD, Jan. 20, 1997, 1 pg.Applicant
- Patent Abstracts of Japan, “Electronic Mail Multiplexing System and Communication Control Method in The System.” Jun. 30, 1993, JP 05162529.Applicant
- “Cache Director Systems Technology Overview.” Cisco System Inc., 1997, pp. 1-3, http://www.cisco.com/warp/public/751/cache/cds—ds.htm.Applicant
- “Local Area Network Server Replacement Procedure”, IBM Technical Disclosure Bulletin, vol. 38, No. 01, Jan. 1995, pp. 235-236.Applicant
- Gwertzman, James, et al. “The Case for Geographical Push-Caching”, May 4, 1995, pp. 51-55.Applicant
- De Bra, P.M.E., et al. “Information retrieval in the World-Wide Web: Making client-based searching feasible”, Computer Networks and ISDN Systems 27, (1994), pp. 183-192.Applicant
- Andresen et al., “SWEB: Towards a Scalable World Wide Web Server on Multicomputers”, Proceedings of IPPS, Apr. 15, 1996, pp. 850-856.Applicant
- Mourad et al., “Scalable Web Server Architectures”, Proceedings IEEE Symposium on Computers and Communications, Jul. 1, 1997, pp. 12-16.Applicant
- Adler, “Distributed Coordination Models for Client/Server Computing”, Computer, vol. 28, No. 4, Apr. 1, 1995, pp. 14-22.Applicant
- International Search Report dated Jun. 8, 1999 for PCT/US99/01477.Applicant
- “Local Area Network Server Replacement Procedure,” IBM Technical Disclosure Bulletin, vol. 38, No. 01, Jan. 1995, p. 235-36, ISSN: 0018-8696.Applicant
- Gwertzmen, J. S., et al., The Case for Geographical push-caching, Workshop on Hot Topics in Operating Systems, May 4, 1995, pp. 51-55.Applicant
- De Bra, P. M. E. et al, “Information Retrieval in the World-Wide Web: Making client-based searching feasible,” Computer Networks and ISDN Systems, NL, North Holland Publishing, Amsterdam, vol. 27, No. 2, Nov. 1, 1994, pp. 183-192, ISSN: 0169-7552.Applicant
- Communication (1 page) and European Search Report for Appln. No. EP 00 12 8346 (3 pages) mailed Aug. 24, 2001.Applicant