English
Related papers

Related papers: Cache-aided Interference Management Using Hypercub…

200 papers

We study a multi-access variant of the popular coded caching framework, which consists of a central server with a catalog of $N$ files, $K$ caches with limited memory $M$, and $K$ users such that each user has access to $L$ consecutive…

Information Theory · Computer Science 2020-03-13 Kota Srinivas Reddy , Nikhil Karamchandani

Coded multicasting has been shown to improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link. However, the schemes that have been shown to achieve order-optimal perfor- mance…

Information Theory · Computer Science 2015-11-25 Mingyue Ji , Karthikeyan Shanmugam , Giuseppe Vettigli , Jaime Llorca , Antonia M. Tulino , Giuseppe Caire

Over the past decade, the bulk of wireless traffic has shifted from speech to content. This shift creates the opportunity to cache part of the content in memories closer to the end users, for example in base stations. Most of the prior…

Information Theory · Computer Science 2019-02-18 Mohammad Ali Maddah-Ali , Urs Niesen

Recent studies on cloud-radio access networks assume either signal-level or scheduling-level coordination. This paper considers a hybrid coordinated scheme as a means to benefit from both policies. Consider the downlink of a multi-cloud…

Information Theory · Computer Science 2016-10-14 Ahmed Douik , Hayssam Dahrouj , Tareq Y. Al-Naffouri , Mohamed-Slim Alouini

In this paper, we propose an emerging wavenumber-domain precoding scheme to break the limitations of rank-1 channels that merely supports single-stream transmission, enabling simultaneous transmission of multiple data streams. The proposed…

Signal Processing · Electrical Eng. & Systems 2024-09-23 Yuanbin Chen , Xufeng Guo , Tianqi Mao , Qingqing Wu , Zhaocheng Wang , Chau Yuen

We study the problem of multi-access coded caching (MACC): a central server has $N$ files, $K$ ($K \leq N$) caches each of which stores $M$ out of the $N$ files, $K$ users each of which demands one out of the $N$ files, and each user…

Information Theory · Computer Science 2022-02-14 Niladri Das , B. Sundar Rajan

High-throughput inference serving is essential for applications built on large language models (LLMs). Existing serving frameworks reduce request-level and batch-level bubbles through batching and scheduling, but often overlook bubbles…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-25 Fengyao Bai , Hongbin Zhang , Zhitao Chen , Jiangsu Du , Zhiguang Chen , Yutong Lu

Coded caching leverages the differences in user cache memories to achieve gains that scale with the total cache size, alleviating network congestion due to high-quality content requests. Additionally, distributing transmitters over a wide…

Information Theory · Computer Science 2025-05-05 Kagan Akcay , Eleftherios Lampiris , MohammadJavad Salehi , Giuseppe Caire

This paper considers the downlink of a cache-enabled fog radio access network (F-RAN) with limited fronthaul capacity, where user association (UA), data delivery rate (DDR) and signal precoding are jointly optimized. We formulate a…

Information Theory · Computer Science 2017-07-03 Tung T. Vu , Duy T. Ngo , Lawrence Ong , Salman Durrani , Richard H. Middleton

The strong interference suffered by users can be a severe problem in cache-enabled networks (CENs) due to the content-centric user association mechanism. To tackle this issue, multi-antenna technology may be employed for interference…

Information Theory · Computer Science 2022-01-31 Tianming Feng , Xuemai Gu , Ben Liang

With the growing demand for latency-critical and computation-intensive Internet of Things (IoT) services, the IoT-oriented network architecture, mobile edge computing (MEC), has emerged as a promising technique to reinforce the computation…

Information Theory · Computer Science 2022-08-09 Jiechen Chen , Hong Xing , Xiaohui Lin , Arumugam Nallanathan , Suzhi Bi

A key practical constraint on the design of Hybrid automatic repeat request (HARQ) schemes is the size of the on-chip buffer that is available at the receiver to store previously received packets. In fact, in modern wireless standards such…

Information Theory · Computer Science 2015-04-01 Wonju Lee , Osvaldo Simeone , Joonhyuk Kang , Sundeep Rangan , Petar Popovski

The next generation multibeam satellites open up a new way to design satellite communication channels with the full flexibility in bandwidth, transmit power and beam coverage management. In this paper, we exploit the flexible multibeam…

Information Theory · Computer Science 2022-01-25 Thang X. Vu , Nicola Maturo , Symeon Chatzinotas , Joel Grotz , Tom Christophory , Björn Ottersten

Network based on distributed caching of content is a new architecture to alleviate the ongoing explosive demands for rate of multi-media traffic. In caching networks, coded caching is a recently proposed technique that achieves significant…

Information Theory · Computer Science 2017-10-16 Qifa Yan , Xiaohu Tang , Qingchun Chen

This paper addresses the problem of exponentially increasing sub-packetization with the number of users in a centralized coded caching system by introducing a new coded caching scheme inspired by the symmetric neighboring consecutive side…

Information Theory · Computer Science 2020-09-24 Anjana A. Mahesh , B. Sundar Rajan

We study the throughput and delay characteristics of wireless caching networks, where users are mainly interested in retrieving content stored in the network, rather than in maintaining source-destination communication. Nodes are assumed to…

Networking and Internet Architecture · Computer Science 2017-04-25 Milad Mahdian , Edmund Yeh

Decentralized coded caching scheme, introduced by Maddah-Ali and Niesen, assumes that the caches are filled with no coordination. This work identifies a decentralized coded caching scheme -- under the assumption of uncoded placement -- for…

Information Theory · Computer Science 2021-01-26 Elizabath Peter , B. Sundar Rajan

This paper addresses joint admission control and per-user equipment (UE) bandwidth allocation to maximize weighted sum-rate in network slicing-enabled user-centric cell-free (CF) massive multiple-input multiple-output (mMIMO) systems when…

Systems and Control · Electrical Eng. & Systems 2026-01-22 Manobendu Sarker , Soumaya Cherkaoui

For the K user, single input single output (SISO), frequency selective interference channel, a new low complexity transmit beamforming design that improves the achievable sum rate is presented. Jointly employing the interference alignment…

Information Theory · Computer Science 2015-03-17 Douglas Kim , Murat Torlak

Recent literature including our past work provide analysis and solutions for using (i) erasure coding, (ii) parallelism, or (iii) variable slicing/chunking (i.e., dividing an object of a specific size into a variable number of smaller…

Networking and Internet Architecture · Computer Science 2014-03-21 Guanfeng Liang , Ulas C. Kozat