A distributed caching hierarchy that includes multiple edge routing servers, at least some of which receiving content requests from client computing systems via a load balancer. When receiving a content request, an edge routing server identifies which of the edge caching servers the requested content would be in if the requested content were to be cached within the edge caching servers, and distributes the content request to the identified edge caching server in a deterministic and predictable manner to increase the likelihood of increasing a cache-hit ratio.
This application is a continuation of U.S. patent application Ser. No. 14/096,697 filed on Dec. 4, 2013, entitled "PROXY-BASED CACHE CONTENT DISTRIBUTION AND AFFINITY," which is a continuation of U.S. patent application Ser. No. 13/022,527 filed on Feb. 7, 2011, entitled "PROXY-BASED CACHE CONTENT DISTRIBUTION AND AFFINITY," which issued as U.S. Pat. No. 8,612,550 on Dec. 17, 2013, and which application is expressly incorporated herein by reference in its entirety.
Content distribution networks are used to deliver all types of content from origin servers to client computing systems. To efficiently deliver such content, distributed cache hierarchies intervene between origin servers and client computing systems. When a client issues a request for content, if the content is available in the hierarchy, the content may often be provided by the hierarchy rather than having to obtain the content all the way from the origin server, provided that the content is found in the hierarchy.
In many cases, the cache hierarchy is partitioned in such a way that content items are cached mutually exclusively with one another, while providing a way to route the requests accordingly and expectedly to find the cached content. Therefore, when a request is routed to a cache server, the cache content is expected to be cached by that cache server and it would likely result in a cache hit, meaning the requested content is cached by that cache server and thus the cache server may satisfy the content request directly. One way to do this is to perform such cache distribution and predictive routing at the edge caching tier (in a cache hierarchy, this would be the first tier of cache servers geographically closest to the client).
A conventional way for a client to determine a location of cached content in an edge caching tier is for the client to first provide the Uniform Resource Locator (URL) of the desired content to an intelligent Domain Name Server (DNS) server. The intelligent DNS server knows the geographic proximity of the cached content, and provides an Internet Protocol (IP) address of a cache server that would perform well for the client. The client then requests the content using the IP address provided by the intelligent DNS server.
At least one embodiment described herein relates to a distributed caching hierarchy that includes multiple edge routing servers, at least some of which receive content requests from client computing systems via a load balancer. When receiving a content request, an edge routing server identifies which of the edge caching servers is responsible for caching the requested content in a predictable manner. Once the appropriate caching server has been identified, the edge routing server routes the content request to the appropriate caching server to maximize the likelihood of a cache hit. The edge routing server and the edge caching server can be in one physical server in a cache hierarchy, although that is not required.
In accordance with at least one embodiment described herein, when the edge caching server receives the content request, the edge caching server determines whether the edge caching server has the content cached. If so, the edge caching server initiates return of the requested content to the client. If not, the edge caching server identifies which of the next tier caching servers is responsible for the requested content in a predictable manner and routes the now cache-missed content request to the appropriate next tier caching server. This continues potentially all the way up the distributed caching hierarchy until, if necessary, the origin server is reached. When the next tier caching server receives the requested content, it caches the requested content, and then initiates return of the requested content to the client.
FIG. 4 illustrates a flowchart of a method for managing a distributed cache hierarchy in a network from the viewpoint of a tier of edge caching servers.
In accordance with embodiments described herein, a distributed caching hierarchy includes multiple edge routing servers, at least some of which receiving content requests from client computing systems via a load balancer. When receiving a content request, an edge routing server identifies which of the edge caching servers is responsible for the requested content in a predictable manner and routes the now cache-missed content request to the identified next tier caching server. First, some introductory discussion regarding computing systems will be described with respect to FIG. 1. Then, the embodiments of the distributed caching network and its example operation will be described with respect to subsequent figures.
First, introductory discussion regarding computing systems is described with respect to FIG. 1. Computing systems are now increasingly taking a wide variety of forms. Computing systems may, for example, be handheld devices, appliances, laptop computers, desktop computers, mainframes, distributed computing systems, or even devices that have not conventionally considered a computing system. In this description and in the claims, the term "computing system" is defined broadly as including any device or system (or combination thereof) that includes at least one physical and tangible processor, and a physical and tangible memory capable of having thereon computer-executable instructions that may be executed by the processor. The memory may take any form and may depend on the nature and form of the computing system. A computing system may be distributed over a network environment and may include multiple constituent computing systems. As illustrated in FIG. 1, in its most basic configuration, a computing system 100 typically includes at least one processing unit 102 and memory 104. The memory 104 may be physical system memory, which may be volatile, non-volatile, or some combination of the two. The term "memory" may also be used herein to refer to non-volatile mass storage such as physical storage media. If the computing system is distributed, the processing, memory and/or storage capability may be distributed as well. As used herein, the term "module" or "component" can refer to software objects or routines that execute on the computing system. The different components, modules, engines, and services described herein may be implemented as objects or processes that execute on the computing system (e.g., as separate threads).
In the description that follows, embodiments are described with reference to acts that are performed by one or more computing systems. If such acts are implemented in software, one or more processors of the associated computing system that performs the act direct the operation of the computing system in response to having executed computer-executable instructions. An example of such an operation involves the manipulation of data. The computer-executable instructions (and the manipulated data) may be stored in the memory 104 of the computing system 100. Computing system 100 may also contain communication channels 108 that allow the computing system 100 to communicate with other message processors over, for example, network 110.
Embodiments of the present invention may comprise or utilize a special purpose or general-purpose computer including computer hardware, such as, for example, one or more processors and system memory, as discussed in greater detail below. Embodiments within the scope of the present invention also include physical and other computer-readable media for carrying or storing computer-executable instructions and/or data structures. Such computer-readable media can be any available media that can be accessed by a general purpose or special purpose computer system. Computer-readable media that store computer-executable instructions are physical storage media. Computer-readable media that carry computer-executable instructions are transmission media. Thus, by way of example, and not limitation, embodiments of the invention can comprise at least two distinctly different kinds of computer-readable media: computer storage media and transmission media.
Computer storage media includes RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer.
FIG. 2 illustrates a network that includes a distributed cache hierarchy. The network 200 includes a number of client computing systems 201A, 201B, 201C and 201D (collectively referred to as clients 201) and a plurality of origin server computing systems 202A and 202B (collectively referred to as origin servers 202) with a cache hierarchy 210 disposed therebetween.
The "origin" server is the server that originally sources the content. Although content is available on the origin servers 202, that content may often be available within the cache hierarchy 210 when requested by one of the clients 201. The ellipses 201E represent that there may be any number of clients within the network, and that the number of clients need not be static. The ellipses 202C represents that there may be any number or origin servers within the network, and again that the number of origin servers need not be static. Each of the clients 201 and origin servers 202 may be structured as described above for the computing system 100.
The example cache hierarchy 210 includes a tier of edge routing servers 211A, 211B and 211C (collective referred to as edge routing servers 211), a tier of edge caching servers 212A, 212B and 212C (collective referred to as edge caching servers 212) and a second tier of caching servers 213A, 213B, and 213C (collectively referred to as second tier caching servers 213). The edge routing servers 211 may perhaps not actually cache content, but instead they identify the edge cache server for the requested content in a predictable manner to increase the likelihood of a cache-hit. In addition, the edge routing server and the edge caching server are logical roles. These roles could be served by the same physical server in the hierarchy. The edge cache servers and the second tier cache servers actually cache content.
A load balancer 214 receives content requests from the clients 201 and distributes the content request to one of the edge routing servers 211 in accordance with a load balancing algorithm. The load balancer 214 may also monitor a status of edge routing servers 211 and avoid distributed content requests to edge routing servers that are not healthy enough to sufficiently operate on such requests. The requested content may be video, images, files, sound, music, collaborative authoring content, or any other content.
While the load balancer is a good solution to provide both high availability and scalability, it does not have any awareness of where in the cache hierarchy the requested content resides. This is inefficient when it comes to routing requests for cached contents because its load balancing algorithm does not help to maximize the likeliness of getting a cache hit. The principles described herein reduce the impact of this inefficiency since the edge routing servers more predictably route the content requests to the edge caching servers. Because the edge routing servers can determine which edge caching server is responsible for caching the requested content, by routing the request to the responsible server, it can increase the cache-hit ratio.
The example cache hierarchy 210 is kept simple for clarity in explaining the principles described herein. An actual cache hierarchy may have any number of tiers of cache servers intermediating between the origin servers 202 and the clients 201. The cache hierarchy 210 may, in fact, be distributed across the Internet. Furthermore, the ellipses 211D, 212D and 213D represent that there may be any number of edge routing servers, edge caching servers, and second tier caching servers. The number of edge routing servers need not be the same as the number of caching servers in any tier, and vice versa. In one embodiment, at least one, but potentially all, of the edge routing servers may be on the same machine as a respective edge caching server. For instance, edge routing server 211A may be on the same machine as edge caching server 212A, edge routing server 211B may be on the same machine as edge caching server 212B, and/or edge routing server 211C may be on the same machine as edge caching server 213C, although not required. Each of the servers in the distributed cache hierarchy 210 may be structured as described above for the computing system 100 of FIG. 1.
FIG. 3 illustrates a flowchart of a method 300 for managing a distributed cache hierarchy in a network. While the method 300 may be performed in any network having a tier of edge routing servers and at least one tier of edge caching servers, the method 300 will now be described with respect to the network 200 of FIG. 2. Specifically, the arrows in FIG. 2 represent the communications associated with a specific content request.
The load balancer receives the content request (act 301), and applies a load balancing algorithm to determine which edge routing server should handle the content request (act 302). The load balancer then distributes the content request to the corresponding edge routing server (act 303). The precise load balancing algorithm is not critical to the principles described herein and may be random, round robin, or any other load balancing algorithm because these algorithms do not have awareness of which server is responsible for caching particular content. Referring to FIG. 2, the load balancer 214 receives the content requested as represented by arrow 221. The load balancer 214 determines that the edge routing server to route the content request to. In the illustrated case, the load balancer 214 routes the content request to the edge routing server 211B as represented by arrow 222.
The edge routing server receives the content request from the load balancer (act 304) (also as represented by the arrow 222), the edge routing server identifies which of the edge caching servers the requested content would be in if the requested content were to be cached within the edge caching servers (act 305). For example, the edge routing server 211B may apply the Cache Array Routing Protocol (CARP) using the Uniform Resource Locator (URL) to identify the corresponding edge caching server. The edge routing server does not itself cache the requested content. Accordingly, the edge routing server dispatches the content request to the identified edge caching server (act 306). Referring to FIG. 2, for example, the edge routing server 211B routes the content request to the corresponding edge caching server 212C as represented by arrow. Any of the other edge routing servers 211 of FIG. 2 may behave the same way with respect to routing to edge caching servers 212 that are appropriate given the URL of the content request.
In one embodiment, in addition to routing the requests in a predictable manner, the edge routing servers also routes the requests in a way that the cached contents on the edge cache servers are mutually exclusive. For instance, if edge routing server 212A is responsible for caching a particular content, then the same content is not cached by another other edge caching server 212. This behavior allows the cache hierarchy operator to distribute the contents in a way that there are no duplicated cached contents in the cache hierarchy, and therefore can more efficiently use resources, which would have otherwise been wasted by caching duplicate contents.
FIG. 4 illustrates a flowchart of a method 400 for a caching server at any tier in the distributed cache hierarchy to handle requests from the prior tier in the distributed cache hierarchy. For instance, if the caching server was an edge caching server amongst the edge caching servers 212, the edge caching server would perform the method 400 in response to receiving a content request from an edge routing server of the edge routing servers 211. If the caching server was a second tier caching server of the second tier caching servers 213, the second tier caching server would perform the method 400 in response to receiving the content request from an edge caching server of the edge content servers 212, and so forth for subsequent tiers.
Applying method 400 first to the edge caching server tier, the edge caching server receives the content request from prior tier in the distributed cache hierarchy (act 401), which would be the edge routing server in the case where the method 400 is applied to the edge caching server tier. For instance, in the example of FIG. 2, the edge caching server 212C receives the content request from the edge routing server 211B as also represented by arrow 223.
The edge caching server determines whether the requested content is cached on the edge caching server (decision block 402). If the requested content is cached in the edge caching server (Yes in decision block 402), the edge caching server initiates return of the requested content (act 411) to a client computing system associated with the content request. Referring to FIG. 2, if the edge caching server 212C had the requested content, the requested content would be returned along the reverse path along arrow 233 and arrow 232 in sequence to the client 201D.
If the requested content is not cached in the edge caching server (No in decision block 402), the edge caching server identifies which of the next tier of caching servers the requested content would be in (act 421) if the requested content were to be cached within the next tier caching servers. The content request is then distributed to the identified next tier caching server (act 422). For instance, if the requested content were not in the edge caching server 212C, the content request would be dispatched to the identified next tier caching server. In the illustrated case, the CARP algorithm may be applied by the edge caching server to identify that the requested content would be cached by the second tier caching server 213A if the requested content were cached by one of the second tier caching servers 213. The method 400 would then be performed for the next tier caching server.
Applying method 400 next to the second tier caching servers, the second tier caching server receives the content request from prior tier in the distributed cache hierarchy (act 401), which would be the edge caching server in the case where the method 400 is applied to the second tier caching server tier. For instance, in the example of FIG. 2, the second tier caching server 213A receives the content request from the edge caching server 212C as also represented by arrow 224.
The second tier caching server determines whether the requested content is cached on the second tier caching server (decision block 402). If the requested content is cached in the second tier caching server (Yes in decision block 402), the second tier caching server initiates return of the requested content (act 411) to a client computing system associated with the content request. Referring to FIG. 2, if the second tier caching server 213A had the requested content, the requested content would be returned along the reverse path along arrow 234, arrow 233 and arrow 232 in sequence to the client 201D. While on the return path the requested content may perhaps be cached at the edge caching server 212C. Although the requested content might always be cached in the edge caching servers encountered in the return path, caching policy might also be applied in order to determine whether to cache the returned content.
If the requested content is not cached in the second tier caching server (No in decision block 402), the second tier caching server identifies which of the next tier of caching servers the requested content would be in (act 421) if the requested content were to be cached within the next tier caching server. In this case, the next tier would actually be the origin servers 202. The content request is then distributed to the identified next tier caching server (act 422). For instance, if the requested content were not in the second tier caching server 213A, the content request would be dispatched to the identified next tier caching server. In this case, the origin server 202A may be identified based on the URL itself. The origin server 202A would then return the requested content along the reverse path along arrow 235 (thereupon being potentially cached in second tier caching server 213A), along arrow 234 (thereupon being potentially cached in edge caching server 212C), along arrow 233 and along arrow 232.
Accordingly, an effective mechanism for managing a distributed cache hierarchy is described. The mechanism provides predictability in where the content request should be dispatched, while also providing increased hit rate for caching servers. FIG. 2 also shows an intelligent Domain Name Server (DNS) server 240 to represent that the presence of the principles described with respect to FIGS. 3 and 4 are not inconsistent with the use of an intelligent DNS server. Some of the content requests may still be dispatched to the intelligent DNS server 440 for handling in accordance with the prior art.
routing the content request to the identified edge caching server without having to first determine whether the edge routing server contains the requested content.
2. The distribution network in accordance with claim 1, wherein the edge routing unit sends the given content request to a particular edge caching server and the edge caching unit of the particular edge caching server determines whether the edge caching unit of the particular edge caching server has the requested content cached.
3. The distribution network in accordance with claim 2, wherein the edge caching unit initiates of the particular edge caching server return of the requested content to a client computing system from which the given content request was sent.
4. The distribution network in accordance with claim 1, wherein the edge routing unit sends the given content request to a particular edge caching server and the edge caching unit of the particular edge caching server determines that the edge caching unit of the particular edge caching server does not have the requested content, and wherein an edge routing unit of the particular caching server then identifies, based on the predictive routing protocol, which other of the plurality of edge caching servers the given content request would be in, and the given content request is then sent from the particular edge caching server to said identified other of the plurality of edge caching servers.
the given content request is then routed to one of the edge servers in the identified next tier of edge caching servers.
6. The distribution network of claim 1, wherein the load balancer routes the content requests based at least in part on a health status associated with each of the edge routing units.
7. The distribution network of claim 1, wherein each edge routing unit is configured to refrain from caching content.
8. The distribution network of claim 1, wherein each of the edge caching units caches mutually exclusive sets of cached content from one another.
9. The distribution network of claim 1, wherein the edge routing unit and the one edge caching unit of at least one edge caching server reside on a common computing device.
11. The computer-implemented method in accordance with claim 10, wherein the edge routing unit sends the given content request to a particular edge caching server and the edge caching unit of the particular edge caching server determines whether the edge caching unit of the particular edge caching server has the requested content cached.
12. The computer-implemented method in accordance with claim 11, wherein the edge caching unit initiates of the particular edge caching server return of the requested content to a client computing system from which the given content request was sent.
13. The computer-implemented method in accordance with claim 11, wherein the edge routing unit sends the given content request to a particular edge caching server and the edge caching unit of the particular edge caching server determines that the edge caching unit of the particular edge caching server does not have the requested content, and wherein an edge routing unit of the particular caching server then identifies, based on the predictive routing protocol, which other of the plurality of edge caching servers the given content request would be in, and the given content request is then sent from the particular edge caching server to said identified other of the plurality of edge caching servers.
14. The computer-implemented method in accordance with claim 10, wherein the edge routing unit sends the given content request to a particular edge caching server and the edge caching unit of the particular edge caching server determines that the edge caching unit of the particular edge caching server does not have the requested content, and wherein the edge routing unit probabilistically identifies a further tier of edge caching servers at which the given content request would likely be cached, and the given content request is then routed to one of the edge servers in the identified next tier of edge caching servers.
15. The computer-implemented method of claim 10, wherein the load balancer routes the content requests based at least in part on a health status associated with each of the edge routing units.
16. The computer-implemented method of claim 10, wherein each edge routing unit is configured to refrain from caching content.
17. The computer-implemented method of claim 10, wherein each of the edge caching units caches mutually exclusive sets of cached content from one another.
18. The computer-implemented method of claim 10, wherein the edge routing unit and the one edge caching unit of at least one edge caching server reside on a common computing device.
19. One or more hardware storage devices containing computer-executable instructions which, when executed by one or more processors, cause the one or more processors to perform a computer-implemented method for retrieving cached content from a hierarchy of edge caching servers, and wherein the computer-implemented method comprises: receiving at a load balancer one or more requests from one or more client computing systems; without being aware of where any content corresponding to content requests may reside in the distribution network, the load balancer routing said content requests to one or more edge caching servers; a plurality of the edge caching servers each comprising an edge caching unit having at least one hardware processor and memory for caching content obtained from one or more origin servers, and an edge routing unit, and wherein the computer implemented method further comprises: receiving at one or more edge routing units, content requests from the load balancer; each edge routing unit comprising at least one hardware processor and memory containing computer-executable instructions which, when implemented, cause the edge routing unit to process one or more content requests received from the load balancer according to a computer-implemented predictive routing protocol which predicts where cached content corresponding to requested content resides in the distribution network, and wherein the computer-implemented predictive routing protocol comprises acts of: identifying which of the plurality of edge caching servers is correlated to the requested content based on the predictive routing protocol; and routing the content request to the identified edge caching server without having to first determine whether the edge routing server contains the requested content.
20. The one or more hardware storage devices of claim 19, wherein the edge routing unit sends the given content request to a particular edge caching server and the edge caching unit of the particular edge caching server determines that the edge caching unit of the particular edge caching server does not have the requested content, and wherein an edge routing unit of the particular caching server then identifies, based on the predictive routing protocol, which other of the plurality of edge caching servers the given content request would be in, and the given content request is then sent from the particular edge caching server to said identified other of the plurality of edge caching servers.
"Effects of Virtualization and Cloud Computing on Data Center Networks", Retrieved from <<http://web.archive.org/web/20121127070451/http://h20000.www2.hp.com/bc/docs/support/SupportManual/c03042885/c03042885.pdf>>, Oct. 2011, 16 Pages.
"Final Office Action Issued in U.S. Appl. No. 14/096,697", Mailed Date: Feb. 13, 2015, 11 Pages.
"Load Balancing: Optimum Performance, Scalability and Resiliency", Available at least as early as Apr. 20, 2012, available at: http://www.contegix.com/solutions/managed-hosting/managed-services/load-balancing/.
"Non-final Office Action Issued in U.S. Appl. No. 13/006,694", Mailed Date: Aug. 28, 2012, 17 Pages.
"Non-final Office Action Issued in U.S. Appl. No. 13/022,527", Mailed Date: Mar. 22, 2013, 9 Pages.
"Non-final Office Action Issued in U.S. Appl. No. 14/096,697", Mailed Date; Jul. 22, 2014, 19 Pages.
"Notice of Allowance Issued in U.S. Appl. No. 13/006,694", Mailed Date: Nov. 20, 2012, 9 Pages.
"Notice of Allowance Issued in U.S. Appl. No. 13/022,527", Mailed Date: Aug. 20, 2013, 8 Pages.
"Notice of Allowance Issued in U.S. Appl. No. 14/096,697", Mailed Date: Jun. 16, 2015, 6 Pages.
Al-Fares, et al., "Hedera: Dynamic Flow Scheduling for Data Center Networks", In Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, Apr. 28, 2010, pp. 281-295.
Alur, Sandeep J., "Enterprise Integration and Distributed Computing: A Ubiquitous Phenomenon", Published: Sep. 2008. Available at: http://msdn.microsoft.com/en-us/library/cc949110.aspx.
Bunt, Richard B., et al., "Achieving Load Balance and Effective Caching in Clustered Web Servers", Proceedings of the Fourth International Web Caching Workshop, San Diego, CA, Apr. 1999, pp. 159-169.
Chinese Office Action issued in Chinese Patent Application No. 201380054147.2 mailed Mar. 20, 2017.
Das, et al., "Predicting Web Cache Behavior using Stochastic State-Space Models", In Proceedings of the Second International Workshop on Scalable Data Management Applications and Systems, Jul. 2008, 8 Pages.
First Office Action Received for Chinese Application No. 201110444322.1, Mailed Date: Sep. 3, 2014, 12 Pages.
Gill, Binny S., "On Multi-Level Exclusing Caching: Offline Optimality and Why Promotions are Better Than Demotions", In Proceedings of the 6th USENIX Conference on File and Storage Technologies, Article No. 4, Feb. 26, 2008, pp. 49-65.
Greenberg, et al., "Towards a Next Generation Data Center Architecture: Scalability and Commoditization", In Proceedings of the ACM Workshop on Programmable Routers for Extensible Services of Tomorrow, Aug. 17-22, 2008, pp. 57-62.
Gulwani, et al., "WebCaL-A Domain Specific Language for Web Caching", In Journal of Computer Communications, vol. 24, Issue 2, Feb. 1, 2001, 13 Pages.
Gulwani, et al., "WebCaL—A Domain Specific Language for Web Caching", In Journal of Computer Communications, vol. 24, Issue 2, Feb. 1, 2001, 13 Pages.
HAProxy, "The Reliable, High Performance TCP/HTTP Load Balancer", Jul. 28, 2010, 10 pages.
InfoBPN Solutions on Business Process Networking Business and Process Automation, "Application Load Balancing Solution", Based on information and belief available, at least as early as Jul. 27, 2010.
International Search Report and Written Opinion Issued in PCT Application No. PCT/US2013/065159, mailed Jan. 22, 2014.
Joseph, et al., "A Policy-Aware Switching Layer for Data Centers", In Proceedings of the ACM SIGCOMM Conference on Data Communication, Aug. 17, 2008, pp. 51-62.
K2 Colocation, Network Load Balancing Appliance, Intelligent Routing Network Appliance, "Flow Control Platform (FCP) Solutions", Jan. 4, 2007, 2 pages.
Laoutaris, et al., "The Cache Inference Problem and Its Application to Content and Request Routing", In Proceedings of 26th IEEE International Conference on Computer Communication, INFOCOM 2007, May 6, 2007, 10 Pages.
Lindemann, et al., "Evaluating Cooperative Web Caching Protocols for Emerging Network Technologies", In Proceedings of International Workshop on Caching, Coherence and Consistency, Jun. 2001, 9 Pages.
Microsoft TechNet, "MS Windows NT Load Balancing Service Whitepaper", Based on information and belief available, at least as early as Jul. 27, 2010, 9 pages.
Naumenko, Andrey, "Some Recommendations on Building Proxy Caching Service", In Proceedings of WebNet 98-World Conference of the WWW, Internet and Intranet, Nov. 1998, 6 Pages.
Naumenko, Andrey, "Some Recommendations on Building Proxy Caching Service", In Proceedings of WebNet 98—World Conference of the WWW, Internet and Intranet, Nov. 1998, 6 Pages.
Nehra, Neeraj, et al., "A Framework for Distributed Dynamic Load Balancing in Heterogeneous Cluster", Journal of Computer Science 3 (1): Jan. 2007 Science Publications, pp. 14-24.
Second Office Action Issued in Chinese Patent Application No. 201110444322.1, Mailed Date: Apr. 9, 2015, 6 Pages.
Stage, et al., "Network-aware Migration Control and Scheduling of Differentiated Virtual Machine Workloads", In Workshop on Software Engineering Challenges in Cloud Computing, May 23, 2009, pp. 9-14.
Top Web Hosting, "Load Balancing", Copyright 2002-2010, Based on information and belief available ast least as early as Jul. 27, 2010, 6 pages.
U.S. Appl. No. 12/972,340, Dec. 18, 2013, Notice of Allowance.
U.S. Appl. No. 12/972,340, Feb. 14, 2014, Notice of Allowance.
U.S. Appl. No. 12/972,340, Feb. 25, 2013, Office Action.
U.S. Appl. No. 13/115,444, Apr. 15, 2013, Office Action.
U.S. Appl. No. 13/115,444, Jan. 30, 2014, Office Action.
U.S. Appl. No. 13/115,444, Sep. 13, 2013, Office Action.
U.S. Appl. No. 13/547,805, Apr. 14, 2014, Notice of Allowance.
U.S. Appl. No. 13/547,805, Jan. 3, 2014, Office Action.
U.S. Appl. No. 13/652,718, Mar. 5, 2015, Office Action.
U.S. Appl. No. 13/652,718, Oct. 20, 2015, Notice of Allowance.
U.S. Appl. No. 13/652,718, Oct. 9, 2014, Office Action.
U.S. Appl. No. 13/652,718, Sep. 18, 2015, Notice of Allowance.
U.S. Appl. No. 14/198,465, Dec. 5, 2014, Office Action.
U.S. Appl. No. 14/198,465, Sep. 3, 2015, Office Action.
U.S. Appl. No. 14/452,314, Mar. 24, 2015, Notice of Allowance.
U.S. Appl. No. 14/546,729, May 24, 2016, Notice of Allowance.
U.S. Appl. No. 14/804,381, Feb. 10, 2016, Notice of Allowance.
Walcott, Costa, "Taking a load off: Load balancing with balance", Aug. 17, 2005, 7 pages.
Wessels, et al., "ICP and the Squid Web Cache", In Proceedings of IEEE Journal on Selected Areas in Communications, Aug. 13, 1997, 25 Pages.
White Paper, Equalizer, "Purpose-Built Load Balancing the Advantages of Coyote Point Equalizer over Software-based Solutions", Copyright 2004 Coyote Point Systems, Inc. 9 pages.


This is a really lovely vintage hand painted Porcelain Inkwell & Stand. The makers mark on the bottom simply reads "M", and it has a German appearance. The stand is in gorgeous vintage condition, possible spelter, with a few small chips in the glass insert. I will replace this as it appears to be newer than the stand. The whole set is beautiful, and fully hand painted with delicate floral sprays. A very unusual and very old stand.
SIZE: 7 inches long x 6 inches wide.


text:
Kim Kardashian Got Trolled By Twitter And Forbes In The Same Day
The first half of 2020 has officially come to a close, and it's safe say it's been a struggle. And you know what? Times are tough for Kim Kardashian too. All she wants is to be able to brag about being rich, but this week, she just can't catch a break from the trolls.
On Tuesday, Kim shared several photos from North's 7th birthday celebration in Wyoming. Kourtney and her kids were there, along with some other children. It looked like a great time, with lots of leather pants, go-kart racing, and horseback riding.
Speaking of horses, Kim tweeted introducing the world to "North's Freesian horse", adding that they have "14 gorgeous Freesians on the ranch". That might be the fanciest combination of words I've ever heard, and Twitter wasted no time trolling Kim for her failure to read the depressing room that is 2020.
Meet North's Freesian horse. We have 14 gorgeous Freesians on the ranch. pic.twitter.com/TO87I25YKJ
— Kim Kardashian West (@KimKardashian) June 29, 2020
First of all, it's actually spelled "Friesian", which the good people of Horse Twitter pointed out as evidence that Kim might not actually know that much about horses (or spell-check). She also got called out for other horse-related inaccuracies, like the kind of bridle on the horse and North's lack of proper riding attire (read: Ugg boots). But on top of those technical faux pas on Kim's part, she also got dragged for the tone of the post in general.
Kim might not know much about horses, but I'm sure she's at least vaguely aware that the last few months have been an extremely tough time for a lot of people. With an unemployment rate higher than it's been in decades, it seems like the exact wrong time to be bragging on social media about how many gorgeous horses you can afford. Everyone knows the Kardashians are rich, but a post like this is over the top even for them.
Honestly the fact that you chose a moment in time when our unemployment rate is the highest it's ever been since the Great Depression to brag about having too many fancy horses and then couldn't even spell the breed correctly is a perfect illustration of America in 2020
— ✨eva✨ (@midwest_monster) June 30, 2020
In one more personal response to Kim's tweet, a woman claimed that she used to work for the Kardashian family, and could barely afford groceries at the time. On top of that, she was reprimanded for picking up freelance work to supplement her wages.
I had to buy groceries at the 99 Cents Only Store when I worked as an editor on the Kardashian-Jenner Official Apps ❤ and got reprimanded for freelancing on the side ❤❤ https://t.co/E4crddQo7i
— Jessica DeFino (@jessicadefino_) June 30, 2020
Here's another one, for good measure. The emojis really help bring it to life.
Kim Kardashian really looked at everything that's going on right now and said "damn that sucks…..anyway this is our $30K horse & guess what? we have 14 more😍🐎 also this is our ranch which includes a go kart track🤠 BILLIONAIRE TINGZ🤪🥰"
— J☆DE (@foxijade) June 30, 2020
Speaking of billionaire, Kim posted her horse tweet on the same day that news broke of a major deal which will see her sell a portion of her KKW Beauty Brand. In the deal with Coty, they will buy a 20% stake in the company for $200 million, giving the company a total valuation of… wait for it… $1 billion. It's a similar deal to the one Kylie made with Coty last year, except that Kim will retain majority ownership of KKW Beauty. With the news of the deal on Monday, it was widely reported that this meant Kim was officially a billionaire. Even Kanye toasted Kim's 10-figure financial status with a bizarre tweet featuring a photo of some vegetables.
I am so proud of my beautiful wife Kim Kardashian West for officially becoming a billionaire
You've weathered the craziest storms and now God is shining on you and our family
So blessed this is still life
So I made you this still life
We love you so much pic.twitter.com/Vvtgzodnah
— ye (@kanyewest) June 30, 2020
But just like Twitter trolled the hell out of Kim's horses, Forbes popped up to troll the hell out of Kim's newly-minted billionaire status. Back in May, Forbes published a bombshell report about Kylie Jenner, stripping her of her billionaire designation, and alleging that she made false statements and even forged tax documents. Clearly, Forbes is done with this family's bullsh*t, and after Kim's Coty announcement on Monday, they wasted no time knocking her down a peg.
While Kanye was busy writing a poem about his billionaire wife, Forbes published a report headlined "Kim Kardashian Is Worth $900 Million After Agreeing To Sell A Stake In Her Cosmetics Firm To Coty." According to Forbes, though the deal values KKW Beauty at $1 billion, Kris Jenner actually owns eight percent of the company, leaving Kim short of the coveted billionaire mark. Honestly, this means almost nothing in the grand scheme of anything, because Kim can still buy as many gorgeous horses as she wants, but you know that she must be dying to officially be called a billionaire.
I'm sure if Kim Kardashian keeps working hard and pulling herself up by her bootstraps, she can eventually make it there, but in the meantime, maybe she should refrain from bragging about her wealth on social media. Much like mask-less concerts and white people waving guns at protestors, it's just not what we need to see right now.
Images: Tinseltown / Shutterstock.com; kimkardashian, midwest_monster, jessicadefino_, foxijade, kanyewest / Twitter

redpajama_set_name: RedPajamaCommonCrawl


text:
Q: Risks of unintstalling and reinstalling workflow manager Due to an expired certificate on our Workflow site it seems that we need to uninstall and reinstall the Workflow manager. https://social.technet.microsoft.com/Forums/en-US/d935d8df-9de1-4d7f-9937-6e811b24b472/sharepoint-2013-workflow-manager-now-has-expired-certificate?forum=sharepointadmin Nowhere though can I find anything about the impact of doing this. ie) does this remove any existing workflows? What if we have a custom Action in one of our Workflows?  Also, I asked in a separate question - how do I tell which CU I have on my Workflow manager? Does this have any impact on any other Sharepoint services? I can see my build-number but don't have a resource that tells me which build-number matches which CU. Thank you,

A: It does not remove existing workflows as those are already in the workflow manager databases. You will re-use your existing databases when creating the new WFM farm. You should use Copy-SPActivitiesToWorkflowService once you've bound WFM back to SharePoint.

A: We had to do the same thing in our company last week - with no errors. Just be sure to backup all Workflow Manager DataBases and then restore them.
For the Custom Activity I agree with Trevor.
For the Build Number, I already answered your second question HERE

redpajama_set_name: RedPajamaStackExchange