| Mohit Aron, Darren Sanders, Peter Druschel, and Willy Zwaenepoel. Scalable content-aware request distribution in cluster-based network servers. In Proc. USENIX Annual Technical Conference, San Diego, CA, June 2000. |
....and report errors in manner consistent with the network fabric s fault model. 1. Introduction Popular Internet services frequently rely on clusters of commodity computers as their computing platform [7] The performance and scalability of cluster based servers have been studied extensively [1, 7, 9]. However, understanding designs for availability, behavior during component failures, and the relationship between performance and availability (and combined performability) of these servers has received much less attention. In this paper, we seek to understand the impact of different ....
....is that we can approximate log(1 u) as u when u is small. 3 The PRESS Server PRESS is a highly optimized yet portable cluster based locality conscious web server that has been shown to provide good performance in a wide range of scenarios [9, 10] Like other locality conscious servers [1, 4, 27], PRESS is based on the observation that serving a request from any memory cache, even a remote cache, is substantially more efcient than serving it from disk, even a local disk. In PRESS, any node of the cluster can receive a client request and becomes the initial node for that request. When the ....
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable Content-Aware Request Distribution in Cluster-Based Network Servers. In Proceedings of the 2000.
....requests for a given object across all of the servers, forcing each server to fetch the object and cache it redundantly. On the other hand, content routing policies preserve this locality by preferring the same server for repeat requests, but they are vulnerable to load imbalances. Recent research [16, 4, 5] has studied this tradeoff in depth, and developed locality aware request distribution (LARD) and related policies to combine the benefits of both approaches. We use the term URL switching to encompass URL hashing as well as the more sophisticated LARD strategies when applied in a server switch. ....
Mohit Aron, Darren Sanders, Peter Druschel, and Willy Zwaenepoel. Scalable content-aware request distribution in cluster-based network servers. In In Proceedings of the USENIX 2000.
....a technique based on reinforcement learning. Several other approaches ranging from control theory to online measurements and optimizations can also be employed to address this problem. While no such study exists for storage systems, both control theory [1] and online measurements and optimizations [6, 15] have been employed for dynamically allocating resources in web servers. Utility based optimization models for dynamic resource allocation in server clusters have been employed in [11] Feedback based dynamic proportional share allocation to meet real rate disk I O requirements have been studied ....
M. Aron, D. Sanders, P. Druschel and W. Zwaenepoel. Scalable Contentaware Request Distribution in Cluster-based Network Servers. Proceedings of the USENIX 2000.
....This chapter investigates the techniques of providing efficient load balancing support for accessing replicated services inside the service cluster. A large amount of work has been done by the industry and research community to optimize HTTP request distribution among a cluster of Web servers [11, 12, 21, 38, 53, 64]. Most load balancing policies proposed in such a context rely on the premise that all network packets go through a single frontend dispatcher or a TCP aware (layer 4 or above) switch so that TCP level connection based statistics can be accurately maintained. In contrast, clients and servers ....
....trace. The improvement is 5.2 if the polling time is excluded. Note that the performance results shown in Figure 3.5 are not with discarding slow responding polls. HTTP load balancing. A large body of work has been done to optimize HTTP request distribution among a cluster of Web servers [11, 12, 21, 38, 53, 64]. Most load balancing policies proposed in such a context rely on 52 the premise that all network packets go through a single front end dispatcher or a TCP aware (layer 4 or above) switch so that TCP level connection based statistics can be accurately maintained. However, clients and servers ....
[Article contains additional citation context not shown here]
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable Contentaware Request Distribution in Cluster-based Network Services. In Proc. of the 2000.
....try to balance the load of web servers. Load balancing can be as simple as round robin or as sophisticated as measurement based [20] In addition, similar to cache load balancing discussed at the end of Section 2.2. 1, server load balancing needs to provide both load protection and request locality [21, 22]. In addition, to address the dynamic content distribution problem discussed in Section 2.2.3, several commercial products accelerate the origin servers by caching dynamic content at web servers, such as SpiderCache [23] and XCache [24] 2.4. Protocol and content optimization HTTP TCP IP is the ....
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel, "Scalable content-aware request distribution in clusterbased network servers," in Proceedings of the 2000.
....or clients, as shown in Figure 1. We distinguish three different layers of hosts that can hold a copy of a document. The core layer consists of servers that host permanent replicas of a document. In many cases, each Web document is hosted by only a single primary server. Clusters of Web servers [1, 13] and servers that mirror entire Web sites are examples of multiple permanent replicas. The middle layer consists of servers for hosting document initiated replicas. These replicas are normally created by one of the permanent replicas, but possibly also by one of the other document initiated ....
.... Let s A (d) denote the strategy that is assigned to document d in arrangement A, and res(m k ; d;s A (d) the value in metric m k that is attained for document d using strategy s A (d) For each arrangement A, we can then construct the following result vector total(A) total(A) htotal(A)[1]; total(A) N]i with total(A) k] res(m k ; d;s A (d) Note that total(A) k] is simply the aggregated performance in metric m k . For example, in our experiments each total(A) k] represents the total turnaround time, the total number of returned stale documents, or the total consumed ....
[Article contains additional citation context not shown here]
Mohit Aron, Darren Sanders, Peter Druschel, and Willy Zwaenepoel, Scalable Content-aware Request Distribution in Cluster-based Network Servers, Usenix Ann. Techn. Conf. (San Diego, CA), June 2000, pp. 323--336.
No context found.
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable Content-aware Request Distribution in Cluster-based Network Servers. In Proceedings of the USENIX 2000.
No context found.
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable Content-aware Request Distribution in Cluster-based Network Servers. In Proceedings of the USENIX 2000.
No context found.
Mohit Aron, Darren Sanders, Peter Druschel, and Willy Zwaenepoel. Scalable content-aware request distribution in cluster-based network servers. In Proc. USENIX Annual Technical Conference, San Diego, CA, June 2000.
No context found.
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable content-aware request distribution in cluster-based network servers. In In Proc of the 2000.
No context found.
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable content-aware request distribution in cluster-based network servers. In Proceedings of the USENIX 2000.
No context found.
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable Content-aware Request Distribution in Cluster-based Network Services. In Proc. of the 2000.
No context found.
M.Aron et al. Scalable Content-aware Request Distribution in Cluster-based Network Servers. Proceedings of the USENIX 2000 Annual Technical Conference, San Diego, CA, June 2000.
No context found.
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel, "Scalable content-aware request distribution in cluster-based network servers," in Proceedings of the USENIX 2000.
No context found.
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable Content-Aware Request Distribution in Cluster-Based Network Servers. In Proceedings of USENIX'2000.
No context found.
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable Content-aware Request Distribution in Clusterbased Network Services. In Proc. of the 2000.
No context found.
M. Aron, D. Sanders, P. Druschel and W. Zwaenepoel. Scalable ContentAware Request Distribution in Cluster-based Network Servers. In Proceedings of the USENIX 2000.
No context found.
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel, "Scalable Content-Aware Request Distribution in Cluster-Based Network Services," Proc. USENIX Ann. Technical Conf., June 2000.
No context found.
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel, "Scalable content-aware request distribution in cluster-based network servers," in Proceedings of the USENIX 2000.
No context found.
Aron, M., D. Sanders, P. Druschel, and W. Zwaenepoel: 2000, `Scalable Content-Aware Request Distribution in Cluster-based Network Servers'. In: Proceedings of the 2000 USENIX Technical Conference. pp. 90--101.
No context found.
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable Content-Aware Request Distribution in Cluster-Based Network Servers. In Proceedings of the 2000.
No context found.
Mohit Aron, Darren Sanders, et. al., "Scalable Content-Aware Request Distribution in Cluster-Based Network Servers", Proceedings of the USENIX 2000.
No context found.
Aron, M., Sanders, D., Druschel, P., Zwaenepoel, W., (2000), "Scalable Content Aware Request Distribution in Cluster-based Netwrok Servers", Proceedings of USENIX 2000 Annual Technical Conference, San Diego, CA, USA.Available Online: http://www.usenix.org/publications/library/proceedings/usenix2000/ge neral/aron/aron_html
No context found.
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel, "Scalable content-aware request distribution in cluster-based network servers," in Proceedings of the USENIX Summer Conference, USENIX, June 2000.
No context found.
Aron, M., D. Sanders, P. Druschel and W. Zwaenepoel. Scalable content-aware request distribution in cluster-based network servers. In Annual Usenix Technical Conference, 2000. San Diego, CA.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC