English
Related papers

Related papers: Network Cache Design under Stationary Requests: Ex…

200 papers

Caches are fundamental to latency-sensitive systems like Content Delivery Networks (CDNs) and Mobile Edge Computing (MEC). However, the delayed hit phenomenon where multiple requests for an object occur during its fetch from the remote…

Networking and Internet Architecture · Computer Science 2025-05-06 Bowen Jiang , Chaofan Ma , Duo Wang

Small basestations (SBs) equipped with caching units have potential to handle the unprecedented demand growth in heterogeneous networks. Through low-rate, backhaul connections with the backbone, SBs can prefetch popular files during…

Networking and Internet Architecture · Computer Science 2018-03-14 Alireza Sadeghi , Fatemeh Sheikholeslami , Georgios B. Giannakis

This paper considers heterogeneous coded caching where the users have unequal distortion requirements. The server is connected to the users via an error-free multicast link and designs the users' cache sizes subject to a total memory…

Information Theory · Computer Science 2018-02-28 Abdelrahman M. Ibrahim , Ahmed A. Zewail , Aylin Yener

In this paper, we consider the problem of allocating cache resources among multiple content providers. The cache can be partitioned into slices and each partition can be dedicated to a particular content provider, or shared among a number…

Networking and Internet Architecture · Computer Science 2017-02-08 Mostafa Dehghan , Weibo Chu , Philippe Nain , Don Towsley

In order for an e-commerce platform to maximize its revenue, it must recommend customers items they are most likely to purchase. However, the company often has business constraints on these items, such as the number of each item in stock.…

Optimization and Control · Mathematics 2019-11-19 Andrea Boskovic , Qinyi Chen , Dominik Kufel , Zijie Zhou

In heterogeneous networks (HetNets), load balancing among different tiers can be effectively achieved by a biased user association scheme with which each user chooses to associate with one base station (BS) based on the biased received…

Networking and Internet Architecture · Computer Science 2017-01-05 Fancheng Kong , Xinghua Sun , Victor C. M. Leung , Hongbo Zhu

In cellular networks, the densification of connected devices and base stations engender the ever-growing traffic intensity, and caching popular contents with smart management is a promising way to alleviate such consequences. Our research…

Information Theory · Computer Science 2021-03-25 Takehiro Ohashi

Network cache allocation and management are important aspects of the design of an Information-Centric Network (ICN), such as one based on Named Data Networking (NDN). We address the problem of optimal cache size allocation and content…

Optimization and Control · Mathematics 2021-05-13 Van Sy Mai , Stratis Ioannidis , Davide Pesavento , Lotfi Benmohamed

A heterogenous network with base stations (BSs), small base stations (SBSs) and users distributed according to independent Poisson point processes is considered. SBS nodes are assumed to possess high storage capacity and to form a…

Information Theory · Computer Science 2016-11-17 B. N. Bharath , K. G. Nagananda , H. Vincent Poor

Caching is crucial for system performance, but the delayed hit phenomenon, where requests queue during lengthy fetches after a cache miss, significantly degrades user-perceived latency in modern high-throughput systems. While prior works…

Networking and Internet Architecture · Computer Science 2025-05-22 Bowen Jiang , Chaofan Ma

Hybrid networks consisting of MANET nodes and cellular infrastructure have been recently proposed to improve the performance of military networks. Prior work has demonstrated the benefits of in-network content caching in a wired, Internet…

Networking and Internet Architecture · Computer Science 2014-07-08 Mostafa Dehghan , Anand Seetharam , Ting He , Theodoros Salonidis , Jim Kurose , Don Towsley

In a 2002 paper, Che and co-authors proposed a simple approach for estimating the hit rates of a cache operating the least recently used (LRU) replacement policy. The approximation proves remarkably accurate and is applicable to quite…

Networking and Internet Architecture · Computer Science 2012-02-20 Christine Fricker , Philippe Robert , James Roberts

We propose a new and easily-realizable distributed hash table (DHT) peer-to-peer structure, incorporating a random caching strategy that allows for {\em polylogarithmic search time} while having only a {\em constant cache} size. We also…

Networking and Internet Architecture · Computer Science 2007-05-23 Nima Sarshar , Vwani Roychowdhury

Inspired by several delay-bounded mission-critical applications, this paper investigates chase-combining-based hybrid automatic repeat request (CC-HARQ) protocols to achieve high reliability in delay-constrained applications. A salient…

Information Theory · Computer Science 2023-01-24 Jaya Goel , J. Harshan

Existing proactive caching policies are designed by assuming that all users request contents with identical activity level at uniformly-distributed or known locations, among which most of the policies are optimized by assuming that user…

Information Theory · Computer Science 2018-10-29 Dong Liu , Chenyang Yang

Faced with increasing network traffic demands, cell dense deployment is one of significant means to utilize spectrum resources efficiently to improve network capacity. Multi-hop integrated access and backhaul (IAB) architectures have…

Neural and Evolutionary Computing · Computer Science 2025-04-07 Shuaifeng Zhang

Pushing popular content to cheap "helper" nodes (e.g., small cells) during off-peak hours has recently been proposed to cope with the increase in mobile data traffic. User requests can be served locally from these helper nodes, if the…

Networking and Internet Architecture · Computer Science 2017-02-17 Pavlos Sermpezis , Thrasyvoulos Spyropoulos , Luigi Vigneri , Theodoros Giannakas

We consider models of content delivery networks in which the servers are constrained by two main resources: memory and bandwidth. In such systems, the throughput crucially depends on how contents are replicated across servers and how the…

Performance · Computer Science 2018-01-10 Arpan Mukhopadhyay , Nidhi Hegde , Marc Lelarge

Inspired by several delay-bounded mission-critical applications, optimizing the end-to-end reliability of multi-hop networks is an important problem subject to end-to-end delay constraints on the packets. Towards that direction, Automatic…

Information Theory · Computer Science 2022-07-26 Jaya Goel , J. Harshan

Caching at base stations is a promising technology to satisfy the increasing capacity requirements and reduce the backhaul loads in future wireless networks. Careful design of random caching can fully exploit the file popularity and achieve…

Information Theory · Computer Science 2017-09-20 Sufeng Kuang , Nan Liu