Joint Caching and Routing in Cache Networks With Arbitrary Topology
Joint Caching and Routing in Cache Networks With Arbitrary Topology
复制标题
DOI：
10.1109/tpds.2023.3276724
复制
发表时间：
2022-07
影响因子：
5.3
通讯作者：
Tian Xie;Sanchal Thakkar;Ting He;P. Mcdaniel;Quinn K. Burke
中科院分区：
文献类型：
--
作者：
Tian Xie;Sanchal Thakkar;Ting He;P. Mcdaniel;Quinn K. Burke
网内缓存和灵活的路由是下一代网络基础设施的两个最著名的优点。然而，很少有解决方案可用于联合优化缓存和路由，为具有任意拓扑结构的网络提供性能保证。我们对这个基本问题采取了整体的方法，通过分析其复杂性在所有情况下，并开发多项式时间的算法，在重要的特殊情况下近似保证。我们还揭示了在一般情况下实现保证近似的根本挑战，并提出了一个交替优化算法具有良好的经验性能和快速收敛。我们的算法已经证明了上级性能的路由成本和拥塞相比，国家的最先进的解决方案在评估的基础上真实的拓扑结构和请求跟踪。
In-network caching and flexible routing are two of the most celebrated advantages of next generation network infrastructures. Yet few solutions are available for jointly optimizing caching and routing that provide performance guarantees for networks with arbitrary topology. We take a holistic approach towards this fundamental problem by analyzing its complexity in all the cases and developing polynomial-time algorithms with approximation guarantees in important special cases. We also reveal the fundamental challenge in achieving guaranteed approximation in the general case and propose an alternating optimization algorithm with good empirical performance and fast convergence. Our algorithms have demonstrated superior performance in both routing cost and congestion compared to the state-of-the-art solutions in evaluations based on real topology and request traces.