Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis

The idea behind network caching is to reduce network traffic during peak hours via transmitting frequently-requested content items to end users during off-peak hours. However, due to limited cache sizes and unpredictable access patterns, this might not totally eliminate the need for data transmissio...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Behrouz Zolfaghari, Vikrant Singh, Brijesh Kumar Rai, Khodakhast Bibak, Takeshi Koshiba
Formato: article
Lenguaje:EN
Publicado: MDPI AG 2021
Materias:
Q
Acceso en línea:https://doaj.org/article/73aa16272a884df0b7ffbfd4b7023416
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:doaj.org-article:73aa16272a884df0b7ffbfd4b7023416
record_format dspace
spelling oai:doaj.org-article:73aa16272a884df0b7ffbfd4b70234162021-11-25T17:29:50ZCryptography in Hierarchical Coded Caching: System Model and Cost Analysis10.3390/e231114591099-4300https://doaj.org/article/73aa16272a884df0b7ffbfd4b70234162021-11-01T00:00:00Zhttps://www.mdpi.com/1099-4300/23/11/1459https://doaj.org/toc/1099-4300The idea behind network caching is to reduce network traffic during peak hours via transmitting frequently-requested content items to end users during off-peak hours. However, due to limited cache sizes and unpredictable access patterns, this might not totally eliminate the need for data transmission during peak hours. Coded caching was introduced to further reduce the peak hour traffic. The idea of coded caching is based on sending coded content which can be decoded in different ways by different users. This allows the server to service multiple requests by transmitting a single content item. Research works regarding coded caching traditionally adopt a simple network topology consisting of a single server, a single hub, a shared link connecting the server to the hub, and private links which connect the users to the hub. Building on the results of Sengupta et al. (IEEE Trans. Inf. Forensics Secur., 2015), we propose and evaluate a yet more complex system model that takes into consideration both throughput and security via combining the mentioned ideas. It is demonstrated that the achievable rates in the proposed model are within a constant multiplicative and additive gap with the minimum secure rates.Behrouz ZolfaghariVikrant SinghBrijesh Kumar RaiKhodakhast BibakTakeshi KoshibaMDPI AGarticlecoded cachingsecure deliveryhierarchical coded cachingcost analysissystem modelScienceQAstrophysicsQB460-466PhysicsQC1-999ENEntropy, Vol 23, Iss 1459, p 1459 (2021)
institution DOAJ
collection DOAJ
language EN
topic coded caching
secure delivery
hierarchical coded caching
cost analysis
system model
Science
Q
Astrophysics
QB460-466
Physics
QC1-999
spellingShingle coded caching
secure delivery
hierarchical coded caching
cost analysis
system model
Science
Q
Astrophysics
QB460-466
Physics
QC1-999
Behrouz Zolfaghari
Vikrant Singh
Brijesh Kumar Rai
Khodakhast Bibak
Takeshi Koshiba
Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis
description The idea behind network caching is to reduce network traffic during peak hours via transmitting frequently-requested content items to end users during off-peak hours. However, due to limited cache sizes and unpredictable access patterns, this might not totally eliminate the need for data transmission during peak hours. Coded caching was introduced to further reduce the peak hour traffic. The idea of coded caching is based on sending coded content which can be decoded in different ways by different users. This allows the server to service multiple requests by transmitting a single content item. Research works regarding coded caching traditionally adopt a simple network topology consisting of a single server, a single hub, a shared link connecting the server to the hub, and private links which connect the users to the hub. Building on the results of Sengupta et al. (IEEE Trans. Inf. Forensics Secur., 2015), we propose and evaluate a yet more complex system model that takes into consideration both throughput and security via combining the mentioned ideas. It is demonstrated that the achievable rates in the proposed model are within a constant multiplicative and additive gap with the minimum secure rates.
format article
author Behrouz Zolfaghari
Vikrant Singh
Brijesh Kumar Rai
Khodakhast Bibak
Takeshi Koshiba
author_facet Behrouz Zolfaghari
Vikrant Singh
Brijesh Kumar Rai
Khodakhast Bibak
Takeshi Koshiba
author_sort Behrouz Zolfaghari
title Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis
title_short Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis
title_full Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis
title_fullStr Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis
title_full_unstemmed Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis
title_sort cryptography in hierarchical coded caching: system model and cost analysis
publisher MDPI AG
publishDate 2021
url https://doaj.org/article/73aa16272a884df0b7ffbfd4b7023416
work_keys_str_mv AT behrouzzolfaghari cryptographyinhierarchicalcodedcachingsystemmodelandcostanalysis
AT vikrantsingh cryptographyinhierarchicalcodedcachingsystemmodelandcostanalysis
AT brijeshkumarrai cryptographyinhierarchicalcodedcachingsystemmodelandcostanalysis
AT khodakhastbibak cryptographyinhierarchicalcodedcachingsystemmodelandcostanalysis
AT takeshikoshiba cryptographyinhierarchicalcodedcachingsystemmodelandcostanalysis
_version_ 1718412292249354240