论文标题
数据平面中有限的关联缓存
Limited Associativity Caching in the Data Plane
论文作者
论文摘要
网络内的缓存有望提高网络和边缘应用程序的性能，因为它缩短了数据所需的路径。这是通过在访问数据的客户端与维护数据的存储服务器之间在网络切换中存储所谓的热门项目。由于数据在任何情况下都流过这些开关，因此在那里缓存热门物品是很自然的。 大多数软件管理的缓存将缓存视为完全关联的区域。 las，一种完全关联的设计似乎与可编程开关在短时间内处理数据包的目标以及其限制编程模型的目标是不符的。在这项工作中，我们提出了PKACHE，这是可编程开关特定于域的P4语言中的通用有限的关联缓存实现，并通过实现多种流行的高速缓存管理方案来演示其实用性。
In-network caching promises to improve the performance of networked and edge applications as it shortens the paths data need to travel. This is by storing so-called hot items in the network switches on-route between clients who access the data and the storage servers who maintain it. Since the data flows through those switches in any case, it is natural to cache hot items there. Most software-managed caches treat the cache as a fully associative region. Alas, a fully associative design seems to be at odds with programmable switches' goal of handling packets in a short bounded amount of time, as well as their restricted programming model. In this work, we present PKache, a generic limited associativity cache implementation in the programmable switches' domain-specific P4 language, and demonstrate its utility by realizing multiple popular cache management schemes.
