New optimal trade-off point for coded caching systems with limited cache size

This paper presents a new achievable scheme for coded caching systems with \(\mathsf{N}\) files, \(\mathsf{K}=\mathsf{N}\) users, and cache size \(\mathsf{M}=1/(\mathsf{N}-1)\). The scheme employs linear coding during the cache placement phase, and a three-stage transmissions designed to eliminate i...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2024-06
Main Authors: Ma, Yinbin, Tuninetti, Daniela
Format: Article
Language:English
Subjects:
Caching
Coding
Fields (mathematics)
Optimization
Placement
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Ma, Yinbin
Tuninetti, Daniela
description This paper presents a new achievable scheme for coded caching systems with \(\mathsf{N}\) files, \(\mathsf{K}=\mathsf{N}\) users, and cache size \(\mathsf{M}=1/(\mathsf{N}-1)\). The scheme employs linear coding during the cache placement phase, and a three-stage transmissions designed to eliminate interference in the delivery phase. The achievable load meets a known converse bound, which impose no constraint on the cache placement, and is thus optimal. This new result, together with known inner and outer bounds, shows optimality of linear coding placement for \(\mathsf{M} \leq 1/(\mathsf{N}-1)\) when \(\mathsf{K}=\mathsf{N}\geq 3\). Interestingly and surprisingly, the proposed scheme is relatively simple but requires operations on a finite field of size at least 3.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2876196722</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2876196722</sourcerecordid><originalsourceid>FETCH-proquest_journals_28761967223</originalsourceid><addsrcrecordid>eNqNjrsOgkAQAC8mJhLlHzaxJsE7eVgbjY1W9uQCe7IEOLw9QvTrpeADrKaYKWYlAqnUIcqPUm5EyNzEcSzTTCaJCsT9gRPYwVOnW_BOVxhZY2Cw1Hsw1kFpK6yg1GVN_Qv4wx47hol8DS115BeJwPTFnVgb3TKGC7dif708z7docPY9IvuisaPrZ1XIPEsPp3lDqv-qH4ZsPdY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2876196722</pqid></control><display><type>article</type><title>New optimal trade-off point for coded caching systems with limited cache size</title><source>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</source><creator>Ma, Yinbin ; Tuninetti, Daniela</creator><creatorcontrib>Ma, Yinbin ; Tuninetti, Daniela</creatorcontrib><description>This paper presents a new achievable scheme for coded caching systems with \(\mathsf{N}\) files, \(\mathsf{K}=\mathsf{N}\) users, and cache size \(\mathsf{M}=1/(\mathsf{N}-1)\). The scheme employs linear coding during the cache placement phase, and a three-stage transmissions designed to eliminate interference in the delivery phase. The achievable load meets a known converse bound, which impose no constraint on the cache placement, and is thus optimal. This new result, together with known inner and outer bounds, shows optimality of linear coding placement for \(\mathsf{M} \leq 1/(\mathsf{N}-1)\) when \(\mathsf{K}=\mathsf{N}\geq 3\). Interestingly and surprisingly, the proposed scheme is relatively simple but requires operations on a finite field of size at least 3.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Caching ; Coding ; Fields (mathematics) ; Optimization ; Placement</subject><ispartof>arXiv.org, 2024-06</ispartof><rights>2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2876196722?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Ma, Yinbin</creatorcontrib><creatorcontrib>Tuninetti, Daniela</creatorcontrib><title>New optimal trade-off point for coded caching systems with limited cache size</title><title>arXiv.org</title><description>This paper presents a new achievable scheme for coded caching systems with \(\mathsf{N}\) files, \(\mathsf{K}=\mathsf{N}\) users, and cache size \(\mathsf{M}=1/(\mathsf{N}-1)\). The scheme employs linear coding during the cache placement phase, and a three-stage transmissions designed to eliminate interference in the delivery phase. The achievable load meets a known converse bound, which impose no constraint on the cache placement, and is thus optimal. This new result, together with known inner and outer bounds, shows optimality of linear coding placement for \(\mathsf{M} \leq 1/(\mathsf{N}-1)\) when \(\mathsf{K}=\mathsf{N}\geq 3\). Interestingly and surprisingly, the proposed scheme is relatively simple but requires operations on a finite field of size at least 3.</description><subject>Caching</subject><subject>Coding</subject><subject>Fields (mathematics)</subject><subject>Optimization</subject><subject>Placement</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNjrsOgkAQAC8mJhLlHzaxJsE7eVgbjY1W9uQCe7IEOLw9QvTrpeADrKaYKWYlAqnUIcqPUm5EyNzEcSzTTCaJCsT9gRPYwVOnW_BOVxhZY2Cw1Hsw1kFpK6yg1GVN_Qv4wx47hol8DS115BeJwPTFnVgb3TKGC7dif708z7docPY9IvuisaPrZ1XIPEsPp3lDqv-qH4ZsPdY</recordid><startdate>20240610</startdate><enddate>20240610</enddate><creator>Ma, Yinbin</creator><creator>Tuninetti, Daniela</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20240610</creationdate><title>New optimal trade-off point for coded caching systems with limited cache size</title><author>Ma, Yinbin ; Tuninetti, Daniela</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_28761967223</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Caching</topic><topic>Coding</topic><topic>Fields (mathematics)</topic><topic>Optimization</topic><topic>Placement</topic><toplevel>online_resources</toplevel><creatorcontrib>Ma, Yinbin</creatorcontrib><creatorcontrib>Tuninetti, Daniela</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ma, Yinbin</au><au>Tuninetti, Daniela</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>New optimal trade-off point for coded caching systems with limited cache size</atitle><jtitle>arXiv.org</jtitle><date>2024-06-10</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>This paper presents a new achievable scheme for coded caching systems with \(\mathsf{N}\) files, \(\mathsf{K}=\mathsf{N}\) users, and cache size \(\mathsf{M}=1/(\mathsf{N}-1)\). The scheme employs linear coding during the cache placement phase, and a three-stage transmissions designed to eliminate interference in the delivery phase. The achievable load meets a known converse bound, which impose no constraint on the cache placement, and is thus optimal. This new result, together with known inner and outer bounds, shows optimality of linear coding placement for \(\mathsf{M} \leq 1/(\mathsf{N}-1)\) when \(\mathsf{K}=\mathsf{N}\geq 3\). Interestingly and surprisingly, the proposed scheme is relatively simple but requires operations on a finite field of size at least 3.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2024-06
issn 2331-8422
language eng
recordid cdi_proquest_journals_2876196722
source Publicly Available Content Database (Proquest) (PQ_SDU_P3)
subjects Caching
Coding
Fields (mathematics)
Optimization
Placement
title New optimal trade-off point for coded caching systems with limited cache size
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T12%3A24%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=New%20optimal%20trade-off%20point%20for%20coded%20caching%20systems%20with%20limited%20cache%20size&rft.jtitle=arXiv.org&rft.au=Ma,%20Yinbin&rft.date=2024-06-10&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2876196722%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_28761967223%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2876196722&rft_id=info:pmid/&rfr_iscdi=true