We consider cluster-based network servers in which a front-end directs incoming requests to one of a number of back-ends. Specifically, we consider content-based request distribution: the front-end uses the content requested, in addition to information about the load on the back-end nodes, to choose which back-end will handle this request. Content-based request distribution can improve locality in the back-ends’ main memory caches, increase secondary storage scalability by partitioning the server’s database, and provide the ability to employ back-end nodes that are specialized for certain types of requests. As a specific policy for content-based request distribution, we introduce a simple, practical strategy for locality-aware request distr...
Abstract- In P2P systems, large volumes of data are de-clustered naturally across a large number of ...
[[abstract]]We have implemented an efficient and scalable web cluster named LVS-CAD/FC (i.e. LVS wit...
Cache-aided content delivery is studied in a multi-server system with P servers and K users, each eq...
We consider cluster-based network servers in which a front-end directs incoming requests to one of a...
We consider cluster-based network servers in which a front-end directs incoming requests to one of a...
Widely adopted distributor-based systems forward user requests to a balanced set of waiting servers ...
In this paper we use analytic modeling and simulation to evaluate network servers implemented on clu...
We consider the use of cooperative caching to manage the memories of cluster-based servers. Over the...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/19...
Efficiency and portability are usually conflicting objectives for cluster-based network servers that...
We present the design and deployment of the Julia locality aware content distribution algorithm. Our...
In this paper, we argue that cache consistency mechanisms designed for stand-alone proxies do not sc...
Abstract—The rapid increase of content delivery over the Internet has led to the proliferation of co...
[[abstract]]To support Web clusters with efficient dispatching mechanisms and policies, we propose a...
The overwhelming use of today’s network is for an endpoint to acquire a named content file. As a res...
Abstract- In P2P systems, large volumes of data are de-clustered naturally across a large number of ...
[[abstract]]We have implemented an efficient and scalable web cluster named LVS-CAD/FC (i.e. LVS wit...
Cache-aided content delivery is studied in a multi-server system with P servers and K users, each eq...
We consider cluster-based network servers in which a front-end directs incoming requests to one of a...
We consider cluster-based network servers in which a front-end directs incoming requests to one of a...
Widely adopted distributor-based systems forward user requests to a balanced set of waiting servers ...
In this paper we use analytic modeling and simulation to evaluate network servers implemented on clu...
We consider the use of cooperative caching to manage the memories of cluster-based servers. Over the...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/19...
Efficiency and portability are usually conflicting objectives for cluster-based network servers that...
We present the design and deployment of the Julia locality aware content distribution algorithm. Our...
In this paper, we argue that cache consistency mechanisms designed for stand-alone proxies do not sc...
Abstract—The rapid increase of content delivery over the Internet has led to the proliferation of co...
[[abstract]]To support Web clusters with efficient dispatching mechanisms and policies, we propose a...
The overwhelming use of today’s network is for an endpoint to acquire a named content file. As a res...
Abstract- In P2P systems, large volumes of data are de-clustered naturally across a large number of ...
[[abstract]]We have implemented an efficient and scalable web cluster named LVS-CAD/FC (i.e. LVS wit...
Cache-aided content delivery is studied in a multi-server system with P servers and K users, each eq...