CIF: Small: Collaborative Research:Synchronization and Deduplication of Distributed Coded Data: Fundamental Limits and Algorithms

第一部分：在过去的几年中，由于信息技术的快速发展以及需要在大规模网络中存储和传播的大数据格式的出现，分布式存储系统的编码已经引起了人们的极大关注。由于典型的分布式系统需要确保低延迟的数据访问和存储大量的文件通过一组节点连接通过通信网络，它是必要的，以保护系统不受不希望的组件故障的新的分布式编码方案。在分布式系统中使用的代码的两个关键功能，即通过访问节点的子集和修复故障节点来重建文件，需要在用户通过符号/块插入、删除或替换编辑来访问和处理文件时保留。由于系统级重复数据删除，删除经常出现：当部分文件被删除或编辑时，信息内容的更改需要以最小的通信成本传送到冗余存储节点。用于同步经历编辑的数据的当前解决方案假定数据是未编码的，并且它们没有充分利用信息的分布式性质。此外，它们大多忽略了重复数据删除协议的存在。这使得分布式存储架构在存储、用户访问时间和错误保护方面效率低下。因此，拟议的研究计划的目标是开发一套新的协议和编码方案，将支持新一代的通用和可更新的编码分布式存储系统。第二部分：在调查人员初步工作的基础上，该提案旨在为编码同步和重复数据删除的新领域奠定基础，其目标是获得基本性能限制，为两个问题家族开发有效的算法解决方案，并构建新的分布式存储代码，使编码数据和编码重复数据删除同步。该提案特别涉及以下综合问题：1）表征已知和新的（未）编码同步方案的通信速率极限，针对不同的结构化或编码数据格式以及不同类型的通信信道，在重复数据删除和数据修复性能之间进行权衡。2）介绍并分析用于结构化/编码数据格式的近似同步和重复数据删除的通信速率失真（CRD）函数，3）开发动态可更新的同步和重复数据删除算法，该算法认识到网络拓扑和用户的不同优先级需求，如在图像和视频数据编码中遇到的。

Part 1: Coding for distributed storage systems has garnered significant attention in the past few years due to the rapid development of information technologies and the emergence of Big Data formats that need to be stored and disseminated across large-scale networks. As typical distributed systems need to ensure low-latency data access and store a large number of files over a set of nodes connected through a communication network, it is imperative to develop new distributed coding schemes that protect the systems from undesired component failures. The two key functionalities of codes used in distributed systems, namely the reconstruction of files via access to a subset of the nodes and repair of failed nodes, need to be retained when the files are accessed and processed by the users via symbol/block insertion, deletion, or substitution edits. Deletions frequently arise due to system-level data deduplication: when parts of files are deduplicated or edited, the changes in the information content need to be communicated to the redundant storage nodes with minimum communication cost. Current solutions for synchronizing data that underwent edits assume that data is uncoded and they do not fully exploit the distributed nature of information. Furthermore, they mostly ignore the presence of deduplication protocols. This makes distributed storage architectures inefficient in terms of storage, user access times, and error protection. Hence, the goals of the proposed research program are to develop a new set of protocols and coding schemes that will support a new generation of versatile and updatable coded distributed storage systems. Part 2: Building on the preliminary work of the investigators, this proposal aims to set the foundations of the new field of coded synchronization and deduplication, with the goal of deriving fundamental performance limits, developing efficient algorithmic solutions for the two families of problems, and constructing new distributed storage codes that enable synchronization of coded data and coded deduplication. In particular, the proposal addresses the following comprehensive issues: 1) Characterizing the communication rate limits of known and new (un)coded synchronization schemes, trade-offs between deduplication and data repair performance for different structured or encoded data formats and different types of communication channels.2) Introducing and analyzing the communication rate-distortion (CRD) function for approximate synchronization and deduplication of structured/encoded data, with a special focus on delay-sensitive applications.3) Developing dynamically updatable synchronization and deduplication algorithms cognizant of the network topology and of different prioritization needs of the users, as encountered in image and video data coding.