Proxy caching that estimates page load delays
Do users wait less if proxy caches incorporate estimates of the current network conditions into document replacement algorithms? To answer this, we explore two new caching algorithms: (1) keep in the cache documents that take the longest to retrieve; and (2) use a hybrid of several factors, trying t...
Gespeichert in:
| Veröffentlicht in: | Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 1997-09, Vol.29 (8), p.977-986 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 986 |
|---|---|
| container_issue | 8 |
| container_start_page | 977 |
| container_title | Computer networks (Amsterdam, Netherlands : 1999) |
| container_volume | 29 |
| creator | Wooster, Roland P. Abrams, Marc |
| description | Do users wait less if proxy caches incorporate estimates of the current network conditions into document replacement algorithms? To answer this, we explore two new caching algorithms: (1) keep in the cache documents that take the longest to retrieve; and (2) use a hybrid of several factors, trying to keep in the cache documents from servers that take a long time to connect to, that must be loaded over the slowest Internet links, that have been referenced the most frequently, and that are small. The algorithms work by estimating the Web page download delays or proxy-to-Web server bandwidth using recent page fetches. The new algorithms are compared to the best three existing policies—LRU, LFU, and SIZE—using three measures-user response time and ability to minimize Web server loads and network bandwidth consumed—on workloads from Virginia Tech and Boston University. |
| doi_str_mv | 10.1016/S0169-7552(97)00041-X |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_57445883</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S016975529700041X</els_id><sourcerecordid>23288431</sourcerecordid><originalsourceid>FETCH-LOGICAL-c394t-e6db4ee49f7841d7f190dd4bcd45e3559b49d221d67ab829ee3aa71f1526eb723</originalsourceid><addsrcrecordid>eNqFkMtKxDAUhoMoOI4-glBERBfVnDRpmpXI4A0GFFSYXUiT07HSacekI87bm7ngwo2bczbffy4fIcdAL4FCfvUSi0qlEOxcyQtKKYd0skMGUEiWSpqrXTL4RfbJQQgfEQKQakDSZ999LxNr7HvdTpP-3fQJhr6emR5DMjdTTJrOuMRhY5bhkOxVpgl4tO1D8nZ3-zp6SMdP94-jm3FqM8X7FHNXckSuKllwcLICRZ3jpXVcYCaEKrlyjIHLpSkLphAzYyRUIFiOpWTZkJxt5s5997mI9-hZHSw2jWmxWwQtJOeiKLIInvwBP7qFb-NtGpTKKfBMRUhsIOu7EDxWeu7jg36pgeqVQb02qFd6tJJ6bVBPYu50O9wEa5rKm9bW4TfMgBZciohdbzCMRr5q9DrYGluLrvZoe-26-p9FP04Hg6Y</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>199601439</pqid></control><display><type>article</type><title>Proxy caching that estimates page load delays</title><source>Alma/SFX Local Collection</source><creator>Wooster, Roland P. ; Abrams, Marc</creator><creatorcontrib>Wooster, Roland P. ; Abrams, Marc</creatorcontrib><description>Do users wait less if proxy caches incorporate estimates of the current network conditions into document replacement algorithms? To answer this, we explore two new caching algorithms: (1) keep in the cache documents that take the longest to retrieve; and (2) use a hybrid of several factors, trying to keep in the cache documents from servers that take a long time to connect to, that must be loaded over the slowest Internet links, that have been referenced the most frequently, and that are small. The algorithms work by estimating the Web page download delays or proxy-to-Web server bandwidth using recent page fetches. The new algorithms are compared to the best three existing policies—LRU, LFU, and SIZE—using three measures-user response time and ability to minimize Web server loads and network bandwidth consumed—on workloads from Virginia Tech and Boston University.</description><identifier>ISSN: 0169-7552</identifier><identifier>ISSN: 1389-1286</identifier><identifier>EISSN: 1872-7069</identifier><identifier>DOI: 10.1016/S0169-7552(97)00041-X</identifier><identifier>CODEN: CNISE9</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Cache ; Caching ; Exact sciences and technology ; Interconnected networks ; Networks and services in france and abroad ; Proxy servers ; Servers ; Service introduction ; Studies ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; World Wide Web ; WWW</subject><ispartof>Computer networks (Amsterdam, Netherlands : 1999), 1997-09, Vol.29 (8), p.977-986</ispartof><rights>1997</rights><rights>1998 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Sep 1997</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c394t-e6db4ee49f7841d7f190dd4bcd45e3559b49d221d67ab829ee3aa71f1526eb723</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,314,780,784,789,790,23930,23931,25140,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2108475$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Wooster, Roland P.</creatorcontrib><creatorcontrib>Abrams, Marc</creatorcontrib><title>Proxy caching that estimates page load delays</title><title>Computer networks (Amsterdam, Netherlands : 1999)</title><description>Do users wait less if proxy caches incorporate estimates of the current network conditions into document replacement algorithms? To answer this, we explore two new caching algorithms: (1) keep in the cache documents that take the longest to retrieve; and (2) use a hybrid of several factors, trying to keep in the cache documents from servers that take a long time to connect to, that must be loaded over the slowest Internet links, that have been referenced the most frequently, and that are small. The algorithms work by estimating the Web page download delays or proxy-to-Web server bandwidth using recent page fetches. The new algorithms are compared to the best three existing policies—LRU, LFU, and SIZE—using three measures-user response time and ability to minimize Web server loads and network bandwidth consumed—on workloads from Virginia Tech and Boston University.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Cache</subject><subject>Caching</subject><subject>Exact sciences and technology</subject><subject>Interconnected networks</subject><subject>Networks and services in france and abroad</subject><subject>Proxy servers</subject><subject>Servers</subject><subject>Service introduction</subject><subject>Studies</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>World Wide Web</subject><subject>WWW</subject><issn>0169-7552</issn><issn>1389-1286</issn><issn>1872-7069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><recordid>eNqFkMtKxDAUhoMoOI4-glBERBfVnDRpmpXI4A0GFFSYXUiT07HSacekI87bm7ngwo2bczbffy4fIcdAL4FCfvUSi0qlEOxcyQtKKYd0skMGUEiWSpqrXTL4RfbJQQgfEQKQakDSZ999LxNr7HvdTpP-3fQJhr6emR5DMjdTTJrOuMRhY5bhkOxVpgl4tO1D8nZ3-zp6SMdP94-jm3FqM8X7FHNXckSuKllwcLICRZ3jpXVcYCaEKrlyjIHLpSkLphAzYyRUIFiOpWTZkJxt5s5997mI9-hZHSw2jWmxWwQtJOeiKLIInvwBP7qFb-NtGpTKKfBMRUhsIOu7EDxWeu7jg36pgeqVQb02qFd6tJJ6bVBPYu50O9wEa5rKm9bW4TfMgBZciohdbzCMRr5q9DrYGluLrvZoe-26-p9FP04Hg6Y</recordid><startdate>19970901</startdate><enddate>19970901</enddate><creator>Wooster, Roland P.</creator><creator>Abrams, Marc</creator><general>Elsevier B.V</general><general>Elsevier Science</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19970901</creationdate><title>Proxy caching that estimates page load delays</title><author>Wooster, Roland P. ; Abrams, Marc</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c394t-e6db4ee49f7841d7f190dd4bcd45e3559b49d221d67ab829ee3aa71f1526eb723</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Cache</topic><topic>Caching</topic><topic>Exact sciences and technology</topic><topic>Interconnected networks</topic><topic>Networks and services in france and abroad</topic><topic>Proxy servers</topic><topic>Servers</topic><topic>Service introduction</topic><topic>Studies</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>World Wide Web</topic><topic>WWW</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wooster, Roland P.</creatorcontrib><creatorcontrib>Abrams, Marc</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wooster, Roland P.</au><au>Abrams, Marc</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Proxy caching that estimates page load delays</atitle><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle><date>1997-09-01</date><risdate>1997</risdate><volume>29</volume><issue>8</issue><spage>977</spage><epage>986</epage><pages>977-986</pages><issn>0169-7552</issn><issn>1389-1286</issn><eissn>1872-7069</eissn><coden>CNISE9</coden><abstract>Do users wait less if proxy caches incorporate estimates of the current network conditions into document replacement algorithms? To answer this, we explore two new caching algorithms: (1) keep in the cache documents that take the longest to retrieve; and (2) use a hybrid of several factors, trying to keep in the cache documents from servers that take a long time to connect to, that must be loaded over the slowest Internet links, that have been referenced the most frequently, and that are small. The algorithms work by estimating the Web page download delays or proxy-to-Web server bandwidth using recent page fetches. The new algorithms are compared to the best three existing policies—LRU, LFU, and SIZE—using three measures-user response time and ability to minimize Web server loads and network bandwidth consumed—on workloads from Virginia Tech and Boston University.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0169-7552(97)00041-X</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0169-7552 |
| ispartof | Computer networks (Amsterdam, Netherlands : 1999), 1997-09, Vol.29 (8), p.977-986 |
| issn | 0169-7552 1389-1286 1872-7069 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_57445883 |
| source | Alma/SFX Local Collection |
| subjects | Algorithms Applied sciences Cache Caching Exact sciences and technology Interconnected networks Networks and services in france and abroad Proxy servers Servers Service introduction Studies Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn World Wide Web WWW |
| title | Proxy caching that estimates page load delays |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T13%3A25%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Proxy%20caching%20that%20estimates%20page%20load%20delays&rft.jtitle=Computer%20networks%20(Amsterdam,%20Netherlands%20:%201999)&rft.au=Wooster,%20Roland%20P.&rft.date=1997-09-01&rft.volume=29&rft.issue=8&rft.spage=977&rft.epage=986&rft.pages=977-986&rft.issn=0169-7552&rft.eissn=1872-7069&rft.coden=CNISE9&rft_id=info:doi/10.1016/S0169-7552(97)00041-X&rft_dat=%3Cproquest_cross%3E23288431%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=199601439&rft_id=info:pmid/&rft_els_id=S016975529700041X&rfr_iscdi=true |