Article
Engineering, Electrical & Electronic
Digvijay Katyal, Pooja Nayak Muralidhar, B. Sundar Rajan
Summary: This paper introduces a novel caching and coded delivery scheme for multi-access networks, which outperforms existing schemes like MaN and the SPE scheme, particularly in large memory size cases. By normalizing the per-user rate of different schemes, it is shown that the proposed scheme performs better, allowing for different choices based on cross resolvable designs.
IEEE TRANSACTIONS ON COMMUNICATIONS
(2021)
Article
Engineering, Electrical & Electronic
Xianzhang Wu, Minquan Cheng, Congduan Li, Li Chen
Summary: This paper introduces the technique of coded caching and its application in reducing data transmission load during peak traffic times. A novel placement delivery array (PDA) construction using proper orthogonal arrays (POAs) is proposed to achieve a smaller subpacketization level. An effective transform is further proposed to improve the coded caching scheme and achieve a smaller subpacketization level. Experimental results show that the proposed schemes have a lower subpacketization level or transmission rate compared to benchmark schemes.
IEEE TRANSACTIONS ON COMMUNICATIONS
(2022)
Article
Computer Science, Information Systems
Minquan Cheng, Jie Li, Xiaohu Tang, Ruizhong Wei
Summary: Coded caching systems aim to reduce data transmission during peak traffic, with transmission rate and subpacketization being important parameters. Designing schemes with lower transmission rates and subpacketization can improve transmission efficiency.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2021)
Article
Computer Science, Information Systems
Minquan Cheng, Jinyu Wang, Xi Zhong, Qiang Wang
Summary: The text presents a framework for constructing coded caching schemes, with the use of orthogonal arrays leading to more efficient solutions with lower transmission load and decreased implementation complexity.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2021)
Article
Computer Science, Information Systems
Guillaume Ruty, Hana Baccouch, Victor Nguyen, Andre Surcouf, Jean-Louis Rougier, Nadia Boukhatem
Summary: The study proposes a new caching policy for erasure-coded storage systems, aiming to cache full objects to improve cache hit ratio and reduce waste. Simulation evaluation demonstrates that the full replica solution outperforms traditional caching methods in terms of cache performance.
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS
(2021)
Article
Computer Science, Hardware & Architecture
Rong Sun, Huihui Zheng, Jingwei Liu
Summary: This study introduces novel cache placement and delivery schemes for fog-aided networks, utilizing coding techniques to reduce transmission load and alleviate network congestion. The impact of cache memories on transmission time is analyzed, showing that centralized schemes outperform decentralized ones for both parallel and successive delivery. Increasing memories of relays and users lead to decreased transmission load, and when total memory can store the file library, the need for a server in delivery phase is eliminated.
Article
Computer Science, Information Systems
Hari Hara Suthan Chittoor, Prasad Krishnan, K. V. Sushena Sree, Bhavana Mamillapalli
Summary: Existing centralized coded caching schemes require files at the server to be divisible into a large number of parts to achieve significant rate gains. This study proposes two new centralized coded caching schemes with low subpacketization and moderate rate gains utilizing projective geometries over finite fields. The first scheme has a larger cache requirement with a constant rate, while the second scheme has a smaller cache requirement but offers a higher rate.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2021)
Proceedings Paper
Computer Science, Information Systems
Digvijay Katyal, Pooja Nayak Muralidhar, B. Sundar Rajan
Summary: This study proposes a new caching and coded delivery scheme for multi-access networks, which outperforms other schemes when normalized by the rate of users served.
2020 IEEE INFORMATION THEORY WORKSHOP (ITW)
(2021)
Article
Engineering, Electrical & Electronic
Xianzhang Wu, Minquan Cheng, Li Chen, Congduan Li, Zifan Shi
Summary: Coded caching is an effective technique to reduce traffic congestion, but the implementation complexity increases with the number of packets. The placement delivery array (PDA) was proposed to address this issue, using the injective arc coloring of regular digraphs. This paper investigates the design of PDA from a new perspective and proposes four new coded caching schemes with a linear subpacketization level and a small transmission rate.
IEEE TRANSACTIONS ON COMMUNICATIONS
(2023)
Proceedings Paper
Computer Science, Hardware & Architecture
Yun Kong, Youlong Wu, Minquan Cheng
Summary: This paper studies a hierarchical caching system with a server and multiple mirror sites, aiming to address two main problems: 1) the unknown optimal communication load under the uncoded placement for the first layer, and 2) the unclear tradeoff between transmission loads and subpacketization level in the existing schemes. The paper proposes a new structure called hierarchical placement delivery array (HPDA) to characterize the data placement and delivery, and constructs two classes of HPDAs to achieve optimal R-1 or lower subpacketization level with slight increase in transmission loads.
2023 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, WCNC
(2023)
Article
Engineering, Electrical & Electronic
Jesper Pedersen, Alexandre Graell Amat, Jasper Goseling, Fredrik Brannstrom, Iryna Andriyanova, Eirik Rosnes
Summary: The study focuses on distributed and dynamic caching of coded content at small base stations (SBSs) in an area served by a macro base station (MBS), using time-to-live (TTL) cache eviction policy to minimize overall network load, especially when request arrivals are bursty. The problem can be analyzed as a convex optimization problem for a specific single cache, showing that static caching is optimal under a Poisson request process.
IEEE TRANSACTIONS ON COMMUNICATIONS
(2021)
Article
Engineering, Electrical & Electronic
Sreelakshmi Pazhoor, Jesy Pachat, Anjana Ambika Mahesh, P. P. Deepthi, B. Sundar Rajan
Summary: In this work, a novel technique called index coded NOMA (IC-NOMA) is proposed, which combines NOMA and index coding to reduce the number of transmissions and improve spectral efficiency. Through detailed analytical studies, it is validated that the proposed transmission system provides improved spectral efficiency and power saving compared to conventional IC systems.
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
(2022)
Proceedings Paper
Computer Science, Information Systems
Pooja Nayak Muralidhar, Digvijay Katyal, B. Sundar Rajan
Summary: This paper presents a new multi-access coded caching scheme using CRDs design, which can improve the rate-per-user performance metric.
2021 IEEE INFORMATION THEORY WORKSHOP (ITW)
(2021)
Article
Engineering, Electrical & Electronic
Fariba Abbasi, Hessam Mahdavifar, Emanuele Viterbo
Summary: This paper proposes a novel mechanism for concatenating outer polar codes with inner repetition codes, called polar coded repetition. By slightly modifying the polar codeword, the achievable rate of the standard polar-repetition scheme can be improved while maintaining overall encoding and decoding complexity. The performance of the polar coded repetition scheme is analyzed for the binary erasure channel (BEC) and additive white Gaussian noise (AWGN) channel, showing better finite-length performance compared to the uncoded polar repetition scheme at the cost of slightly increased decoding complexity. The proposed scheme is also compared with other low-rate solutions based on polar codes in terms of performance and complexity.
IEEE TRANSACTIONS ON COMMUNICATIONS
(2022)
Article
Telecommunications
Monolina Dutta, Anoop Thomas
Summary: This study focuses on addressing network congestion caused by temporal variance in client demands in the client-server framework, and proposes a decentralized shared caching scheme. The proposed scheme, utilizing index coding techniques, is shown to be optimal among all linear schemes, achieving a comparable rate to existing centralized prefetching schemes.
IEEE COMMUNICATIONS LETTERS
(2021)
Article
Computer Science, Information Systems
Ardhendu Tripathy, Aditya Ramamoorthy
IEEE TRANSACTIONS ON INFORMATION THEORY
(2018)
Article
Telecommunications
Li Tang, Konstantinos Konstantinidis, Aditya Ramamoorthy
IEEE COMMUNICATIONS LETTERS
(2019)
Article
Engineering, Electrical & Electronic
Aditya Ramamoorthy, Anindya Bijoy Das, Li Tang
IEEE SIGNAL PROCESSING MAGAZINE
(2020)
Article
Computer Science, Hardware & Architecture
Konstantinos Konstantinidis, Aditya Ramamoorthy
IEEE-ACM TRANSACTIONS ON NETWORKING
(2020)
Article
Computer Science, Hardware & Architecture
Hooshang Ghasemi, Aditya Ramamoorthy
IEEE-ACM TRANSACTIONS ON NETWORKING
(2020)
Article
Computer Science, Information Systems
Anindya Bijoy Das, Aditya Ramamoorthy, Namrata Vaswani
Summary: In distributed matrix computations, the problem of stragglers can be addressed by a convolutional coding approach that offers optimal straggler resilience and numerical robustness. Another approach with slightly higher decoding complexity allows operation close to the storage capacity lower bound while its numerical robustness can be quantified theoretically. Extensive experiments on the AWS cloud platform support these claims.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2021)
Article
Computer Science, Information Systems
Anindya Bijoy Das, Aditya Ramamoorthy
Summary: Distributed matrix computations can be affected by slow or failed worker nodes, but coded computation can mitigate these issues. However, using MDS codes may destroy the sparsity of sparse matrices and ignore the partial computations from slow nodes. This research proposes a scheme that leverages partial computation and reduces coding time, leading to improved numerical stability in the decoding process.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2022)
Article
Computer Science, Information Systems
Aditya Ramamoorthy, Li Tang
Summary: Polynomial based methods can mitigate the effect of stragglers in distributed matrix computations. However, they suffer from serious numerical issues. This research proposes a novel approach using circulant permutation matrices and rotation matrices for coded matrix computation, and demonstrates an upper bound on the condition number of the recovery matrices.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2022)
Article
Engineering, Electrical & Electronic
Praneeth Narayanamurthy, Namrata Vaswani, Aditya Ramamoorthy
Summary: This work addresses the problem of Subspace Tracking with missing data and outliers. It proposes a novel algorithm that does not assume piecewise constant subspace change and is simpler compared to previous approaches. Furthermore, the study extends its approach to solving these problems in federated settings and over-air data communication mode.
IEEE TRANSACTIONS ON SIGNAL PROCESSING
(2022)
Article
Engineering, Electrical & Electronic
Kyungrak Son, Aditya Ramamoorthy, Wan Choi
Summary: By leveraging group theory, this study proposes a distributed matrix multiplication scheme using the cyclic group and identifies the condition for perfect reconstruction. The proposed scheme demonstrates better error performance in a noisy channel compared to the uncoded scheme due to its diversity gain.
IEEE SIGNAL PROCESSING LETTERS
(2021)