The Experts below are selected from a list of 8379 Experts worldwide ranked by ideXlab platform

Kc Claffy - One of the best experts on this subject based on the ideXlab platform.

  • icp and the squid web Cache
    IEEE Journal on Selected Areas in Communications, 1998
    Co-Authors: Duane Wessels, Kc Claffy
    Abstract:

    We describe the structure and functionality of the Internet Cache protocol (ICP) and its implementation in the Squid web caching software. ICP is a lightweight message format used for communication among Web Caches. Caches exchange ICP queries and replies to gather information to use in selecting the most appropriate location from which to retrieve an object. We present background on the history of ICP, and discuss issues in ICP deployment, efficiency, security, and interaction with other aspects of Web traffic behavior. We catalog successes, failures, and lessons learned from using ICP to deploy a global Web Cache hierarchy.

  • Internet Cache protocol icp version 2
    RFC 2186, 1997
    Co-Authors: Deborah Wessels, Kc Claffy
    Abstract:

    This document describes version 2 of the Internet Cache Protocol (ICPv2) as currently implemented in two World-Wide Web proxy Cache packages[3,5]. ICP is a lightweight message format used for communicating among Web Caches. ICP is used to exchange hints about the existence of URLs in neighbor Caches. Caches exchange ICP queries and replies to gather information to use in selecting the most appropriate location from which to retrieve an object.

  • application of Internet Cache protocol icp version 2
    RFC2186, 1997
    Co-Authors: Deborah Wessels, Kc Claffy
    Abstract:

    This document describes the application of ICPv2 (Internet Cache Protocol version 2, RFC2186) to Web caching. ICPv2 is a lightweight message format used for communication among Web Caches. Several independent caching implementations now use ICP[3,5], making it important to codify the existing practical uses of ICP for those trying to implement, deploy, and extend its use.

Andrei Z Broder - One of the best experts on this subject based on the ideXlab platform.

  • summary Cache a scalable wide area web Cache sharing protocol
    IEEE ACM Transactions on Networking, 2000
    Co-Authors: Li Fan, Pei Cao, Jussara M Almeida, Andrei Z Broder
    Abstract:

    The sharing of Caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we demonstrate the benefits of Cache sharing, measure the overhead of the existing protocols, and propose a new protocol called "summary Cache". In this new protocol, each proxy keeps a summary of the Cache directory of each participating proxy, and checks these summaries for potential hits before sending any queries. Two factors contribute to our protocol's low overhead: the summaries are updated only periodically, and the directory representations are very economical, as low as 8 bits per entry. Using trace-driven simulations and a prototype implementation, we show that, compared to existing protocols such as the Internet Cache protocol (ICP), summary Cache reduces the number of interCache protocol messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, eliminates 30% to 95% of the protocol CPU overhead, all while maintaining almost the same Cache hit ratios as ICP. Hence summary Cache scales to a large number of proxies. (This paper is a revision of Fan et al. 1998; we add more data and analysis in this version.).

  • summary Cache a scalable wide area web Cache sharing protocol
    ACM Special Interest Group on Data Communication, 1998
    Co-Authors: Li Fan, Pei Cao, Jussara M Almeida, Andrei Z Broder
    Abstract:

    The sharing of Caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we propose a new protocol called "Summary Cache"; each proxy keeps a summary of the URLs of Cached documents of each participating proxy and checks these summaries for potential hits before sending any queries. Two factors contribute to the low overhead: the summaries are updated only periodically, and the summary representations are economical --- as low as 8 bits per entry. Using trace-driven simulations and a prototype implementation, we show that compared to the existing Internet Cache Protocol (ICP), Summary Cache reduces the number of inter-Cache messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, and eliminates between 30% to 95% of the CPU overhead, while at the same time maintaining almost the same hit ratio as ICP. Hence Summary Cache enables Cache sharing among a large number of proxies.

Ali R. Hurson - One of the best experts on this subject based on the ideXlab platform.

  • Quality of service (QoS) in Internet Cache coherence
    2005
    Co-Authors: John Sustersic, Ali R. Hurson
    Abstract:

    Caching has long been employed in computer systems to improve performance at the expense of additional complexity in memory organisation and management. The coherence schemes developed for traditional large-scale systems (CC-NUMA) fail when applied to the vastness of today's mobile Internet. A quality of service (QoS) approach is ideally suited for a general-purpose Internet Cache coherence protocol, providing strong consistency when needed while permitting weaker consistency for less critical data. An inexpensive, QOS solution to Internet Cache coherence is presented, and an experimental framework is outlined to verify the potential of the proposed scheme as a viable coherence solution for general Internet applications.

  • a quality of service qos implementation of Internet Cache coherence
    Advanced Information Networking and Applications, 2004
    Co-Authors: John Sustersic, Ali R. Hurson
    Abstract:

    Caching has long been employed in computer system architectures to improve performance in terms of reduced memory access times and latencies and hence, to improve throughput at the expense of additional complexity in memory organization and of managing multiple copies of shared data. In traditional large-scale computer architectures, the Cache coherency schemes developed permit very large, Cache-coherent non-uniform memory access (CC-NUMA) to shared memory spaces. However, these approaches fail when applied to the vastness of the Internet and the growing complexities introduced by mobility. While caching has been successfully employed in specific, limited applications in modern Internet implementations, there has been no general-purpose approach to Cache coherency on the Internet. A quality-of-service (QOS) approach is ideally suited for such a general-purpose Cache coherence protocol, providing strong consistency for those data items that require it while permitting weaker consistency for less critical data. A statistical analysis of the read/write behavior of typical Internet data is used to suggest a low overhead, inexpensive QOS solution to Cache coherency issues on the Internet. An experimental framework studies and verifies the potential of the proposed scheme as a viable solution to Cache coherence on both wired and wireless Internet applications.

Deborah Wessels - One of the best experts on this subject based on the ideXlab platform.

  • Internet Cache protocol icp version 2
    RFC 2186, 1997
    Co-Authors: Deborah Wessels, Kc Claffy
    Abstract:

    This document describes version 2 of the Internet Cache Protocol (ICPv2) as currently implemented in two World-Wide Web proxy Cache packages[3,5]. ICP is a lightweight message format used for communicating among Web Caches. ICP is used to exchange hints about the existence of URLs in neighbor Caches. Caches exchange ICP queries and replies to gather information to use in selecting the most appropriate location from which to retrieve an object.

  • application of Internet Cache protocol icp version 2
    RFC2186, 1997
    Co-Authors: Deborah Wessels, Kc Claffy
    Abstract:

    This document describes the application of ICPv2 (Internet Cache Protocol version 2, RFC2186) to Web caching. ICPv2 is a lightweight message format used for communication among Web Caches. Several independent caching implementations now use ICP[3,5], making it important to codify the existing practical uses of ICP for those trying to implement, deploy, and extend its use.

Li Fan - One of the best experts on this subject based on the ideXlab platform.

  • summary Cache a scalable wide area web Cache sharing protocol
    IEEE ACM Transactions on Networking, 2000
    Co-Authors: Li Fan, Pei Cao, Jussara M Almeida, Andrei Z Broder
    Abstract:

    The sharing of Caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we demonstrate the benefits of Cache sharing, measure the overhead of the existing protocols, and propose a new protocol called "summary Cache". In this new protocol, each proxy keeps a summary of the Cache directory of each participating proxy, and checks these summaries for potential hits before sending any queries. Two factors contribute to our protocol's low overhead: the summaries are updated only periodically, and the directory representations are very economical, as low as 8 bits per entry. Using trace-driven simulations and a prototype implementation, we show that, compared to existing protocols such as the Internet Cache protocol (ICP), summary Cache reduces the number of interCache protocol messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, eliminates 30% to 95% of the protocol CPU overhead, all while maintaining almost the same Cache hit ratios as ICP. Hence summary Cache scales to a large number of proxies. (This paper is a revision of Fan et al. 1998; we add more data and analysis in this version.).

  • summary Cache a scalable wide area web Cache sharing protocol
    ACM Special Interest Group on Data Communication, 1998
    Co-Authors: Li Fan, Pei Cao, Jussara M Almeida, Andrei Z Broder
    Abstract:

    The sharing of Caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we propose a new protocol called "Summary Cache"; each proxy keeps a summary of the URLs of Cached documents of each participating proxy and checks these summaries for potential hits before sending any queries. Two factors contribute to the low overhead: the summaries are updated only periodically, and the summary representations are economical --- as low as 8 bits per entry. Using trace-driven simulations and a prototype implementation, we show that compared to the existing Internet Cache Protocol (ICP), Summary Cache reduces the number of inter-Cache messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, and eliminates between 30% to 95% of the CPU overhead, while at the same time maintaining almost the same hit ratio as ICP. Hence Summary Cache enables Cache sharing among a large number of proxies.