Advanced Technologies in Storage, Computing, and Communication

A special issue of Information (ISSN 2078-2489). This special issue belongs to the section "Information Theory and Methodology".

Deadline for manuscript submissions: closed (20 July 2023) | Viewed by 7173

Special Issue Editors

Electrical Engineering and Computer Science Department, Technische Universität Berlin, 10587 Berlin, Germany
Interests: information theory; coding techniques; wireless communications; security and privacy
Electrical and Computer Engineering Department, University of Utah, Salt Lake City, UT 84112, USA
Interests: cloud and edge computing; machine learning; information theory; caching networks; communications and networking; signal processing; optimizations
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Electrical Engineering and Computer Science Department, Technische Universität Berlin, 10587 Berlin, Germany
Interests: communications theory; information theory; channel and source coding; wireless communications

Special Issue Information

Dear Colleagues,

Recent years have witnessed the emergence of Big Data and artificial intelligence with wide applications in both business and consumer worlds. One promising solution is to use the rapidly increasing volume of data and computition resource available at massive distributed nodes, and to integrate the intelligences of information computing, storage, and communication. The aim of this Special Issue is to develop and review the recent results in this fascinating intersection of caching, distributed computing, communication, machine learning, and information theory. Topics of interest include, but are not limited to, 

  • Coded and uncoded caching;
  • Coded distributed computing;
  • Elastic computing;
  • Computations and communications in distributed machine learning;
  • Private information retrieval;
  • Distributed storage systems;
  • Computations in network coding;
  • Practical considerations such as network topologies, privacy and security, and implementation complexities.

Dr. Kai Wan
Dr. Mingyue Ji
Dr. Giuseppe Caire
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Information is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • information theory
  • coding techniques
  • storage
  • computing
  • communication
  • privacy and security

Published Papers (4 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

30 pages, 887 KiB  
Article
Group Testing with a Graph Infection Spread Model
by Batuhan Arasli and Sennur Ulukus
Information 2023, 14(1), 48; https://doi.org/10.3390/info14010048 - 12 Jan 2023
Cited by 5 | Viewed by 1446
Abstract
The group testing idea is an efficient infection identification approach based on pooling the test samples of a group of individuals, which results in identification with less number of tests than individually testing the population. In our work, we propose a novel infection [...] Read more.
The group testing idea is an efficient infection identification approach based on pooling the test samples of a group of individuals, which results in identification with less number of tests than individually testing the population. In our work, we propose a novel infection spread model based on a random connection graph which represents connections between n individuals. Infection spreads via connections between individuals, and this results in a probabilistic cluster formation structure as well as non-i.i.d. (correlated) infection statuses for individuals. We propose a class of two-step sampled group testing algorithms where we exploit the known probabilistic infection spread model. We investigate the metrics associated with two-step sampled group testing algorithms. To demonstrate our results, for analytically tractable exponentially split cluster formation trees, we calculate the required number of tests and the expected number of false classifications in terms of the system parameters, and identify the trade-off between them. For such exponentially split cluster formation trees, for zero-error construction, we prove that the required number of tests is O(log2n). Thus, for such cluster formation trees, our algorithm outperforms any zero-error non-adaptive group test, binary splitting algorithm, and Hwang’s generalized binary splitting algorithm. Our results imply that, by exploiting probabilistic information on the connections of individuals, group testing can be used to reduce the number of required tests significantly even when the infection rate is high, contrasting the prevalent belief that group testing is useful only when the infection rate is low. Full article
(This article belongs to the Special Issue Advanced Technologies in Storage, Computing, and Communication)
Show Figures

Figure 1

14 pages, 365 KiB  
Article
A Shannon-Theoretic Approach to the Storage–Retrieval Trade-Off in PIR Systems
by Chao Tian, Hua Sun and Jun Chen
Information 2023, 14(1), 44; https://doi.org/10.3390/info14010044 - 11 Jan 2023
Viewed by 1454
Abstract
We consider the storage–retrieval rate trade-off in private information retrieval (PIR) systems using a Shannon-theoretic approach. Our focus is mostly on the canonical two-message two-database case, for which a coding scheme based on random codebook generation and the binning technique is proposed. This [...] Read more.
We consider the storage–retrieval rate trade-off in private information retrieval (PIR) systems using a Shannon-theoretic approach. Our focus is mostly on the canonical two-message two-database case, for which a coding scheme based on random codebook generation and the binning technique is proposed. This coding scheme reveals a hidden connection between PIR and the classic multiple description source coding problem. We first show that when the retrieval rate is kept optimal, the proposed non-linear scheme can achieve better performance over any linear scheme. Moreover, a non-trivial storage-retrieval rate trade-off can be achieved beyond space-sharing between this extreme point and the other optimal extreme point, achieved by the retrieve-everything strategy. We further show that with a method akin to the expurgation technique, one can extract a zero-error PIR code from the random code. Outer bounds are also studied and compared to establish the superiority of the non-linear codes over linear codes. Full article
(This article belongs to the Special Issue Advanced Technologies in Storage, Computing, and Communication)
Show Figures

Figure 1

13 pages, 1110 KiB  
Article
Coded Parallel Transmission for Half-Duplex Distributed Computing
by Qixuan Zai, Kai Yuan and Youlong Wu
Information 2022, 13(7), 342; https://doi.org/10.3390/info13070342 - 15 Jul 2022
Viewed by 1620
Abstract
This work studies a general distributed coded computing system based on the MapReduce-type framework, where distributed computing nodes within a half-duplex network wish to compute multiple output functions. We first introduce a definition of communication delay to characterize the time cost during the [...] Read more.
This work studies a general distributed coded computing system based on the MapReduce-type framework, where distributed computing nodes within a half-duplex network wish to compute multiple output functions. We first introduce a definition of communication delay to characterize the time cost during the date shuffle phase, and then propose a novel coding strategy that enables parallel transmission among the computation nodes by delicately designing the data placement, message symbols encoding, data shuffling, and decoding. Compared to the coded distributed computing (CDC) scheme proposed by Li et al., the proposed scheme significantly reduces the communication delay, in particular when the computation load is relatively smaller than the number of computing nodes K. Moreover, the communication delay of CDC is a monotonically increasing function of K, while the communication delay of our scheme decreases as K increases, indicating that the proposed scheme can make better use of the computing resources. Full article
(This article belongs to the Special Issue Advanced Technologies in Storage, Computing, and Communication)
Show Figures

Figure 1

19 pages, 791 KiB  
Article
Coded Caching for Combination Networks with Multiaccess
by Leitang Huang, Jinyu Wang, Minquan Cheng, Qingyong Deng and Bineng Zhong
Information 2022, 13(4), 191; https://doi.org/10.3390/info13040191 - 11 Apr 2022
Cited by 1 | Viewed by 1714
Abstract
In a traditional (H,r) combination network, each user connects to a unique set of r relays. However, few research efforts have considered the (H,r,u) multiaccess combination network problem wherein each unique set of [...] Read more.
In a traditional (H,r) combination network, each user connects to a unique set of r relays. However, few research efforts have considered the (H,r,u) multiaccess combination network problem wherein each unique set of r relays is connected by u users. In this paper, we focus on designing coded caching schemes for a (H,r,u) multiaccess combination network. By directly applying the well-known coding method (proposed by Zewail and Yener) for a (H,r) combination network, a coded caching scheme (called ZY scheme) for (H,r,u) multiaccess combination network is obtained. However, its subpacketization has an exponential order with the number of users which leads to high implementation complexity. In order to reduce subpacketization, a direct construction of a coded caching scheme (called the direct scheme) for (H,r,u) multiaccess combination network is proposed by means of combinational design theory, where the parameter u must be a combinatorial number. For the arbitrary parameter u, the hybrid construction of a coded caching scheme (called the hybrid scheme) for the (H,r,u) multiaccess combination network is proposed based on the direct scheme. Theoretical and numerical analysis shows that the direct scheme and the hybrid scheme have a smaller transmission load for each relay compared with the naive scheme (which is obtained by repeatedly applying the coded caching scheme for a traditional (H,r) combination network by u times) and have much lower subpacketization compared with the ZY scheme. Full article
(This article belongs to the Special Issue Advanced Technologies in Storage, Computing, and Communication)
Show Figures

Figure 1

Back to TopTop