Hash routing for collections of shared Web caches
Shared Web caches, also referred to as proxy Web servers, allow multiple clients to quickly access a pool of popular Web pages. An organization that provides shared caching to its Web clients will typically have a collection of shared caches rather than just one. For collections of shared caches, it...
Saved in:
Published in: | IEEE network Vol. 11; no. 6; pp. 37 - 44 |
---|---|
Main Author: | |
Format: | Journal Article |
Language: | English |
Published: |
New York
IEEE
01-11-1997
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Abstract | Shared Web caches, also referred to as proxy Web servers, allow multiple clients to quickly access a pool of popular Web pages. An organization that provides shared 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 caches 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 caches, 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 balances 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 caches, and can have significant performance advantages over ICP. |
---|---|
AbstractList | Shared Web caches, also referred to as proxy Web servers, allow multiple clients to quickly access a pool of popular Web pages. An organization that provides shared 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 caches 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 caches, 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 balances 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 caches, and can have significant performance advantages over ICP Ross extends a robust hash-routing scheme so that it balances requests among the caches according to any desired distribution. Shared Web caches, also referred to as proxy Web servers, allow multiple clients to quickly access a pool of popular Web pages. An organization that provides shared 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 has routing protocols, which place objects in the shared caches 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 caches, 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 balances request 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 caches, and can have significant performance advantages over ICP. Shared Web caches, also referred to as proxy Web servers, allow multiple clients to quickly access a pool of popular Web pages. An organization that provides shared 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 caches 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 caches, 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 balances 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 caches, and can have significant performance advantages over ICP. |
Author | Ross, K.W. |
Author_xml | – sequence: 1 givenname: K.W. surname: Ross fullname: Ross, K.W. organization: Pennsylvania Univ., Philadelphia, PA, USA |
BookMark | eNqF0b9Lw0AUB_BDFGyrg6tTcBAcUu_ny2WUolYouCi6HZf7YVPSXL1LBv97U1IcXDq94X34wnvfKTptQ-sQuiJ4Tggu70HMgVMm5AmaECFkTgR8nqIJliXOJeb8HE1T2mBMuGB0gshSp3UWQ9_V7VfmQ8xMaBpnujq0KQs-S2sdnc0-XJUZbdYuXaAzr5vkLg9zht6fHt8Wy3z1-vyyeFjlhkPR5dx4rLXUnOsSMCtkyQEqb6z0jHFRGKpx4StSWG-pBSqNrAQBcNwSK2TJZuh2zN3F8N271KltnYxrGt260CdFSyqoKMVxKIuCMIyPQxBcUrlPvPkHN6GP7XCtosNvAWAInKG7EZkYUorOq12stzr-KILVvgsFQo1dDPZ6tLVz7s8dlr9lCIL_ |
CODEN | IENEET |
CitedBy_id | crossref_primary_10_1007_BF02944789 crossref_primary_10_1109_TNET_2019_2957075 crossref_primary_10_1109_TPDS_2005_56 crossref_primary_10_1109_TNET_2005_852881 crossref_primary_10_1016_S0169_7552_98_00246_3 crossref_primary_10_1016_S1389_1286_00_00042_6 crossref_primary_10_1109_TNET_2011_2177858 crossref_primary_10_1016_S0140_3664_00_00318_2 crossref_primary_10_1177_0037549706067079 crossref_primary_10_1109_TPDS_2007_1076 crossref_primary_10_1109_TMC_2006_15 crossref_primary_10_1016_j_jpdc_2004_06_007 crossref_primary_10_1007_s11107_011_0360_9 crossref_primary_10_1007_s00799_005_0118_z crossref_primary_10_1109_MNET_2003_1220696 crossref_primary_10_1109_MNET_2004_1301022 crossref_primary_10_1016_j_bjp_2013_12_002 crossref_primary_10_1016_j_future_2016_03_015 crossref_primary_10_1016_j_pmcj_2008_11_002 crossref_primary_10_1109_TNET_2015_2480093 crossref_primary_10_1109_TC_2010_231 crossref_primary_10_1108_10650740310467763 crossref_primary_10_1007_s11107_016_0665_9 crossref_primary_10_1109_65_681926 crossref_primary_10_1016_S0140_3664_99_00131_0 crossref_primary_10_1587_transcom_2015AMI0001 crossref_primary_10_1016_j_datak_2004_03_002 crossref_primary_10_1016_S0169_7552_98_00237_2 crossref_primary_10_1016_j_comnet_2016_04_001 crossref_primary_10_1109_JSAC_2002_801752 crossref_primary_10_1016_S1389_1286_01_00204_3 crossref_primary_10_1142_S0129626403001574 crossref_primary_10_1007_s11227_006_4671_z crossref_primary_10_1016_j_peva_2004_05_006 crossref_primary_10_1109_TNET_2007_909839 crossref_primary_10_1109_TC_2002_1009146 crossref_primary_10_1109_TPDS_2006_159 crossref_primary_10_4028_www_scientific_net_AMR_765_767_1254 crossref_primary_10_1109_TNSM_2019_2956525 crossref_primary_10_1016_j_comcom_2004_08_007 crossref_primary_10_1109_TKDE_2004_1277819 crossref_primary_10_1109_35_841844 crossref_primary_10_1145_511399_511354 crossref_primary_10_2200_S00313ED1V01Y201011CNT008 crossref_primary_10_1007_BF03179730 crossref_primary_10_1007_s10586_009_0094_y |
Cites_doi | 10.17487/rfc2068 10.17487/rfc2186 10.1109/90.663936 10.1016/0169-7552(96)00073-6 |
ContentType | Journal Article |
Copyright | Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Nov 1997 |
Copyright_xml | – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Nov 1997 |
DBID | AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D 7TB FR3 KR7 |
DOI | 10.1109/65.642358 |
DatabaseName | CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Mechanical & Transportation Engineering Abstracts Engineering Research Database Civil Engineering Abstracts |
DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Civil Engineering Abstracts Engineering Research Database Mechanical & Transportation Engineering Abstracts |
DatabaseTitleList | Computer and Information Systems Abstracts Technology Research Database Civil Engineering Abstracts Technology Research Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1558-156X |
EndPage | 44 |
ExternalDocumentID | 26161944 10_1109_65_642358 642358 |
Genre | Feature |
GroupedDBID | -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 97E AAIKC AAJGR AAMNW AASAJ AAYOK ABQJQ ABVLG ACIWK AENEX AETIX AFOGA AI. AIBXA AKJIK ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV AZLTO B-7 BEFXN BFFAM BGNUA BKEBE BKOMP BPEOZ CS3 DU5 EBS EJD F20 F5P HZ~ H~9 ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL PQQKQ RIA RIE RIG RNS TN5 VH1 XFK ZCA AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D 7TB FR3 KR7 |
ID | FETCH-LOGICAL-c467t-4cf0aa8a44a9603789466bfcd8f33457c2a07fb17dfd2d628c8b5166e4d1d5893 |
IEDL.DBID | RIE |
ISSN | 0890-8044 |
IngestDate | Sat Aug 17 03:21:39 EDT 2024 Fri Aug 16 11:42:51 EDT 2024 Fri Aug 16 22:10:50 EDT 2024 Thu Oct 10 18:00:23 EDT 2024 Fri Nov 22 01:04:01 EST 2024 Wed Jun 26 19:28:18 EDT 2024 |
IsDoiOpenAccess | false |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 6 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c467t-4cf0aa8a44a9603789466bfcd8f33457c2a07fb17dfd2d628c8b5166e4d1d5893 |
Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
OpenAccessLink | http://cis.poly.edu/~ross/papers/hash.pdf |
PQID | 223566671 |
PQPubID | 23500 |
PageCount | 8 |
ParticipantIDs | proquest_miscellaneous_26548285 proquest_miscellaneous_29252595 ieee_primary_642358 proquest_miscellaneous_28771300 proquest_journals_223566671 crossref_primary_10_1109_65_642358 |
PublicationCentury | 1900 |
PublicationDate | 1997-11-01 |
PublicationDateYYYYMMDD | 1997-11-01 |
PublicationDate_xml | – month: 11 year: 1997 text: 1997-11-01 day: 01 |
PublicationDecade | 1990 |
PublicationPlace | New York |
PublicationPlace_xml | – name: New York |
PublicationTitle | IEEE network |
PublicationTitleAbbrev | NET-M |
PublicationYear | 1997 |
Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
References | ref12 sullivan (ref9) 1997 valloppillil (ref6) 0 valloppillil (ref7) 0 ref10 (ref11) 0 ref2 chankhunthod (ref3) 0 smith (ref5) 1997 ref4 marwood (ref13) 1997 (ref8) 1996 yeager (ref1) 1996 |
References_xml | – ident: ref12 doi: 10.17487/rfc2068 – year: 0 ident: ref11 – year: 0 ident: ref6 publication-title: Hierarchical HTTP Routing Protocol contributor: fullname: valloppillil – year: 1997 ident: ref5 publication-title: Personal communication contributor: fullname: smith – year: 1996 ident: ref8 publication-title: Super Proxy Script How to Make Distributed Proxy Servers by URL Hashing – year: 1997 ident: ref13 publication-title: Squid Proxy Analysis contributor: fullname: marwood – ident: ref2 doi: 10.17487/rfc2186 – year: 1997 ident: ref9 article-title: CARP Divvies Up the Duties publication-title: PCWeek Online contributor: fullname: sullivan – ident: ref4 doi: 10.1109/90.663936 – year: 1996 ident: ref1 publication-title: Web Server Technology contributor: fullname: yeager – year: 0 ident: ref3 article-title: A Hierarchical Internet Object Cache publication-title: Proc 1996 USENIX Tech Conf contributor: fullname: chankhunthod – year: 0 ident: ref7 publication-title: Cache array routing protocol v1 0 contributor: fullname: valloppillil – ident: ref10 doi: 10.1016/0169-7552(96)00073-6 |
SSID | ssj0014532 |
Score | 1.8965638 |
Snippet | Shared Web caches, also referred to as proxy Web servers, allow multiple clients to quickly access a pool of popular Web pages. An organization that provides... Ross extends a robust hash-routing scheme so that it balances requests among the caches according to any desired distribution. |
SourceID | proquest crossref ieee |
SourceType | Aggregation Database Publisher |
StartPage | 37 |
SubjectTerms | Cache Cache memory Cache storage Delay Measurement Performance analysis Robustness Routing Routing protocols Servers Uniform resource locators Web pages Web server World Wide Web |
Title | Hash routing for collections of shared Web caches |
URI | https://ieeexplore.ieee.org/document/642358 https://www.proquest.com/docview/223566671 https://search.proquest.com/docview/26548285 https://search.proquest.com/docview/28771300 https://search.proquest.com/docview/29252595 |
Volume | 11 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELZoJxh4FBClPCzEmtaO7dgeEbTqxAIItsjxQ50S1DT_H9tJKhCoEluUXCTnfLG_8919B8C9c1pLZFUiHCsSik2RKOxkokNXByERcSRUIy9f-POHeJrTnmc71sJYa2PymZ2GyxjLN5VuwlHZzGNlwsQADLgUbanWNmBAWexFhkSojEaUdiRCGMlZxqbtiz-2nthL5dcCHHeVxdG_xnMMDjvwCB_a2T4Be7YcgYNvlIKnAC9VvYLrqgnpzNAjUhhmOuZblTWsHKxXIeUcvtsC6kDmXJ-Bt8X89XGZdG0REu1XtU1CtUNKCUWp8u4H4SJQxBdOG-EIoYzrVCHuCsyNM6nJUqFFwXCWWWqwYR6fnINhWZX2AkDCvCEhDwlDOS0SpiBSF9hgDyq8Z8jRGNz1Gss_W_aLPHoNSOYZy9vvH4NRUM1WoL876VWbd79FnXss4uFjxvEY3G6fensOQQpV2qrxIqGRfSrYDgnBeQjC7ZCQKfNuHbv8c2QTsB85aGNB4RUYbtaNvQaD2jQ30aa-AHwGydU |
link.rule.ids | 315,782,786,798,27933,27934,54767 |
linkProvider | IEEE |
linkToHtml | http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLYYHIADb8R4RohrIWmTJj0i2DQE7MIQ3Ko0D-3UopX-f5K0m0CgSdyq1pVSx00-x_ZngCtrlcqwkZGwrIgo0UUkic0i5bs6iAwnNvHVyKMXPn4X9wM659kOtTDGmJB8Zq79ZYjl60o1_qjsxmHlhIkerDHKU94Way1CBpSFbmRY-NpoTGlHI0RwdpOy6_bVH5tP6KbyawkO-8pw-18j2oGtDj6i23a-d2HFlHuw-Y1UcB_ISNZTNKsan9CMHCZFfq5DxlVZo8qieuqTztGbKZDydM71AbwOB5O7UdQ1RoiUW9c-I6osllJISqVzQBIuPEl8YZUWNkko4yqWmNuCcG11rNNYKFEwkqaGaqKZQyiHsFpWpTkClDBnStiBQl9Qi4UukkwVRBMHK5xvyHEfLucayz9a_os8-A04y1OWt9_fhz2vmoXA_O7JXLV592PUuUMjDkCmnPThYvHUWbQPU8jSVI0T8a3sY8GWSAjOfRhuiUQWM-fYseM_R3YB66PJ81P-9DB-PIGNwEgbygtPYfVz1pgz6NW6OQ_29QVEL80m |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Hash+routing+for+collections+of+shared+Web+caches&rft.jtitle=IEEE+network&rft.au=Ross%2C+K.W.&rft.date=1997-11-01&rft.pub=IEEE&rft.issn=0890-8044&rft.eissn=1558-156X&rft.volume=11&rft.issue=6&rft.spage=37&rft.epage=44&rft_id=info:doi/10.1109%2F65.642358&rft.externalDocID=642358 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0890-8044&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0890-8044&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0890-8044&client=summon |