论文标题
私人边缘计算的关节存储分配和计算设计
Joint Storage Allocation and Computation Design for Private Edge Computing
论文作者
论文摘要
近年来,Edge Computing(EC)因其高速计算和低延迟特性引起了极大的关注。但是,EC的实施面临许多挑战。首先,由于边缘设备可能是不可信的,因此将用户的隐私视为主要问题。在私有边缘计算(PEC)的情况下,用户希望在其本地矩阵和库中的一个矩阵之间计算矩阵乘法,该矩阵已被冗余地存储在边缘设备中。当利用边缘设备的资源时,隐私要求每个边缘设备不知道用户需要将哪种矩阵存储在其上。其次,Edge设备通常具有有限的通信和存储资源,这使得他们无法将所有矩阵存储在库中。在本文中,我们考虑了边缘设备的有限资源,并为PEC提出了一个统一的框架。在框架内,我们研究了两个高度耦合的问题,(1)存储分配,这些问题确定了哪些矩阵存储在每个边缘设备上,以及(2)计算设计,这些矩阵确定了哪些矩阵(或它们的线性组合)在每个边缘设备中都选择以私密考虑在计算过程中参与计算过程。具体而言,我们提供了一个通用存储分配方案,然后设计两个可行的私人计算方案,即综合私人计算(GPC)方案和私人编码计算(PCC)方案。特别是,在通常的情况下,可以应用GPC,并且PCC只能在特殊情况下应用,而PCC可以减少通信负载。我们理论上分析了提出的计算方案,并将其与其他方案进行比较。最后,我们进行广泛的模拟以显示拟议方案的有效性。
In recent years, edge computing (EC) has attracted great attention for its high-speed computing and low-latency characteristics. However, there are many challenges in the implementation of EC. Firstly, user's privacy has been raised as a major concern because the edge devices may be untrustworthy. In the case of Private Edge Computing (PEC), a user wants to compute a matrix multiplication between its local matrix and one of the matrices in a library, which has been redundantly stored in edge devices. When utilizing resources of edge devices, the privacy requires that each edge device cannot know which matrix stored on it is desired by the user for the multiplication. Secondly, edge devices usually have limited communication and storage resources, which makes it impossible for them to store all matrices in the library. In this paper, we consider the limited resources of edge devices and propose an unified framework for PEC. Within the framework, we study two highly-coupled problems, (1) storage allocation, that determines which matrices are stored on each edge device, and (2) computation design, that determines which matrices (or linear combinations of them) in each edge device are selected to participate in the computing process with the privacy consideration. Specifically, we give a general storage allocation scheme and then design two feasible private computation schemes, i.e., General Private Computation (GPC) scheme and Private Coded Computation (PCC) scheme. In particular, GPC can be applied in general case and PCC can only be applied in special cases, while PCC achieves less communication load. We theoretically analyze the proposed computing schemes and compare them with other schemes. Finally, we conduct extensive simulations to show the effectiveness of the proposed schemes.