Access Strategies for Network Caching

Having multiple data stores that can potentially serve content is common in modern networked applications. Data stores often publish approximate summaries of their content to enable effective utilization. Since these summaries are not entirely accurate, forming an efficient access strategy to multip...

Full description

Saved in:
Bibliographic Details
Main Authors: Cohen, Itamar, Einziger, Gil, Friedman, Roy, Scalosub, Gabriel
Format: Conference Proceeding
Language:English
Subjects:
5G mobile communication
Approximation algorithms
Data centers
Data models
Encoding
Heuristic algorithms
Risk management
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 36
container_issue
container_start_page 28
container_title
container_volume
creator Cohen, Itamar
Einziger, Gil
Friedman, Roy
Scalosub, Gabriel
description Having multiple data stores that can potentially serve content is common in modern networked applications. Data stores often publish approximate summaries of their content to enable effective utilization. Since these summaries are not entirely accurate, forming an efficient access strategy to multiple data stores becomes a complex risk management problem.This paper formally models this problem, and introduces practical algorithms with guaranteed approximation ratios, and in particular we show that our algorithms are optimal in a variety of settings. We also perform an extensive simulation study based on real data, and show that our algorithms are more robust than existing heuristics. That is, they exhibit near optimal performance in various settings whereas the efficiency of existing approaches depends upon system parameters that may change over time, or be otherwise unknown.
doi_str_mv 10.1109/INFOCOM.2019.8737427
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_8737427</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8737427</ieee_id><sourcerecordid>8737427</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-3bd8a6a52fff71374fc2134366eae8bd7d814bdb4c5f0da17cd7e59e20e9fdd43</originalsourceid><addsrcrecordid>eNotj7tOwzAUQA0SEn3wBTBkYUzw9es6YxXRUqk0Q2GuHPu6mFeRHQnx9yDR6WxH5zB2A7wB4O3dervsu_6xERzaxqJEJfCMTQGFBa5By3M2EUZB3VpUl2xayivn3KIwE3a78J5KqXZjdiMdEpUqHnO1pfH7mN-qzvmX9HmYs4vo3gtdnThjz8v7p-6h3vSrdbfY1AlQj7UcgnXGaRFjRPjriF6AVNIYcmSHgMGCGsKgvI48OEAfkHRLglMbQ1Byxq7_vYmI9l85fbj8sz8tyV-OeECa</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Access Strategies for Network Caching</title><source>IEEE Xplore All Conference Series</source><creator>Cohen, Itamar ; Einziger, Gil ; Friedman, Roy ; Scalosub, Gabriel</creator><creatorcontrib>Cohen, Itamar ; Einziger, Gil ; Friedman, Roy ; Scalosub, Gabriel</creatorcontrib><description>Having multiple data stores that can potentially serve content is common in modern networked applications. Data stores often publish approximate summaries of their content to enable effective utilization. Since these summaries are not entirely accurate, forming an efficient access strategy to multiple data stores becomes a complex risk management problem.This paper formally models this problem, and introduces practical algorithms with guaranteed approximation ratios, and in particular we show that our algorithms are optimal in a variety of settings. We also perform an extensive simulation study based on real data, and show that our algorithms are more robust than existing heuristics. That is, they exhibit near optimal performance in various settings whereas the efficiency of existing approaches depends upon system parameters that may change over time, or be otherwise unknown.</description><identifier>EISSN: 2641-9874</identifier><identifier>EISBN: 1728105153</identifier><identifier>EISBN: 9781728105154</identifier><identifier>DOI: 10.1109/INFOCOM.2019.8737427</identifier><language>eng</language><publisher>IEEE</publisher><subject>5G mobile communication ; Approximation algorithms ; Data centers ; Data models ; Encoding ; Heuristic algorithms ; Risk management</subject><ispartof>IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, 2019, p.28-36</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8737427$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,23912,23913,25122,27907,54537,54914</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8737427$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Cohen, Itamar</creatorcontrib><creatorcontrib>Einziger, Gil</creatorcontrib><creatorcontrib>Friedman, Roy</creatorcontrib><creatorcontrib>Scalosub, Gabriel</creatorcontrib><title>Access Strategies for Network Caching</title><title>IEEE INFOCOM 2019 - IEEE Conference on Computer Communications</title><addtitle>INFOCOM</addtitle><description>Having multiple data stores that can potentially serve content is common in modern networked applications. Data stores often publish approximate summaries of their content to enable effective utilization. Since these summaries are not entirely accurate, forming an efficient access strategy to multiple data stores becomes a complex risk management problem.This paper formally models this problem, and introduces practical algorithms with guaranteed approximation ratios, and in particular we show that our algorithms are optimal in a variety of settings. We also perform an extensive simulation study based on real data, and show that our algorithms are more robust than existing heuristics. That is, they exhibit near optimal performance in various settings whereas the efficiency of existing approaches depends upon system parameters that may change over time, or be otherwise unknown.</description><subject>5G mobile communication</subject><subject>Approximation algorithms</subject><subject>Data centers</subject><subject>Data models</subject><subject>Encoding</subject><subject>Heuristic algorithms</subject><subject>Risk management</subject><issn>2641-9874</issn><isbn>1728105153</isbn><isbn>9781728105154</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2019</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj7tOwzAUQA0SEn3wBTBkYUzw9es6YxXRUqk0Q2GuHPu6mFeRHQnx9yDR6WxH5zB2A7wB4O3dervsu_6xERzaxqJEJfCMTQGFBa5By3M2EUZB3VpUl2xayivn3KIwE3a78J5KqXZjdiMdEpUqHnO1pfH7mN-qzvmX9HmYs4vo3gtdnThjz8v7p-6h3vSrdbfY1AlQj7UcgnXGaRFjRPjriF6AVNIYcmSHgMGCGsKgvI48OEAfkHRLglMbQ1Byxq7_vYmI9l85fbj8sz8tyV-OeECa</recordid><startdate>201904</startdate><enddate>201904</enddate><creator>Cohen, Itamar</creator><creator>Einziger, Gil</creator><creator>Friedman, Roy</creator><creator>Scalosub, Gabriel</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201904</creationdate><title>Access Strategies for Network Caching</title><author>Cohen, Itamar ; Einziger, Gil ; Friedman, Roy ; Scalosub, Gabriel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-3bd8a6a52fff71374fc2134366eae8bd7d814bdb4c5f0da17cd7e59e20e9fdd43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2019</creationdate><topic>5G mobile communication</topic><topic>Approximation algorithms</topic><topic>Data centers</topic><topic>Data models</topic><topic>Encoding</topic><topic>Heuristic algorithms</topic><topic>Risk management</topic><toplevel>online_resources</toplevel><creatorcontrib>Cohen, Itamar</creatorcontrib><creatorcontrib>Einziger, Gil</creatorcontrib><creatorcontrib>Friedman, Roy</creatorcontrib><creatorcontrib>Scalosub, Gabriel</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></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cohen, Itamar</au><au>Einziger, Gil</au><au>Friedman, Roy</au><au>Scalosub, Gabriel</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Access Strategies for Network Caching</atitle><btitle>IEEE INFOCOM 2019 - IEEE Conference on Computer Communications</btitle><stitle>INFOCOM</stitle><date>2019-04</date><risdate>2019</risdate><spage>28</spage><epage>36</epage><pages>28-36</pages><eissn>2641-9874</eissn><eisbn>1728105153</eisbn><eisbn>9781728105154</eisbn><abstract>Having multiple data stores that can potentially serve content is common in modern networked applications. Data stores often publish approximate summaries of their content to enable effective utilization. Since these summaries are not entirely accurate, forming an efficient access strategy to multiple data stores becomes a complex risk management problem.This paper formally models this problem, and introduces practical algorithms with guaranteed approximation ratios, and in particular we show that our algorithms are optimal in a variety of settings. We also perform an extensive simulation study based on real data, and show that our algorithms are more robust than existing heuristics. That is, they exhibit near optimal performance in various settings whereas the efficiency of existing approaches depends upon system parameters that may change over time, or be otherwise unknown.</abstract><pub>IEEE</pub><doi>10.1109/INFOCOM.2019.8737427</doi><tpages>9</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISSN: 2641-9874
ispartof IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, 2019, p.28-36
issn 2641-9874
language eng
recordid cdi_ieee_primary_8737427
source IEEE Xplore All Conference Series
subjects 5G mobile communication
Approximation algorithms
Data centers
Data models
Encoding
Heuristic algorithms
Risk management
title Access Strategies for Network Caching
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T08%3A20%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Access%20Strategies%20for%20Network%20Caching&rft.btitle=IEEE%20INFOCOM%202019%20-%20IEEE%20Conference%20on%20Computer%20Communications&rft.au=Cohen,%20Itamar&rft.date=2019-04&rft.spage=28&rft.epage=36&rft.pages=28-36&rft.eissn=2641-9874&rft_id=info:doi/10.1109/INFOCOM.2019.8737427&rft.eisbn=1728105153&rft.eisbn_list=9781728105154&rft_dat=%3Cieee_CHZPO%3E8737427%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-3bd8a6a52fff71374fc2134366eae8bd7d814bdb4c5f0da17cd7e59e20e9fdd43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=8737427&rfr_iscdi=true