Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Decentralized Caching Schemes and Performance Limits in Two-Layer Networks
Univ Elect Sci & Technol China, Key Lab Commun, Chengdu 611731, Sichuan, Peoples R China.;Univ Elect Sci & Technol China, Ctr Intelligent Networking & Commun, Chengdu 611731, Sichuan, Peoples R China..
Ericsson Res, S-16483 Stockholm, Sweden..
KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.ORCID iD: 0000-0002-5407-0835
Univ Elect Sci & Technol China, Key Lab Commun, Chengdu 611731, Sichuan, Peoples R China..
Show others and affiliations
2018 (English)In: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 67, no 12, p. 12177-12192Article in journal (Refereed) Published
Abstract [en]

We study the decentralized caching scheme in a two-layer network, which includes a server, multiple helpers, and multiple users. Basically, the proposed caching scheme consists of two phases, i.e., placement phase and delivery phase. In the placement phase, each helper/user randomly and independently selects contents from the server and stores them into its memory. In the delivery phase, the users request contents from the server, and the server satisfies each user through a helper. Different from the existing caching scheme, the proposed caching scheme takes into account the pre- stored contents at both helpers and users in the placement phase to design the delivery phase. Meanwhile, the proposed caching scheme exploits index coding in the delivery phase and leverages multicast opportunities, even when different users request distinct contents. Besides, we analytically characterize the performance limit of the proposed caching scheme, and show that the achievable rate region of the proposed caching scheme lies within constant margins to the information-theoretic optimum. In particular, the multiplicative and additive factors are carefully sharpened to be 1/48 and 4, respectively, both of which are better than the state of arts. Finally, simulation results demonstrate the advantage of the proposed caching scheme compared with the state of arts.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2018. Vol. 67, no 12, p. 12177-12192
Keywords [en]
Achievable rate region, cross-layer caching, decentralized coded caching, hybrid scheme, two-layer networks
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-241009DOI: 10.1109/TVT.2018.2873723ISI: 000454112100071Scopus ID: 2-s2.0-85054470759OAI: oai:DiVA.org:kth-241009DiVA, id: diva2:1276808
Note

QC 20190109

Available from: 2019-01-09 Created: 2019-01-09 Last updated: 2019-08-20Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Xiao, Ming
By organisation
Information Science and Engineering
In the same journal
IEEE Transactions on Vehicular Technology
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 6 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf