Loading…
Single vs Distributed Edge Caching for Dynamic Content
Existing content caching mechanisms are predominantly geared towards easy-access to content that is static once created. However, numerous applications, such as news and dynamic sources with time-varying states, generate 'dynamic' content where new updates replace previous versions. This m...
Saved in:
Published in: | IEEE/ACM transactions on networking 2022-04, Vol.30 (2), p.669-682 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c336t-acb5fae0b8984768f2146f33e3e8eb5acbc69ab5052f85058cd0a64ebab321a73 |
---|---|
cites | cdi_FETCH-LOGICAL-c336t-acb5fae0b8984768f2146f33e3e8eb5acbc69ab5052f85058cd0a64ebab321a73 |
container_end_page | 682 |
container_issue | 2 |
container_start_page | 669 |
container_title | IEEE/ACM transactions on networking |
container_volume | 30 |
creator | Abolhassani, Bahman Tadrous, John Eryilmaz, Atilla |
description | Existing content caching mechanisms are predominantly geared towards easy-access to content that is static once created. However, numerous applications, such as news and dynamic sources with time-varying states, generate 'dynamic' content where new updates replace previous versions. This motivates us in this work to study the freshness-driven caching algorithm for dynamic content, which accounts for the changing nature of data content. In particular, we provide new models and analyses of the average operational cost both for the single and distributed edge caching scenarios. In both scenarios, we characterize the performance of the optimal solution and develop algorithms to select the content and the update rate that the user(s) must employ to have low-cost access to fresh content. Moreover, our work reveals new and easy-to-calculate key metrics for quantifying the caching value of dynamic content in terms of their refresh rates, popularity, number of users in the distribute edge caching group, and the fetching and update costs associated with the optimal decisions. We compare the proposed freshness-driven caching strategies with benchmark caching strategies like cache the most popular content. Results demonstrate that freshness-driven caching strategies considerably enhance the utilization of the edge caches with possibly orders-of-magnitude cost reduction. Furthermore, our investigations reveal that the distributed edge caching scenario, benefiting from the multicasting property of wireless service to update the cached content, can be cost-effective compared to the single edge caching, as the number of edge caches increases. |
doi_str_mv | 10.1109/TNET.2021.3121098 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2650298321</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9596584</ieee_id><sourcerecordid>2650298321</sourcerecordid><originalsourceid>FETCH-LOGICAL-c336t-acb5fae0b8984768f2146f33e3e8eb5acbc69ab5052f85058cd0a64ebab321a73</originalsourceid><addsrcrecordid>eNo9kE9PAjEQxRujiYh-AOOliefF_tkO3aNZQE2IHsRz05YpLoFdbBcTvr0lEC8zk3nvzSQ_Qu45G3HOqqfF-3QxEkzwkeQiL_QFGXCldCEUwGWeGcgCoBLX5CalNWNcMgEDAp9Nu9og_U100qQ-Nm7f45JOlyuktfXfWaWhi3RyaO228bTu2h7b_pZcBbtJeHfuQ_I1my7q12L-8fJWP88LLyX0hfVOBYvM6UqXY9BB8BKClChRo1NZ9lBZp5gSQeeq_ZJZKNFZJwW3Yzkkj6e7u9j97DH1Zt3tY5tfGgGKiUpnX3bxk8vHLqWIwexis7XxYDgzRzzmiMcc8Zgznpx5OGUaRPz3V6oCpUv5B8E3X-8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2650298321</pqid></control><display><type>article</type><title>Single vs Distributed Edge Caching for Dynamic Content</title><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><source>IEEE Xplore (Online service)</source><creator>Abolhassani, Bahman ; Tadrous, John ; Eryilmaz, Atilla</creator><creatorcontrib>Abolhassani, Bahman ; Tadrous, John ; Eryilmaz, Atilla</creatorcontrib><description>Existing content caching mechanisms are predominantly geared towards easy-access to content that is static once created. However, numerous applications, such as news and dynamic sources with time-varying states, generate 'dynamic' content where new updates replace previous versions. This motivates us in this work to study the freshness-driven caching algorithm for dynamic content, which accounts for the changing nature of data content. In particular, we provide new models and analyses of the average operational cost both for the single and distributed edge caching scenarios. In both scenarios, we characterize the performance of the optimal solution and develop algorithms to select the content and the update rate that the user(s) must employ to have low-cost access to fresh content. Moreover, our work reveals new and easy-to-calculate key metrics for quantifying the caching value of dynamic content in terms of their refresh rates, popularity, number of users in the distribute edge caching group, and the fetching and update costs associated with the optimal decisions. We compare the proposed freshness-driven caching strategies with benchmark caching strategies like cache the most popular content. Results demonstrate that freshness-driven caching strategies considerably enhance the utilization of the edge caches with possibly orders-of-magnitude cost reduction. Furthermore, our investigations reveal that the distributed edge caching scenario, benefiting from the multicasting property of wireless service to update the cached content, can be cost-effective compared to the single edge caching, as the number of edge caches increases.</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/TNET.2021.3121098</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Caching ; Cost analysis ; Costs ; Distributed databases ; dynamic content ; Freshness ; IEEE transactions ; Measurement ; Multicast algorithms ; Multicast communication ; Operating costs ; Wireless communication ; Wireless content distribution</subject><ispartof>IEEE/ACM transactions on networking, 2022-04, Vol.30 (2), p.669-682</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c336t-acb5fae0b8984768f2146f33e3e8eb5acbc69ab5052f85058cd0a64ebab321a73</citedby><cites>FETCH-LOGICAL-c336t-acb5fae0b8984768f2146f33e3e8eb5acbc69ab5052f85058cd0a64ebab321a73</cites><orcidid>0000-0001-5560-5806 ; 0000-0003-4758-6996</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9596584$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Abolhassani, Bahman</creatorcontrib><creatorcontrib>Tadrous, John</creatorcontrib><creatorcontrib>Eryilmaz, Atilla</creatorcontrib><title>Single vs Distributed Edge Caching for Dynamic Content</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>Existing content caching mechanisms are predominantly geared towards easy-access to content that is static once created. However, numerous applications, such as news and dynamic sources with time-varying states, generate 'dynamic' content where new updates replace previous versions. This motivates us in this work to study the freshness-driven caching algorithm for dynamic content, which accounts for the changing nature of data content. In particular, we provide new models and analyses of the average operational cost both for the single and distributed edge caching scenarios. In both scenarios, we characterize the performance of the optimal solution and develop algorithms to select the content and the update rate that the user(s) must employ to have low-cost access to fresh content. Moreover, our work reveals new and easy-to-calculate key metrics for quantifying the caching value of dynamic content in terms of their refresh rates, popularity, number of users in the distribute edge caching group, and the fetching and update costs associated with the optimal decisions. We compare the proposed freshness-driven caching strategies with benchmark caching strategies like cache the most popular content. Results demonstrate that freshness-driven caching strategies considerably enhance the utilization of the edge caches with possibly orders-of-magnitude cost reduction. Furthermore, our investigations reveal that the distributed edge caching scenario, benefiting from the multicasting property of wireless service to update the cached content, can be cost-effective compared to the single edge caching, as the number of edge caches increases.</description><subject>Algorithms</subject><subject>Caching</subject><subject>Cost analysis</subject><subject>Costs</subject><subject>Distributed databases</subject><subject>dynamic content</subject><subject>Freshness</subject><subject>IEEE transactions</subject><subject>Measurement</subject><subject>Multicast algorithms</subject><subject>Multicast communication</subject><subject>Operating costs</subject><subject>Wireless communication</subject><subject>Wireless content distribution</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNo9kE9PAjEQxRujiYh-AOOliefF_tkO3aNZQE2IHsRz05YpLoFdbBcTvr0lEC8zk3nvzSQ_Qu45G3HOqqfF-3QxEkzwkeQiL_QFGXCldCEUwGWeGcgCoBLX5CalNWNcMgEDAp9Nu9og_U100qQ-Nm7f45JOlyuktfXfWaWhi3RyaO228bTu2h7b_pZcBbtJeHfuQ_I1my7q12L-8fJWP88LLyX0hfVOBYvM6UqXY9BB8BKClChRo1NZ9lBZp5gSQeeq_ZJZKNFZJwW3Yzkkj6e7u9j97DH1Zt3tY5tfGgGKiUpnX3bxk8vHLqWIwexis7XxYDgzRzzmiMcc8Zgznpx5OGUaRPz3V6oCpUv5B8E3X-8</recordid><startdate>202204</startdate><enddate>202204</enddate><creator>Abolhassani, Bahman</creator><creator>Tadrous, John</creator><creator>Eryilmaz, Atilla</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-5560-5806</orcidid><orcidid>https://orcid.org/0000-0003-4758-6996</orcidid></search><sort><creationdate>202204</creationdate><title>Single vs Distributed Edge Caching for Dynamic Content</title><author>Abolhassani, Bahman ; Tadrous, John ; Eryilmaz, Atilla</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c336t-acb5fae0b8984768f2146f33e3e8eb5acbc69ab5052f85058cd0a64ebab321a73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Caching</topic><topic>Cost analysis</topic><topic>Costs</topic><topic>Distributed databases</topic><topic>dynamic content</topic><topic>Freshness</topic><topic>IEEE transactions</topic><topic>Measurement</topic><topic>Multicast algorithms</topic><topic>Multicast communication</topic><topic>Operating costs</topic><topic>Wireless communication</topic><topic>Wireless content distribution</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Abolhassani, Bahman</creatorcontrib><creatorcontrib>Tadrous, John</creatorcontrib><creatorcontrib>Eryilmaz, Atilla</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore (Online service)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & 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><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Abolhassani, Bahman</au><au>Tadrous, John</au><au>Eryilmaz, Atilla</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Single vs Distributed Edge Caching for Dynamic Content</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>2022-04</date><risdate>2022</risdate><volume>30</volume><issue>2</issue><spage>669</spage><epage>682</epage><pages>669-682</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>Existing content caching mechanisms are predominantly geared towards easy-access to content that is static once created. However, numerous applications, such as news and dynamic sources with time-varying states, generate 'dynamic' content where new updates replace previous versions. This motivates us in this work to study the freshness-driven caching algorithm for dynamic content, which accounts for the changing nature of data content. In particular, we provide new models and analyses of the average operational cost both for the single and distributed edge caching scenarios. In both scenarios, we characterize the performance of the optimal solution and develop algorithms to select the content and the update rate that the user(s) must employ to have low-cost access to fresh content. Moreover, our work reveals new and easy-to-calculate key metrics for quantifying the caching value of dynamic content in terms of their refresh rates, popularity, number of users in the distribute edge caching group, and the fetching and update costs associated with the optimal decisions. We compare the proposed freshness-driven caching strategies with benchmark caching strategies like cache the most popular content. Results demonstrate that freshness-driven caching strategies considerably enhance the utilization of the edge caches with possibly orders-of-magnitude cost reduction. Furthermore, our investigations reveal that the distributed edge caching scenario, benefiting from the multicasting property of wireless service to update the cached content, can be cost-effective compared to the single edge caching, as the number of edge caches increases.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TNET.2021.3121098</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0001-5560-5806</orcidid><orcidid>https://orcid.org/0000-0003-4758-6996</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1063-6692 |
ispartof | IEEE/ACM transactions on networking, 2022-04, Vol.30 (2), p.669-682 |
issn | 1063-6692 1558-2566 |
language | eng |
recordid | cdi_proquest_journals_2650298321 |
source | Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list); IEEE Xplore (Online service) |
subjects | Algorithms Caching Cost analysis Costs Distributed databases dynamic content Freshness IEEE transactions Measurement Multicast algorithms Multicast communication Operating costs Wireless communication Wireless content distribution |
title | Single vs Distributed Edge Caching for Dynamic Content |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T13%3A41%3A45IST&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=Single%20vs%20Distributed%20Edge%20Caching%20for%20Dynamic%20Content&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Abolhassani,%20Bahman&rft.date=2022-04&rft.volume=30&rft.issue=2&rft.spage=669&rft.epage=682&rft.pages=669-682&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/TNET.2021.3121098&rft_dat=%3Cproquest_cross%3E2650298321%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c336t-acb5fae0b8984768f2146f33e3e8eb5acbc69ab5052f85058cd0a64ebab321a73%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2650298321&rft_id=info:pmid/&rft_ieee_id=9596584&rfr_iscdi=true |