论文标题
在有限的时间内，最佳数据库分配，有效的通信和传输在动态网络上停止
Optimal Database Allocation in Finite Time with Efficient Communication and Transmission Stopping over Dynamic Networks
论文作者
论文摘要
在本文中，我们关注通过无线计算机网络（即无线网格）的数据共享问题。在给定一组可用数据的情况下，我们提出了一个分布式算法，该算法通过动态变化的网络运行，并允许每个节点以有限的时间步骤计算数据的最佳分配。我们表明，我们提出的算法（i）在有限的时间内以很高的概率收敛到最佳解决方案，并且（ii）一旦达到了最佳解决方案，每个节点就能停止传输，而无需了解全局参数（例如网络直径）。此外，我们的算法（i）专门用量化值（即，每个节点过程和传输量化的信息），（ii）依赖于事件驱动的更新，并且（iii）以量化分数的形式计算最佳解决方案，从而避免了由于量化而造成的错误。最后，我们证明了算法比随机动态网络的操作，性能和潜在优势。
In this paper, we focus on the problem of data sharing over a wireless computer network (i.e., a wireless grid). Given a set of available data, we present a distributed algorithm which operates over a dynamically changing network, and allows each node to calculate the optimal allocation of data in a finite number of time steps. We show that our proposed algorithm (i) converges to the optimal solution in finite time with very high probability, and (ii) once the optimal solution is reached, each node is able to cease transmissions without needing knowledge of a global parameter such as the network diameter. Furthermore, our algorithm (i) operates exclusively with quantized values (i.e., each node processes and transmits quantized information), (ii) relies on event-driven updates, and (iii) calculates the optimal solution in the form of a quantized fraction which avoids errors due to quantization. Finally, we demonstrate the operation, performance, and potential advantages of our algorithm over random dynamic networks.
