Hash routing for collections of shared web caches

Keith Ross

    Research output: Contribution to journalArticle

    Abstract

    Shored Web coches, also referred to as proxy Web servers, allow multiple clients to quickly access a pool of popular Web pages. An organization that provides shored caching to its Web clients will typically have a collection of shared caches rather than just one. For collections of shared caches, it is desirable to coordinate the caches so that all cached pages in the collection are shared among the organization's clients. In this article we investigate two classes of protocols for coordinating a collection of shared caches: the ICP protocol, which has caches ping each other to locate a cached object; and the hash routing protocols, which place objects in the shared coches as a function of the objects' URLs. Our contribution is twofold. First, we compare the performance of the protocols with respect to cache-server overhead and object retrieval latency; for a collection of shared coches, our analysis shows that the hash-routing schemes have significant performance advantages over ICP for both of the performance metrics. The existing hash-routing protocols assume that the cache servers are homogeneous in storage capacity and processing capability, even though most collections of cache servers are vastly heterogeneous. Our second contribution is to extend a robust hash-routing scheme so that it balonces requests among the caches according to any desired distribution; the extended hash-routing scheme is robust in the face of cache failures, is tunable for heterogeneous coches, and can have significant performance advantages over ICP.

    Original languageEnglish (US)
    Pages (from-to)37-44
    Number of pages8
    JournalIEEE Network
    Volume11
    Issue number6
    DOIs
    StatePublished - Nov 1997

    Fingerprint

    Servers
    Routing protocols
    Network protocols
    Websites
    Processing

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Hardware and Architecture
    • Information Systems
    • Electrical and Electronic Engineering

    Cite this

    Hash routing for collections of shared web caches. / Ross, Keith.

    In: IEEE Network, Vol. 11, No. 6, 11.1997, p. 37-44.

    Research output: Contribution to journalArticle

    Ross, Keith. / Hash routing for collections of shared web caches. In: IEEE Network. 1997 ; Vol. 11, No. 6. pp. 37-44.
    @article{48cec0354b124342b899fc396b29728f,
    title = "Hash routing for collections of shared web caches",
    abstract = "Shored Web coches, also referred to as proxy Web servers, allow multiple clients to quickly access a pool of popular Web pages. An organization that provides shored caching to its Web clients will typically have a collection of shared caches rather than just one. For collections of shared caches, it is desirable to coordinate the caches so that all cached pages in the collection are shared among the organization's clients. In this article we investigate two classes of protocols for coordinating a collection of shared caches: the ICP protocol, which has caches ping each other to locate a cached object; and the hash routing protocols, which place objects in the shared coches as a function of the objects' URLs. Our contribution is twofold. First, we compare the performance of the protocols with respect to cache-server overhead and object retrieval latency; for a collection of shared coches, our analysis shows that the hash-routing schemes have significant performance advantages over ICP for both of the performance metrics. The existing hash-routing protocols assume that the cache servers are homogeneous in storage capacity and processing capability, even though most collections of cache servers are vastly heterogeneous. Our second contribution is to extend a robust hash-routing scheme so that it balonces requests among the caches according to any desired distribution; the extended hash-routing scheme is robust in the face of cache failures, is tunable for heterogeneous coches, and can have significant performance advantages over ICP.",
    author = "Keith Ross",
    year = "1997",
    month = "11",
    doi = "10.1109/65.642358",
    language = "English (US)",
    volume = "11",
    pages = "37--44",
    journal = "IEEE Network",
    issn = "0890-8044",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "6",

    }

    TY - JOUR

    T1 - Hash routing for collections of shared web caches

    AU - Ross, Keith

    PY - 1997/11

    Y1 - 1997/11

    N2 - Shored Web coches, also referred to as proxy Web servers, allow multiple clients to quickly access a pool of popular Web pages. An organization that provides shored caching to its Web clients will typically have a collection of shared caches rather than just one. For collections of shared caches, it is desirable to coordinate the caches so that all cached pages in the collection are shared among the organization's clients. In this article we investigate two classes of protocols for coordinating a collection of shared caches: the ICP protocol, which has caches ping each other to locate a cached object; and the hash routing protocols, which place objects in the shared coches as a function of the objects' URLs. Our contribution is twofold. First, we compare the performance of the protocols with respect to cache-server overhead and object retrieval latency; for a collection of shared coches, our analysis shows that the hash-routing schemes have significant performance advantages over ICP for both of the performance metrics. The existing hash-routing protocols assume that the cache servers are homogeneous in storage capacity and processing capability, even though most collections of cache servers are vastly heterogeneous. Our second contribution is to extend a robust hash-routing scheme so that it balonces requests among the caches according to any desired distribution; the extended hash-routing scheme is robust in the face of cache failures, is tunable for heterogeneous coches, and can have significant performance advantages over ICP.

    AB - Shored Web coches, also referred to as proxy Web servers, allow multiple clients to quickly access a pool of popular Web pages. An organization that provides shored caching to its Web clients will typically have a collection of shared caches rather than just one. For collections of shared caches, it is desirable to coordinate the caches so that all cached pages in the collection are shared among the organization's clients. In this article we investigate two classes of protocols for coordinating a collection of shared caches: the ICP protocol, which has caches ping each other to locate a cached object; and the hash routing protocols, which place objects in the shared coches as a function of the objects' URLs. Our contribution is twofold. First, we compare the performance of the protocols with respect to cache-server overhead and object retrieval latency; for a collection of shared coches, our analysis shows that the hash-routing schemes have significant performance advantages over ICP for both of the performance metrics. The existing hash-routing protocols assume that the cache servers are homogeneous in storage capacity and processing capability, even though most collections of cache servers are vastly heterogeneous. Our second contribution is to extend a robust hash-routing scheme so that it balonces requests among the caches according to any desired distribution; the extended hash-routing scheme is robust in the face of cache failures, is tunable for heterogeneous coches, and can have significant performance advantages over ICP.

    UR - http://www.scopus.com/inward/record.url?scp=0031268167&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0031268167&partnerID=8YFLogxK

    U2 - 10.1109/65.642358

    DO - 10.1109/65.642358

    M3 - Article

    VL - 11

    SP - 37

    EP - 44

    JO - IEEE Network

    JF - IEEE Network

    SN - 0890-8044

    IS - 6

    ER -