期刊
IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2019)
卷 -, 期 -, 页码 226-234出版社
IEEE
DOI: 10.1109/infocom.2019.8737407
关键词
-
类别
资金
- NSF [CNS-1411636, CNS 1618339, CNS 1617729, CNS-1814322, CNS-1836772]
In this paper, we develop an optimization decomposition framework for cache management under BIG cache abstraction which fully utilizes the cache resources in a cache network. We assign a utility function to each content, and formulate a joint optimization problem to maximize the overall utility of a cache network. We show that this global network utility maximization problem can be decomposed into two sub-problems, the cache allotment problem and object placement problem, which can be solved separately and iteratively. This decoupling enables us to separately optimize the performance objectives from the perspectives of content providers, cache network operators, and users. We provide exact solution to the object placement problem with Poisson and Pareto request interarrival distributions. We also devise a primal-dual algorithm for online content management. We conduct extensive numerical analysis and simulations to evaluate the performance of our optimization decomposition framework, and study the impact of various key factors such as hazard rate functions of the request interarrival distributions and object popularities. We show that our optimization decomposition framework outperform existing heuristic methods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据