基于内容定义的Merkle树的高效集装箱配送
Content-defined Merkle Trees for Efficient Container Delivery
摘要：
当软件交付链中的环境发生变化时，容器化简化了应用程序的共享和部署。为了部署应用程序，容器交付方法推送和拉取容器映像。这些方法在文件和层（文件集）粒度上操作，并在容器内引入冗余数据。由于复制和提供冗余数据，一些容器操作（如升级、安装和维护）变得效率低下。在本文中，我们重新建立最近的结果，块级重复数据删除减少了单个容器的大小，通过使用内容定义的分块验证结果。然而，块级重复数据删除并不能提高推送/拉取操作的效率，推送/拉取操作必须确定要传输的特定块。我们在容器中的重复数据消除存储上引入内容定义的Merkle树（\CDMT{}）。\CDMT{}为已消除重复数据的数据块编制索引，并确定客户端上对数时间内数据块的更改。\CDMT{}可以有效地从注册表中推送和拉取容器映像，尤其是在客户端上升级和（重新）配置容器时。我们还描述了如何注册表可以有效地维护\CDMT{}索引作为新的图像版本被推。我们使用Docker Hub的15个容器镜像和233个镜像版本，展示了\CDMT{}在磁盘和网络I/O节省方面相对于Merkle树的可扩展性。
英文摘要：
Containerization simplifies the sharing and deployment of applications when environments change in the software delivery chain. To deploy an application, container delivery methods push and pull container images. These methods operate on file and layer (set of files) granularity, and introduce redundant data within a container. Several container operations such as upgrading, installing, and maintaining become inefficient, because of copying and provisioning of redundant data. In this paper, we reestablish recent results that block-level deduplication reduces the size of individual containers, by verifying the result using content-defined chunking. Block-level deduplication, however, does not improve the efficiency of push/pull operations which must determine the specific blocks to transfer. We introduce a content-defined Merkle Tree (\CDMT{}) over deduplicated storage in a container. \CDMT{} indexes deduplicated blocks and determines changes to blocks in logarithmic time on the client. \CDMT{} efficiently pushes and pulls container images from a registry, especially as containers are upgraded and (re-)provisioned on a client. We also describe how a registry can efficiently maintain the \CDMT{} index as new image versions are pushed. We show the scalability of \CDMT{} over Merkle Trees in terms of disk and network I/O savings using 15 container images and 233 image versions from Docker Hub.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
