Reducing Search Complexity of Coded Caching by Shrinking Search Space

Reducing Search Complexity of Coded Caching by Shrinking Search Space

Coded caching is a new technique to reduce the communication load by utilizing local memories. In this letter, we propose an improved decentralized coded caching delivery algorithm to reduce the search complexity with limited performance loss. Besides, the problem of shrinking the search space is fo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters 2019-04, Vol.23 (4), p.568-571
Hauptverfasser: Cao, Hankun, Yan, Qifa, Tang, Xiaohu
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Caching
Coded caching
Complexity
Complexity theory
Multicast communication
Network topologies
Numerical models
Optimization
Probability density function
Search problems
search space
Searching
Servers
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 571
container_issue 4
container_start_page 568
container_title IEEE communications letters
container_volume 23
creator Cao, Hankun
Yan, Qifa
Tang, Xiaohu
description Coded caching is a new technique to reduce the communication load by utilizing local memories. In this letter, we propose an improved decentralized coded caching delivery algorithm to reduce the search complexity with limited performance loss. Besides, the problem of shrinking the search space is formulated as an optimization problem, and we relax this problem into an efficient computable one. Consequently, the proposed scheme can be applied to various network topologies efficiently.
doi_str_mv 10.1109/LCOMM.2019.2900237
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_LCOMM_2019_2900237</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8643756</ieee_id><sourcerecordid>2210015452</sourcerecordid><originalsourceid>FETCH-LOGICAL-c361t-5b61246f07de958a4493b250bc10e9d9d953f65c985212e51bf402ba5dd8e25b3</originalsourceid><addsrcrecordid>eNpNkG9LwzAQh4MoOKdfQN8UfN15ufba5KUU_8HGwOnrkCZX17mtNd3AfXs7N0QO7hJ4fnfwCHEtYSQl6LtxMZ1MRghSj1ADYJKfiIEkUjH27bR_g9Jxnmt1Li66bgEACkkOxMMr-62r1x_RjG1w86hoVu2Sv-vNLmqq_ufZR4V18z1S7qLZPNTrz3_8rLWOL8VZZZcdXx3nULw_PrwVz_F4-vRS3I9jl2RyE1OZSUyzCnLPmpRNU52USFA6Cax9X5RUGTmtCCUyybJKAUtL3itGKpOhuD3sbUPzteVuYxbNNqz7kwZRAkhKCXsKD5QLTdcFrkwb6pUNOyPB7HWZX11mr8scdfWhm0OoZua_gMrSJKcs-QGYE2S3</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2210015452</pqid></control><display><type>article</type><title>Reducing Search Complexity of Coded Caching by Shrinking Search Space</title><source>IEEE Electronic Library (IEL)</source><creator>Cao, Hankun ; Yan, Qifa ; Tang, Xiaohu</creator><creatorcontrib>Cao, Hankun ; Yan, Qifa ; Tang, Xiaohu</creatorcontrib><description>Coded caching is a new technique to reduce the communication load by utilizing local memories. In this letter, we propose an improved decentralized coded caching delivery algorithm to reduce the search complexity with limited performance loss. Besides, the problem of shrinking the search space is formulated as an optimization problem, and we relax this problem into an efficient computable one. Consequently, the proposed scheme can be applied to various network topologies efficiently.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2019.2900237</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Caching ; Coded caching ; Complexity ; Complexity theory ; Multicast communication ; Network topologies ; Numerical models ; Optimization ; Probability density function ; Search problems ; search space ; Searching ; Servers</subject><ispartof>IEEE communications letters, 2019-04, Vol.23 (4), p.568-571</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c361t-5b61246f07de958a4493b250bc10e9d9d953f65c985212e51bf402ba5dd8e25b3</citedby><cites>FETCH-LOGICAL-c361t-5b61246f07de958a4493b250bc10e9d9d953f65c985212e51bf402ba5dd8e25b3</cites><orcidid>0000-0002-8162-1540 ; 0000-0002-7938-7812 ; 0000-0002-0746-9819</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8643756$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8643756$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Cao, Hankun</creatorcontrib><creatorcontrib>Yan, Qifa</creatorcontrib><creatorcontrib>Tang, Xiaohu</creatorcontrib><title>Reducing Search Complexity of Coded Caching by Shrinking Search Space</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>Coded caching is a new technique to reduce the communication load by utilizing local memories. In this letter, we propose an improved decentralized coded caching delivery algorithm to reduce the search complexity with limited performance loss. Besides, the problem of shrinking the search space is formulated as an optimization problem, and we relax this problem into an efficient computable one. Consequently, the proposed scheme can be applied to various network topologies efficiently.</description><subject>Algorithms</subject><subject>Caching</subject><subject>Coded caching</subject><subject>Complexity</subject><subject>Complexity theory</subject><subject>Multicast communication</subject><subject>Network topologies</subject><subject>Numerical models</subject><subject>Optimization</subject><subject>Probability density function</subject><subject>Search problems</subject><subject>search space</subject><subject>Searching</subject><subject>Servers</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpNkG9LwzAQh4MoOKdfQN8UfN15ufba5KUU_8HGwOnrkCZX17mtNd3AfXs7N0QO7hJ4fnfwCHEtYSQl6LtxMZ1MRghSj1ADYJKfiIEkUjH27bR_g9Jxnmt1Li66bgEACkkOxMMr-62r1x_RjG1w86hoVu2Sv-vNLmqq_ufZR4V18z1S7qLZPNTrz3_8rLWOL8VZZZcdXx3nULw_PrwVz_F4-vRS3I9jl2RyE1OZSUyzCnLPmpRNU52USFA6Cax9X5RUGTmtCCUyybJKAUtL3itGKpOhuD3sbUPzteVuYxbNNqz7kwZRAkhKCXsKD5QLTdcFrkwb6pUNOyPB7HWZX11mr8scdfWhm0OoZua_gMrSJKcs-QGYE2S3</recordid><startdate>20190401</startdate><enddate>20190401</enddate><creator>Cao, Hankun</creator><creator>Yan, Qifa</creator><creator>Tang, Xiaohu</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>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0002-8162-1540</orcidid><orcidid>https://orcid.org/0000-0002-7938-7812</orcidid><orcidid>https://orcid.org/0000-0002-0746-9819</orcidid></search><sort><creationdate>20190401</creationdate><title>Reducing Search Complexity of Coded Caching by Shrinking Search Space</title><author>Cao, Hankun ; Yan, Qifa ; Tang, Xiaohu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c361t-5b61246f07de958a4493b250bc10e9d9d953f65c985212e51bf402ba5dd8e25b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Caching</topic><topic>Coded caching</topic><topic>Complexity</topic><topic>Complexity theory</topic><topic>Multicast communication</topic><topic>Network topologies</topic><topic>Numerical models</topic><topic>Optimization</topic><topic>Probability density function</topic><topic>Search problems</topic><topic>search space</topic><topic>Searching</topic><topic>Servers</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cao, Hankun</creatorcontrib><creatorcontrib>Yan, Qifa</creatorcontrib><creatorcontrib>Tang, Xiaohu</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cao, Hankun</au><au>Yan, Qifa</au><au>Tang, Xiaohu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Reducing Search Complexity of Coded Caching by Shrinking Search Space</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2019-04-01</date><risdate>2019</risdate><volume>23</volume><issue>4</issue><spage>568</spage><epage>571</epage><pages>568-571</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>Coded caching is a new technique to reduce the communication load by utilizing local memories. In this letter, we propose an improved decentralized coded caching delivery algorithm to reduce the search complexity with limited performance loss. Besides, the problem of shrinking the search space is formulated as an optimization problem, and we relax this problem into an efficient computable one. Consequently, the proposed scheme can be applied to various network topologies efficiently.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2019.2900237</doi><tpages>4</tpages><orcidid>https://orcid.org/0000-0002-8162-1540</orcidid><orcidid>https://orcid.org/0000-0002-7938-7812</orcidid><orcidid>https://orcid.org/0000-0002-0746-9819</orcidid></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1089-7798
ispartof IEEE communications letters, 2019-04, Vol.23 (4), p.568-571
issn 1089-7798
1558-2558
language eng
recordid cdi_crossref_primary_10_1109_LCOMM_2019_2900237
source IEEE Electronic Library (IEL)
subjects Algorithms
Caching
Coded caching
Complexity
Complexity theory
Multicast communication
Network topologies
Numerical models
Optimization
Probability density function
Search problems
search space
Searching
Servers
title Reducing Search Complexity of Coded Caching by Shrinking Search Space
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T14%3A57%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Reducing%20Search%20Complexity%20of%20Coded%20Caching%20by%20Shrinking%20Search%20Space&rft.jtitle=IEEE%20communications%20letters&rft.au=Cao,%20Hankun&rft.date=2019-04-01&rft.volume=23&rft.issue=4&rft.spage=568&rft.epage=571&rft.pages=568-571&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2019.2900237&rft_dat=%3Cproquest_RIE%3E2210015452%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2210015452&rft_id=info:pmid/&rft_ieee_id=8643756&rfr_iscdi=true