Enhancing wireless networks with caching: Asymptotic laws, sustainability & trade-offs
We investigate on the sustainability of multihop wireless communications in the context of Information-Centric Networks, when content is replicated in caches over the network. The problem is cast in a flat wireless network for a given content popularity distribution and sized by three parameters, (i...
Gespeichert in:
| Veröffentlicht in: | Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2014-05, Vol.64, p.353-368 |
|---|---|
| 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 | 368 |
|---|---|
| container_issue | |
| container_start_page | 353 |
| container_title | Computer networks (Amsterdam, Netherlands : 1999) |
| container_volume | 64 |
| creator | Gitzenis, S. Paschos, G.S. Tassiulas, L. |
| description | We investigate on the sustainability of multihop wireless communications in the context of Information-Centric Networks, when content is replicated in caches over the network. The problem is cast in a flat wireless network for a given content popularity distribution and sized by three parameters, (i) the network size N, (ii) the content volume M and (iii) the cache capacity K per node. The objective is to select a joint replication and delivery scheme that minimizes the link traffic. Assuming the Zipf distribution about the content popularity, a law well established in the research on Internet traffic, we compute an order optimal solution, let the three size parameters jointly scale to infinity, and find the scaling laws about the link rates, ranging from ON down to o(1). Analyzing the derived laws, we determine the regimes that the network becomes sustainable subject to the scaling of the three network size parameters and the Zipf rank exponent, characterize the relative merit of network resources and identify the induced trade-offs about network expansion. |
| doi_str_mv | 10.1016/j.comnet.2014.01.012 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1519069156</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1389128614000802</els_id><sourcerecordid>3285794531</sourcerecordid><originalsourceid>FETCH-LOGICAL-c364t-aa0d827a7f237a0b3755cd64491ffc0c1752510567dac57de323af37a3f12f073</originalsourceid><addsrcrecordid>eNp9kF1LwzAUhosoOKf_wIuC6JWt-Wia1gthjPkBA2_U25CliUvtmpmTOfbvzejwUjiQkDznPZwnSS4xyjHC5V2bK7fqdcgJwkWOcCxylIxwxUnGUVkfxzut6gyTqjxNzgBahFBRkGqUfMz6peyV7T_TrfW60wBpTNo6_wXxJSxTJdUyft-nE9it1sEFq9JObuE2hQ0EaXu5sJ0Nu_QmDV42OnPGwHlyYmQH-uJwjpP3x9nb9Dmbvz69TCfzTNGyCJmUqKkIl9wQyiVaUM6YasqiqLExCinMGWEYsZI3UjHeaEqoNBGlBhODOB0nV0Pu2rvvjYYgWrfxfRwpMMN13B2zMlLFQCnvALw2Yu3tSvqdwEjsDYpWDAbF3qBAOBaJbdeHcAlKdsbvRcFfL6miQUKKyD0MnI6b_ljtBSire6WbaFQF0Tj7_6Bf9cqImg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1519069156</pqid></control><display><type>article</type><title>Enhancing wireless networks with caching: Asymptotic laws, sustainability & trade-offs</title><source>Elsevier ScienceDirect Journals</source><creator>Gitzenis, S. ; Paschos, G.S. ; Tassiulas, L.</creator><creatorcontrib>Gitzenis, S. ; Paschos, G.S. ; Tassiulas, L.</creatorcontrib><description>We investigate on the sustainability of multihop wireless communications in the context of Information-Centric Networks, when content is replicated in caches over the network. The problem is cast in a flat wireless network for a given content popularity distribution and sized by three parameters, (i) the network size N, (ii) the content volume M and (iii) the cache capacity K per node. The objective is to select a joint replication and delivery scheme that minimizes the link traffic. Assuming the Zipf distribution about the content popularity, a law well established in the research on Internet traffic, we compute an order optimal solution, let the three size parameters jointly scale to infinity, and find the scaling laws about the link rates, ranging from ON down to o(1). Analyzing the derived laws, we determine the regimes that the network becomes sustainable subject to the scaling of the three network size parameters and the Zipf rank exponent, characterize the relative merit of network resources and identify the induced trade-offs about network expansion.</description><identifier>ISSN: 1389-1286</identifier><identifier>EISSN: 1872-7069</identifier><identifier>DOI: 10.1016/j.comnet.2014.01.012</identifier><language>eng</language><publisher>Kidlington: Elsevier B.V</publisher><subject>Access methods and protocols, osi model ; Applied sciences ; Asymptotic methods ; Cache ; Caching ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Content centric networks ; Exact sciences and technology ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Network sustainability ; Radiocommunications ; Scaling laws ; Software ; Studies ; Sustainability ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; Wireless communications ; Wireless network capacity ; Wireless networks ; Zipf law</subject><ispartof>Computer networks (Amsterdam, Netherlands : 1999), 2014-05, Vol.64, p.353-368</ispartof><rights>2014 Elsevier B.V.</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. May 8, 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c364t-aa0d827a7f237a0b3755cd64491ffc0c1752510567dac57de323af37a3f12f073</citedby><cites>FETCH-LOGICAL-c364t-aa0d827a7f237a0b3755cd64491ffc0c1752510567dac57de323af37a3f12f073</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S1389128614000802$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28428224$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Gitzenis, S.</creatorcontrib><creatorcontrib>Paschos, G.S.</creatorcontrib><creatorcontrib>Tassiulas, L.</creatorcontrib><title>Enhancing wireless networks with caching: Asymptotic laws, sustainability & trade-offs</title><title>Computer networks (Amsterdam, Netherlands : 1999)</title><description>We investigate on the sustainability of multihop wireless communications in the context of Information-Centric Networks, when content is replicated in caches over the network. The problem is cast in a flat wireless network for a given content popularity distribution and sized by three parameters, (i) the network size N, (ii) the content volume M and (iii) the cache capacity K per node. The objective is to select a joint replication and delivery scheme that minimizes the link traffic. Assuming the Zipf distribution about the content popularity, a law well established in the research on Internet traffic, we compute an order optimal solution, let the three size parameters jointly scale to infinity, and find the scaling laws about the link rates, ranging from ON down to o(1). Analyzing the derived laws, we determine the regimes that the network becomes sustainable subject to the scaling of the three network size parameters and the Zipf rank exponent, characterize the relative merit of network resources and identify the induced trade-offs about network expansion.</description><subject>Access methods and protocols, osi model</subject><subject>Applied sciences</subject><subject>Asymptotic methods</subject><subject>Cache</subject><subject>Caching</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Content centric networks</subject><subject>Exact sciences and technology</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Network sustainability</subject><subject>Radiocommunications</subject><subject>Scaling laws</subject><subject>Software</subject><subject>Studies</subject><subject>Sustainability</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>Wireless communications</subject><subject>Wireless network capacity</subject><subject>Wireless networks</subject><subject>Zipf law</subject><issn>1389-1286</issn><issn>1872-7069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNp9kF1LwzAUhosoOKf_wIuC6JWt-Wia1gthjPkBA2_U25CliUvtmpmTOfbvzejwUjiQkDznPZwnSS4xyjHC5V2bK7fqdcgJwkWOcCxylIxwxUnGUVkfxzut6gyTqjxNzgBahFBRkGqUfMz6peyV7T_TrfW60wBpTNo6_wXxJSxTJdUyft-nE9it1sEFq9JObuE2hQ0EaXu5sJ0Nu_QmDV42OnPGwHlyYmQH-uJwjpP3x9nb9Dmbvz69TCfzTNGyCJmUqKkIl9wQyiVaUM6YasqiqLExCinMGWEYsZI3UjHeaEqoNBGlBhODOB0nV0Pu2rvvjYYgWrfxfRwpMMN13B2zMlLFQCnvALw2Yu3tSvqdwEjsDYpWDAbF3qBAOBaJbdeHcAlKdsbvRcFfL6miQUKKyD0MnI6b_ljtBSire6WbaFQF0Tj7_6Bf9cqImg</recordid><startdate>20140508</startdate><enddate>20140508</enddate><creator>Gitzenis, S.</creator><creator>Paschos, G.S.</creator><creator>Tassiulas, L.</creator><general>Elsevier B.V</general><general>Elsevier</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>20140508</creationdate><title>Enhancing wireless networks with caching: Asymptotic laws, sustainability & trade-offs</title><author>Gitzenis, S. ; Paschos, G.S. ; Tassiulas, L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c364t-aa0d827a7f237a0b3755cd64491ffc0c1752510567dac57de323af37a3f12f073</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Access methods and protocols, osi model</topic><topic>Applied sciences</topic><topic>Asymptotic methods</topic><topic>Cache</topic><topic>Caching</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Content centric networks</topic><topic>Exact sciences and technology</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Network sustainability</topic><topic>Radiocommunications</topic><topic>Scaling laws</topic><topic>Software</topic><topic>Studies</topic><topic>Sustainability</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>Wireless communications</topic><topic>Wireless network capacity</topic><topic>Wireless networks</topic><topic>Zipf law</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gitzenis, S.</creatorcontrib><creatorcontrib>Paschos, G.S.</creatorcontrib><creatorcontrib>Tassiulas, L.</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>Gitzenis, S.</au><au>Paschos, G.S.</au><au>Tassiulas, L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Enhancing wireless networks with caching: Asymptotic laws, sustainability & trade-offs</atitle><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle><date>2014-05-08</date><risdate>2014</risdate><volume>64</volume><spage>353</spage><epage>368</epage><pages>353-368</pages><issn>1389-1286</issn><eissn>1872-7069</eissn><abstract>We investigate on the sustainability of multihop wireless communications in the context of Information-Centric Networks, when content is replicated in caches over the network. The problem is cast in a flat wireless network for a given content popularity distribution and sized by three parameters, (i) the network size N, (ii) the content volume M and (iii) the cache capacity K per node. The objective is to select a joint replication and delivery scheme that minimizes the link traffic. Assuming the Zipf distribution about the content popularity, a law well established in the research on Internet traffic, we compute an order optimal solution, let the three size parameters jointly scale to infinity, and find the scaling laws about the link rates, ranging from ON down to o(1). Analyzing the derived laws, we determine the regimes that the network becomes sustainable subject to the scaling of the three network size parameters and the Zipf rank exponent, characterize the relative merit of network resources and identify the induced trade-offs about network expansion.</abstract><cop>Kidlington</cop><pub>Elsevier B.V</pub><doi>10.1016/j.comnet.2014.01.012</doi><tpages>16</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1389-1286 |
| ispartof | Computer networks (Amsterdam, Netherlands : 1999), 2014-05, Vol.64, p.353-368 |
| issn | 1389-1286 1872-7069 |
| language | eng |
| recordid | cdi_proquest_journals_1519069156 |
| source | Elsevier ScienceDirect Journals |
| subjects | Access methods and protocols, osi model Applied sciences Asymptotic methods Cache Caching Computer science control theory systems Computer systems and distributed systems. User interface Content centric networks Exact sciences and technology Memory and file management (including protection and security) Memory organisation. Data processing Network sustainability Radiocommunications Scaling laws Software Studies Sustainability Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Wireless communications Wireless network capacity Wireless networks Zipf law |
| title | Enhancing wireless networks with caching: Asymptotic laws, sustainability & trade-offs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T04%3A27%3A11IST&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=Enhancing%20wireless%20networks%20with%20caching:%20Asymptotic%20laws,%20sustainability%20&%20trade-offs&rft.jtitle=Computer%20networks%20(Amsterdam,%20Netherlands%20:%201999)&rft.au=Gitzenis,%20S.&rft.date=2014-05-08&rft.volume=64&rft.spage=353&rft.epage=368&rft.pages=353-368&rft.issn=1389-1286&rft.eissn=1872-7069&rft_id=info:doi/10.1016/j.comnet.2014.01.012&rft_dat=%3Cproquest_cross%3E3285794531%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=1519069156&rft_id=info:pmid/&rft_els_id=S1389128614000802&rfr_iscdi=true |