The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff
Abstract
Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the main performance gain of this caching was thought to result from making part of the requested data available closer to end-users. Instead, we recently showed that a much more significant gain can be achieved by using caches to create coded-multicasting opportunities, even for users with different demands, through coding across data streams. These coded-multicasting opportunities are enabled by careful content overlap at the various caches in the network, created by a central coordinating server. In many scenarios, such a central coordinating server may not be available, raising the question if this multicasting gain can still be achieved in a more decentralized setting. In this paper, we propose an efficient caching scheme, in which the content placement is performed in a decentralized manner. In other words, no coordination is required for the content placement. Despite this lack of coordination, the proposed scheme is nevertheless able to create coded-multicasting opportunities and achieves a rate close to the optimal centralized scheme.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850663 · Cited by 7,814
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726 · cited 1×
“In many scenarios, such a central coordinating server may not be available, raising the question if thismulticasting gain can still be achieved in a more decentralized setting.”
BackgroundSelf-citationDistributed Caching Algorithms for Content Distribution Networks
Borst, S., Gupta, V., & Walid, A. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461964 · Cited by 681
Index Coding With Side Information
Bar-Yossef, Z., Birk, Y., Jayram, T. S., & Kol, T. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2103753 · Cited by 498
Comparative Models of the File Assignment Problem
Dowdy, L. W., & Foster, D. V. (1982) · ACM Computing Surveys · doi:10.1145/356876.356883 · Cited by 472
Coded caching with nonuniform demands
Niesen, U., & Maddah-Ali, M. A. (2014) · 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infcomw.2014.6849235 · Cited by 415
Self-citationDynamic batching policies for an on-demand video server
Dan, A., Sitaram, D., & Shahabuddin, P. (1996) · Multimedia Systems · doi:10.1007/s005300050016 · Cited by 400
The use of multicast delivery to provide a scalable and interactive video-on-demand service
Almeroth, K. C., & Ammar, M. H. (1996) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.508282 · Cited by 336
Birk, Y., & Kol, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874540 · Cited by 324
Approximation Algorithms for Data Placement Problems
Baev, I., Rajaraman, R., & Swamy, C. (2008) · SIAM Journal on Computing · doi:10.1137/080715421 · Cited by 215
Placement Algorithms for Hierarchical Cooperative Caching
Korupolu, M. R., Plaxton, C. G., & Rajaraman, R. (2001) · Journal of Algorithms · doi:10.1006/jagm.2000.1129 · Cited by 175
Karamchandani, N., Niesen, U., Maddah-Ali, M. A., & Diggavi, S. N. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6875212 · Cited by 79
Self-citationOn the Hardness of Approximating the Network Coding Capacity
Langberg, M., & Sprintson, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2094910 · Cited by 69
An equivalence between network coding and index coding
Effros, M., Rouayheb, S. E., & Langberg, M. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620370 · Cited by 56
Web caching using access statistics
Meyerson, A., Munagala, K., & Plotkin, S. A. (2001) · doi:10.5555/365411.365479 · Cited by 42
Online Coded CachingPreprint
Pedarsani, R., Maddah-Ali, M. A., & Niesen, U. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.3646 · Cited by 12
Self-citation
Cited by
A Survey on Low Latency Towards 5G: RAN, Core Network and Caching Solutions
Parvez, I., Rahmati, A., Guvenc, I., Sarwat, A. I., & Dai, H. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2841349 · Cited by 883
Speeding Up Distributed Machine Learning Using Codes
Lee, K., Lam, M., Pedarsani, R., Papailiopoulos, D., & Ramchandran, K. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2736066 · Cited by 829
Fundamental Limits of Caching in Wireless D2D Networks
Ji, M., Caire, G., & Molisch, A. F. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2504556 · Cited by 596
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing
Li, S., Maddah-Ali, M. A., Yu, Q., & Avestimehr, A. S. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2756959 · Cited by 451
Self-citationBase-Station Assisted Device-to-Device Communications for High-Throughput Wireless Video Networks
Golrezaei, N., Mansourifard, P., Molisch, A. F., & Dimakis, A. G. (2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.2316817 · Cited by 448
Metadata
- Authors
- Maddah-Ali, M. A., & Niesen, U.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2015-08
- Volume
- 23
- Issue
- 4
- Pages
- 1029-1040
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W1990395546
- Cited by
- 626
- References
- 17
- FWCI
- 77.82
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.