Foundations and Trends in Communications and Information Theory最新文献_第2页

Modeling and Optimization of Latency in Erasure-coded Storage Systems 擦除编码存储系统的延迟建模与优化

IF 2.4

Foundations and Trends in Communications and Information Theory Pub Date : 2020-05-21 DOI: 10.1561/0100000108

V. Aggarwal, Tian Lan

{"title":"Modeling and Optimization of Latency in Erasure-coded Storage Systems","authors":"V. Aggarwal, Tian Lan","doi":"10.1561/0100000108","DOIUrl":"https://doi.org/10.1561/0100000108","url":null,"abstract":"As consumers are increasingly engaged in social networking and E-commerce activities, businesses grow to rely on Big Data analytics for intelligence, and traditional IT infrastructures continue to migrate to the cloud and edge, these trends cause distributed data storage demand to rise at an unprecedented speed. Erasure coding has seen itself quickly emerged as a promising technique to reduce storage cost while providing similar reliability as replicated systems, widely adopted by companies like Facebook, Microsoft and Google. However, it also brings new challenges in characterizing and optimizing the access latency when erasure codes are used in distributed storage. The aim of this monograph is to provide a review of recent progress (both theoretical and practical) on systems that employ erasure codes for distributed storage. \u0000In this monograph, we will first identify the key challenges and taxonomy of the research problems and then give an overview of different approaches that have been developed to quantify and model latency of erasure-coded storage. This includes recent work leveraging MDS-Reservation, Fork-Join, Probabilistic, and Delayed-Relaunch scheduling policies, as well as their applications to characterize access latency (e.g., mean, tail, asymptotic latency) of erasure-coded distributed storage systems. We will also extend the problem to the case when users are streaming videos from erasure-coded distributed storage systems. Next, we bridge the gap between theory and practice, and discuss lessons learned from prototype implementation. In particular, we will discuss exemplary implementations of erasure-coded storage, illuminate key design degrees of freedom and tradeoffs, and summarize remaining challenges in real-world storage systems such as in content delivery and caching. Open problems for future research are discussed at the end of each chapter.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"11 1","pages":"380-525"},"PeriodicalIF":2.4,"publicationDate":"2020-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88639804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Information-Theoretic Foundations of Mismatched Decoding 错配解码的信息论基础

IF 2.4

Foundations and Trends in Communications and Information Theory Pub Date : 2020-03-26 DOI: 10.1561/0100000101

J. Scarlett, A. G. Fàbregas, A. Somekh-Baruch, Alfonso Martinez

{"title":"Information-Theoretic Foundations of Mismatched Decoding","authors":"J. Scarlett, A. G. Fàbregas, A. Somekh-Baruch, Alfonso Martinez","doi":"10.1561/0100000101","DOIUrl":"https://doi.org/10.1561/0100000101","url":null,"abstract":"Shannon's channel coding theorem characterizes the maximal rate of information that can be reliably transmitted over a communication channel when optimal encoding and decoding strategies are used. In many scenarios, however, practical considerations such as channel uncertainty and implementation constraints rule out the use of an optimal decoder. The mismatched decoding problem addresses such scenarios by considering the case that the decoder cannot be optimized, but is instead fixed as part of the problem statement. This problem is not only of direct interest in its own right, but also has close connections with other long-standing theoretical problems in information theory. In this monograph, we survey both classical literature and recent developments on the mismatched decoding problem, with an emphasis on achievable random-coding rates for memoryless channels. We present two widely-considered achievable rates known as the generalized mutual information (GMI) and the LM rate, and overview their derivations and properties. In addition, we survey several improved rates via multi-user coding techniques, as well as recent developments and challenges in establishing upper bounds on the mismatch capacity, and an analogous mismatched encoding problem in rate-distortion theory. Throughout the monograph, we highlight a variety of applications and connections with other prominent information theory problems.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"49 1","pages":"149-401"},"PeriodicalIF":2.4,"publicationDate":"2020-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91030153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 28

Theoretical Foundations of Adversarial Binary Detection 对抗性二进制检测的理论基础

IF 2.4

Foundations and Trends in Communications and Information Theory Pub Date : 2020-01-01 DOI: 10.1561/0100000102

M. Barni, B. Tondi

引用次数: 4

An Algebraic and Probabilistic Framework for Network Information Theory 网络信息理论的代数与概率框架

IF 2.4

Foundations and Trends in Communications and Information Theory Pub Date : 2020-01-01 DOI: 10.1561/0100000083

S. Pradhan, Arun Padakandla, Farhad Shirani

{"title":"An Algebraic and Probabilistic Framework for Network Information Theory","authors":"S. Pradhan, Arun Padakandla, Farhad Shirani","doi":"10.1561/0100000083","DOIUrl":"https://doi.org/10.1561/0100000083","url":null,"abstract":"In this monograph, we develop a mathematical framework based on asymptotically good random structured codes, i.e., codes possessing algebraic properties, for network information theory. We use these codes to propose new strategies for communication in multi-terminal settings. The proposed coding strategies are applicable to arbitrary instances of the multi-terminal communication problems under consideration. In particular, we consider four fundamental problems which can be considered as building blocks of networks: distributed source coding, interference channels, multiple-access channels with distributed states and multiple description source coding. We then develop a systematic framework for characterizing the performance limits of these strategies for these problems from an information-theoretic viewpoint. Lastly, we identify several examples of the multiterminal communication problems studied herein, for which structured codes S. Sandeep Pradhan, Arun Padakandla and Farhad Shirani (2021), “An Algebraic and Probabilistic Framework for Network Information Theory”, Foundations and Trends © in Communications and Information Theory: Vol. 18, No. 2, pp 173–379. DOI: 10.1561/0100000083. Full text available at: http://dx.doi.org/10.1561/0100000083","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"45 1","pages":"173-379"},"PeriodicalIF":2.4,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76231089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Cache Optimization Models and Algorithms 缓存优化模型和算法

IF 2.4

Foundations and Trends in Communications and Information Theory Pub Date : 2019-12-27 DOI: 10.1561/0100000104

G. Paschos, G. Iosifidis, G. Caire

引用次数: 29

Lattice-Reduction-Aided and Integer-Forcing Equalization: Structures, Criteria, Factorization, and Coding 格化约辅助和整数强制均衡:结构、准则、分解和编码

IF 2.4

Foundations and Trends in Communications and Information Theory Pub Date : 2019-12-08 DOI: 10.1561/0100000100

R. Fischer, S. Stern, J. Huber

引用次数: 6

Sparse Regression Codes 稀疏回归码

IF 2.4

Foundations and Trends in Communications and Information Theory Pub Date : 2019-09-30 DOI: 10.1561/0100000092

R. Venkataramanan, S. Tatikonda, A. Barron

{"title":"Sparse Regression Codes","authors":"R. Venkataramanan, S. Tatikonda, A. Barron","doi":"10.1561/0100000092","DOIUrl":"https://doi.org/10.1561/0100000092","url":null,"abstract":"Developing computationally-efficient codes that approach the Shannon-theoretic limits for communication and compression has long been one of the major goals of information and coding theory. There have been significant advances towards this goal in the last couple of decades, with the emergence of turbo codes, sparse-graph codes, and polar codes. These codes are designed primarily for discrete-alphabet channels and sources. For Gaussian channels and sources, where the alphabet is inherently continuous, Sparse Superposition Codes or Sparse Regression Codes (SPARCs) are a promising class of codes for achieving the Shannon limits. \u0000This survey provides a unified and comprehensive overview of sparse regression codes, covering theory, algorithms, and practical implementation aspects. The first part of the monograph focuses on SPARCs for AWGN channel coding, and the second part on SPARCs for lossy compression (with squared error distortion criterion). In the third part, SPARCs are used to construct codes for Gaussian multi-terminal channel and source coding models such as broadcast channels, multiple-access channels, and source and channel coding with side information. The survey concludes with a discussion of open problems and directions for future work.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"11 1","pages":"1-195"},"PeriodicalIF":2.4,"publicationDate":"2019-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74307354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 29

Group testing: an information theory perspective 群体测试:信息论视角

IF 2.4

Foundations and Trends in Communications and Information Theory Pub Date : 2019-02-15 DOI: 10.1561/0100000099

Matthew Aldridge, O. Johnson, J. Scarlett

{"title":"Group testing: an information theory perspective","authors":"Matthew Aldridge, O. Johnson, J. Scarlett","doi":"10.1561/0100000099","DOIUrl":"https://doi.org/10.1561/0100000099","url":null,"abstract":"The group testing problem concerns discovering a small number of defective items within a large population by performing tests on pools of items. A test is positive if the pool contains at least one defective, and negative if it contains no defectives. This is a sparse inference problem with a combinatorial flavour, with applications in medical testing, biology, telecommunications, information technology, data science, and more. In this monograph, we survey recent developments in the group testing problem from an information-theoretic perspective. We cover several related developments: efficient algorithms with practical storage and computation requirements, achievability bounds for optimal decoding methods, and algorithm-independent converse bounds. We assess the theoretical guarantees not only in terms of scaling laws, but also in terms of the constant factors, leading to the notion of the {em rate} of group testing, indicating the amount of information learned per test. Considering both noiseless and noisy settings, we identify several regimes where existing algorithms are provably optimal or near-optimal, as well as regimes where there remains greater potential for improvement. In addition, we survey results concerning a number of variations on the standard group testing problem, including partial recovery criteria, adaptive algorithms with a limited number of stages, constrained test designs, and sublinear-time algorithms.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"15 1","pages":"196-392"},"PeriodicalIF":2.4,"publicationDate":"2019-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88025684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 228

Lattice-Reduction-Aided andInteger-Forcing Equalization 格化约辅助和积分强迫均衡

IF 2.4

Foundations and Trends in Communications and Information Theory Pub Date : 2019-01-01 DOI: 10.1561/9781680836455

R. Fischer, S. Stern, J. Huber

引用次数: 1

Fundamentals of Index Coding 索引编码基础

IF 2.4

Foundations and Trends in Communications and Information Theory Pub Date : 2018-10-17 DOI: 10.1561/0100000094

Fatemeh Arbabjolfaei, Young-Han Kim

{"title":"Fundamentals of Index Coding","authors":"Fatemeh Arbabjolfaei, Young-Han Kim","doi":"10.1561/0100000094","DOIUrl":"https://doi.org/10.1561/0100000094","url":null,"abstract":"The index coding problem provides a simple yet rich model for several important engineering tasks such as satellite communication, content broadcasting, distributed caching, device-to-device relaying, and interference management. This monograph provides a broad overview of this fascinating subject, focusing on the simplest form of multiple-unicast index coding. The main objective in studying the index coding problem are to characterize the capacity region for a general index coding instance in a computable expression and to develop the coding scheme that can achieve it. Despite their simplicity, these two closely related questions are extremely difficult and precise answers to them, after twenty years of vigorous investigation, are still in terra incognita. There are, nonetheless, many elegant results that shed light on the fundamental challenges in multiple-unicast network communication and expose intriguing interplay between coding theory, graph theory, and information theory. This monograph contains a concise survey of these results in a unified framework. It further discusses the relation to Network Coding and Distributed Storage. Fundamentals of Index Coding gives the reader a concise, yet comprehensive, overview of the work undertaken on this important topic; its relationship to adjacent areas and lays the groundwork for future research. It is a valuable starting point for all researchers and students in Information Theory.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"76 1","pages":"163-346"},"PeriodicalIF":2.4,"publicationDate":"2018-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75950276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 53