Self-organizing wide-area network caches

A substantial fraction of all network traffic today comes from applications in which clients retrieve objects from servers. The caching of objects in locations "close" to clients is an important technique for reducing both network traffic and response time for such applications. In this pa...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bhattacharjee, S., Calvert, K.L., Zegura, E.W.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 608 vol.2
container_issue
container_start_page 600
container_title
container_volume 2
creator Bhattacharjee, S.
Calvert, K.L.
Zegura, E.W.
description A substantial fraction of all network traffic today comes from applications in which clients retrieve objects from servers. The caching of objects in locations "close" to clients is an important technique for reducing both network traffic and response time for such applications. In this paper we consider the benefits of associating caches with switching nodes throughout the network, rather than in a few locations. We also consider the use of various self-organizing or active cache management strategies for organizing cache content. We evaluate caching techniques using both simulation and a general analytic model for network caching. Our results indicate that in-network caching can make effective use of cache space, and in many cases self-organizing caching schemes yield better average round-trip latencies than traditional approaches, using much smaller per-node caches.
doi_str_mv 10.1109/INFCOM.1998.665080
format Conference Proceeding
fullrecord <record><control><sourceid>proquest_6IE</sourceid><recordid>TN_cdi_ieee_primary_665080</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>665080</ieee_id><sourcerecordid>26788929</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2110-5c417adfb2d0a30d02fd35cc110dc735ceeb418ce9b86d41de8b3131b4810b373</originalsourceid><addsrcrecordid>eNotUE1Lw0AUXPwAa-0f6Kkn8bL1vd3NfhylWC1Ue1DBW9jsvtRomtRsS9Ffb6DOZQZmGIZhbIwwRQR3u3iez1ZPU3TOTrXOwMIJGwitkDtr1Cm7BGNBKmmlOGMDMEpy1Pr9go1S-oQeKgONdsBuXqguedutfVP9Vs16cqgicd-RnzS0O7Td1yT48EHpip2Xvk40-uche5vfv84e-XL1sJjdLXkQ_TKeBYXGx7IQEbyECKKMMguh92IwvSIqFNpArrA6KoxkC4kSC2URCmnkkF0fe7dd-72ntMs3VQpU176hdp9yoY21Trg-OD4GKyLKt1218d1PfjxD_gE0Z1Av</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>26788929</pqid></control><display><type>conference_proceeding</type><title>Self-organizing wide-area network caches</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bhattacharjee, S. ; Calvert, K.L. ; Zegura, E.W.</creator><creatorcontrib>Bhattacharjee, S. ; Calvert, K.L. ; Zegura, E.W.</creatorcontrib><description>A substantial fraction of all network traffic today comes from applications in which clients retrieve objects from servers. The caching of objects in locations "close" to clients is an important technique for reducing both network traffic and response time for such applications. In this paper we consider the benefits of associating caches with switching nodes throughout the network, rather than in a few locations. We also consider the use of various self-organizing or active cache management strategies for organizing cache content. We evaluate caching techniques using both simulation and a general analytic model for network caching. Our results indicate that in-network caching can make effective use of cache space, and in many cases self-organizing caching schemes yield better average round-trip latencies than traditional approaches, using much smaller per-node caches.</description><identifier>ISSN: 0743-166X</identifier><identifier>ISBN: 0780343832</identifier><identifier>ISBN: 9780780343832</identifier><identifier>EISSN: 2641-9874</identifier><identifier>DOI: 10.1109/INFCOM.1998.665080</identifier><language>eng</language><publisher>IEEE</publisher><subject>Analytical models ; Computer networks ; Content management ; Delay ; Educational institutions ; Network servers ; Organizing ; Telecommunication computing ; Telecommunication traffic ; Traffic control</subject><ispartof>Annual Joint Conference of the IEEE Computer and Communications Societies, 1998, Vol.2, p.600-608 vol.2</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2110-5c417adfb2d0a30d02fd35cc110dc735ceeb418ce9b86d41de8b3131b4810b373</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/665080$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,4038,4039,27912,54907</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/665080$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bhattacharjee, S.</creatorcontrib><creatorcontrib>Calvert, K.L.</creatorcontrib><creatorcontrib>Zegura, E.W.</creatorcontrib><title>Self-organizing wide-area network caches</title><title>Annual Joint Conference of the IEEE Computer and Communications Societies</title><addtitle>INFCOM</addtitle><description>A substantial fraction of all network traffic today comes from applications in which clients retrieve objects from servers. The caching of objects in locations "close" to clients is an important technique for reducing both network traffic and response time for such applications. In this paper we consider the benefits of associating caches with switching nodes throughout the network, rather than in a few locations. We also consider the use of various self-organizing or active cache management strategies for organizing cache content. We evaluate caching techniques using both simulation and a general analytic model for network caching. Our results indicate that in-network caching can make effective use of cache space, and in many cases self-organizing caching schemes yield better average round-trip latencies than traditional approaches, using much smaller per-node caches.</description><subject>Analytical models</subject><subject>Computer networks</subject><subject>Content management</subject><subject>Delay</subject><subject>Educational institutions</subject><subject>Network servers</subject><subject>Organizing</subject><subject>Telecommunication computing</subject><subject>Telecommunication traffic</subject><subject>Traffic control</subject><issn>0743-166X</issn><issn>2641-9874</issn><isbn>0780343832</isbn><isbn>9780780343832</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1998</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotUE1Lw0AUXPwAa-0f6Kkn8bL1vd3NfhylWC1Ue1DBW9jsvtRomtRsS9Ffb6DOZQZmGIZhbIwwRQR3u3iez1ZPU3TOTrXOwMIJGwitkDtr1Cm7BGNBKmmlOGMDMEpy1Pr9go1S-oQeKgONdsBuXqguedutfVP9Vs16cqgicd-RnzS0O7Td1yT48EHpip2Xvk40-uche5vfv84e-XL1sJjdLXkQ_TKeBYXGx7IQEbyECKKMMguh92IwvSIqFNpArrA6KoxkC4kSC2URCmnkkF0fe7dd-72ntMs3VQpU176hdp9yoY21Trg-OD4GKyLKt1218d1PfjxD_gE0Z1Av</recordid><startdate>1998</startdate><enddate>1998</enddate><creator>Bhattacharjee, S.</creator><creator>Calvert, K.L.</creator><creator>Zegura, E.W.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>1998</creationdate><title>Self-organizing wide-area network caches</title><author>Bhattacharjee, S. ; Calvert, K.L. ; Zegura, E.W.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2110-5c417adfb2d0a30d02fd35cc110dc735ceeb418ce9b86d41de8b3131b4810b373</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Analytical models</topic><topic>Computer networks</topic><topic>Content management</topic><topic>Delay</topic><topic>Educational institutions</topic><topic>Network servers</topic><topic>Organizing</topic><topic>Telecommunication computing</topic><topic>Telecommunication traffic</topic><topic>Traffic control</topic><toplevel>online_resources</toplevel><creatorcontrib>Bhattacharjee, S.</creatorcontrib><creatorcontrib>Calvert, K.L.</creatorcontrib><creatorcontrib>Zegura, E.W.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</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></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bhattacharjee, S.</au><au>Calvert, K.L.</au><au>Zegura, E.W.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Self-organizing wide-area network caches</atitle><btitle>Annual Joint Conference of the IEEE Computer and Communications Societies</btitle><stitle>INFCOM</stitle><date>1998</date><risdate>1998</risdate><volume>2</volume><spage>600</spage><epage>608 vol.2</epage><pages>600-608 vol.2</pages><issn>0743-166X</issn><eissn>2641-9874</eissn><isbn>0780343832</isbn><isbn>9780780343832</isbn><abstract>A substantial fraction of all network traffic today comes from applications in which clients retrieve objects from servers. The caching of objects in locations "close" to clients is an important technique for reducing both network traffic and response time for such applications. In this paper we consider the benefits of associating caches with switching nodes throughout the network, rather than in a few locations. We also consider the use of various self-organizing or active cache management strategies for organizing cache content. We evaluate caching techniques using both simulation and a general analytic model for network caching. Our results indicate that in-network caching can make effective use of cache space, and in many cases self-organizing caching schemes yield better average round-trip latencies than traditional approaches, using much smaller per-node caches.</abstract><pub>IEEE</pub><doi>10.1109/INFCOM.1998.665080</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0743-166X
ispartof Annual Joint Conference of the IEEE Computer and Communications Societies, 1998, Vol.2, p.600-608 vol.2
issn 0743-166X
2641-9874
language eng
recordid cdi_ieee_primary_665080
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Analytical models
Computer networks
Content management
Delay
Educational institutions
Network servers
Organizing
Telecommunication computing
Telecommunication traffic
Traffic control
title Self-organizing wide-area network caches
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T16%3A34%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Self-organizing%20wide-area%20network%20caches&rft.btitle=Annual%20Joint%20Conference%20of%20the%20IEEE%20Computer%20and%20Communications%20Societies&rft.au=Bhattacharjee,%20S.&rft.date=1998&rft.volume=2&rft.spage=600&rft.epage=608%20vol.2&rft.pages=600-608%20vol.2&rft.issn=0743-166X&rft.eissn=2641-9874&rft.isbn=0780343832&rft.isbn_list=9780780343832&rft_id=info:doi/10.1109/INFCOM.1998.665080&rft_dat=%3Cproquest_6IE%3E26788929%3C/proquest_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=26788929&rft_id=info:pmid/&rft_ieee_id=665080&rfr_iscdi=true