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

第1部分：由于信息技术的快速发展和需要在大规模网络上存储和传播的大数据格式的出现，分布式存储系统的编码在过去几年中得到了极大的关注。由于典型的分布式系统需要确保低延迟的数据访问并在通过通信网络连接的一组节点上存储大量文件，因此开发新的分布式编码方案以保护系统免受意外组件故障的影响势在必行。当用户通过符号/块插入、删除或替换编辑来访问和处理文件时，需要保留在分布式系统中使用的代码的两个关键功能，即通过访问节点的子集来重建文件和修复故障节点。由于系统级重复数据消除，删除操作经常发生：当对部分文件进行重复数据消除或编辑时，需要以最低的通信成本将信息内容中的更改传送到冗余存储节点。当前用于同步经过编辑的数据的解决方案假定数据是未编码的，并且它们没有充分利用信息的分布式性质。此外，它们大多忽略了重复数据删除协议的存在。这使得分布式存储体系结构在存储、用户访问时间和错误保护方面效率低下。因此，拟议的研究计划的目标是开发一套新的协议和编码方案，以支持新一代多功能和可更新的编码分布式存储系统。第2部分：在研究人员前期工作的基础上，这项提议旨在为编码同步和重复数据删除这一新领域奠定基础，目的是得出基本的性能限制，为这两类问题开发有效的算法解决方案，并构建新的分布式存储代码，使编码数据同步和编码重复数据删除成为可能。具体地，该建议涉及以下综合问题：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.