首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >In-Network Cache Management and Resource Allocation for Information-Centric Networks
【24h】

In-Network Cache Management and Resource Allocation for Information-Centric Networks

机译:信息中心网络的网络内缓存管理和资源分配

获取原文
获取原文并翻译 | 示例

摘要

We introduce the concept of resource management for in-network caching environments. We argue that in Information-Centric Networking environments, deterministically caching content messages at predefined places along the content delivery path results in unfair and inefficient content multiplexing between different content flows, as well as in significant caching redundancy. Instead, allocating resources along the path according to content flow characteristics results in better use of network resources and therefore, higher overall performance. The design principles of our proposed in-network caching scheme, which we call ProbCache, target these two outcomes, namely reduction of caching redundancy and fair content flow multiplexing along the delivery path. In particular, $ProbCache$ approximates the caching capability of a path and caches contents probabilistically to: 1) leave caching space for other flows sharing (part of) the same path, and 2) fairly multiplex contents in caches along the path from the server to the client. We elaborate on the content multiplexing fairness of $ProbCache$ and find that it sometimes behaves in favor of content flows connected far away from the source, that is, it gives higher priority to flows travelling longer paths, leaving little space to shorter-path flows. We introduce an enhanced version of the main algorithm that guarantees fair behavior to all participating content flows. We evaluate the proposed schemes in both homogeneous and heterogeneous cache size environments and formulate a framework for resource allocation in in-network caching environments. The proposed probabilistic approach to in-network caching exhibits ideal performance both in terms of network resource utilization and in terms of resource allocation fairness among competing content flows. Finally, and in contrast to the expected - ehavior, we find that the efficient design of $ProbCache$ results in fast convergence to caching of popular content items.
机译:我们介绍了用于网络内缓存环境的资源管理的概念。我们认为,在以信息为中心的网络环境中,沿内容传递路径在预定义位置处确定性地缓存内容消息会导致不同内容流之间的内容多路复用不公平且效率低下,并导致大量缓存冗余。取而代之的是,根据内容流特征沿路径分配资源可更好地利用网络资源,从而提高整体性能。我们提出的网络内缓存方案的设计原理(我们称为ProbCache)针对这两个结果,即减少缓存冗余和沿传递路径进行公平的内容流多路复用。特别是, $ ProbCache $ 近似于路径的缓存功能,并可能缓存内容以:1)为其他缓存空间流共享同一路径(的一部分),以及2)沿着从服务器到客户端的路径在缓存中公平地复用内容。我们详细介绍了 $ ProbCache $ 的内容多路复用公平性,发现它有时表现为有利于远离的内容流连接源,即,它优先考虑流经较长路径的流,而留给较短路径的空间很小。我们介绍了main算法的增强版本,该算法可以保证所有参与内容流的公平行为。我们在同构和异构缓存大小环境中评估所提出的方案,并为网络缓存环境中的资源分配制定框架。所提出的概率性网络内缓存方法在网络资源利用率和竞争性内容流之间的资源分配公平性方面均表现出理想的性能。最后,与预期的行为相反,我们发现 $ ProbCache $ 的有效设计可以快速收敛到缓存热门内容项目。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号