J.-M. Menaud, V. Issarny, and M. Banatre. A new protocol for efficient transversal Web caching. In Proc. of the 12th Int. Symp. on Distributed Computing, Sep. 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....backbone links, and can also serve to decrease object access latencies. Much research has focused on Web proxy caching [4, 5, 7, 11, 12] and, more recently, on coordinating state among multiple, cooperating proxy caches [13, 30, 33] some of these proposals aim to create global caching structures [27, 34]. The results of these studies generally indicate that cache hit rates of 40 50 are achievable, but that hit rate increases only logarithmically with client population [36] and is constrained by the increasing amount of dynamically generated and hence uncacheable content. 2.2 Content Delivery ....

J.-M. Menaud, V. Issarny, and M. Banatre. A new protocol for efficient transversal Web caching. In Proc. of the 12th Int. Symp. on Distributed Computing, Sep. 1998.

....backbone links, and can also serve to decrease object access latencies. Much research has focused on Web proxy caching [4, 5, 7, 11, 12] and, more recently, on coordinating state among multiple, cooperating proxy caches [13, 30, 33] some of these proposals aim to create global caching structures [27, 34]. The results of these studies generally indicate that cache hit rates of 40 50 are achievable, but that hit rate increases only logarithmically with client population [36] and is constrained by the increasing amount of dynamically generated and hence uncacheable content. 2.2 Content Delivery ....

J.-M. Menaud, V. Issarny, and M. Banatre. A new protocol for efficient transversal Web caching. In Proc. of the 12th Int. Symp. on Distributed Computing, Sep. 1998.

....The overall goal is to bring a particular web object to the cache that is closest to the clients requesting that web object. Previous proposals include hierarchical cache schemes (e.g. CDN 96, KLL 97, squ, CK01a] hash based schemes [KLL 97, VR98] directory based schemes [FCAB98, MIB98, TDVK99] and multicast based schemes (e.g. Tou98] Of these cooperative caching studies, those most related to CUP are work on refreshment policies for cascaded caches by Cohen et al. CK01a] and work on distributing location hints across a hierarchy of caches by Tewari et al. TDVK99] ....

J.M. Menaud, V. Issarny, and M. Banatre. A New Protocol for Efficient Transversal Web Caching. In Symposium on Distributed Computing, 1998.

....[5, 8, 14, 20, 24] There has also been extensive work on cooperative Web caching as a technique to reduce access latency and bandwidth consumption. Cooperative Web caching proposals include hierarchical schemes like Harvest and Squid [9, 32] hash based schemes [21, 35] directory based schemes [16, 27, 33] and multicast based schemes [28, 34] Although each of these research efforts included a performance evaluation of the protocols proposed and a discussion of algorithm scalability, only [22] presents empirical evaluations of cooperation for small populations, and none present empirical or ....

J.-M. Menaud, V. Issarny, and M. Banatre. A new protocol for efficient transversal Web caching. In Proc. of the 12th Int. Symp. on Distributed Computing, pages 288--302, September 1998.

....8, 31, 20, 21, 14] There has also been extensive work on cooperative Web caching as a technique to reduce access latency and bandwidth consumption. Cooperative Web caching proposals include hierarchical schemes like Harvest and Squid [9, 29] hash based schemes [33, 22] directorybased schemes [15, 30, 26] and multicast based schemes [34, 32] Although each of these research efforts included a performance evaluation of the protocols proposed and a discussion of algorithm scalability, none of these evaluations presented either empirical or analytical evaluations of the effectiveness of their schemes ....

Jean-Marc Menaud, Valerie Issarny, and Michel Banatre. A new protocol for efficient transversal web caching. In Proc. of the 12th Int. Symp. on Distributed Computing, September 1998.

....the pages over each machine in turn. This simplistic choice is due to the fact that an efficient cooperation protocol is implemented among the cluster s machines. Efficiency comes from the use of an Atm network but also from the cooperation algorithm, which is based on the one introduced in [23] Concerning distribution of the users requests, it consists of choosing a cluster for every user upon the user s connection. The cluster is selected based on the groups it hosts and on its current processing load. Among clusters that host a group which is contained in the user s profile, the one ....

.... A client server communication protocol implemented on all the machines of the clusters, according to the priority based parallel communication scheme discussed in Subsection 3.1. A cooperation protocol among the machines of each cluster, which is an adaptation of the one proposed in [23]. 3.3 Evaluation Regarding evaluation of the Etel service, we are interested in assessing the benefit of the proposed prefetching and load balancing strategies with respect to the service s mean response time and scalability. Ideally, such an assessment should be based on performance measures of ....

J-M. Menaud, V. Issarny, and M. Banatre. A new protocol for efficient transversal web caching. In Proc. of DISC'98 (Formerly WDAG --) 12th International Symposium on Distributed Computing, 1998.

....upon the evaluation of D(C i ) and A(C i ) for every cache C i of S. Furthermore, the value of these sets must satisfy the aforementioned condition of load balancing, and should be such that the number of messages sent for updating the system state on a cache update is minimal. It can be shown [16] that we have an optimal system meeting our scalability requirement if jA(C i )j = p jSj and jD(C i )j = p jSj Gamma 1, the number of exchanged messages on a cache update being then of p jSj Gamma1. With such values, the network 3 2 A(C ) C ,C 4 D(C ) C 2 4 A(C ) C ,C 4 1 ....

J-M. Menaud, V. Issarny, and M. Banatre. A New Protocol for Efficient Transversal Web Caching. Proceedings of DISC'98 (Formerly WDAG) -- 12th International Symposium on Distributed Computing. 1998.

No context found.

J.-M. Menaud, V. Issarny, and M. Banatre. A new protocol for efficient transversal Web caching. In Proc. of the 12th Int. Symp. on Distributed Computing, Sep. 1998.

No context found.

J.-M. Menaud, V. Issarny, and M. Banatre. A new protocol for efficient transversal Web caching. In Proc. of the 12th Int. Symp. on Distributed Computing, Sep. 1998.

No context found.

J.-M. Menaud, V. Issarny, and M. Banatre. A new protocol for efficient transversal Web caching. In Proc. of the 12th Int. Symp. on Distributed Computing, Sep. 1998.

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