Monolina Dutta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Monolina Dutta has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Anoop Thomas
School of Electrical Sciences, Indian Institute of Technology Bhubaneswar, Odisha 752050, India
4 shared publications - Balaji Sundar Rajan
Department of Electrical Communication Engineering, Indian Institute of Science, Bengaluru, India
1 shared publication - Frank Yong Li
University of Agder (UiA)
1 shared publication
Latest Publications
- 6 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 502-515
Novel Delivery Algorithms for Decentralized Multi-Access Coded Caching Systems
In this paper, we propose a multi-access coded caching system under decentralized setting tailored for Content Delivery Networks (CDNs). In this system, a central server hosts N files, each of size F bits, and serves K≤N users through a shared link. The network is equipped with c caches, each with a capacity of MF bits, distributed across the network, where each of the K users is connected to a random set of r≤c caches. Initially, we consider a model where each cache subset is accessed by an equal number of users. We introduce a novel content delivery algorithm for the central server, which allows us to derive a closed-form expression for the per user transmission rate. Using techniques from index coding, we prove the optimality of the proposed delivery scheme. Additionally, we extend the model to propose a more general and novel framework by allowing each subset of caches to serve an arbitrary number of users, thereby greatly enhancing the system’s flexibility and applicability. We also propose a new delivery algorithm tailored to this generalized setting and demonstrate its optimality under specific user-to-cache association scenarios. Numerical results demonstrate that, in a specific scenario where the user-to-cache associations do not satisfy the optimality conditions, the proposed generalized scheme shows improvement over the order-optimal state-of-the-art decentralized multi-access coded caching scheme for small cache sizes. Specifically, when approximately 25% of the content is stored at every cache, the proposed scheme achieves up to a 20% reduction in the per user transmission rate. Considering that both schemes serve an equal number of users, the observed improvements indicate a potential reduction in server bandwidth requirements, lower latency, and enhanced energy efficiency during content delivery.
- 6 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 502-515
Novel Delivery Algorithms for Decentralized Multi-Access Coded Caching Systems
In this paper, we propose a multi-access coded caching system under decentralized setting tailored for Content Delivery Networks (CDNs). In this system, a central server hosts N files, each of size F bits, and serves K≤N users through a shared link. The network is equipped with c caches, each with a capacity of MF bits, distributed across the network, where each of the K users is connected to a random set of r≤c caches. Initially, we consider a model where each cache subset is accessed by an equal number of users. We introduce a novel content delivery algorithm for the central server, which allows us to derive a closed-form expression for the per user transmission rate. Using techniques from index coding, we prove the optimality of the proposed delivery scheme. Additionally, we extend the model to propose a more general and novel framework by allowing each subset of caches to serve an arbitrary number of users, thereby greatly enhancing the system’s flexibility and applicability. We also propose a new delivery algorithm tailored to this generalized setting and demonstrate its optimality under specific user-to-cache association scenarios. Numerical results demonstrate that, in a specific scenario where the user-to-cache associations do not satisfy the optimality conditions, the proposed generalized scheme shows improvement over the order-optimal state-of-the-art decentralized multi-access coded caching scheme for small cache sizes. Specifically, when approximately 25% of the content is stored at every cache, the proposed scheme achieves up to a 20% reduction in the per user transmission rate. Considering that both schemes serve an equal number of users, the observed improvements indicate a potential reduction in server bandwidth requirements, lower latency, and enhanced energy efficiency during content delivery.
- 14 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Networking Letters
- Vol. 7 (1) , 26-30
Decentralized Coded Caching With Distributed Storage Across Data and Parity Servers
Traditional single server based coded caching may face server saturation and service vulnerability problems. In this letter, we integrate decentralized coded caching with a multi-server architecture comprising both data and parity servers. For file distribution in this network, a method referred to as file stripping is adopted, and a novel file delivery scheme is proposed. Closed-form expressions for the total transmission rate achieved by this scheme are derived, considering all the operational servers along with the worst-case transmission rate amongst these servers. Additionally, a comparative analysis between the proposed scheme and the conventional decentralized coded caching scheme is presented. The simulation results demonstrate the viability of our proposed scheme.
- 14 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Networking Letters
- Vol. 7 (1) , 26-30
Decentralized Coded Caching With Distributed Storage Across Data and Parity Servers
Traditional single server based coded caching may face server saturation and service vulnerability problems. In this letter, we integrate decentralized coded caching with a multi-server architecture comprising both data and parity servers. For file distribution in this network, a method referred to as file stripping is adopted, and a novel file delivery scheme is proposed. Closed-form expressions for the total transmission rate achieved by this scheme are derived, considering all the operational servers along with the worst-case transmission rate amongst these servers. Additionally, a comparative analysis between the proposed scheme and the conventional decentralized coded caching scheme is presented. The simulation results demonstrate the viability of our proposed scheme.
- 30 November 2023
- Published by Elsevier in Physical Communication
- Vol. 62
Decentralized coded caching for shared caches using erasure coding
- 30 November 2023
- Published by Elsevier in Physical Communication
- Vol. 62
Decentralized coded caching for shared caches using erasure coding
- 18 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (5) , 1458-1462
Decentralized Coded Caching for Shared Caches
The demands of the clients in the client-server framework exhibit temporal variance leading to congestion in the network at random intervals. To alleviate this problem, popular data is loaded in cache memories scattered across the network. In the conventional cache framework, each user has an associated cache and cache loading is centrally coordinated. For large networks, a more practical approach is to make the loading of the caches decentralized. This letter considers the shared caching problem in which each cache can serve multiple clients. A new and optimal delivery scheme is proposed for the decentralized shared caching problem. The delivery scheme is shown to be optimal among all linear schemes, using techniques from index coding. It is shown that the rate achieved by the proposed scheme is comparable to the existing scheme which uses centralized prefetching.
- 18 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (5) , 1458-1462
Decentralized Coded Caching for Shared Caches
The demands of the clients in the client-server framework exhibit temporal variance leading to congestion in the network at random intervals. To alleviate this problem, popular data is loaded in cache memories scattered across the network. In the conventional cache framework, each user has an associated cache and cache loading is centrally coordinated. For large networks, a more practical approach is to make the loading of the caches decentralized. This letter considers the shared caching problem in which each cache can serve multiple clients. A new and optimal delivery scheme is proposed for the decentralized shared caching problem. The delivery scheme is shown to be optimal among all linear schemes, using techniques from index coding. It is shown that the rate achieved by the proposed scheme is comparable to the existing scheme which uses centralized prefetching.