English
Related papers

Related papers: Caching With Time-Varying Popularity Profiles: A L…

200 papers

A heterogenous network is considered where the base stations (BSs), small base stations (SBSs) and users are distributed according to independent Poisson point processes (PPPs). We let the SBS nodes to posses high storage capacity and are…

Information Theory · Computer Science 2015-07-28 B. N. Bharath , K. G. Nagananda

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

Optimal cache content placement in a wireless small cell base station (sBS) with limited backhaul capacity is studied. The sBS has a large cache memory and provides content-level selective offloading by delivering high data rate contents to…

Information Theory · Computer Science 2014-02-24 Pol Blasco , Deniz Gunduz

Caching contents at the network edge is an efficient mean for offloading traffic, reducing latency and improving users' quality-of-experience. In this letter, we focus on aspects of storage-bandwidth tradeoffs in which small cell base…

Information Theory · Computer Science 2016-11-18 Syed Tamoor-ul-Hassan , Mehdi Bennis , Pedro H. J. Nardelli , Matti Latva-Aho

Network densification with small cell base stations is a promising solution to satisfy future data traffic demands. However, increasing small cell base station density alone does not ensure better users quality-of-experience and incurs high…

Information Theory · Computer Science 2015-07-02 Syed Tamoor-ul-Hassan , Mehdi Bennis , Pedro H. J. Nardelli , Matti Latva-Aho

This paper studies content caching in cloud-aided wireless networks where small cell base stations with limited storage are connected to the cloud via limited capacity fronthaul links. By formulating a utility (inverse of service delay)…

Networking and Internet Architecture · Computer Science 2017-10-03 Syed Tamoor-ul-Hassan , Sumudu Samarakoon , Mehdi Bennis , Matti Latva-aho , Choong-Seong Hong

Design of distributed caching mechanisms is considered as an active area of research due to its promising solution in reducing data load in the backhaul link of a cellular network. In this paper, the problem of distributed content caching…

Information Theory · Computer Science 2020-10-14 S. Krishnendu , B. N. Bharath , Navneet Garg , Vimal Bhatia , Tharmalingam Ratnarajah

As the capacity demand of mobile applications keeps increasing, the backhaul network is becoming a bottleneck to support high quality of experience (QoE) in next-generation wireless networks. Content caching at base stations (BSs) is a…

Information Theory · Computer Science 2015-09-03 Xi Peng , Juei-Chin Shen , Jun Zhang , Khaled B. Letaief

Caching at base stations (BSs) is a promising way to offload traffic and eliminate backhaul bottleneck in heterogeneous networks (HetNets). In this paper, we investigate the optimal content placement maximizing the successful offloading…

Information Theory · Computer Science 2016-04-13 Dong Liu , Chenyang Yang

Caching at base stations (BSs) is a promising approach for supporting the tremendous traffic growth of content delivery over future small-cell wireless networks with limited backhaul. This paper considers exploiting spatial caching…

Signal Processing · Electrical Eng. & Systems 2018-08-09 Wei Han , An Liu , Wei Yu , Vincent K. N. Lau

In this paper, the problem of content-aware user clustering and content caching in wireless small cell networks is studied. In particular, a service delay minimization problem is formulated, aiming at optimally caching contents at the small…

Networking and Internet Architecture · Computer Science 2016-11-15 Mohammed S. ElBamby , Mehdi Bennis , Walid Saad , Matti Latva-aho

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

Caching popular content at base stations is a powerful supplement to existing limited backhaul links for accommodating the exponentially increasing mobile data traffic. Given the limited cache budget, we investigate the cache size…

Information Theory · Computer Science 2016-03-01 Xi Peng , Jun Zhang , S. H. Song , Khaled B. Letaief

We focus on a dense cellular network, in which a limited-size cache is available at every Base Station (BS). In order to optimize the overall performance of the system in such scenario, where a significant fraction of the users is covered…

Networking and Internet Architecture · Computer Science 2018-06-15 Emilio Leonardi , Giovanni Neglia

We consider content-level selective offloading of cellular downlink traffic to a wireless infostation terminal which stores high data-rate content in its cache memory. Cellular users in the vicinity of the infostation can directly download…

Information Theory · Computer Science 2014-07-24 Pol Blasco , Deniz Gündüz

We consider a hierarchical network that consists of mobile users, a two-tiered cellular network (namely small cells and macro cells) and central routers, each of which follows a Poisson point process (PPP). In this scenario, small cells…

Information Theory · Computer Science 2016-05-05 Ejder Baştuğ , Marios Kountouris , Mehdi Bennis , Mérouane Debbah

An efficient caching can be achieved by predicting the popularity of the files accurately. It is well known that the popularity of a file can be nudged by using recommendation, and hence it can be estimated accurately leading to an…

Information Theory · Computer Science 2023-07-21 S. Krishnendu , B. N. Bharath , Vimal Bhatia

In this paper, downlink delivery of popular content is optimized with the assistance of wireless cache nodes. Specifically, the requests of one file is modeled as a Poisson point process with finite lifetime, and two downlink transmission…

Information Theory · Computer Science 2018-01-04 Bojie Lv , Lexiang Huang , Rui Wang

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

In heterogeneous cellular networks with caching capability, due to mobility of users and storage constraints of small-cell base stations (SBSs), users may not be able to download all of their requested content from the SBSs within the delay…

Information Theory · Computer Science 2017-11-22 Emre Ozfatura , Deniz Gündüz
‹ Prev 1 2 3 10 Next ›