Loading…

Some Variant of Known Coded Caching Schemes With Good Performance

In coded caching system, we prefer to design a scheme with the rate R and the packet number F of each file split as small as possible since the efficiency of transmission in the peak traffic times increases with the decreasing of R and the realizing complexity increases with the increasing of F. Up...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2020-03, Vol.68 (3), p.1370-1377
Main Authors: Cheng, Minquan, Jiang, Jing, Tang, Xiaohu, Yan, Qifa
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-c295t-7ca77a5b9fc9fcbd690a9d82c8c518516102af36db445ed553d99ff2754cf9de3
cites cdi_FETCH-LOGICAL-c295t-7ca77a5b9fc9fcbd690a9d82c8c518516102af36db445ed553d99ff2754cf9de3
container_end_page 1377
container_issue 3
container_start_page 1370
container_title IEEE transactions on communications
container_volume 68
creator Cheng, Minquan
Jiang, Jing
Tang, Xiaohu
Yan, Qifa
description In coded caching system, we prefer to design a scheme with the rate R and the packet number F of each file split as small as possible since the efficiency of transmission in the peak traffic times increases with the decreasing of R and the realizing complexity increases with the increasing of F. Up to now, almost all of the previously known schemes can be realized by the combinatorial structure which is called placement delivery array (PDA). In this paper, we also study the schemes by means of PDAs. We first show that given the minimum rate, the scheme proposed by Maddah-Ali and Niesen (MN scheme) has the minimum packet number which is too large in practice. From the view point of combinatorial design, two variant MN schemes, which can significantly reduce the packet number by increasing some rate, are obtained. Especially one of these schemes has better performance than the scheme generated by the well known grouping method.
doi_str_mv 10.1109/TCOMM.2019.2962028
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TCOMM_2019_2962028</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8941013</ieee_id><sourcerecordid>2379362804</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-7ca77a5b9fc9fcbd690a9d82c8c518516102af36db445ed553d99ff2754cf9de3</originalsourceid><addsrcrecordid>eNo9kE1LAzEURYMoWKt_QDcB11NfkskkWZZBq9hSoVWXIc2HneJMamaK-O-d2iJceJt73oWD0DWBESGg7pblfDYbUSBqRFVBgcoTNCCcywwkF6doAKAgK4SQ5-iibTcAkANjAzRexNrjN5Mq03Q4BvzcxO8Gl9F5h0tj11XzgRd27Wvf4veqW-NJjA6_-BRiqk1j_SU6C-az9VfHO0SvD_fL8jGbzidP5XiaWap4lwlrhDB8pYLts3KFAqOcpFZaTiQnBQFqAivcKs-5d5wzp1QIVPDcBuU8G6Lbw99til8733Z6E3ep6Sc1ZUKxgkrI-xY9tGyKbZt80NtU1Sb9aAJ6r0r_qdJ7VfqoqoduDlDlvf8HpMoJEMZ-ATK3ZC8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2379362804</pqid></control><display><type>article</type><title>Some Variant of Known Coded Caching Schemes With Good Performance</title><source>IEEE Xplore (Online service)</source><creator>Cheng, Minquan ; Jiang, Jing ; Tang, Xiaohu ; Yan, Qifa</creator><creatorcontrib>Cheng, Minquan ; Jiang, Jing ; Tang, Xiaohu ; Yan, Qifa</creatorcontrib><description>In coded caching system, we prefer to design a scheme with the rate R and the packet number F of each file split as small as possible since the efficiency of transmission in the peak traffic times increases with the decreasing of R and the realizing complexity increases with the increasing of F. Up to now, almost all of the previously known schemes can be realized by the combinatorial structure which is called placement delivery array (PDA). In this paper, we also study the schemes by means of PDAs. We first show that given the minimum rate, the scheme proposed by Maddah-Ali and Niesen (MN scheme) has the minimum packet number which is too large in practice. From the view point of combinatorial design, two variant MN schemes, which can significantly reduce the packet number by increasing some rate, are obtained. Especially one of these schemes has better performance than the scheme generated by the well known grouping method.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/TCOMM.2019.2962028</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Cache storage ; Caching ; Coded caching scheme ; Codes ; Combinatorial analysis ; Combinatorial mathematics ; Complexity theory ; packet number ; placement delivery array ; rate ; Telecommunication traffic ; Transmission efficiency</subject><ispartof>IEEE transactions on communications, 2020-03, Vol.68 (3), p.1370-1377</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c295t-7ca77a5b9fc9fcbd690a9d82c8c518516102af36db445ed553d99ff2754cf9de3</citedby><cites>FETCH-LOGICAL-c295t-7ca77a5b9fc9fcbd690a9d82c8c518516102af36db445ed553d99ff2754cf9de3</cites><orcidid>0000-0002-0746-9819 ; 0000-0002-1942-3834 ; 0000-0003-0360-0610 ; 0000-0002-7938-7812</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8941013$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Cheng, Minquan</creatorcontrib><creatorcontrib>Jiang, Jing</creatorcontrib><creatorcontrib>Tang, Xiaohu</creatorcontrib><creatorcontrib>Yan, Qifa</creatorcontrib><title>Some Variant of Known Coded Caching Schemes With Good Performance</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>In coded caching system, we prefer to design a scheme with the rate R and the packet number F of each file split as small as possible since the efficiency of transmission in the peak traffic times increases with the decreasing of R and the realizing complexity increases with the increasing of F. Up to now, almost all of the previously known schemes can be realized by the combinatorial structure which is called placement delivery array (PDA). In this paper, we also study the schemes by means of PDAs. We first show that given the minimum rate, the scheme proposed by Maddah-Ali and Niesen (MN scheme) has the minimum packet number which is too large in practice. From the view point of combinatorial design, two variant MN schemes, which can significantly reduce the packet number by increasing some rate, are obtained. Especially one of these schemes has better performance than the scheme generated by the well known grouping method.</description><subject>Cache storage</subject><subject>Caching</subject><subject>Coded caching scheme</subject><subject>Codes</subject><subject>Combinatorial analysis</subject><subject>Combinatorial mathematics</subject><subject>Complexity theory</subject><subject>packet number</subject><subject>placement delivery array</subject><subject>rate</subject><subject>Telecommunication traffic</subject><subject>Transmission efficiency</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNo9kE1LAzEURYMoWKt_QDcB11NfkskkWZZBq9hSoVWXIc2HneJMamaK-O-d2iJceJt73oWD0DWBESGg7pblfDYbUSBqRFVBgcoTNCCcywwkF6doAKAgK4SQ5-iibTcAkANjAzRexNrjN5Mq03Q4BvzcxO8Gl9F5h0tj11XzgRd27Wvf4veqW-NJjA6_-BRiqk1j_SU6C-az9VfHO0SvD_fL8jGbzidP5XiaWap4lwlrhDB8pYLts3KFAqOcpFZaTiQnBQFqAivcKs-5d5wzp1QIVPDcBuU8G6Lbw99til8733Z6E3ep6Sc1ZUKxgkrI-xY9tGyKbZt80NtU1Sb9aAJ6r0r_qdJ7VfqoqoduDlDlvf8HpMoJEMZ-ATK3ZC8</recordid><startdate>20200301</startdate><enddate>20200301</enddate><creator>Cheng, Minquan</creator><creator>Jiang, Jing</creator><creator>Tang, Xiaohu</creator><creator>Yan, Qifa</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-0746-9819</orcidid><orcidid>https://orcid.org/0000-0002-1942-3834</orcidid><orcidid>https://orcid.org/0000-0003-0360-0610</orcidid><orcidid>https://orcid.org/0000-0002-7938-7812</orcidid></search><sort><creationdate>20200301</creationdate><title>Some Variant of Known Coded Caching Schemes With Good Performance</title><author>Cheng, Minquan ; Jiang, Jing ; Tang, Xiaohu ; Yan, Qifa</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-7ca77a5b9fc9fcbd690a9d82c8c518516102af36db445ed553d99ff2754cf9de3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Cache storage</topic><topic>Caching</topic><topic>Coded caching scheme</topic><topic>Codes</topic><topic>Combinatorial analysis</topic><topic>Combinatorial mathematics</topic><topic>Complexity theory</topic><topic>packet number</topic><topic>placement delivery array</topic><topic>rate</topic><topic>Telecommunication traffic</topic><topic>Transmission efficiency</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cheng, Minquan</creatorcontrib><creatorcontrib>Jiang, Jing</creatorcontrib><creatorcontrib>Tang, Xiaohu</creatorcontrib><creatorcontrib>Yan, Qifa</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cheng, Minquan</au><au>Jiang, Jing</au><au>Tang, Xiaohu</au><au>Yan, Qifa</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Some Variant of Known Coded Caching Schemes With Good Performance</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>2020-03-01</date><risdate>2020</risdate><volume>68</volume><issue>3</issue><spage>1370</spage><epage>1377</epage><pages>1370-1377</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>In coded caching system, we prefer to design a scheme with the rate R and the packet number F of each file split as small as possible since the efficiency of transmission in the peak traffic times increases with the decreasing of R and the realizing complexity increases with the increasing of F. Up to now, almost all of the previously known schemes can be realized by the combinatorial structure which is called placement delivery array (PDA). In this paper, we also study the schemes by means of PDAs. We first show that given the minimum rate, the scheme proposed by Maddah-Ali and Niesen (MN scheme) has the minimum packet number which is too large in practice. From the view point of combinatorial design, two variant MN schemes, which can significantly reduce the packet number by increasing some rate, are obtained. Especially one of these schemes has better performance than the scheme generated by the well known grouping method.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCOMM.2019.2962028</doi><tpages>8</tpages><orcidid>https://orcid.org/0000-0002-0746-9819</orcidid><orcidid>https://orcid.org/0000-0002-1942-3834</orcidid><orcidid>https://orcid.org/0000-0003-0360-0610</orcidid><orcidid>https://orcid.org/0000-0002-7938-7812</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0090-6778
ispartof IEEE transactions on communications, 2020-03, Vol.68 (3), p.1370-1377
issn 0090-6778
1558-0857
language eng
recordid cdi_crossref_primary_10_1109_TCOMM_2019_2962028
source IEEE Xplore (Online service)
subjects Cache storage
Caching
Coded caching scheme
Codes
Combinatorial analysis
Combinatorial mathematics
Complexity theory
packet number
placement delivery array
rate
Telecommunication traffic
Transmission efficiency
title Some Variant of Known Coded Caching Schemes With Good Performance
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T09%3A34%3A58IST&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=Some%20Variant%20of%20Known%20Coded%20Caching%20Schemes%20With%20Good%20Performance&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Cheng,%20Minquan&rft.date=2020-03-01&rft.volume=68&rft.issue=3&rft.spage=1370&rft.epage=1377&rft.pages=1370-1377&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/TCOMM.2019.2962028&rft_dat=%3Cproquest_cross%3E2379362804%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c295t-7ca77a5b9fc9fcbd690a9d82c8c518516102af36db445ed553d99ff2754cf9de3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2379362804&rft_id=info:pmid/&rft_ieee_id=8941013&rfr_iscdi=true