匿名动态拥塞系统中的高效分布式计算
Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity
摘要：
在这项工作中，我们解决的问题，分布式计算在匿名的，拥挤的，高度动态的，并不总是连接的网络/系统的效率。更准确地说，该系统由未知数量的匿名节点与拥塞的链接和本地计算。链路可以从一轮到另一轮任意变化，唯一的限制是任何T个连续网络的并集必须在所有节点上形成一个临时连接的（多）图（T的知识是节点需要的唯一信息，否则通信将不可行）。节点没有任何ID，只有其中的一些l具有一个位，将它们与没有这样的位的节点区分开。在每一轮中，节点可以发送和接收来自其当前邻居的消息。链路和节点是拥塞的，在这个意义上，消息和本地计算的本地缓存内存的长度是（渐近）对数。全对全通信是分布式计算中的一个基本原则-它假定每个节点都有一个输入消息要传递给所有其他节点。不失一般性，每个输入消息的大小是对数的，以适应链路和节点拥塞假设;否则，它们可以分成对数批次并逐个考虑。由于匿名性，每个节点只需要接收一组所有输入消息，每个消息都伴随着一些发起节点（消息多重性）。我们证明，这项任务可以在时间多项式中（最初未知）的节点数n和动态发展的图形的等周数的下界。这允许有效地模拟一个流行的拥塞集团模型上的匿名动态拥塞系统（ADCS）与抽象连接，即使节点的数量可能会任意改变在开始的仿真。
英文摘要：
In this work we address the question of efficiency of distributed computing in anonymous, congested and highly dynamic and not-always-connected networks/systems. More precisely, the system consists of an unknown number of anonymous nodes with congestion on links and local computation. Links can change arbitrarily from round to round, with only limitation that the union of any T consecutive networks must form a temporarily connected (multi-)graph on all nodes (knowledge of T is the only information the nodes require, otherwise the communication would not be feasible). Nodes do not have any IDs, only some number l of them have a bit distinguishing them from nodes without such a bit. In each round a node can send and receive messages from its current neighbors. Links and nodes are congested, in the sense that the length of messages and local cache memory for local computation is (asymptotically) logarithmic. All-to-all communication is a fundamental principle in distributed computing - it assumes that each node has an input message to be delivered to all other nodes. Without loss of generality, the size of each input message is logarithmic to fit in the link and node congestion assumption; otherwise, they could be split in logarithmic batches and considered one-by-one. Because of anonymity, each node needs to receive only a set of all input messages, each accompanied by a number of initiating nodes (message multiplicity). We prove that this task can be done in time polynomial in the (initially unknown) number of nodes n and in the lower bound on the isoperimetric numbers of dynamically evolving graphs. This allows to efficiently emulate a popular Congested Clique model on top of Anonymous Dynamic Congested Systems (ADCS) with Opportunistic Connectivity, even if the number of nodes may arbitrarily change in the beginning of emulation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
