Loading…

Popularity-Aware Content Caching for Distributed Wireless Helper Nodes

Content caching enables end users to obtain contents in a short time. To further reduce the time to access a mobile wireless network, we consider a device-to-device communication scenario where contents are distributed and users may obtain contents directly from neighbors instead of accessing the ba...

Full description

Saved in:
Bibliographic Details
Published in:Arabian journal for science and engineering (2011) 2017-08, Vol.42 (8), p.3375-3389
Main Authors: Khan, Furqan H., Khan, Zeashan
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-c316t-2ec4a78335cef39c023917bf8be24bceeec9aa97c355ae18a8206f2919973e353
cites cdi_FETCH-LOGICAL-c316t-2ec4a78335cef39c023917bf8be24bceeec9aa97c355ae18a8206f2919973e353
container_end_page 3389
container_issue 8
container_start_page 3375
container_title Arabian journal for science and engineering (2011)
container_volume 42
creator Khan, Furqan H.
Khan, Zeashan
description Content caching enables end users to obtain contents in a short time. To further reduce the time to access a mobile wireless network, we consider a device-to-device communication scenario where contents are distributed and users may obtain contents directly from neighbors instead of accessing the base station. For maximizing the cache hit rate per unit of bandwidth consumed, we derive a theoretical model based on the probability distribution of content popularity. To make the problem tractable, we propose a popularity-aware content caching mechanism using the modified weighted Zipf distribution. Through our simulation with a real YouTube trace, the proposed algorithm is compared with the existing well-known least-recently-used algorithm in terms of the achieved hit rate, caching time, cache eviction rate, and consumed bandwidth. The results show that our approach is able to achieve near-optimal performances and at the same time approximate the optimal cache time a cached content resides at the device.
doi_str_mv 10.1007/s13369-017-2505-3
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1919664203</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1919664203</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-2ec4a78335cef39c023917bf8be24bceeec9aa97c355ae18a8206f2919973e353</originalsourceid><addsrcrecordid>eNp1kLFOwzAQhi0EElXpA7BFYjb4fHESj1WgFKkCBhBsluNeSlBIgp0I9e1JCQML093wf__pPsbOQVyCEOlVAMREcwEpl0oojkdsJkEDj2UGxz87cpWkr6dsEUJViDhDrQBwxlaPbTfU1lf9ni-_rKcob5uemj7KrXurml1Utj66rkLvq2LoaRu9VJ5qCiFaU92Rj-7bLYUzdlLaOtDid87Z8-rmKV_zzcPtXb7ccIeQ9FySi22aISpHJWonJGpIizIrSMaFIyKnrdWpQ6UsQWYzKZJSatA6RUKFc3Yx9Xa-_Rwo9Oa9HXwznjTjvzpJYilwTMGUcr4NwVNpOl99WL83IMzBmJmMmdGYORgzB0ZOTBizzY78n-Z_oW86jG23</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1919664203</pqid></control><display><type>article</type><title>Popularity-Aware Content Caching for Distributed Wireless Helper Nodes</title><source>Springer Nature</source><creator>Khan, Furqan H. ; Khan, Zeashan</creator><creatorcontrib>Khan, Furqan H. ; Khan, Zeashan</creatorcontrib><description>Content caching enables end users to obtain contents in a short time. To further reduce the time to access a mobile wireless network, we consider a device-to-device communication scenario where contents are distributed and users may obtain contents directly from neighbors instead of accessing the base station. For maximizing the cache hit rate per unit of bandwidth consumed, we derive a theoretical model based on the probability distribution of content popularity. To make the problem tractable, we propose a popularity-aware content caching mechanism using the modified weighted Zipf distribution. Through our simulation with a real YouTube trace, the proposed algorithm is compared with the existing well-known least-recently-used algorithm in terms of the achieved hit rate, caching time, cache eviction rate, and consumed bandwidth. The results show that our approach is able to achieve near-optimal performances and at the same time approximate the optimal cache time a cached content resides at the device.</description><identifier>ISSN: 2193-567X</identifier><identifier>ISSN: 1319-8025</identifier><identifier>EISSN: 2191-4281</identifier><identifier>DOI: 10.1007/s13369-017-2505-3</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Caching ; Computer simulation ; End users ; Engineering ; Humanities and Social Sciences ; multidisciplinary ; Optimization ; Research Article - Computer Engineering and Computer Science ; Science ; Wireless communications ; Wireless networks</subject><ispartof>Arabian journal for science and engineering (2011), 2017-08, Vol.42 (8), p.3375-3389</ispartof><rights>King Fahd University of Petroleum &amp; Minerals 2017</rights><rights>Copyright Springer Science &amp; Business Media 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-2ec4a78335cef39c023917bf8be24bceeec9aa97c355ae18a8206f2919973e353</citedby><cites>FETCH-LOGICAL-c316t-2ec4a78335cef39c023917bf8be24bceeec9aa97c355ae18a8206f2919973e353</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Khan, Furqan H.</creatorcontrib><creatorcontrib>Khan, Zeashan</creatorcontrib><title>Popularity-Aware Content Caching for Distributed Wireless Helper Nodes</title><title>Arabian journal for science and engineering (2011)</title><addtitle>Arab J Sci Eng</addtitle><description>Content caching enables end users to obtain contents in a short time. To further reduce the time to access a mobile wireless network, we consider a device-to-device communication scenario where contents are distributed and users may obtain contents directly from neighbors instead of accessing the base station. For maximizing the cache hit rate per unit of bandwidth consumed, we derive a theoretical model based on the probability distribution of content popularity. To make the problem tractable, we propose a popularity-aware content caching mechanism using the modified weighted Zipf distribution. Through our simulation with a real YouTube trace, the proposed algorithm is compared with the existing well-known least-recently-used algorithm in terms of the achieved hit rate, caching time, cache eviction rate, and consumed bandwidth. The results show that our approach is able to achieve near-optimal performances and at the same time approximate the optimal cache time a cached content resides at the device.</description><subject>Caching</subject><subject>Computer simulation</subject><subject>End users</subject><subject>Engineering</subject><subject>Humanities and Social Sciences</subject><subject>multidisciplinary</subject><subject>Optimization</subject><subject>Research Article - Computer Engineering and Computer Science</subject><subject>Science</subject><subject>Wireless communications</subject><subject>Wireless networks</subject><issn>2193-567X</issn><issn>1319-8025</issn><issn>2191-4281</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNp1kLFOwzAQhi0EElXpA7BFYjb4fHESj1WgFKkCBhBsluNeSlBIgp0I9e1JCQML093wf__pPsbOQVyCEOlVAMREcwEpl0oojkdsJkEDj2UGxz87cpWkr6dsEUJViDhDrQBwxlaPbTfU1lf9ni-_rKcob5uemj7KrXurml1Utj66rkLvq2LoaRu9VJ5qCiFaU92Rj-7bLYUzdlLaOtDid87Z8-rmKV_zzcPtXb7ccIeQ9FySi22aISpHJWonJGpIizIrSMaFIyKnrdWpQ6UsQWYzKZJSatA6RUKFc3Yx9Xa-_Rwo9Oa9HXwznjTjvzpJYilwTMGUcr4NwVNpOl99WL83IMzBmJmMmdGYORgzB0ZOTBizzY78n-Z_oW86jG23</recordid><startdate>20170801</startdate><enddate>20170801</enddate><creator>Khan, Furqan H.</creator><creator>Khan, Zeashan</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20170801</creationdate><title>Popularity-Aware Content Caching for Distributed Wireless Helper Nodes</title><author>Khan, Furqan H. ; Khan, Zeashan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-2ec4a78335cef39c023917bf8be24bceeec9aa97c355ae18a8206f2919973e353</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Caching</topic><topic>Computer simulation</topic><topic>End users</topic><topic>Engineering</topic><topic>Humanities and Social Sciences</topic><topic>multidisciplinary</topic><topic>Optimization</topic><topic>Research Article - Computer Engineering and Computer Science</topic><topic>Science</topic><topic>Wireless communications</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Khan, Furqan H.</creatorcontrib><creatorcontrib>Khan, Zeashan</creatorcontrib><collection>CrossRef</collection><jtitle>Arabian journal for science and engineering (2011)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Khan, Furqan H.</au><au>Khan, Zeashan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Popularity-Aware Content Caching for Distributed Wireless Helper Nodes</atitle><jtitle>Arabian journal for science and engineering (2011)</jtitle><stitle>Arab J Sci Eng</stitle><date>2017-08-01</date><risdate>2017</risdate><volume>42</volume><issue>8</issue><spage>3375</spage><epage>3389</epage><pages>3375-3389</pages><issn>2193-567X</issn><issn>1319-8025</issn><eissn>2191-4281</eissn><abstract>Content caching enables end users to obtain contents in a short time. To further reduce the time to access a mobile wireless network, we consider a device-to-device communication scenario where contents are distributed and users may obtain contents directly from neighbors instead of accessing the base station. For maximizing the cache hit rate per unit of bandwidth consumed, we derive a theoretical model based on the probability distribution of content popularity. To make the problem tractable, we propose a popularity-aware content caching mechanism using the modified weighted Zipf distribution. Through our simulation with a real YouTube trace, the proposed algorithm is compared with the existing well-known least-recently-used algorithm in terms of the achieved hit rate, caching time, cache eviction rate, and consumed bandwidth. The results show that our approach is able to achieve near-optimal performances and at the same time approximate the optimal cache time a cached content resides at the device.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s13369-017-2505-3</doi><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 2193-567X
ispartof Arabian journal for science and engineering (2011), 2017-08, Vol.42 (8), p.3375-3389
issn 2193-567X
1319-8025
2191-4281
language eng
recordid cdi_proquest_journals_1919664203
source Springer Nature
subjects Caching
Computer simulation
End users
Engineering
Humanities and Social Sciences
multidisciplinary
Optimization
Research Article - Computer Engineering and Computer Science
Science
Wireless communications
Wireless networks
title Popularity-Aware Content Caching for Distributed Wireless Helper Nodes
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T17%3A06%3A26IST&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=Popularity-Aware%20Content%20Caching%20for%20Distributed%20Wireless%20Helper%20Nodes&rft.jtitle=Arabian%20journal%20for%20science%20and%20engineering%20(2011)&rft.au=Khan,%20Furqan%20H.&rft.date=2017-08-01&rft.volume=42&rft.issue=8&rft.spage=3375&rft.epage=3389&rft.pages=3375-3389&rft.issn=2193-567X&rft.eissn=2191-4281&rft_id=info:doi/10.1007/s13369-017-2505-3&rft_dat=%3Cproquest_cross%3E1919664203%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c316t-2ec4a78335cef39c023917bf8be24bceeec9aa97c355ae18a8206f2919973e353%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1919664203&rft_id=info:pmid/&rfr_iscdi=true