网络容量约束下命名数据缓存的最优缓存分配
Optimal Cache Allocation for Named Data Caching under Network-Wide Capacity Constraint
摘要:
网络缓存分配和管理是信息中心网络(ICN)设计的重要方面,例如基于命名数据网络(NDN)的网络。我们解决的问题,最佳的高速缓存大小分配和内容放置在ICN,以最大限度地提高缓存增益路由成本节约。虽然现有技术假设在每个网络节点处的给定高速缓存大小并专注于内容放置,但我们研究了当给定全局网络范围的高速缓存存储预算时的问题,并且我们解决了最优的每节点高速缓存分配。这个问题出现在基于云的网络设置中,其中每个网络节点被虚拟化并容纳在云数据中心节点内,其中根据需要从云节点获取相关联的动态存储资源。与离线集中式版本的最佳缓存分配问题是NP-难的,我们开发了一个分布式自适应算法,提供了一个近似解内的一个常数因子的最佳。该算法的性能评估进行了广泛的模拟,涉及各种网络拓扑结构,建立实验,我们的建议显着优于现有的缓存分配算法。
英文摘要:
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 placement in an ICN in order to maximize the caching gain resulting from routing cost savings. While prior art assumes a given cache size at each network node and focuses on content placement, we study the problem when a global, network-wide cache storage budget is given and we solve for the optimal per-node cache allocation. This problem arises in cloud-based network settings where each network node is virtualized and housed within a cloud data center node with associated dynamic storage resources acquired from the cloud node as needed. With the offline centralized version of the optimal cache allocation problem being NP-hard, we develop a distributed adaptive algorithm that provides an approximate solution within a constant factor from the optimal. Performance evaluation of the algorithm is carried out through extensive simulations involving a variety of network topologies, establishing experimentally that our proposal significantly outperforms existing cache allocation algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。