U
Urs Niesen
Researcher at Qualcomm
Publications - 128
Citations - 7131
Urs Niesen is an academic researcher from Qualcomm. The author has contributed to research in topics: Wireless network & Cache. The author has an hindex of 34, co-authored 128 publications receiving 6583 citations. Previous affiliations of Urs Niesen include Carnegie Mellon University & Massachusetts Institute of Technology.
Papers
More filters
Journal ArticleDOI
Fundamental Limits of Caching
TL;DR: This paper proposes a novel coded caching scheme that exploits both local and global caching gains, leading to a multiplicative improvement in the peak rate compared with previously known schemes, and argues that the performance of the proposed scheme is within a constant factor of the information-theoretic optimum for all values of the problem parameters.
Journal ArticleDOI
Decentralized coded caching attains order-optimal memory-rate tradeoff
TL;DR: In this paper, the authors propose an efficient caching scheme, in which the content placement is performed in a decentralized manner, and despite this lack of coordination, the proposed scheme is nevertheless able to create coded-multicasting opportunities and achieves a rate close to the optimal centralized scheme.
Posted Content
Fundamental Limits of Caching
TL;DR: In this article, the authors proposed a coded caching scheme that exploits both local and global caching gains, leading to a multiplicative improvement in the peak rate compared to previously known schemes, in particular the improvement can be on the order of the number of users in the network.
Journal ArticleDOI
Online coded caching
TL;DR: This work proposes an online coded caching scheme termed coded least-recently sent (LRS) and simulates it for a demand time series derived from the dataset made available by Netflix for the Netflix Prize, showing that the proposed coded LRS algorithm significantly outperforms the popular least- recently used caching algorithm.
Posted Content
Hierarchical Coded Caching
TL;DR: A new caching scheme that combines two basic approaches is proposed that achieves the optimal communication rates to within a constant multiplicative and additive gap and shows that there is no tension between the rates in each of the two layers up to the aforementioned gap.