J. Cohen, N. Phadnis, V. Valloppillil, and K. W. Ross. Cache array routing protocol v1.1. http://ds1.internic.net/internet-drafts/draft-vinod-carp-v1-01.txt, September 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....combined increase the overall storage space (cache) and, therefore, increase the chance of fulfilling incoming requests. Cooperative proxies try to combine their individual caches in such a way that maximum cache usage is achieved while acting transparently as one single load balanced proxy cache [10]. They lead to overhead problems like inter proxy communication and the distribution of object storage location information. Previous research on cooperative proxies can be found in hierarchical [33] and hashing approaches [20, 29] adaptive web caching [37] CacheMesh [34] WebWave [15] and the ....

....if requests are not resolved locally and they continue to climb the hierarchy until the request objects are found. This often lead to a bottleneck situation at the main root server. The distributed approach is usually based on a hashing algorithm like the Cache Array Routing Protocol (CARP) [10]. Each requested page is mapped to exactly one proxy in the proxy array in a hashing system and will either be resolved by the local cache or requested from the origin server. Hashing based allocations can be widely seen 4 TSUI et al. as the ideal way to find cached web pages, due to the fact ....

[Article contains additional citation context not shown here]

J. Cohen, N. Phadnis, V. Valloppillil, and K. W. Ross. Cache array routing protocol v.1.1. September 1997.

....increase the overall storage space for cached documents and increase therefore the chance to resolve incoming requests. Cooperative proxies try to combine their individual caches in such a way that maximum cache usage is achieved while acting transparently as one single loadbalanced proxy cache [4] which leads to problems like inter proxy communication to avoid the storage of equal objects and the distribution of information about stored projects for the allocation process. Previous research on cooperative proxies can be found in the area of hierarchical [27] and hashing approaches ....

....request time but focus solely on the time difference between the last two requests. In any adaptive system, changes in the recent past need to be considered and the HITS value would allow objects that were highly requested in the past to remain unnecessarily long in the local cache. www.xy34 Proxy[4] 9953 0 1 www.xy123 Proxy[1] 9954 0 1 www.xy64 Proxy[2] 9955 0 1 www.xy53 Proxy[1] 9956 123 432 www.xy343 Proxy[7] 9957 0 1 www.xy452 Proxy[4] 9958 522 434 www.xy2 Proxy[1] 9959 0 1 www.xy32 Proxy[2] 9960 0 1 www.xy29 Proxy[4] 9961 0 1 Figure 1: A Sample Single table 3.2 Multiple Table ....

[Article contains additional citation context not shown here]

J. Cohen, N. Phadnis, V. Valloppillil, K.W.Ross, Cache array routing protocol v.1.1, Sept. 1997, Internet Draft.

....the assigned root proxy in the hierarchy will be queried and unresolved requests continue to climb the hierarchy and often lead to a bottleneck situation on the main root server. The distributed approach is usually based on a hashing algorithm like the Cache Array Routing Protocol (CARP) [16]. In a hashingsystem each requested page is mapped to exactly one proxy in the proxy array and will be either resolved by the local cache or requested from the origin server. Hashing based allocations can be widely seen as the most ideal way to find cached web pages, due to the fact that their ....

J. Cohen, N. Phadnis, V. Valloppillil, K.W.Ross, Cache array routing protocol v.1.1, Sept. 1997, Internet Draft

.... cache structures or classical hashing algorithms [4] While in the hierarchical structure unresolved requests get forwarded to sibling caches, using ICP, and to the parent cache up the hierarchy with a high number of additional querying messages, the hashing approach, like found in CARP [7], computes the exact location of the requested object and forwards the request to maximal one additional proxy minimizing the number of querying messages to one [5] 6] On the other side, the hierarchical approach leads usually to multiple copies of the same object in different locations, ....

J. Cohen, N. Phadnis, V. Valloppillil, K.W.Ross, Cache array routing protocol v.1.1, Sept. 1997, Internet Draft

....within an ISP, tradeoffs may be different depending on the pricing model. In a volume based pricing model, it may be valuable to maximize hit ratio even at the expense of latency, to reduce the inflow of outside traffic. Such environments would be better served by existing approaches (e.g. [2, 3, 5, 7, 8], and many commercial products) Given that there is little value in distant hits, our observation is that, in this type of environment, the system should not try to maximize the global hit ratio. Consequently, instead of paying the overhead for maintaining global location information of cached ....

....is how a cache that received a request for an object it does not have finds out if any other cache has it before declaring a global miss. The three main existing approaches include broadcast probe, exemplified by Harvest [2] and Squid [4] hash partitioning of the object namespace among caches [3] and a directory service first proposed in CRISP [8] None of these approaches scale well to inter ISP caching. Broadcast probes degrade performance of global misses. On a global miss, a cache at every level of hierarchy must wait for the slowest response from all probed nodes before proceeding ....

J. Cohen, N. Phadnis, V. Valloppillil, and K. W. Ross. Cache array routing protocol v1.1. http://ds1.internic.net/internet-drafts/draft-vinod-carp-v1-01.txt, September 1997.

....that for a caching platform contained entirely within an ISP, tradeoffs may be different. In this case, it might be valuable to to maximize hit ratio even at the expense of the latency, to reduce the inflow of outside traffic. Such environments would be better served by existing approaches (e.g. [2, 7, 6], and many commercial products) Contact author; tel. 973)360 8778. Given that there is little value in distant hits, our observation is that the system should not try to maximize the global hit ratio. Consequently, instead of paying the overhead for maintaining global location information ....

....is how a cache that received a request for an object it does not have finds out if any other cache has it before declaring a global miss. The three main existing approaches include broadcast probe, exemplified by Harvest [1] and Squid [3] hash partitioning of the object namespace among caches [2] and a directory service first proposed in CRISP [7] None of these approaches scale well to inter ISP caching. Broadcast probes degrade performance of global misses. On a global miss, a cache at every level of hierarchy must wait for the slowest response from all probed nodes before proceeding ....

J. Cohen, N. Phadnis, V. Valloppillil, and K. W. Ross. Cache array routing protocol v1.1. http://ds1.internic.net/internet-drafts/draft-vinod-carp-v1-01.txt, September 1997.

....of the object can be present in the collection of shared caches. One alternative to ICP is to use hash routing schemes to retrieve objects from a hierarchy of shared caches. Hash routing schemes for collections of Web caches have recently been proposed by several research teams [10] 8] 11] [4] [1] and one hash routing scheme forms the basis of the Cache Array Routing Protocol (CARP) defined in an Internet Draft [4] A simple hash routing scheme operates as follows. All the clients store a common hash function which maps URLs to a hash space . The hash space is partitioned and each set ....

....to retrieve objects from a hierarchy of shared caches. Hash routing schemes for collections of Web caches have recently been proposed by several research teams [10] 8] 11] 4] 1] and one hash routing scheme forms the basis of the Cache Array Routing Protocol (CARP) defined in an Internet Draft [4]. A simple hash routing scheme operates as follows. All the clients store a common hash function which maps URLs to a hash space . The hash space is partitioned and each set in the partition is associated with one of the sibling caches. When a client desires an object, it first hashes the object s ....

[Article contains additional citation context not shown here]

J. Cohen, N. Phadnis, V. Valloppillil, and K.W. Ross. Cache array routing protocol v1.1, September 1997. Internet Draft, http://dsl.internic.net/internet-drafts/draft-vinod-carp- vl-01.txt.

....of the object can be present in the collection of shared caches. One alternative to ICP is to use hash routing schemes to retrieve objects from a hierarchy of shared caches. Hash routing schemes for collections of Web caches have recently been proposed by several research teams [10] 8] 11] [4] [1] and one hash routing scheme forms the basis of the Cache Array Routing Protocol (CARP) defined in an Internet Draft [4] A simple hash routing scheme operates as follows. All the clients store a common hash function which maps URLs to a hash space 1 . The hash space is partitioned and each ....

....to retrieve objects from a hierarchy of shared caches. Hash routing schemes for collections of Web caches have recently been proposed by several research teams [10] 8] 11] 4] 1] and one hash routing scheme forms the basis of the Cache Array Routing Protocol (CARP) defined in an Internet Draft [4]. A simple hash routing scheme operates as follows. All the clients store a common hash function which maps URLs to a hash space 1 . The hash space is partitioned and each set in the partition is associated with one of the sibling caches. When a client desires an object, it first hashes the ....

[Article contains additional citation context not shown here]

J. Cohen, N. Phadnis, V. Valloppillil, and K.W. Ross. Cache array routing protocol v1.1, September 1997. Internet Draft, http://ds1.internic.net/internet-drafts/draft-vinod-carpv1 -01.txt.

No context found.

J. Cohen, N. Phadnis, V. Valloppillil, and K. W. Ross. Cache array routing protocol v1.1. http://ds1.internic.net/internet-drafts/draft-vinod-carp-v1-01.txt, September 1997.

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